Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r058-smll-174854063900306.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is DES-PT-20b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854063900306
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 91K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748698236981

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-20b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-05-31 13:30:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-31 13:30:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 13:30:39] [INFO ] Load time of PNML (sax parser for PT used): 152 ms
[2025-05-31 13:30:39] [INFO ] Transformed 360 places.
[2025-05-31 13:30:39] [INFO ] Transformed 311 transitions.
[2025-05-31 13:30:39] [INFO ] Found NUPN structural information;
[2025-05-31 13:30:39] [INFO ] Parsed PT model containing 360 places and 311 transitions and 987 arcs in 333 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 22 ms.
Support contains 146 out of 360 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 360/360 places, 311/311 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 357 transition count 311
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 15 place count 345 transition count 299
Iterating global reduction 1 with 12 rules applied. Total rules applied 27 place count 345 transition count 299
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 343 transition count 297
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 343 transition count 297
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 343 transition count 296
Applied a total of 32 rules in 130 ms. Remains 343 /360 variables (removed 17) and now considering 296/311 (removed 15) transitions.
// Phase 1: matrix 296 rows 343 cols
[2025-05-31 13:30:39] [INFO ] Computed 62 invariants in 30 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 13:30:40] [INFO ] Implicit Places using invariants in 639 ms returned []
[2025-05-31 13:30:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 13:30:41] [INFO ] Implicit Places using invariants and state equation in 668 ms returned []
Implicit Place search using SMT with State Equation took 1365 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2025-05-31 13:30:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/343 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/343 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (OVERLAPS) 296/639 variables, 343/405 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:30:53] [INFO ] Deduced a trap composed of 7 places in 299 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:30:54] [INFO ] Deduced a trap composed of 8 places in 231 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:30:54] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:30:55] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:30:55] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:30:55] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:30:55] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:30:55] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:30:55] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:30:55] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:30:56] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:30:56] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:30:56] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:30:56] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:30:56] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:30:56] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:30:56] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:30:56] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:30:56] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:30:57] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/639 variables, 20/425 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:02] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:02] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:02] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:02] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:02] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:02] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:03] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:03] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:03] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:03] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:03] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:03] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:03] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:03] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:03] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:04] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:04] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:04] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:04] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:04] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/639 variables, 20/445 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:07] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:07] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:08] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:08] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:08] [INFO ] Deduced a trap composed of 44 places in 160 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:08] [INFO ] Deduced a trap composed of 46 places in 128 ms of which 15 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/639 variables, 6/451 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 639/639 variables, and 451 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 343/343 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/343 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/343 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 46/108 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:14] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:14] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:14] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:14] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:14] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:14] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:15] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:15] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:15] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:16] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:16] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:16] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:16] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:16] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:16] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:16] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:16] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:16] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:17] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:17] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 12 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:18] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:18] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:18] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:18] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:21] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 5/133 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (OVERLAPS) 296/639 variables, 343/476 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/639 variables, 295/771 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 639/639 variables, and 771 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 343/343 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 71/71 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60294ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 60321ms
Starting structural reductions in LTL mode, iteration 1 : 343/360 places, 296/311 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61852 ms. Remains : 343/360 places, 296/311 transitions.
Support contains 146 out of 343 places after structural reductions.
[2025-05-31 13:31:41] [INFO ] Flatten gal took : 119 ms
[2025-05-31 13:31:41] [INFO ] Flatten gal took : 57 ms
[2025-05-31 13:31:42] [INFO ] Input system was already deterministic with 296 transitions.
Support contains 144 out of 343 places (down from 146) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 87 to 86
RANDOM walk for 40000 steps (337 resets) in 2715 ms. (14 steps per ms) remains 18/86 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 18/18 properties
[2025-05-31 13:31:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Problem AtomicPropp66 is UNSAT
At refinement iteration 1 (OVERLAPS) 94/134 variables, 19/19 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 71/205 variables, 14/33 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/33 constraints. Problems are: Problem set: 1 solved, 17 unsolved
Problem AtomicPropp8 is UNSAT
At refinement iteration 5 (OVERLAPS) 117/322 variables, 27/60 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 0/60 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 4/326 variables, 2/62 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 0/62 constraints. Problems are: Problem set: 2 solved, 16 unsolved
Problem AtomicPropp78 is UNSAT
At refinement iteration 9 (OVERLAPS) 281/607 variables, 326/388 constraints. Problems are: Problem set: 3 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/607 variables, 0/388 constraints. Problems are: Problem set: 3 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 20/627 variables, 11/399 constraints. Problems are: Problem set: 3 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:45] [INFO ] Deduced a trap composed of 11 places in 256 ms of which 24 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/627 variables, 1/400 constraints. Problems are: Problem set: 3 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/627 variables, 0/400 constraints. Problems are: Problem set: 3 solved, 15 unsolved
SMT process timed out in 5041ms, After SMT, problems are : Problem set: 3 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 32 out of 343 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 343/343 places, 296/296 transitions.
Graph (complete) has 713 edges and 343 vertex of which 340 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 340 transition count 278
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 29 place count 327 transition count 278
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 29 place count 327 transition count 269
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 47 place count 318 transition count 269
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 62 place count 303 transition count 254
Iterating global reduction 2 with 15 rules applied. Total rules applied 77 place count 303 transition count 254
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 80 place count 303 transition count 251
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 88 place count 295 transition count 243
Iterating global reduction 3 with 8 rules applied. Total rules applied 96 place count 295 transition count 243
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 9 rules applied. Total rules applied 105 place count 295 transition count 234
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 106 place count 294 transition count 234
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 106 place count 294 transition count 231
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 112 place count 291 transition count 231
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 5 with 128 rules applied. Total rules applied 240 place count 227 transition count 167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 241 place count 227 transition count 166
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 245 place count 225 transition count 171
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 247 place count 225 transition count 169
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 249 place count 223 transition count 169
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 250 place count 223 transition count 168
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 251 place count 222 transition count 168
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 253 place count 222 transition count 168
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 254 place count 221 transition count 167
Applied a total of 254 rules in 321 ms. Remains 221 /343 variables (removed 122) and now considering 167/296 (removed 129) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 321 ms. Remains : 221/343 places, 167/296 transitions.
RANDOM walk for 40000 steps (884 resets) in 658 ms. (60 steps per ms) remains 14/15 properties
BEST_FIRST walk for 40003 steps (139 resets) in 174 ms. (228 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (206 resets) in 193 ms. (206 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (204 resets) in 210 ms. (189 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (204 resets) in 213 ms. (186 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (146 resets) in 154 ms. (258 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (147 resets) in 167 ms. (238 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (202 resets) in 148 ms. (268 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (152 resets) in 207 ms. (192 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (162 resets) in 182 ms. (218 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (145 resets) in 162 ms. (245 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (150 resets) in 129 ms. (307 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (167 resets) in 154 ms. (258 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (155 resets) in 96 ms. (412 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (123 resets) in 101 ms. (392 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 541187 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :0 out of 14
Probabilistic random walk after 541187 steps, saw 75488 distinct states, run finished after 3008 ms. (steps per millisecond=179 ) properties seen :0
// Phase 1: matrix 167 rows 221 cols
[2025-05-31 13:31:52] [INFO ] Computed 64 invariants in 7 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 47/77 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 46/123 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 98/221 variables, 28/64 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 167/388 variables, 221/285 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 0/388 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 388/388 variables, and 285 constraints, problems are : Problem set: 0 solved, 14 unsolved in 1193 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 47/77 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 46/123 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 98/221 variables, 28/64 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem AtomicPropp44 is UNSAT
At refinement iteration 7 (OVERLAPS) 167/388 variables, 221/285 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 13/298 constraints. Problems are: Problem set: 1 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:55] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:55] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:55] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:55] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:55] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:55] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:56] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:56] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:56] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:31:56] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 10/308 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/388 variables, 0/308 constraints. Problems are: Problem set: 1 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:32:02] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 5 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/388 variables, 1/309 constraints. Problems are: Problem set: 1 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:32:06] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 12 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/388 variables, 1/310 constraints. Problems are: Problem set: 1 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:32:11] [INFO ] Deduced a trap along path composed of 4 places in 35 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/388 variables, 1/311 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/388 variables, 0/311 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 15 (OVERLAPS) 0/388 variables, 0/311 constraints. Problems are: Problem set: 1 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 388/388 variables, and 311 constraints, problems are : Problem set: 1 solved, 13 unsolved in 31375 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 13/14 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 32591ms problems are : Problem set: 1 solved, 13 unsolved
Parikh walk visited 0 properties in 26909 ms.
Support contains 29 out of 221 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 221/221 places, 167/167 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 220 transition count 166
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 220 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 219 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 219 transition count 165
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 8 place count 219 transition count 161
Applied a total of 8 rules in 30 ms. Remains 219 /221 variables (removed 2) and now considering 161/167 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 219/221 places, 161/167 transitions.
RANDOM walk for 40000 steps (835 resets) in 340 ms. (117 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (145 resets) in 130 ms. (305 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (208 resets) in 109 ms. (363 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (212 resets) in 123 ms. (322 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (217 resets) in 115 ms. (344 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (160 resets) in 148 ms. (268 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (216 resets) in 92 ms. (430 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (146 resets) in 69 ms. (571 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (160 resets) in 109 ms. (363 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (141 resets) in 104 ms. (380 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (158 resets) in 92 ms. (430 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (167 resets) in 90 ms. (439 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (170 resets) in 176 ms. (226 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (157 resets) in 147 ms. (270 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 494094 steps, run timeout after 3001 ms. (steps per millisecond=164 ) properties seen :0 out of 13
Probabilistic random walk after 494094 steps, saw 67887 distinct states, run finished after 3001 ms. (steps per millisecond=164 ) properties seen :0
// Phase 1: matrix 161 rows 219 cols
[2025-05-31 13:32:55] [INFO ] Computed 64 invariants in 4 ms
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 47/76 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 46/122 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 97/219 variables, 28/64 constraints. Problems are: Problem set: 0 solved, 13 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 161/380 variables, 219/283 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:32:56] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 8 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/380 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 0/380 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 284 constraints, problems are : Problem set: 0 solved, 13 unsolved in 3034 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 219/219 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 47/76 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 46/122 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 97/219 variables, 28/64 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 161/380 variables, 219/284 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 13/297 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:33:01] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:33:01] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:33:02] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:33:03] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 4/301 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:33:07] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/380 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:33:11] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:33:11] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:33:12] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 8 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 3/305 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:33:15] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/380 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/380 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:33:23] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 4 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/380 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:33:28] [INFO ] Deduced a trap along path composed of 2 places in 31 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/380 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/380 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (OVERLAPS) 0/380 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 380/380 variables, and 308 constraints, problems are : Problem set: 0 solved, 13 unsolved in 42638 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 219/219 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 45691ms problems are : Problem set: 0 solved, 13 unsolved
Parikh walk visited 0 properties in 29862 ms.
Support contains 29 out of 219 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 161/161 transitions.
Applied a total of 0 rules in 15 ms. Remains 219 /219 variables (removed 0) and now considering 161/161 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 219/219 places, 161/161 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 161/161 transitions.
Applied a total of 0 rules in 10 ms. Remains 219 /219 variables (removed 0) and now considering 161/161 (removed 0) transitions.
[2025-05-31 13:34:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 13:34:11] [INFO ] Implicit Places using invariants in 195 ms returned []
[2025-05-31 13:34:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 13:34:11] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 13:34:11] [INFO ] Redundant transitions in 6 ms returned []
Running 157 sub problems to find dead transitions.
[2025-05-31 13:34:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (OVERLAPS) 4/219 variables, 36/49 constraints. Problems are: Problem set: 0 solved, 157 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 15/64 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (OVERLAPS) 161/380 variables, 219/283 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:34:16] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:34:17] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 2/285 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:34:20] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:34:22] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 16 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:34:24] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:34:25] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 12 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/380 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:34:30] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:34:31] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:34:31] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:34:31] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:34:31] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:34:31] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 4 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/380 variables, 6/295 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:34:32] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:34:32] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:34:32] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:34:32] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:34:32] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 17 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/380 variables, 5/300 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/380 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 15 (OVERLAPS) 0/380 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 300 constraints, problems are : Problem set: 0 solved, 157 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 219/219 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (OVERLAPS) 4/219 variables, 36/51 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 15/66 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 15/81 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (OVERLAPS) 161/380 variables, 219/300 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 157/457 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:34:55] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:34:56] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 459 constraints, problems are : Problem set: 0 solved, 157 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 219/219 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60090ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 60091ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60652 ms. Remains : 219/219 places, 161/161 transitions.
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2025-05-31 13:35:11] [INFO ] Flatten gal took : 41 ms
[2025-05-31 13:35:11] [INFO ] Flatten gal took : 42 ms
[2025-05-31 13:35:12] [INFO ] Input system was already deterministic with 296 transitions.
Computed a total of 141 stabilizing places and 133 stable transitions
Graph (complete) has 713 edges and 343 vertex of which 336 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.19 ms
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 296/296 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 327 transition count 280
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 327 transition count 280
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 327 transition count 278
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 43 place count 318 transition count 269
Iterating global reduction 1 with 9 rules applied. Total rules applied 52 place count 318 transition count 269
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 60 place count 318 transition count 261
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 317 transition count 260
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 317 transition count 260
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 317 transition count 259
Applied a total of 63 rules in 74 ms. Remains 317 /343 variables (removed 26) and now considering 259/296 (removed 37) transitions.
// Phase 1: matrix 259 rows 317 cols
[2025-05-31 13:35:12] [INFO ] Computed 62 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 13:35:12] [INFO ] Implicit Places using invariants in 385 ms returned []
[2025-05-31 13:35:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 13:35:13] [INFO ] Implicit Places using invariants and state equation in 848 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1237 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 316/343 places, 259/296 transitions.
Applied a total of 0 rules in 10 ms. Remains 316 /316 variables (removed 0) and now considering 259/259 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1321 ms. Remains : 316/343 places, 259/296 transitions.
[2025-05-31 13:35:13] [INFO ] Flatten gal took : 33 ms
[2025-05-31 13:35:13] [INFO ] Flatten gal took : 31 ms
[2025-05-31 13:35:13] [INFO ] Input system was already deterministic with 259 transitions.
[2025-05-31 13:35:13] [INFO ] Flatten gal took : 27 ms
[2025-05-31 13:35:13] [INFO ] Flatten gal took : 27 ms
[2025-05-31 13:35:13] [INFO ] Time to serialize gal into /tmp/CTLFireability412944756656503015.gal : 10 ms
[2025-05-31 13:35:13] [INFO ] Time to serialize properties into /tmp/CTLFireability16790770253390378022.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability412944756656503015.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16790770253390378022.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-31 13:35:43] [INFO ] Flatten gal took : 18 ms
[2025-05-31 13:35:43] [INFO ] Applying decomposition
[2025-05-31 13:35:43] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1667240154055894061.txt' '-o' '/tmp/graph1667240154055894061.bin' '-w' '/tmp/graph1667240154055894061.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1667240154055894061.bin' '-l' '-1' '-v' '-w' '/tmp/graph1667240154055894061.weights' '-q' '0' '-e' '0.001'
[2025-05-31 13:35:43] [INFO ] Decomposing Gal with order
[2025-05-31 13:35:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 13:35:43] [INFO ] Removed a total of 14 redundant transitions.
[2025-05-31 13:35:44] [INFO ] Flatten gal took : 88 ms
[2025-05-31 13:35:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 12 ms.
[2025-05-31 13:35:44] [INFO ] Time to serialize gal into /tmp/CTLFireability11497971302276606987.gal : 10 ms
[2025-05-31 13:35:44] [INFO ] Time to serialize properties into /tmp/CTLFireability3200166968454603041.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11497971302276606987.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3200166968454603041.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.56257e+20,4.69314,116116,14023,1488,303983,11021,649,212529,262,50239,0


Converting to forward existential form...Done !
original formula: AF(EX(EX(EF(((i3.u28.p195==1)||((i12.u14.p141==1)&&(i12.u72.p339==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(EX(E(TRUE U ((i3.u28.p195==1)||((i12.u14.p141==1)&&(i12.u72.p339==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t50, t58, t60, t62, t191, t219, t220, t252, u31.t79, u33.t76, u75.t17, u75.t152, i0.t118,...889
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 296/296 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 327 transition count 280
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 327 transition count 280
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 35 place count 327 transition count 277
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 44 place count 318 transition count 268
Iterating global reduction 1 with 9 rules applied. Total rules applied 53 place count 318 transition count 268
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 62 place count 318 transition count 259
Applied a total of 62 rules in 22 ms. Remains 318 /343 variables (removed 25) and now considering 259/296 (removed 37) transitions.
// Phase 1: matrix 259 rows 318 cols
[2025-05-31 13:36:14] [INFO ] Computed 62 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 13:36:14] [INFO ] Implicit Places using invariants in 250 ms returned []
[2025-05-31 13:36:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 13:36:14] [INFO ] Implicit Places using invariants and state equation in 535 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 788 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 317/343 places, 259/296 transitions.
Applied a total of 0 rules in 6 ms. Remains 317 /317 variables (removed 0) and now considering 259/259 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 816 ms. Remains : 317/343 places, 259/296 transitions.
[2025-05-31 13:36:14] [INFO ] Flatten gal took : 17 ms
[2025-05-31 13:36:14] [INFO ] Flatten gal took : 16 ms
[2025-05-31 13:36:14] [INFO ] Input system was already deterministic with 259 transitions.
[2025-05-31 13:36:15] [INFO ] Flatten gal took : 15 ms
[2025-05-31 13:36:15] [INFO ] Flatten gal took : 13 ms
[2025-05-31 13:36:15] [INFO ] Time to serialize gal into /tmp/CTLFireability7868308443581651276.gal : 3 ms
[2025-05-31 13:36:15] [INFO ] Time to serialize properties into /tmp/CTLFireability5946628928909256292.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7868308443581651276.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5946628928909256292.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-31 13:36:45] [INFO ] Flatten gal took : 13 ms
[2025-05-31 13:36:45] [INFO ] Applying decomposition
[2025-05-31 13:36:45] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15979094834333255440.txt' '-o' '/tmp/graph15979094834333255440.bin' '-w' '/tmp/graph15979094834333255440.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15979094834333255440.bin' '-l' '-1' '-v' '-w' '/tmp/graph15979094834333255440.weights' '-q' '0' '-e' '0.001'
[2025-05-31 13:36:45] [INFO ] Decomposing Gal with order
[2025-05-31 13:36:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 13:36:45] [INFO ] Removed a total of 12 redundant transitions.
[2025-05-31 13:36:45] [INFO ] Flatten gal took : 27 ms
[2025-05-31 13:36:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2025-05-31 13:36:45] [INFO ] Time to serialize gal into /tmp/CTLFireability12578281960533541503.gal : 8 ms
[2025-05-31 13:36:45] [INFO ] Time to serialize properties into /tmp/CTLFireability5894270616611434803.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12578281960533541503.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5894270616611434803.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.29902e+20,3.18583,81268,7268,1158,173200,11499,678,218587,240,46902,0


Converting to forward existential form...Done !
original formula: E(((((i11.u75.p351==1) + EG((EG((i2.u15.p144==1)) * !(((i0.u8.p88==1)&&(i0.u8.p110==1)))))) + (AF((i2.u14.p147==1)) + !(((i11.u66.p332==1...1000
=> equivalent forward existential formula: [(((FwdU(Init,((((i11.u75.p351==1) + EG((EG((i2.u15.p144==1)) * !(((i0.u8.p88==1)&&(i0.u8.p110==1)))))) + (!(EG(...1160
Reverse transition relation is NOT exact ! Due to transitions t0, t58, t87, t193, t220, t221, u31.t79, i0.t118, i0.u8.t178, i0.u8.t179, i0.u8.t180, i0.u8.t...955
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 296/296 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 329 transition count 282
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 329 transition count 282
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 31 place count 329 transition count 279
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 37 place count 323 transition count 273
Iterating global reduction 1 with 6 rules applied. Total rules applied 43 place count 323 transition count 273
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 48 place count 323 transition count 268
Applied a total of 48 rules in 35 ms. Remains 323 /343 variables (removed 20) and now considering 268/296 (removed 28) transitions.
// Phase 1: matrix 268 rows 323 cols
[2025-05-31 13:37:15] [INFO ] Computed 62 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 13:37:15] [INFO ] Implicit Places using invariants in 367 ms returned []
[2025-05-31 13:37:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 13:37:16] [INFO ] Implicit Places using invariants and state equation in 1026 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1398 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 322/343 places, 268/296 transitions.
Applied a total of 0 rules in 9 ms. Remains 322 /322 variables (removed 0) and now considering 268/268 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1443 ms. Remains : 322/343 places, 268/296 transitions.
[2025-05-31 13:37:16] [INFO ] Flatten gal took : 17 ms
[2025-05-31 13:37:16] [INFO ] Flatten gal took : 17 ms
[2025-05-31 13:37:16] [INFO ] Input system was already deterministic with 268 transitions.
[2025-05-31 13:37:16] [INFO ] Flatten gal took : 18 ms
[2025-05-31 13:37:16] [INFO ] Flatten gal took : 17 ms
[2025-05-31 13:37:16] [INFO ] Time to serialize gal into /tmp/CTLFireability17172407302028369038.gal : 5 ms
[2025-05-31 13:37:16] [INFO ] Time to serialize properties into /tmp/CTLFireability12627234752992843778.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17172407302028369038.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12627234752992843778.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-31 13:37:46] [INFO ] Flatten gal took : 11 ms
[2025-05-31 13:37:46] [INFO ] Applying decomposition
[2025-05-31 13:37:46] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1887835410202693042.txt' '-o' '/tmp/graph1887835410202693042.bin' '-w' '/tmp/graph1887835410202693042.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1887835410202693042.bin' '-l' '-1' '-v' '-w' '/tmp/graph1887835410202693042.weights' '-q' '0' '-e' '0.001'
[2025-05-31 13:37:47] [INFO ] Decomposing Gal with order
[2025-05-31 13:37:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 13:37:47] [INFO ] Removed a total of 16 redundant transitions.
[2025-05-31 13:37:47] [INFO ] Flatten gal took : 22 ms
[2025-05-31 13:37:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2025-05-31 13:37:47] [INFO ] Time to serialize gal into /tmp/CTLFireability2062313298696185492.gal : 4 ms
[2025-05-31 13:37:47] [INFO ] Time to serialize properties into /tmp/CTLFireability4636024689016981056.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2062313298696185492.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4636024689016981056.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 343/343 places, 296/296 transitions.
Graph (complete) has 713 edges and 343 vertex of which 336 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 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 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 335 transition count 276
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 320 transition count 276
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 31 place count 320 transition count 267
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 49 place count 311 transition count 267
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 64 place count 296 transition count 252
Iterating global reduction 2 with 15 rules applied. Total rules applied 79 place count 296 transition count 252
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 82 place count 296 transition count 249
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 82 place count 296 transition count 248
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 84 place count 295 transition count 248
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 93 place count 286 transition count 239
Iterating global reduction 3 with 9 rules applied. Total rules applied 102 place count 286 transition count 239
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 3 with 11 rules applied. Total rules applied 113 place count 286 transition count 228
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 116 place count 284 transition count 227
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 116 place count 284 transition count 224
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 122 place count 281 transition count 224
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 1 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 5 with 142 rules applied. Total rules applied 264 place count 210 transition count 153
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 265 place count 210 transition count 153
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 267 place count 208 transition count 151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 268 place count 207 transition count 151
Applied a total of 268 rules in 90 ms. Remains 207 /343 variables (removed 136) and now considering 151/296 (removed 145) transitions.
// Phase 1: matrix 151 rows 207 cols
[2025-05-31 13:38:17] [INFO ] Computed 58 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 13:38:17] [INFO ] Implicit Places using invariants in 254 ms returned []
[2025-05-31 13:38:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 13:38:17] [INFO ] Implicit Places using invariants and state equation in 516 ms returned []
Implicit Place search using SMT with State Equation took 772 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 13:38:18] [INFO ] Redundant transitions in 10 ms returned []
Running 148 sub problems to find dead transitions.
[2025-05-31 13:38:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 18/50 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (OVERLAPS) 2/206 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (OVERLAPS) 151/357 variables, 206/264 constraints. Problems are: Problem set: 0 solved, 148 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:38:21] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:38:22] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 8 (OVERLAPS) 1/358 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 148 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:38:28] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:38:28] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:38:28] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/358 variables, 3/270 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 11 (OVERLAPS) 0/358 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 358/358 variables, and 270 constraints, problems are : Problem set: 0 solved, 148 unsolved in 20085 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 148 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 18/50 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (OVERLAPS) 2/206 variables, 8/63 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (OVERLAPS) 151/357 variables, 206/269 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 148/417 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 148 unsolved
SMT process timed out in 50172ms, After SMT, problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 50174ms
Starting structural reductions in SI_CTL mode, iteration 1 : 207/343 places, 151/296 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 51054 ms. Remains : 207/343 places, 151/296 transitions.
[2025-05-31 13:39:08] [INFO ] Flatten gal took : 7 ms
[2025-05-31 13:39:08] [INFO ] Flatten gal took : 8 ms
[2025-05-31 13:39:08] [INFO ] Input system was already deterministic with 151 transitions.
[2025-05-31 13:39:08] [INFO ] Flatten gal took : 7 ms
[2025-05-31 13:39:08] [INFO ] Flatten gal took : 7 ms
[2025-05-31 13:39:08] [INFO ] Time to serialize gal into /tmp/CTLFireability9899175611005885411.gal : 2 ms
[2025-05-31 13:39:08] [INFO ] Time to serialize properties into /tmp/CTLFireability2122247274081147117.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9899175611005885411.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2122247274081147117.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-31 13:39:38] [INFO ] Flatten gal took : 6 ms
[2025-05-31 13:39:38] [INFO ] Applying decomposition
[2025-05-31 13:39:38] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9591465045391945272.txt' '-o' '/tmp/graph9591465045391945272.bin' '-w' '/tmp/graph9591465045391945272.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9591465045391945272.bin' '-l' '-1' '-v' '-w' '/tmp/graph9591465045391945272.weights' '-q' '0' '-e' '0.001'
[2025-05-31 13:39:38] [INFO ] Decomposing Gal with order
[2025-05-31 13:39:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 13:39:38] [INFO ] Removed a total of 13 redundant transitions.
[2025-05-31 13:39:38] [INFO ] Flatten gal took : 12 ms
[2025-05-31 13:39:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 4 ms.
[2025-05-31 13:39:38] [INFO ] Time to serialize gal into /tmp/CTLFireability11198157902145462551.gal : 2 ms
[2025-05-31 13:39:38] [INFO ] Time to serialize properties into /tmp/CTLFireability12987813425230451551.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11198157902145462551.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12987813425230451551.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.17693e+14,1.34836,34376,3233,1907,75446,4823,324,71048,235,23889,0


Converting to forward existential form...Done !
original formula: EF(AG((i2.u1.p104==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((i2.u1.p104==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t90, t121, t125, t128, u15.t52, u16.t107, u51.t1, u51.t130, i0.t8, i0.u2.t13, i0.u2.t17, i0.u...515
(forward)formula 0,0,5.84671,153160,1,0,377010,32069,2009,380829,2420,146111,477088
FORMULA DES-PT-20b-CTLFireability-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 296/296 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 325 transition count 278
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 325 transition count 278
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 325 transition count 275
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 49 place count 315 transition count 265
Iterating global reduction 1 with 10 rules applied. Total rules applied 59 place count 315 transition count 265
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 68 place count 315 transition count 256
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 314 transition count 255
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 314 transition count 255
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 71 place count 314 transition count 254
Applied a total of 71 rules in 24 ms. Remains 314 /343 variables (removed 29) and now considering 254/296 (removed 42) transitions.
// Phase 1: matrix 254 rows 314 cols
[2025-05-31 13:39:44] [INFO ] Computed 62 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 13:39:44] [INFO ] Implicit Places using invariants in 282 ms returned []
[2025-05-31 13:39:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 13:39:45] [INFO ] Implicit Places using invariants and state equation in 924 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1213 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 313/343 places, 254/296 transitions.
Applied a total of 0 rules in 9 ms. Remains 313 /313 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1246 ms. Remains : 313/343 places, 254/296 transitions.
[2025-05-31 13:39:45] [INFO ] Flatten gal took : 11 ms
[2025-05-31 13:39:45] [INFO ] Flatten gal took : 11 ms
[2025-05-31 13:39:45] [INFO ] Input system was already deterministic with 254 transitions.
[2025-05-31 13:39:45] [INFO ] Flatten gal took : 7 ms
[2025-05-31 13:39:45] [INFO ] Flatten gal took : 8 ms
[2025-05-31 13:39:45] [INFO ] Time to serialize gal into /tmp/CTLFireability17037761298322313780.gal : 2 ms
[2025-05-31 13:39:45] [INFO ] Time to serialize properties into /tmp/CTLFireability1564678605209354529.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17037761298322313780.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1564678605209354529.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-31 13:40:15] [INFO ] Flatten gal took : 7 ms
[2025-05-31 13:40:15] [INFO ] Applying decomposition
[2025-05-31 13:40:15] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16202205512094248793.txt' '-o' '/tmp/graph16202205512094248793.bin' '-w' '/tmp/graph16202205512094248793.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16202205512094248793.bin' '-l' '-1' '-v' '-w' '/tmp/graph16202205512094248793.weights' '-q' '0' '-e' '0.001'
[2025-05-31 13:40:15] [INFO ] Decomposing Gal with order
[2025-05-31 13:40:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 13:40:15] [INFO ] Removed a total of 12 redundant transitions.
[2025-05-31 13:40:15] [INFO ] Flatten gal took : 19 ms
[2025-05-31 13:40:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2025-05-31 13:40:15] [INFO ] Time to serialize gal into /tmp/CTLFireability15064715320174612248.gal : 4 ms
[2025-05-31 13:40:15] [INFO ] Time to serialize properties into /tmp/CTLFireability12655370564308824632.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15064715320174612248.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12655370564308824632.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.07989e+20,6.55263,168576,13498,1417,432768,9322,692,327653,248,43800,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 296/296 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 325 transition count 278
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 325 transition count 278
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 325 transition count 275
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 49 place count 315 transition count 265
Iterating global reduction 1 with 10 rules applied. Total rules applied 59 place count 315 transition count 265
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 68 place count 315 transition count 256
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 314 transition count 255
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 314 transition count 255
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 71 place count 314 transition count 254
Applied a total of 71 rules in 27 ms. Remains 314 /343 variables (removed 29) and now considering 254/296 (removed 42) transitions.
[2025-05-31 13:40:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 13:40:46] [INFO ] Implicit Places using invariants in 295 ms returned []
[2025-05-31 13:40:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 13:40:47] [INFO ] Implicit Places using invariants and state equation in 995 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1293 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 313/343 places, 254/296 transitions.
Applied a total of 0 rules in 9 ms. Remains 313 /313 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1329 ms. Remains : 313/343 places, 254/296 transitions.
[2025-05-31 13:40:47] [INFO ] Flatten gal took : 11 ms
[2025-05-31 13:40:47] [INFO ] Flatten gal took : 11 ms
[2025-05-31 13:40:47] [INFO ] Input system was already deterministic with 254 transitions.
[2025-05-31 13:40:47] [INFO ] Flatten gal took : 11 ms
[2025-05-31 13:40:47] [INFO ] Flatten gal took : 11 ms
[2025-05-31 13:40:47] [INFO ] Time to serialize gal into /tmp/CTLFireability5981685085819707125.gal : 3 ms
[2025-05-31 13:40:47] [INFO ] Time to serialize properties into /tmp/CTLFireability4514085953247802462.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5981685085819707125.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4514085953247802462.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-31 13:41:17] [INFO ] Flatten gal took : 8 ms
[2025-05-31 13:41:17] [INFO ] Applying decomposition
[2025-05-31 13:41:17] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9613531211669137790.txt' '-o' '/tmp/graph9613531211669137790.bin' '-w' '/tmp/graph9613531211669137790.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9613531211669137790.bin' '-l' '-1' '-v' '-w' '/tmp/graph9613531211669137790.weights' '-q' '0' '-e' '0.001'
[2025-05-31 13:41:17] [INFO ] Decomposing Gal with order
[2025-05-31 13:41:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 13:41:17] [INFO ] Removed a total of 12 redundant transitions.
[2025-05-31 13:41:17] [INFO ] Flatten gal took : 16 ms
[2025-05-31 13:41:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2025-05-31 13:41:17] [INFO ] Time to serialize gal into /tmp/CTLFireability8729941568863089839.gal : 4 ms
[2025-05-31 13:41:17] [INFO ] Time to serialize properties into /tmp/CTLFireability15969611865780258843.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8729941568863089839.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15969611865780258843.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 296/296 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 329 transition count 282
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 329 transition count 282
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 31 place count 329 transition count 279
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 324 transition count 274
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 324 transition count 274
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 45 place count 324 transition count 270
Applied a total of 45 rules in 23 ms. Remains 324 /343 variables (removed 19) and now considering 270/296 (removed 26) transitions.
// Phase 1: matrix 270 rows 324 cols
[2025-05-31 13:41:47] [INFO ] Computed 62 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 13:41:47] [INFO ] Implicit Places using invariants in 352 ms returned []
[2025-05-31 13:41:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 13:41:48] [INFO ] Implicit Places using invariants and state equation in 769 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1136 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 323/343 places, 270/296 transitions.
Applied a total of 0 rules in 12 ms. Remains 323 /323 variables (removed 0) and now considering 270/270 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1172 ms. Remains : 323/343 places, 270/296 transitions.
[2025-05-31 13:41:48] [INFO ] Flatten gal took : 8 ms
[2025-05-31 13:41:48] [INFO ] Flatten gal took : 7 ms
[2025-05-31 13:41:48] [INFO ] Input system was already deterministic with 270 transitions.
[2025-05-31 13:41:48] [INFO ] Flatten gal took : 7 ms
[2025-05-31 13:41:48] [INFO ] Flatten gal took : 7 ms
[2025-05-31 13:41:48] [INFO ] Time to serialize gal into /tmp/CTLFireability4041370583217347801.gal : 2 ms
[2025-05-31 13:41:48] [INFO ] Time to serialize properties into /tmp/CTLFireability2144230588051726948.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4041370583217347801.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2144230588051726948.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-31 13:42:18] [INFO ] Flatten gal took : 7 ms
[2025-05-31 13:42:18] [INFO ] Applying decomposition
[2025-05-31 13:42:18] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17112303044119823619.txt' '-o' '/tmp/graph17112303044119823619.bin' '-w' '/tmp/graph17112303044119823619.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17112303044119823619.bin' '-l' '-1' '-v' '-w' '/tmp/graph17112303044119823619.weights' '-q' '0' '-e' '0.001'
[2025-05-31 13:42:18] [INFO ] Decomposing Gal with order
[2025-05-31 13:42:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 13:42:18] [INFO ] Removed a total of 21 redundant transitions.
[2025-05-31 13:42:18] [INFO ] Flatten gal took : 37 ms
[2025-05-31 13:42:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 7 ms.
[2025-05-31 13:42:18] [INFO ] Time to serialize gal into /tmp/CTLFireability15637520510468982702.gal : 4 ms
[2025-05-31 13:42:18] [INFO ] Time to serialize properties into /tmp/CTLFireability6091808832734520582.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15637520510468982702.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6091808832734520582.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.21867e+20,5.47804,112448,8295,1635,239522,10290,734,233067,260,42758,0


Converting to forward existential form...Done !
original formula: EF(((AG(((i8.i3.u46.p238==1)&&(i8.i3.u53.p263==1))) * (A((i3.i0.u12.p120==1) U (((((i2.i1.u9.p109==1)||((u36.p61==1)&&(u36.p204==1))) * A...522
=> equivalent forward existential formula: ([(((FwdU(Init,TRUE) * (!(E(TRUE U !(((i8.i3.u46.p238==1)&&(i8.i3.u53.p263==1))))) * (!((E(!((((((i2.i1.u9.p109=...2434
Reverse transition relation is NOT exact ! Due to transitions t0, t54, t199, t230, t231, t263, u80.t17, u80.t160, u36.t79, u38.t76, i2.t128, i2.i1.u9.t130,...1126
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 343/343 places, 296/296 transitions.
Graph (complete) has 713 edges and 343 vertex of which 336 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 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 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 335 transition count 277
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 321 transition count 277
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 29 place count 321 transition count 267
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 49 place count 311 transition count 267
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 64 place count 296 transition count 252
Iterating global reduction 2 with 15 rules applied. Total rules applied 79 place count 296 transition count 252
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 82 place count 296 transition count 249
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 82 place count 296 transition count 248
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 84 place count 295 transition count 248
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 93 place count 286 transition count 239
Iterating global reduction 3 with 9 rules applied. Total rules applied 102 place count 286 transition count 239
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 3 with 11 rules applied. Total rules applied 113 place count 286 transition count 228
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 116 place count 284 transition count 227
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 116 place count 284 transition count 224
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 122 place count 281 transition count 224
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 5 with 138 rules applied. Total rules applied 260 place count 212 transition count 155
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 261 place count 212 transition count 155
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 263 place count 210 transition count 153
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 264 place count 209 transition count 153
Applied a total of 264 rules in 71 ms. Remains 209 /343 variables (removed 134) and now considering 153/296 (removed 143) transitions.
// Phase 1: matrix 153 rows 209 cols
[2025-05-31 13:42:49] [INFO ] Computed 58 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 13:42:49] [INFO ] Implicit Places using invariants in 334 ms returned []
[2025-05-31 13:42:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 13:42:49] [INFO ] Implicit Places using invariants and state equation in 526 ms returned []
Implicit Place search using SMT with State Equation took 862 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 13:42:49] [INFO ] Redundant transitions in 7 ms returned []
Running 149 sub problems to find dead transitions.
[2025-05-31 13:42:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (OVERLAPS) 1/206 variables, 25/43 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 11/54 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 149 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 2/208 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 8 (OVERLAPS) 153/361 variables, 208/266 constraints. Problems are: Problem set: 0 solved, 149 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:42:57] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:42:57] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:42:58] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 10 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/361 variables, 3/269 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/361 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 11 (OVERLAPS) 1/362 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 149 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:43:03] [INFO ] Deduced a trap composed of 19 places in 182 ms of which 23 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/362 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/362 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 14 (OVERLAPS) 0/362 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 271 constraints, problems are : Problem set: 0 solved, 149 unsolved in 24492 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 149 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (OVERLAPS) 1/206 variables, 25/45 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 8 (OVERLAPS) 2/208 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 10 (OVERLAPS) 153/361 variables, 208/270 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/361 variables, 149/419 constraints. Problems are: Problem set: 0 solved, 149 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:43:30] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 8 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/361 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 149 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 361/362 variables, and 420 constraints, problems are : Problem set: 0 solved, 149 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 208/209 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54534ms problems are : Problem set: 0 solved, 149 unsolved
Search for dead transitions found 0 dead transitions in 54535ms
Starting structural reductions in SI_CTL mode, iteration 1 : 209/343 places, 153/296 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 55483 ms. Remains : 209/343 places, 153/296 transitions.
[2025-05-31 13:43:44] [INFO ] Flatten gal took : 6 ms
[2025-05-31 13:43:44] [INFO ] Flatten gal took : 5 ms
[2025-05-31 13:43:44] [INFO ] Input system was already deterministic with 153 transitions.
[2025-05-31 13:43:44] [INFO ] Flatten gal took : 5 ms
[2025-05-31 13:43:44] [INFO ] Flatten gal took : 6 ms
[2025-05-31 13:43:44] [INFO ] Time to serialize gal into /tmp/CTLFireability4504298524696153289.gal : 1 ms
[2025-05-31 13:43:44] [INFO ] Time to serialize properties into /tmp/CTLFireability17966983765162377248.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4504298524696153289.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17966983765162377248.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-31 13:44:14] [INFO ] Flatten gal took : 6 ms
[2025-05-31 13:44:14] [INFO ] Applying decomposition
[2025-05-31 13:44:14] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6268667435926254726.txt' '-o' '/tmp/graph6268667435926254726.bin' '-w' '/tmp/graph6268667435926254726.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6268667435926254726.bin' '-l' '-1' '-v' '-w' '/tmp/graph6268667435926254726.weights' '-q' '0' '-e' '0.001'
[2025-05-31 13:44:14] [INFO ] Decomposing Gal with order
[2025-05-31 13:44:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 13:44:14] [INFO ] Removed a total of 26 redundant transitions.
[2025-05-31 13:44:14] [INFO ] Flatten gal took : 13 ms
[2025-05-31 13:44:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 2 ms.
[2025-05-31 13:44:14] [INFO ] Time to serialize gal into /tmp/CTLFireability8340114772355470127.gal : 3 ms
[2025-05-31 13:44:14] [INFO ] Time to serialize properties into /tmp/CTLFireability18179848375517034252.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8340114772355470127.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18179848375517034252.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.67713e+13,1.44168,37396,3192,1405,82651,6924,402,79880,237,31951,0


Converting to forward existential form...Done !
original formula: EG(AF((AG(((i1.u8.p157==0)||(i2.u10.p178==0))) * ((i13.u0.p26==0)||(i13.u51.p352==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((!(E(TRUE U !(((i1.u8.p157==0)||(i2.u10.p178==0))))) * ((i13.u0.p26==0)||(i13.u51.p352==0)))))...167
Reverse transition relation is NOT exact ! Due to transitions t91, t122, t123, t127, t130, u14.t52, i0.t7, i0.u3.t13, i0.u3.t17, i0.u3.t18, i0.u3.t19, i0.u...525
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 296/296 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 326 transition count 279
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 326 transition count 279
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 326 transition count 277
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 46 place count 316 transition count 267
Iterating global reduction 1 with 10 rules applied. Total rules applied 56 place count 316 transition count 267
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 65 place count 316 transition count 258
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 315 transition count 257
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 315 transition count 257
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 315 transition count 256
Applied a total of 68 rules in 24 ms. Remains 315 /343 variables (removed 28) and now considering 256/296 (removed 40) transitions.
// Phase 1: matrix 256 rows 315 cols
[2025-05-31 13:44:44] [INFO ] Computed 62 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 13:44:44] [INFO ] Implicit Places using invariants in 279 ms returned []
[2025-05-31 13:44:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 13:44:45] [INFO ] Implicit Places using invariants and state equation in 589 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 869 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 314/343 places, 256/296 transitions.
Applied a total of 0 rules in 6 ms. Remains 314 /314 variables (removed 0) and now considering 256/256 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 899 ms. Remains : 314/343 places, 256/296 transitions.
[2025-05-31 13:44:45] [INFO ] Flatten gal took : 6 ms
[2025-05-31 13:44:45] [INFO ] Flatten gal took : 6 ms
[2025-05-31 13:44:45] [INFO ] Input system was already deterministic with 256 transitions.
[2025-05-31 13:44:45] [INFO ] Flatten gal took : 7 ms
[2025-05-31 13:44:45] [INFO ] Flatten gal took : 7 ms
[2025-05-31 13:44:45] [INFO ] Time to serialize gal into /tmp/CTLFireability7318252217921247960.gal : 1 ms
[2025-05-31 13:44:45] [INFO ] Time to serialize properties into /tmp/CTLFireability593537268051356631.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7318252217921247960.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability593537268051356631.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-31 13:45:15] [INFO ] Flatten gal took : 7 ms
[2025-05-31 13:45:15] [INFO ] Applying decomposition
[2025-05-31 13:45:15] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9895099794855439282.txt' '-o' '/tmp/graph9895099794855439282.bin' '-w' '/tmp/graph9895099794855439282.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9895099794855439282.bin' '-l' '-1' '-v' '-w' '/tmp/graph9895099794855439282.weights' '-q' '0' '-e' '0.001'
[2025-05-31 13:45:15] [INFO ] Decomposing Gal with order
[2025-05-31 13:45:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 13:45:15] [INFO ] Removed a total of 12 redundant transitions.
[2025-05-31 13:45:15] [INFO ] Flatten gal took : 16 ms
[2025-05-31 13:45:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 4 ms.
[2025-05-31 13:45:15] [INFO ] Time to serialize gal into /tmp/CTLFireability9216797723027950140.gal : 4 ms
[2025-05-31 13:45:15] [INFO ] Time to serialize properties into /tmp/CTLFireability17546513402951907742.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9216797723027950140.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17546513402951907742.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.18876e+20,18.9785,418132,8522,1473,1.1002e+06,8633,681,739664,248,39911,0


Converting to forward existential form...Done !
original formula: EG(E(EF(((i1.i1.u4.p91!=1) * E(((u76.p42==1)&&(u76.p352==1)) U ((i5.u27.p182==1)&&(i5.u29.p190==1))))) U AF(((AF(((u31.p55==1)&&(u31.p204...235
=> equivalent forward existential formula: [FwdG(Init,E(E(TRUE U ((i1.i1.u4.p91!=1) * E(((u76.p42==1)&&(u76.p352==1)) U ((i5.u27.p182==1)&&(i5.u29.p190==1)...302
Reverse transition relation is NOT exact ! Due to transitions t0, t50, t58, t189, t216, t217, t249, u76.t17, u76.t150, u31.t79, u33.t76, i2.t120, i2.u7.t12...926
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 296/296 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 327 transition count 280
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 327 transition count 280
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 327 transition count 278
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 43 place count 318 transition count 269
Iterating global reduction 1 with 9 rules applied. Total rules applied 52 place count 318 transition count 269
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 60 place count 318 transition count 261
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 317 transition count 260
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 317 transition count 260
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 317 transition count 259
Applied a total of 63 rules in 27 ms. Remains 317 /343 variables (removed 26) and now considering 259/296 (removed 37) transitions.
// Phase 1: matrix 259 rows 317 cols
[2025-05-31 13:45:45] [INFO ] Computed 62 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 13:45:46] [INFO ] Implicit Places using invariants in 282 ms returned []
[2025-05-31 13:45:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 13:45:47] [INFO ] Implicit Places using invariants and state equation in 922 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1214 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 316/343 places, 259/296 transitions.
Applied a total of 0 rules in 7 ms. Remains 316 /316 variables (removed 0) and now considering 259/259 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1250 ms. Remains : 316/343 places, 259/296 transitions.
[2025-05-31 13:45:47] [INFO ] Flatten gal took : 9 ms
[2025-05-31 13:45:47] [INFO ] Flatten gal took : 9 ms
[2025-05-31 13:45:47] [INFO ] Input system was already deterministic with 259 transitions.
[2025-05-31 13:45:47] [INFO ] Flatten gal took : 9 ms
[2025-05-31 13:45:47] [INFO ] Flatten gal took : 10 ms
[2025-05-31 13:45:47] [INFO ] Time to serialize gal into /tmp/CTLFireability17688139810455548488.gal : 2 ms
[2025-05-31 13:45:47] [INFO ] Time to serialize properties into /tmp/CTLFireability36608169815739250.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17688139810455548488.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability36608169815739250.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-31 13:46:17] [INFO ] Flatten gal took : 7 ms
[2025-05-31 13:46:17] [INFO ] Applying decomposition
[2025-05-31 13:46:17] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11270378419147573224.txt' '-o' '/tmp/graph11270378419147573224.bin' '-w' '/tmp/graph11270378419147573224.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11270378419147573224.bin' '-l' '-1' '-v' '-w' '/tmp/graph11270378419147573224.weights' '-q' '0' '-e' '0.001'
[2025-05-31 13:46:17] [INFO ] Decomposing Gal with order
[2025-05-31 13:46:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 13:46:17] [INFO ] Removed a total of 13 redundant transitions.
[2025-05-31 13:46:17] [INFO ] Flatten gal took : 19 ms
[2025-05-31 13:46:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2025-05-31 13:46:17] [INFO ] Time to serialize gal into /tmp/CTLFireability15426327825572956480.gal : 3 ms
[2025-05-31 13:46:17] [INFO ] Time to serialize properties into /tmp/CTLFireability15367158716706968651.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15426327825572956480.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15367158716706968651.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.40475e+20,6.24301,135256,14388,1473,312791,10945,653,261519,247,46688,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 296/296 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 326 transition count 279
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 326 transition count 279
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 326 transition count 276
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 47 place count 316 transition count 266
Iterating global reduction 1 with 10 rules applied. Total rules applied 57 place count 316 transition count 266
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 65 place count 316 transition count 258
Applied a total of 65 rules in 17 ms. Remains 316 /343 variables (removed 27) and now considering 258/296 (removed 38) transitions.
// Phase 1: matrix 258 rows 316 cols
[2025-05-31 13:46:47] [INFO ] Computed 62 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 13:46:47] [INFO ] Implicit Places using invariants in 296 ms returned []
[2025-05-31 13:46:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 13:46:48] [INFO ] Implicit Places using invariants and state equation in 726 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1024 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 315/343 places, 258/296 transitions.
Applied a total of 0 rules in 8 ms. Remains 315 /315 variables (removed 0) and now considering 258/258 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1049 ms. Remains : 315/343 places, 258/296 transitions.
[2025-05-31 13:46:48] [INFO ] Flatten gal took : 11 ms
[2025-05-31 13:46:48] [INFO ] Flatten gal took : 11 ms
[2025-05-31 13:46:48] [INFO ] Input system was already deterministic with 258 transitions.
[2025-05-31 13:46:48] [INFO ] Flatten gal took : 11 ms
[2025-05-31 13:46:48] [INFO ] Flatten gal took : 11 ms
[2025-05-31 13:46:48] [INFO ] Time to serialize gal into /tmp/CTLFireability15846195807585774477.gal : 3 ms
[2025-05-31 13:46:48] [INFO ] Time to serialize properties into /tmp/CTLFireability15440606571964661566.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15846195807585774477.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15440606571964661566.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-31 13:47:18] [INFO ] Flatten gal took : 7 ms
[2025-05-31 13:47:18] [INFO ] Applying decomposition
[2025-05-31 13:47:18] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11945975790180005722.txt' '-o' '/tmp/graph11945975790180005722.bin' '-w' '/tmp/graph11945975790180005722.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11945975790180005722.bin' '-l' '-1' '-v' '-w' '/tmp/graph11945975790180005722.weights' '-q' '0' '-e' '0.001'
[2025-05-31 13:47:18] [INFO ] Decomposing Gal with order
[2025-05-31 13:47:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 13:47:18] [INFO ] Removed a total of 14 redundant transitions.
[2025-05-31 13:47:18] [INFO ] Flatten gal took : 15 ms
[2025-05-31 13:47:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2025-05-31 13:47:18] [INFO ] Time to serialize gal into /tmp/CTLFireability17335223972388481261.gal : 3 ms
[2025-05-31 13:47:18] [INFO ] Time to serialize properties into /tmp/CTLFireability3918781307995618089.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17335223972388481261.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3918781307995618089.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.38848e+20,13.2627,192456,4946,1345,372131,7301,686,340502,257,34575,0


Converting to forward existential form...Done !
original formula: A(A((i7.i2.u71.p349==1) U EF(((EG(((i7.i0.u35.p222==1)&&(i10.i0.u39.p231==1))) + (i9.i2.u50.p271!=1)) + ((i3.u8.p81==1)&&(i3.u8.p110==1))...420
=> equivalent forward existential formula: [((Init * !(EG(!(E(E(TRUE U !(EX(!(((i10.i1.u52.p276==1)&&(i10.i3.u62.p305==1)))))) U ((!(EX(!((i4.i1.u21.p162==...1394
Reverse transition relation is NOT exact ! Due to transitions t0, t56, t122, t191, t219, t220, t252, u33.t76, u31.t79, i2.u7.t124, i2.u7.t125, i2.u12.t112,...935
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 296/296 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 326 transition count 279
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 326 transition count 279
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 326 transition count 276
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 44 place count 319 transition count 269
Iterating global reduction 1 with 7 rules applied. Total rules applied 51 place count 319 transition count 269
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 57 place count 319 transition count 263
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 318 transition count 262
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 318 transition count 262
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 318 transition count 261
Applied a total of 60 rules in 21 ms. Remains 318 /343 variables (removed 25) and now considering 261/296 (removed 35) transitions.
// Phase 1: matrix 261 rows 318 cols
[2025-05-31 13:47:48] [INFO ] Computed 62 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 13:47:48] [INFO ] Implicit Places using invariants in 274 ms returned []
[2025-05-31 13:47:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 13:47:49] [INFO ] Implicit Places using invariants and state equation in 873 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1152 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 317/343 places, 261/296 transitions.
Applied a total of 0 rules in 8 ms. Remains 317 /317 variables (removed 0) and now considering 261/261 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1182 ms. Remains : 317/343 places, 261/296 transitions.
[2025-05-31 13:47:49] [INFO ] Flatten gal took : 10 ms
[2025-05-31 13:47:49] [INFO ] Flatten gal took : 11 ms
[2025-05-31 13:47:49] [INFO ] Input system was already deterministic with 261 transitions.
[2025-05-31 13:47:49] [INFO ] Flatten gal took : 12 ms
[2025-05-31 13:47:49] [INFO ] Flatten gal took : 11 ms
[2025-05-31 13:47:49] [INFO ] Time to serialize gal into /tmp/CTLFireability15866462023225621790.gal : 2 ms
[2025-05-31 13:47:49] [INFO ] Time to serialize properties into /tmp/CTLFireability9203259922745950842.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15866462023225621790.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9203259922745950842.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-31 13:48:19] [INFO ] Flatten gal took : 7 ms
[2025-05-31 13:48:19] [INFO ] Applying decomposition
[2025-05-31 13:48:19] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11130565582572338181.txt' '-o' '/tmp/graph11130565582572338181.bin' '-w' '/tmp/graph11130565582572338181.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11130565582572338181.bin' '-l' '-1' '-v' '-w' '/tmp/graph11130565582572338181.weights' '-q' '0' '-e' '0.001'
[2025-05-31 13:48:19] [INFO ] Decomposing Gal with order
[2025-05-31 13:48:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 13:48:19] [INFO ] Removed a total of 17 redundant transitions.
[2025-05-31 13:48:20] [INFO ] Flatten gal took : 14 ms
[2025-05-31 13:48:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 2 ms.
[2025-05-31 13:48:20] [INFO ] Time to serialize gal into /tmp/CTLFireability6762366107541485491.gal : 4 ms
[2025-05-31 13:48:20] [INFO ] Time to serialize properties into /tmp/CTLFireability6413154480586750629.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6762366107541485491.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6413154480586750629.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.21934e+20,2.7134,63076,6518,1427,146361,9322,688,131087,259,36502,0


Converting to forward existential form...Done !
original formula: E((i9.i1.u13.p136==1) U (A(!(((AX(((u32.p7==1)&&(u32.p211==1))) * (u32.p17==1)) * (u32.p211==1))) U ((A(EX(((i3.u6.p101==1)&&(i3.u20.p155...271
=> equivalent forward existential formula: [(((FwdU(Init,(i9.i1.u13.p136==1)) * (i3.u20.p162!=1)) * !(EG(!(((!((E(!(!(EX(!(((i10.u29.p201==1)&&(i10.u29.p20...1010
Reverse transition relation is NOT exact ! Due to transitions t0, t56, t88, t100, t122, t192, t221, t222, t254, u30.t79, u32.t76, i2.t118, i2.u8.t177, i2.u...933
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 343/343 places, 296/296 transitions.
Graph (complete) has 713 edges and 343 vertex of which 336 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 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 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 335 transition count 278
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 322 transition count 277
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 321 transition count 277
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 29 place count 321 transition count 271
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 41 place count 315 transition count 271
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 56 place count 300 transition count 256
Iterating global reduction 3 with 15 rules applied. Total rules applied 71 place count 300 transition count 256
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 74 place count 300 transition count 253
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 74 place count 300 transition count 252
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 76 place count 299 transition count 252
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 85 place count 290 transition count 243
Iterating global reduction 4 with 9 rules applied. Total rules applied 94 place count 290 transition count 243
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 11 rules applied. Total rules applied 105 place count 290 transition count 232
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 108 place count 288 transition count 231
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 108 place count 288 transition count 229
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 112 place count 286 transition count 229
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 6 with 124 rules applied. Total rules applied 236 place count 224 transition count 167
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 238 place count 222 transition count 165
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 239 place count 221 transition count 165
Applied a total of 239 rules in 50 ms. Remains 221 /343 variables (removed 122) and now considering 165/296 (removed 131) transitions.
// Phase 1: matrix 165 rows 221 cols
[2025-05-31 13:48:50] [INFO ] Computed 58 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 13:48:50] [INFO ] Implicit Places using invariants in 223 ms returned []
[2025-05-31 13:48:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 13:48:50] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 662 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 13:48:50] [INFO ] Redundant transitions in 3 ms returned []
Running 161 sub problems to find dead transitions.
[2025-05-31 13:48:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/217 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (OVERLAPS) 2/219 variables, 23/44 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 161 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/220 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (OVERLAPS) 165/385 variables, 220/278 constraints. Problems are: Problem set: 0 solved, 161 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:49:00] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:49:00] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:49:00] [INFO ] Deduced a trap composed of 3 places in 124 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:49:00] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:49:00] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:49:01] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:49:02] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:49:02] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:49:02] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:49:02] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 13 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 10/288 constraints. Problems are: Problem set: 0 solved, 161 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:49:03] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:49:05] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:49:05] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:49:05] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/385 variables, 4/292 constraints. Problems are: Problem set: 0 solved, 161 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:49:06] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:49:07] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:49:08] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 8 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/385 variables, 3/295 constraints. Problems are: Problem set: 0 solved, 161 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:49:09] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:49:09] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/385 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 161 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:49:12] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 9 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/385 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 161 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:49:16] [INFO ] Deduced a trap along path composed of 5 places in 55 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/385 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 161 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:49:19] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 10 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/385 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 161 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 (/ 17.0 20.0))
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 385/386 variables, and 300 constraints, problems are : Problem set: 0 solved, 161 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 220/221 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/217 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 18/39 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 2/219 variables, 23/62 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 7/69 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (OVERLAPS) 1/220 variables, 7/78 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/220 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/220 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 11 (OVERLAPS) 165/385 variables, 220/299 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/385 variables, 161/460 constraints. Problems are: Problem set: 0 solved, 161 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:49:28] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 7 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/385 variables, 1/461 constraints. Problems are: Problem set: 0 solved, 161 unsolved
SMT process timed out in 60061ms, After SMT, problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 60062ms
Starting structural reductions in SI_CTL mode, iteration 1 : 221/343 places, 165/296 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60788 ms. Remains : 221/343 places, 165/296 transitions.
[2025-05-31 13:49:50] [INFO ] Flatten gal took : 7 ms
[2025-05-31 13:49:50] [INFO ] Flatten gal took : 7 ms
[2025-05-31 13:49:50] [INFO ] Input system was already deterministic with 165 transitions.
[2025-05-31 13:49:50] [INFO ] Flatten gal took : 7 ms
[2025-05-31 13:49:50] [INFO ] Flatten gal took : 7 ms
[2025-05-31 13:49:50] [INFO ] Time to serialize gal into /tmp/CTLFireability17602331072541144191.gal : 1 ms
[2025-05-31 13:49:50] [INFO ] Time to serialize properties into /tmp/CTLFireability18380905619628392442.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17602331072541144191.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18380905619628392442.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-31 13:50:20] [INFO ] Flatten gal took : 6 ms
[2025-05-31 13:50:20] [INFO ] Applying decomposition
[2025-05-31 13:50:20] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7942718712012090634.txt' '-o' '/tmp/graph7942718712012090634.bin' '-w' '/tmp/graph7942718712012090634.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7942718712012090634.bin' '-l' '-1' '-v' '-w' '/tmp/graph7942718712012090634.weights' '-q' '0' '-e' '0.001'
[2025-05-31 13:50:21] [INFO ] Decomposing Gal with order
[2025-05-31 13:50:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 13:50:21] [INFO ] Removed a total of 8 redundant transitions.
[2025-05-31 13:50:21] [INFO ] Flatten gal took : 10 ms
[2025-05-31 13:50:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2025-05-31 13:50:21] [INFO ] Time to serialize gal into /tmp/CTLFireability6648612843241564664.gal : 2 ms
[2025-05-31 13:50:21] [INFO ] Time to serialize properties into /tmp/CTLFireability6100546959508633331.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6648612843241564664.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6100546959508633331.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.20946e+14,1.79005,46772,7866,1385,115856,3511,380,78336,242,16801,0


Converting to forward existential form...Done !
original formula: (!(A(EG((!(E((i15.i1.u43.p330==1) U ((i1.u3.p75==1)&&(i1.u3.p110==1)))) * EF((i15.i0.u16.p227==1)))) U (i14.u47.p349==1))) + EG(((AG((i3....386
=> equivalent forward existential formula: (([((FwdU(Init,!((i14.u47.p349==1))) * !((i14.u47.p349==1))) * !(EG((!(E((i15.i1.u43.p330==1) U ((i1.u3.p75==1)&...543
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t95, t106, t128, t139, t140, t143, u13.t72, u14.t107, u48.t4, u48.t145, i0.u1.t96, i0...528
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,19.7176,573664,1,0,1.55266e+06,28666,2818,1.28716e+06,2612,133316,2161809
FORMULA DES-PT-20b-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 343/343 places, 296/296 transitions.
Graph (complete) has 713 edges and 343 vertex of which 336 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 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 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 335 transition count 276
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 320 transition count 276
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 31 place count 320 transition count 267
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 49 place count 311 transition count 267
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 64 place count 296 transition count 252
Iterating global reduction 2 with 15 rules applied. Total rules applied 79 place count 296 transition count 252
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 82 place count 296 transition count 249
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 82 place count 296 transition count 248
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 84 place count 295 transition count 248
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 93 place count 286 transition count 239
Iterating global reduction 3 with 9 rules applied. Total rules applied 102 place count 286 transition count 239
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 3 with 11 rules applied. Total rules applied 113 place count 286 transition count 228
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 116 place count 284 transition count 227
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 116 place count 284 transition count 224
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 122 place count 281 transition count 224
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 5 with 142 rules applied. Total rules applied 264 place count 210 transition count 153
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 266 place count 208 transition count 151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 267 place count 207 transition count 151
Applied a total of 267 rules in 45 ms. Remains 207 /343 variables (removed 136) and now considering 151/296 (removed 145) transitions.
// Phase 1: matrix 151 rows 207 cols
[2025-05-31 13:50:40] [INFO ] Computed 58 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 13:50:41] [INFO ] Implicit Places using invariants in 227 ms returned []
[2025-05-31 13:50:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 13:50:41] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 650 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 13:50:41] [INFO ] Redundant transitions in 2 ms returned []
Running 148 sub problems to find dead transitions.
[2025-05-31 13:50:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 148 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/206 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (OVERLAPS) 151/357 variables, 206/264 constraints. Problems are: Problem set: 0 solved, 148 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:50:47] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:50:47] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 148 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:50:49] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:50:50] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:50:50] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 3/269 constraints. Problems are: Problem set: 0 solved, 148 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:50:50] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 148 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:50:52] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/357 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 148 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:50:55] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:50:55] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 8 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/357 variables, 2/273 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 12 (OVERLAPS) 1/358 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/358 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 14 (OVERLAPS) 0/358 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 358/358 variables, and 274 constraints, problems are : Problem set: 0 solved, 148 unsolved in 27653 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 148 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (OVERLAPS) 2/206 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (OVERLAPS) 151/357 variables, 206/273 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 148/421 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/357 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 148 unsolved
SMT process timed out in 57693ms, After SMT, problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 57695ms
Starting structural reductions in SI_CTL mode, iteration 1 : 207/343 places, 151/296 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 58400 ms. Remains : 207/343 places, 151/296 transitions.
[2025-05-31 13:51:39] [INFO ] Flatten gal took : 5 ms
[2025-05-31 13:51:39] [INFO ] Flatten gal took : 4 ms
[2025-05-31 13:51:39] [INFO ] Input system was already deterministic with 151 transitions.
[2025-05-31 13:51:39] [INFO ] Flatten gal took : 5 ms
[2025-05-31 13:51:39] [INFO ] Flatten gal took : 4 ms
[2025-05-31 13:51:39] [INFO ] Time to serialize gal into /tmp/CTLFireability17157974600856986135.gal : 1 ms
[2025-05-31 13:51:39] [INFO ] Time to serialize properties into /tmp/CTLFireability2155224291005626291.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17157974600856986135.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2155224291005626291.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-31 13:52:09] [INFO ] Flatten gal took : 6 ms
[2025-05-31 13:52:09] [INFO ] Applying decomposition
[2025-05-31 13:52:09] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11959492673785953262.txt' '-o' '/tmp/graph11959492673785953262.bin' '-w' '/tmp/graph11959492673785953262.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11959492673785953262.bin' '-l' '-1' '-v' '-w' '/tmp/graph11959492673785953262.weights' '-q' '0' '-e' '0.001'
[2025-05-31 13:52:09] [INFO ] Decomposing Gal with order
[2025-05-31 13:52:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 13:52:09] [INFO ] Removed a total of 8 redundant transitions.
[2025-05-31 13:52:09] [INFO ] Flatten gal took : 9 ms
[2025-05-31 13:52:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2025-05-31 13:52:09] [INFO ] Time to serialize gal into /tmp/CTLFireability17164782074146449982.gal : 2 ms
[2025-05-31 13:52:09] [INFO ] Time to serialize properties into /tmp/CTLFireability15859364884524702859.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17164782074146449982.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15859364884524702859.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.3698e+13,1.23191,38076,3240,1913,85116,4803,309,79395,232,23806,0


Converting to forward existential form...Done !
original formula: AF((i13.i0.u46.p322==1))
=> equivalent forward existential formula: [FwdG(Init,!((i13.i0.u46.p322==1)))] = FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 296/296 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 325 transition count 278
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 325 transition count 278
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 325 transition count 275
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 49 place count 315 transition count 265
Iterating global reduction 1 with 10 rules applied. Total rules applied 59 place count 315 transition count 265
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 68 place count 315 transition count 256
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 314 transition count 255
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 314 transition count 255
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 71 place count 314 transition count 254
Applied a total of 71 rules in 21 ms. Remains 314 /343 variables (removed 29) and now considering 254/296 (removed 42) transitions.
// Phase 1: matrix 254 rows 314 cols
[2025-05-31 13:52:39] [INFO ] Computed 62 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 13:52:39] [INFO ] Implicit Places using invariants in 377 ms returned []
[2025-05-31 13:52:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 13:52:40] [INFO ] Implicit Places using invariants and state equation in 725 ms returned []
Implicit Place search using SMT with State Equation took 1116 ms to find 0 implicit places.
Running 253 sub problems to find dead transitions.
[2025-05-31 13:52:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/314 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/314 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (OVERLAPS) 254/568 variables, 314/376 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:52:52] [INFO ] Deduced a trap composed of 29 places in 159 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:52:53] [INFO ] Deduced a trap composed of 7 places in 287 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:52:53] [INFO ] Deduced a trap composed of 8 places in 279 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:52:53] [INFO ] Deduced a trap composed of 12 places in 186 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:52:54] [INFO ] Deduced a trap composed of 14 places in 175 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:52:54] [INFO ] Deduced a trap composed of 17 places in 168 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:52:54] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:52:55] [INFO ] Deduced a trap composed of 17 places in 179 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:52:55] [INFO ] Deduced a trap composed of 19 places in 174 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:52:55] [INFO ] Deduced a trap composed of 19 places in 180 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:52:55] [INFO ] Deduced a trap composed of 18 places in 187 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:52:56] [INFO ] Deduced a trap composed of 19 places in 181 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:52:56] [INFO ] Deduced a trap composed of 20 places in 182 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:52:56] [INFO ] Deduced a trap composed of 21 places in 173 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:52:57] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:52:58] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:52:58] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:52:59] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:52:59] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:52:59] [INFO ] Deduced a trap composed of 38 places in 203 ms of which 36 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/568 variables, 20/396 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:53:05] [INFO ] Deduced a trap composed of 30 places in 161 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:53:05] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:53:05] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:53:05] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:53:06] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:53:06] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:53:06] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:53:06] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:53:06] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:53:06] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:53:06] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:53:06] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:53:07] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:53:07] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:53:07] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:53:07] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:53:09] [INFO ] Deduced a trap composed of 40 places in 179 ms of which 23 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 17/413 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 568/568 variables, and 413 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 314/314 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/314 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/314 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 37/99 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:53:13] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:53:13] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:53:14] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:53:14] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:53:14] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:53:14] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:53:15] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:53:15] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:53:15] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:53:15] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:53:16] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:53:16] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 12/111 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 7 (OVERLAPS) 254/568 variables, 314/425 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 253/678 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/568 variables, and 678 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 314/314 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 49/49 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60051ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 60052ms
Starting structural reductions in LTL mode, iteration 1 : 314/343 places, 254/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61191 ms. Remains : 314/343 places, 254/296 transitions.
[2025-05-31 13:53:40] [INFO ] Flatten gal took : 6 ms
[2025-05-31 13:53:40] [INFO ] Flatten gal took : 21 ms
[2025-05-31 13:53:40] [INFO ] Input system was already deterministic with 254 transitions.
[2025-05-31 13:53:40] [INFO ] Flatten gal took : 6 ms
[2025-05-31 13:53:40] [INFO ] Flatten gal took : 7 ms
[2025-05-31 13:53:40] [INFO ] Time to serialize gal into /tmp/CTLFireability15092531242410237356.gal : 1 ms
[2025-05-31 13:53:40] [INFO ] Time to serialize properties into /tmp/CTLFireability13964406943064867769.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15092531242410237356.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13964406943064867769.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-31 13:54:10] [INFO ] Flatten gal took : 7 ms
[2025-05-31 13:54:10] [INFO ] Applying decomposition
[2025-05-31 13:54:10] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3010438895646442874.txt' '-o' '/tmp/graph3010438895646442874.bin' '-w' '/tmp/graph3010438895646442874.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3010438895646442874.bin' '-l' '-1' '-v' '-w' '/tmp/graph3010438895646442874.weights' '-q' '0' '-e' '0.001'
[2025-05-31 13:54:10] [INFO ] Decomposing Gal with order
[2025-05-31 13:54:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 13:54:10] [INFO ] Removed a total of 12 redundant transitions.
[2025-05-31 13:54:10] [INFO ] Flatten gal took : 13 ms
[2025-05-31 13:54:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2025-05-31 13:54:10] [INFO ] Time to serialize gal into /tmp/CTLFireability10786584041952545574.gal : 3 ms
[2025-05-31 13:54:10] [INFO ] Time to serialize properties into /tmp/CTLFireability15917181346879538314.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10786584041952545574.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15917181346879538314.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.07989e+20,16.2267,329424,7477,1138,859124,7783,712,570978,235,36739,0


Converting to forward existential form...Done !
original formula: AX(!(A((EX((i0.i0.u1.p1==1)) + !(AF((i7.u57.p287==1)))) U A(EG((i9.i1.u46.p257==1)) U ((((((i12.u75.p43==1)&&(i12.u75.p352==1))||(((i6.u3...371
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(!((E(!(((((((i12.u75.p43==1)&&(i12.u75.p352==1))||(((i6.u33.p6==1)&&(i12.u75.p27==1))&&((u3...2699
Reverse transition relation is NOT exact ! Due to transitions t0, t56, t87, t188, t215, t216, t248, u30.t79, i1.i0.u12.t109, i1.i1.t119, i1.i1.u5.t124, i1....933
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 343/343 places, 296/296 transitions.
Graph (complete) has 713 edges and 343 vertex of which 336 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 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 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 335 transition count 275
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 319 transition count 275
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 33 place count 319 transition count 266
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 51 place count 310 transition count 266
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 66 place count 295 transition count 251
Iterating global reduction 2 with 15 rules applied. Total rules applied 81 place count 295 transition count 251
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 84 place count 295 transition count 248
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 84 place count 295 transition count 247
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 86 place count 294 transition count 247
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 95 place count 285 transition count 238
Iterating global reduction 3 with 9 rules applied. Total rules applied 104 place count 285 transition count 238
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 3 with 11 rules applied. Total rules applied 115 place count 285 transition count 227
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 118 place count 283 transition count 226
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 118 place count 283 transition count 223
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 124 place count 280 transition count 223
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 5 with 140 rules applied. Total rules applied 264 place count 210 transition count 153
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 266 place count 208 transition count 151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 267 place count 207 transition count 151
Applied a total of 267 rules in 47 ms. Remains 207 /343 variables (removed 136) and now considering 151/296 (removed 145) transitions.
// Phase 1: matrix 151 rows 207 cols
[2025-05-31 13:54:40] [INFO ] Computed 58 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 13:54:41] [INFO ] Implicit Places using invariants in 284 ms returned []
[2025-05-31 13:54:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 13:54:41] [INFO ] Implicit Places using invariants and state equation in 554 ms returned []
Implicit Place search using SMT with State Equation took 842 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 13:54:41] [INFO ] Redundant transitions in 1 ms returned []
Running 148 sub problems to find dead transitions.
[2025-05-31 13:54:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (OVERLAPS) 2/206 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (OVERLAPS) 151/357 variables, 206/264 constraints. Problems are: Problem set: 0 solved, 148 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:54:46] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:54:47] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 148 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:54:51] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 9 (OVERLAPS) 1/358 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 148 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:54:58] [INFO ] Deduced a trap composed of 18 places in 155 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:54:59] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 13:54:59] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 3/271 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 12 (OVERLAPS) 0/358 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 358/358 variables, and 271 constraints, problems are : Problem set: 0 solved, 148 unsolved in 29344 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 148 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (OVERLAPS) 2/206 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (OVERLAPS) 151/357 variables, 206/270 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 148/418 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 148 unsolved
SMT process timed out in 59384ms, After SMT, problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 59385ms
Starting structural reductions in SI_CTL mode, iteration 1 : 207/343 places, 151/296 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60283 ms. Remains : 207/343 places, 151/296 transitions.
[2025-05-31 13:55:41] [INFO ] Flatten gal took : 8 ms
[2025-05-31 13:55:41] [INFO ] Flatten gal took : 8 ms
[2025-05-31 13:55:41] [INFO ] Input system was already deterministic with 151 transitions.
[2025-05-31 13:55:41] [INFO ] Flatten gal took : 13 ms
RANDOM walk for 2094 steps (69 resets) in 36 ms. (56 steps per ms) remains 0/1 properties
FORMULA DES-PT-20b-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-05-31 13:55:41] [INFO ] Flatten gal took : 9 ms
[2025-05-31 13:55:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18332517182941426474.gal : 2 ms
[2025-05-31 13:55:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14619884271778350967.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18332517182941426474.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14619884271778350967.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-31 13:55:41] [INFO ] Flatten gal took : 13 ms
[2025-05-31 13:55:41] [INFO ] Flatten gal took : 13 ms
[2025-05-31 13:55:41] [INFO ] Applying decomposition
[2025-05-31 13:55:41] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5828241931212074243.txt' '-o' '/tmp/graph5828241931212074243.bin' '-w' '/tmp/graph5828241931212074243.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5828241931212074243.bin' '-l' '-1' '-v' '-w' '/tmp/graph5828241931212074243.weights' '-q' '0' '-e' '0.001'
[2025-05-31 13:55:41] [INFO ] Decomposing Gal with order
[2025-05-31 13:55:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 13:55:41] [INFO ] Removed a total of 34 redundant transitions.
[2025-05-31 13:55:41] [INFO ] Flatten gal took : 24 ms
[2025-05-31 13:55:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 4 ms.
[2025-05-31 13:55:41] [INFO ] Time to serialize gal into /tmp/CTLFireability4422409406766133554.gal : 5 ms
[2025-05-31 13:55:41] [INFO ] Time to serialize properties into /tmp/CTLFireability13828006157891537720.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4422409406766133554.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13828006157891537720.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 13 CTL formulae.
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.66963e+21,28.6641,401016,9863,1325,737079,8288,774,1.08364e+06,254,36414,0


Converting to forward existential form...Done !
original formula: AF(EX(EX(EF(((i7.u34.p195==1)||((i12.u19.p141==1)&&(i9.i2.u80.p339==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(EX(E(TRUE U ((i7.u34.p195==1)||((i12.u19.p141==1)&&(i9.i2.u80.p339==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t59, t94, t109, t143, t217, t253, t254, u38.t80, i1.i0.t154, i1.i0.u7.t152, i1.i0.u8.t153...1248
Detected timeout of ITS tools.
[2025-05-31 14:24:01] [INFO ] Applying decomposition
[2025-05-31 14:24:02] [INFO ] Flatten gal took : 8 ms
[2025-05-31 14:24:02] [INFO ] Decomposing Gal with order
[2025-05-31 14:24:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 14:24:02] [INFO ] Removed a total of 96 redundant transitions.
[2025-05-31 14:24:02] [INFO ] Flatten gal took : 17 ms
[2025-05-31 14:24:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 359 labels/synchronizations in 11 ms.
[2025-05-31 14:24:02] [INFO ] Time to serialize gal into /tmp/CTLFireability1394535079390423862.gal : 4 ms
[2025-05-31 14:24:02] [INFO ] Time to serialize properties into /tmp/CTLFireability10367420540924482834.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1394535079390423862.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10367420540924482834.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 13 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is DES-PT-20b, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r058-smll-174854063900306"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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