Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r044-tall-174854027800089.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 CloudDeployment-PT-7b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854027800089
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 21M
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 20M 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 CloudDeployment-PT-7b-CTLCardinality-2023-12
FORMULA_NAME CloudDeployment-PT-7b-CTLCardinality-2023-13
FORMULA_NAME CloudDeployment-PT-7b-CTLCardinality-2023-14
FORMULA_NAME CloudDeployment-PT-7b-CTLCardinality-2023-15
FORMULA_NAME CloudDeployment-PT-7b-CTLCardinality-2025-00
FORMULA_NAME CloudDeployment-PT-7b-CTLCardinality-2025-01
FORMULA_NAME CloudDeployment-PT-7b-CTLCardinality-2025-02
FORMULA_NAME CloudDeployment-PT-7b-CTLCardinality-2025-03
FORMULA_NAME CloudDeployment-PT-7b-CTLCardinality-2025-04
FORMULA_NAME CloudDeployment-PT-7b-CTLCardinality-2025-05
FORMULA_NAME CloudDeployment-PT-7b-CTLCardinality-2025-06
FORMULA_NAME CloudDeployment-PT-7b-CTLCardinality-2025-07
FORMULA_NAME CloudDeployment-PT-7b-CTLCardinality-2025-08
FORMULA_NAME CloudDeployment-PT-7b-CTLCardinality-2025-09
FORMULA_NAME CloudDeployment-PT-7b-CTLCardinality-2025-10
FORMULA_NAME CloudDeployment-PT-7b-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1748564461072

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-7b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-05-30 00:21:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 00:21:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 00:21:03] [INFO ] Load time of PNML (sax parser for PT used): 938 ms
[2025-05-30 00:21:03] [INFO ] Transformed 2271 places.
[2025-05-30 00:21:03] [INFO ] Transformed 19752 transitions.
[2025-05-30 00:21:03] [INFO ] Found NUPN structural information;
[2025-05-30 00:21:03] [INFO ] Parsed PT model containing 2271 places and 19752 transitions and 389666 arcs in 1221 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Initial state reduction rules removed 1 formulas.
FORMULA CloudDeployment-PT-7b-CTLCardinality-2025-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 113 out of 2271 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2271/2271 places, 19752/19752 transitions.
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 2263 transition count 19752
Discarding 631 places :
Symmetric choice reduction at 1 with 631 rule applications. Total rules 639 place count 1632 transition count 2752
Iterating global reduction 1 with 631 rules applied. Total rules applied 1270 place count 1632 transition count 2752
Discarding 230 places :
Symmetric choice reduction at 1 with 230 rule applications. Total rules 1500 place count 1402 transition count 2522
Iterating global reduction 1 with 230 rules applied. Total rules applied 1730 place count 1402 transition count 2522
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 1755 place count 1402 transition count 2497
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 1773 place count 1384 transition count 2479
Iterating global reduction 2 with 18 rules applied. Total rules applied 1791 place count 1384 transition count 2479
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1794 place count 1381 transition count 2476
Iterating global reduction 2 with 3 rules applied. Total rules applied 1797 place count 1381 transition count 2476
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1799 place count 1379 transition count 2474
Iterating global reduction 2 with 2 rules applied. Total rules applied 1801 place count 1379 transition count 2474
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1802 place count 1378 transition count 2473
Iterating global reduction 2 with 1 rules applied. Total rules applied 1803 place count 1378 transition count 2473
Applied a total of 1803 rules in 3444 ms. Remains 1378 /2271 variables (removed 893) and now considering 2473/19752 (removed 17279) transitions.
// Phase 1: matrix 2473 rows 1378 cols
[2025-05-30 00:21:07] [INFO ] Computed 21 invariants in 37 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:21:07] [INFO ] Implicit Places using invariants in 546 ms returned []
[2025-05-30 00:21:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:21:10] [INFO ] Implicit Places using invariants and state equation in 2466 ms returned []
Implicit Place search using SMT with State Equation took 3057 ms to find 0 implicit places.
Running 2472 sub problems to find dead transitions.
[2025-05-30 00:21:10] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1377 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 2472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1377/3851 variables, and 21 constraints, problems are : Problem set: 0 solved, 2472 unsolved in 30070 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/1378 constraints, PredecessorRefiner: 2472/1881 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2472 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1377 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 2472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1377/3851 variables, and 21 constraints, problems are : Problem set: 0 solved, 2472 unsolved in 30063 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/1378 constraints, PredecessorRefiner: 591/1881 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62831ms problems are : Problem set: 0 solved, 2472 unsolved
Search for dead transitions found 0 dead transitions in 62860ms
Starting structural reductions in LTL mode, iteration 1 : 1378/2271 places, 2473/19752 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69402 ms. Remains : 1378/2271 places, 2473/19752 transitions.
Support contains 113 out of 1378 places after structural reductions.
[2025-05-30 00:22:13] [INFO ] Flatten gal took : 229 ms
[2025-05-30 00:22:13] [INFO ] Flatten gal took : 169 ms
[2025-05-30 00:22:14] [INFO ] Input system was already deterministic with 2473 transitions.
Support contains 112 out of 1378 places (down from 113) after GAL structural reductions.
RANDOM walk for 40000 steps (169 resets) in 1710 ms. (23 steps per ms) remains 25/67 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 25/25 properties
[2025-05-30 00:22:14] [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/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 146/189 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 163/352 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 1343/1695 variables, 352/373 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1695 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 747/2442 variables, 317/690 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2442 variables, 0/690 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (OVERLAPS) 656/3098 variables, 298/988 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3098 variables, 0/988 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 11 (OVERLAPS) 525/3623 variables, 258/1246 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3623 variables, 0/1246 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 13 (OVERLAPS) 169/3792 variables, 116/1362 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3792 variables, 0/1362 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3837/3851 variables, and 1389 constraints, problems are : Problem set: 0 solved, 25 unsolved in 5019 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 1368/1378 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 146/189 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 163/352 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 1343/1695 variables, 352/373 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1695 variables, 9/382 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1695 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 747/2442 variables, 317/699 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2442 variables, 16/715 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2442/3851 variables, and 715 constraints, problems are : Problem set: 0 solved, 25 unsolved in 5014 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 669/1378 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10059ms problems are : Problem set: 0 solved, 25 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 43 out of 1378 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1378/1378 places, 2473/2473 transitions.
Graph (trivial) has 1355 edges and 1378 vertex of which 446 / 1378 are part of one of the 52 SCC in 6 ms
Free SCC test removed 394 places
Drop transitions (Empty/Sink Transition effects.) removed 496 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 499 transitions.
Graph (complete) has 4082 edges and 984 vertex of which 982 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 360 transitions
Trivial Post-agglo rules discarded 360 transitions
Performed 360 trivial Post agglomeration. Transition count delta: 360
Iterating post reduction 0 with 369 rules applied. Total rules applied 371 place count 981 transition count 1606
Reduce places removed 360 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 368 rules applied. Total rules applied 739 place count 621 transition count 1598
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 747 place count 613 transition count 1598
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 747 place count 613 transition count 1514
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 915 place count 529 transition count 1514
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 932 place count 512 transition count 1497
Iterating global reduction 3 with 17 rules applied. Total rules applied 949 place count 512 transition count 1497
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 954 place count 512 transition count 1492
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 954 place count 512 transition count 1487
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 964 place count 507 transition count 1487
Performed 126 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 126 places in 2 ms
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 4 with 252 rules applied. Total rules applied 1216 place count 381 transition count 1359
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1218 place count 381 transition count 1357
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -235
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 5 with 94 rules applied. Total rules applied 1312 place count 334 transition count 1592
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 1333 place count 334 transition count 1571
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1335 place count 332 transition count 1533
Iterating global reduction 6 with 2 rules applied. Total rules applied 1337 place count 332 transition count 1533
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -84
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 1351 place count 325 transition count 1617
Drop transitions (Redundant composition of simpler transitions.) removed 202 transitions
Redundant transition composition rules discarded 202 transitions
Iterating global reduction 6 with 202 rules applied. Total rules applied 1553 place count 325 transition count 1415
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1555 place count 324 transition count 1430
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1556 place count 324 transition count 1429
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 7 with 14 rules applied. Total rules applied 1570 place count 324 transition count 1415
Free-agglomeration rule applied 77 times with reduction of 37 identical transitions.
Iterating global reduction 7 with 77 rules applied. Total rules applied 1647 place count 324 transition count 1301
Reduce places removed 77 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 182 transitions
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 231 transitions.
Iterating post reduction 7 with 308 rules applied. Total rules applied 1955 place count 247 transition count 1070
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1956 place count 246 transition count 1062
Iterating global reduction 8 with 1 rules applied. Total rules applied 1957 place count 246 transition count 1062
Drop transitions (Redundant composition of simpler transitions.) removed 98 transitions
Redundant transition composition rules discarded 98 transitions
Iterating global reduction 8 with 98 rules applied. Total rules applied 2055 place count 246 transition count 964
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 8 with 6 rules applied. Total rules applied 2061 place count 246 transition count 1015
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 2067 place count 240 transition count 1015
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 2070 place count 240 transition count 1015
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 2071 place count 239 transition count 1014
Applied a total of 2071 rules in 583 ms. Remains 239 /1378 variables (removed 1139) and now considering 1014/2473 (removed 1459) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 583 ms. Remains : 239/1378 places, 1014/2473 transitions.
RANDOM walk for 40000 steps (817 resets) in 1283 ms. (31 steps per ms) remains 11/25 properties
BEST_FIRST walk for 40004 steps (49 resets) in 103 ms. (384 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (45 resets) in 116 ms. (341 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (49 resets) in 106 ms. (373 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (16 resets) in 160 ms. (248 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (47 resets) in 102 ms. (388 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40002 steps (48 resets) in 117 ms. (339 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (48 resets) in 80 ms. (493 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (48 resets) in 84 ms. (470 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (48 resets) in 75 ms. (526 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (49 resets) in 76 ms. (519 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (48 resets) in 58 ms. (678 steps per ms) remains 10/10 properties
[2025-05-30 00:22:26] [INFO ] Flow matrix only has 628 transitions (discarded 386 similar events)
// Phase 1: matrix 628 rows 239 cols
[2025-05-30 00:22:26] [INFO ] Computed 28 invariants in 5 ms
[2025-05-30 00:22:26] [INFO ] State equation strengthened by 25 read => feed constraints.
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/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 217/239 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 628/867 variables, 239/267 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/867 variables, 25/292 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/867 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/867 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 867/867 variables, and 292 constraints, problems are : Problem set: 0 solved, 10 unsolved in 617 ms.
Refiners :[Generalized P Invariants (flows): 28/28 constraints, State Equation: 239/239 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 217/239 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 628/867 variables, 239/267 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/867 variables, 25/292 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/867 variables, 10/302 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/867 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/867 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 867/867 variables, and 302 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2495 ms.
Refiners :[Generalized P Invariants (flows): 28/28 constraints, State Equation: 239/239 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3143ms problems are : Problem set: 0 solved, 10 unsolved
Parikh walk visited 7 properties in 1565 ms.
Support contains 6 out of 239 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 1014/1014 transitions.
Graph (trivial) has 141 edges and 239 vertex of which 25 / 239 are part of one of the 10 SCC in 1 ms
Free SCC test removed 15 places
Drop transitions (Empty/Sink Transition effects.) removed 90 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 97 transitions.
Graph (complete) has 1955 edges and 224 vertex of which 210 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 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 27 rules applied. Total rules applied 29 place count 210 transition count 890
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 43 place count 196 transition count 890
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 43 place count 196 transition count 887
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 49 place count 193 transition count 887
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 58 place count 184 transition count 864
Iterating global reduction 2 with 9 rules applied. Total rules applied 67 place count 184 transition count 864
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 69 place count 184 transition count 862
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 89 place count 174 transition count 852
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 3 with 25 rules applied. Total rules applied 114 place count 174 transition count 827
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 120 place count 171 transition count 849
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 129 place count 171 transition count 840
Drop transitions (Redundant composition of simpler transitions.) removed 65 transitions
Redundant transition composition rules discarded 65 transitions
Iterating global reduction 5 with 65 rules applied. Total rules applied 194 place count 171 transition count 775
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 195 place count 170 transition count 766
Iterating global reduction 5 with 1 rules applied. Total rules applied 196 place count 170 transition count 766
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 199 place count 170 transition count 763
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 1402 edges and 167 vertex of which 166 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 13 rules applied. Total rules applied 212 place count 166 transition count 754
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 213 place count 165 transition count 746
Iterating global reduction 6 with 1 rules applied. Total rules applied 214 place count 165 transition count 746
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 221 place count 165 transition count 739
Applied a total of 221 rules in 101 ms. Remains 165 /239 variables (removed 74) and now considering 739/1014 (removed 275) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 165/239 places, 739/1014 transitions.
RANDOM walk for 14322 steps (143 resets) in 107 ms. (132 steps per ms) remains 0/3 properties
[2025-05-30 00:22:31] [INFO ] Flatten gal took : 99 ms
[2025-05-30 00:22:31] [INFO ] Flatten gal took : 106 ms
[2025-05-30 00:22:31] [INFO ] Input system was already deterministic with 2473 transitions.
Computed a total of 206 stabilizing places and 878 stable transitions
Graph (complete) has 4773 edges and 1378 vertex of which 1354 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.24 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 1378/1378 places, 2473/2473 transitions.
Graph (trivial) has 1423 edges and 1378 vertex of which 498 / 1378 are part of one of the 55 SCC in 3 ms
Free SCC test removed 443 places
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Graph (complete) has 4187 edges and 935 vertex of which 911 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.9 ms
Discarding 24 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 374 transitions
Trivial Post-agglo rules discarded 374 transitions
Performed 374 trivial Post agglomeration. Transition count delta: 374
Iterating post reduction 0 with 374 rules applied. Total rules applied 376 place count 910 transition count 1590
Reduce places removed 374 places and 0 transitions.
Iterating post reduction 1 with 374 rules applied. Total rules applied 750 place count 536 transition count 1590
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 750 place count 536 transition count 1526
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 878 place count 472 transition count 1526
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 908 place count 442 transition count 1496
Iterating global reduction 2 with 30 rules applied. Total rules applied 938 place count 442 transition count 1496
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 947 place count 442 transition count 1487
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 947 place count 442 transition count 1479
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 963 place count 434 transition count 1479
Performed 121 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 121 places in 0 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 3 with 242 rules applied. Total rules applied 1205 place count 313 transition count 1356
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 1211 place count 313 transition count 1350
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 4 with 27 rules applied. Total rules applied 1238 place count 313 transition count 1323
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 4 with 14 rules applied. Total rules applied 1252 place count 313 transition count 1309
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 1266 place count 299 transition count 1309
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 1278 place count 293 transition count 1303
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1279 place count 292 transition count 1302
Applied a total of 1279 rules in 212 ms. Remains 292 /1378 variables (removed 1086) and now considering 1302/2473 (removed 1171) transitions.
[2025-05-30 00:22:31] [INFO ] Flow matrix only has 1052 transitions (discarded 250 similar events)
// Phase 1: matrix 1052 rows 292 cols
[2025-05-30 00:22:31] [INFO ] Computed 7 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:22:31] [INFO ] Implicit Places using invariants in 147 ms returned []
[2025-05-30 00:22:31] [INFO ] Flow matrix only has 1052 transitions (discarded 250 similar events)
[2025-05-30 00:22:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:22:32] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-05-30 00:22:32] [INFO ] Implicit Places using invariants and state equation in 753 ms returned []
Implicit Place search using SMT with State Equation took 902 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 00:22:33] [INFO ] Redundant transitions in 1011 ms returned []
Running 1245 sub problems to find dead transitions.
[2025-05-30 00:22:33] [INFO ] Flow matrix only has 1052 transitions (discarded 250 similar events)
[2025-05-30 00:22:33] [INFO ] Invariant cache hit.
[2025-05-30 00:22:33] [INFO ] State equation strengthened by 49 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/285 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1245 unsolved
At refinement iteration 2 (OVERLAPS) 1051/1336 variables, 285/292 constraints. Problems are: Problem set: 0 solved, 1245 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1336 variables, 49/341 constraints. Problems are: Problem set: 0 solved, 1245 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1336/1344 variables, and 341 constraints, problems are : Problem set: 0 solved, 1245 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 285/292 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 1245/656 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1245 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/285 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1245 unsolved
At refinement iteration 2 (OVERLAPS) 1051/1336 variables, 285/292 constraints. Problems are: Problem set: 0 solved, 1245 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1336 variables, 49/341 constraints. Problems are: Problem set: 0 solved, 1245 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1336 variables, 67/408 constraints. Problems are: Problem set: 0 solved, 1245 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1336/1344 variables, and 408 constraints, problems are : Problem set: 0 solved, 1245 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 285/292 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 656/656 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61585ms problems are : Problem set: 0 solved, 1245 unsolved
Search for dead transitions found 0 dead transitions in 61590ms
Starting structural reductions in SI_CTL mode, iteration 1 : 292/1378 places, 1302/2473 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 63730 ms. Remains : 292/1378 places, 1302/2473 transitions.
[2025-05-30 00:23:35] [INFO ] Flatten gal took : 50 ms
[2025-05-30 00:23:35] [INFO ] Flatten gal took : 47 ms
[2025-05-30 00:23:35] [INFO ] Input system was already deterministic with 1302 transitions.
[2025-05-30 00:23:35] [INFO ] Flatten gal took : 43 ms
[2025-05-30 00:23:35] [INFO ] Flatten gal took : 44 ms
[2025-05-30 00:23:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality4795454861401521947.gal : 31 ms
[2025-05-30 00:23:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality9338157447597079862.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4795454861401521947.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9338157447597079862.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-30 00:24:05] [INFO ] Flatten gal took : 41 ms
[2025-05-30 00:24:05] [INFO ] Applying decomposition
[2025-05-30 00:24:05] [INFO ] Flatten gal took : 43 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/graph9931812202094523265.txt' '-o' '/tmp/graph9931812202094523265.bin' '-w' '/tmp/graph9931812202094523265.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9931812202094523265.bin' '-l' '-1' '-v' '-w' '/tmp/graph9931812202094523265.weights' '-q' '0' '-e' '0.001'
[2025-05-30 00:24:06] [INFO ] Decomposing Gal with order
[2025-05-30 00:24:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 00:24:06] [INFO ] Removed a total of 2669 redundant transitions.
[2025-05-30 00:24:06] [INFO ] Flatten gal took : 237 ms
[2025-05-30 00:24:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 145 labels/synchronizations in 61 ms.
[2025-05-30 00:24:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality316245583048254973.gal : 8 ms
[2025-05-30 00:24:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality9514250890462818877.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/CTLCardinality316245583048254973.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9514250890462818877.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.31917e+21,0.189425,9304,527,306,8007,3613,1051,12379,242,7784,0


Converting to forward existential form...Done !
original formula: AG(AF(((AF((i7.u50.p1626==0)) + EF((i1.i1.u19.p614==1))) + AF(((i4.u31.p1063==0)||(i6.u46.p1419==1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((!(EG(!((i7.u50.p1626==0)))) + E(TRUE U (i1.i1.u19.p614==1))) + !(EG(!(((i4.u31.p1063==...192
Reverse transition relation is NOT exact ! Due to transitions t431, t458, t624, u81.t1, i0.t434, i0.t306, i0.t148, i0.u0.t155, i0.u0.t159, i0.u1.t305, i0.u...1034
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1378/1378 places, 2473/2473 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 1327 transition count 2422
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 1327 transition count 2422
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 110 place count 1327 transition count 2414
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 125 place count 1312 transition count 2399
Iterating global reduction 1 with 15 rules applied. Total rules applied 140 place count 1312 transition count 2399
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 147 place count 1312 transition count 2392
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 148 place count 1311 transition count 2391
Iterating global reduction 2 with 1 rules applied. Total rules applied 149 place count 1311 transition count 2391
Applied a total of 149 rules in 228 ms. Remains 1311 /1378 variables (removed 67) and now considering 2391/2473 (removed 82) transitions.
// Phase 1: matrix 2391 rows 1311 cols
[2025-05-30 00:24:36] [INFO ] Computed 21 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:24:37] [INFO ] Implicit Places using invariants in 518 ms returned []
[2025-05-30 00:24:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:24:39] [INFO ] Implicit Places using invariants and state equation in 2379 ms returned [13, 21, 188, 196, 361, 369, 534, 542, 707, 715, 880, 890, 1055, 1065]
[2025-05-30 00:24:39] [INFO ] Actually due to overlaps returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2936 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1310/1378 places, 2391/2473 transitions.
Applied a total of 0 rules in 60 ms. Remains 1310 /1310 variables (removed 0) and now considering 2391/2391 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3225 ms. Remains : 1310/1378 places, 2391/2473 transitions.
[2025-05-30 00:24:40] [INFO ] Flatten gal took : 196 ms
[2025-05-30 00:24:40] [INFO ] Flatten gal took : 143 ms
[2025-05-30 00:24:40] [INFO ] Input system was already deterministic with 2391 transitions.
[2025-05-30 00:24:40] [INFO ] Flatten gal took : 158 ms
[2025-05-30 00:24:40] [INFO ] Flatten gal took : 73 ms
[2025-05-30 00:24:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality12034332381070783557.gal : 14 ms
[2025-05-30 00:24:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality14595174755038801586.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/CTLCardinality12034332381070783557.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14595174755038801586.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-30 00:25:10] [INFO ] Flatten gal took : 72 ms
[2025-05-30 00:25:10] [INFO ] Applying decomposition
[2025-05-30 00:25:10] [INFO ] Flatten gal took : 73 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/graph13631927335685439814.txt' '-o' '/tmp/graph13631927335685439814.bin' '-w' '/tmp/graph13631927335685439814.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13631927335685439814.bin' '-l' '-1' '-v' '-w' '/tmp/graph13631927335685439814.weights' '-q' '0' '-e' '0.001'
[2025-05-30 00:25:11] [INFO ] Decomposing Gal with order
[2025-05-30 00:25:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 00:25:11] [INFO ] Removed a total of 3097 redundant transitions.
[2025-05-30 00:25:11] [INFO ] Flatten gal took : 171 ms
[2025-05-30 00:25:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 181 labels/synchronizations in 83 ms.
[2025-05-30 00:25:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality12381562583242724329.gal : 30 ms
[2025-05-30 00:25:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality8063350042737094262.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/CTLCardinality12381562583242724329.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8063350042737094262.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 : 1378/1378 places, 2473/2473 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 1325 transition count 2420
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 1325 transition count 2420
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 114 place count 1325 transition count 2412
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 129 place count 1310 transition count 2397
Iterating global reduction 1 with 15 rules applied. Total rules applied 144 place count 1310 transition count 2397
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 151 place count 1310 transition count 2390
Applied a total of 151 rules in 196 ms. Remains 1310 /1378 variables (removed 68) and now considering 2390/2473 (removed 83) transitions.
// Phase 1: matrix 2390 rows 1310 cols
[2025-05-30 00:25:42] [INFO ] Computed 21 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:25:42] [INFO ] Implicit Places using invariants in 361 ms returned []
[2025-05-30 00:25:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:25:45] [INFO ] Implicit Places using invariants and state equation in 2642 ms returned [13, 21, 187, 195, 360, 370, 536, 544, 709, 717, 882, 891, 1056, 1064]
[2025-05-30 00:25:45] [INFO ] Actually due to overlaps returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3015 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1309/1378 places, 2390/2473 transitions.
Applied a total of 0 rules in 71 ms. Remains 1309 /1309 variables (removed 0) and now considering 2390/2390 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3283 ms. Remains : 1309/1378 places, 2390/2473 transitions.
[2025-05-30 00:25:45] [INFO ] Flatten gal took : 75 ms
[2025-05-30 00:25:45] [INFO ] Flatten gal took : 77 ms
[2025-05-30 00:25:45] [INFO ] Input system was already deterministic with 2390 transitions.
[2025-05-30 00:25:45] [INFO ] Flatten gal took : 77 ms
[2025-05-30 00:25:45] [INFO ] Flatten gal took : 79 ms
[2025-05-30 00:25:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality17659374246637758556.gal : 13 ms
[2025-05-30 00:25:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality1891521205763877636.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/CTLCardinality17659374246637758556.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1891521205763877636.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-30 00:26:15] [INFO ] Flatten gal took : 74 ms
[2025-05-30 00:26:15] [INFO ] Applying decomposition
[2025-05-30 00:26:15] [INFO ] Flatten gal took : 102 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/graph14493643944109552472.txt' '-o' '/tmp/graph14493643944109552472.bin' '-w' '/tmp/graph14493643944109552472.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14493643944109552472.bin' '-l' '-1' '-v' '-w' '/tmp/graph14493643944109552472.weights' '-q' '0' '-e' '0.001'
[2025-05-30 00:26:16] [INFO ] Decomposing Gal with order
[2025-05-30 00:26:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 00:26:16] [INFO ] Removed a total of 3383 redundant transitions.
[2025-05-30 00:26:16] [INFO ] Flatten gal took : 131 ms
[2025-05-30 00:26:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 170 labels/synchronizations in 32 ms.
[2025-05-30 00:26:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality11714456996413425768.gal : 17 ms
[2025-05-30 00:26:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality5660572458331706415.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/CTLCardinality11714456996413425768.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5660572458331706415.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 : 1378/1378 places, 2473/2473 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 1323 transition count 2418
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 1323 transition count 2418
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 119 place count 1323 transition count 2409
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 135 place count 1307 transition count 2393
Iterating global reduction 1 with 16 rules applied. Total rules applied 151 place count 1307 transition count 2393
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 158 place count 1307 transition count 2386
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 159 place count 1306 transition count 2385
Iterating global reduction 2 with 1 rules applied. Total rules applied 160 place count 1306 transition count 2385
Applied a total of 160 rules in 196 ms. Remains 1306 /1378 variables (removed 72) and now considering 2385/2473 (removed 88) transitions.
// Phase 1: matrix 2385 rows 1306 cols
[2025-05-30 00:26:46] [INFO ] Computed 21 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:26:46] [INFO ] Implicit Places using invariants in 270 ms returned []
[2025-05-30 00:26:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:26:49] [INFO ] Implicit Places using invariants and state equation in 2243 ms returned [13, 21, 187, 195, 360, 368, 533, 541, 706, 714, 879, 889, 1054, 1062]
[2025-05-30 00:26:49] [INFO ] Actually due to overlaps returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2521 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1305/1378 places, 2385/2473 transitions.
Applied a total of 0 rules in 71 ms. Remains 1305 /1305 variables (removed 0) and now considering 2385/2385 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2790 ms. Remains : 1305/1378 places, 2385/2473 transitions.
[2025-05-30 00:26:49] [INFO ] Flatten gal took : 73 ms
[2025-05-30 00:26:49] [INFO ] Flatten gal took : 79 ms
[2025-05-30 00:26:49] [INFO ] Input system was already deterministic with 2385 transitions.
[2025-05-30 00:26:49] [INFO ] Flatten gal took : 75 ms
[2025-05-30 00:26:49] [INFO ] Flatten gal took : 76 ms
[2025-05-30 00:26:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality9654856674641988783.gal : 12 ms
[2025-05-30 00:26:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality12890067291901571201.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/CTLCardinality9654856674641988783.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12890067291901571201.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-30 00:27:19] [INFO ] Flatten gal took : 73 ms
[2025-05-30 00:27:19] [INFO ] Applying decomposition
[2025-05-30 00:27:20] [INFO ] Flatten gal took : 74 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/graph7423681957429679497.txt' '-o' '/tmp/graph7423681957429679497.bin' '-w' '/tmp/graph7423681957429679497.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7423681957429679497.bin' '-l' '-1' '-v' '-w' '/tmp/graph7423681957429679497.weights' '-q' '0' '-e' '0.001'
[2025-05-30 00:27:20] [INFO ] Decomposing Gal with order
[2025-05-30 00:27:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 00:27:20] [INFO ] Removed a total of 3643 redundant transitions.
[2025-05-30 00:27:20] [INFO ] Flatten gal took : 117 ms
[2025-05-30 00:27:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 107 labels/synchronizations in 33 ms.
[2025-05-30 00:27:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality11644147852501744587.gal : 14 ms
[2025-05-30 00:27:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality8182101884141151041.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/CTLCardinality11644147852501744587.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8182101884141151041.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 : 1378/1378 places, 2473/2473 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 1327 transition count 2422
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 1327 transition count 2422
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 110 place count 1327 transition count 2414
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 125 place count 1312 transition count 2399
Iterating global reduction 1 with 15 rules applied. Total rules applied 140 place count 1312 transition count 2399
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 147 place count 1312 transition count 2392
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 148 place count 1311 transition count 2391
Iterating global reduction 2 with 1 rules applied. Total rules applied 149 place count 1311 transition count 2391
Applied a total of 149 rules in 170 ms. Remains 1311 /1378 variables (removed 67) and now considering 2391/2473 (removed 82) transitions.
// Phase 1: matrix 2391 rows 1311 cols
[2025-05-30 00:27:50] [INFO ] Computed 21 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:27:51] [INFO ] Implicit Places using invariants in 281 ms returned []
[2025-05-30 00:27:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:27:53] [INFO ] Implicit Places using invariants and state equation in 2285 ms returned [13, 23, 189, 198, 364, 372, 537, 545, 711, 721, 886, 894, 1059, 1067]
[2025-05-30 00:27:53] [INFO ] Actually due to overlaps returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2574 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1310/1378 places, 2391/2473 transitions.
Applied a total of 0 rules in 44 ms. Remains 1310 /1310 variables (removed 0) and now considering 2391/2391 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2790 ms. Remains : 1310/1378 places, 2391/2473 transitions.
[2025-05-30 00:27:53] [INFO ] Flatten gal took : 65 ms
[2025-05-30 00:27:53] [INFO ] Flatten gal took : 87 ms
[2025-05-30 00:27:53] [INFO ] Input system was already deterministic with 2391 transitions.
[2025-05-30 00:27:53] [INFO ] Flatten gal took : 65 ms
[2025-05-30 00:27:53] [INFO ] Flatten gal took : 68 ms
[2025-05-30 00:27:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality14588538384497587122.gal : 11 ms
[2025-05-30 00:27:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality11146061978182950692.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/CTLCardinality14588538384497587122.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11146061978182950692.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-30 00:28:23] [INFO ] Flatten gal took : 79 ms
[2025-05-30 00:28:23] [INFO ] Applying decomposition
[2025-05-30 00:28:24] [INFO ] Flatten gal took : 77 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/graph8740247511862717629.txt' '-o' '/tmp/graph8740247511862717629.bin' '-w' '/tmp/graph8740247511862717629.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8740247511862717629.bin' '-l' '-1' '-v' '-w' '/tmp/graph8740247511862717629.weights' '-q' '0' '-e' '0.001'
[2025-05-30 00:28:24] [INFO ] Decomposing Gal with order
[2025-05-30 00:28:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 00:28:24] [INFO ] Removed a total of 3337 redundant transitions.
[2025-05-30 00:28:24] [INFO ] Flatten gal took : 138 ms
[2025-05-30 00:28:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 180 labels/synchronizations in 28 ms.
[2025-05-30 00:28:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality8453347692249513216.gal : 15 ms
[2025-05-30 00:28:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality9509325373712131742.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/CTLCardinality8453347692249513216.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9509325373712131742.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1378/1378 places, 2473/2473 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 1322 transition count 2417
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 1322 transition count 2417
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 121 place count 1322 transition count 2408
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 137 place count 1306 transition count 2392
Iterating global reduction 1 with 16 rules applied. Total rules applied 153 place count 1306 transition count 2392
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 160 place count 1306 transition count 2385
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 161 place count 1305 transition count 2384
Iterating global reduction 2 with 1 rules applied. Total rules applied 162 place count 1305 transition count 2384
Applied a total of 162 rules in 173 ms. Remains 1305 /1378 variables (removed 73) and now considering 2384/2473 (removed 89) transitions.
// Phase 1: matrix 2384 rows 1305 cols
[2025-05-30 00:28:54] [INFO ] Computed 21 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:28:55] [INFO ] Implicit Places using invariants in 291 ms returned []
[2025-05-30 00:28:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:28:57] [INFO ] Implicit Places using invariants and state equation in 2193 ms returned [13, 21, 187, 195, 360, 368, 533, 541, 706, 714, 879, 887, 1052, 1061]
[2025-05-30 00:28:57] [INFO ] Actually due to overlaps returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2493 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1304/1378 places, 2384/2473 transitions.
Applied a total of 0 rules in 43 ms. Remains 1304 /1304 variables (removed 0) and now considering 2384/2384 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2711 ms. Remains : 1304/1378 places, 2384/2473 transitions.
[2025-05-30 00:28:57] [INFO ] Flatten gal took : 68 ms
[2025-05-30 00:28:57] [INFO ] Flatten gal took : 72 ms
[2025-05-30 00:28:57] [INFO ] Input system was already deterministic with 2384 transitions.
[2025-05-30 00:28:57] [INFO ] Flatten gal took : 68 ms
[2025-05-30 00:28:57] [INFO ] Flatten gal took : 68 ms
[2025-05-30 00:28:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality12633546989797944669.gal : 11 ms
[2025-05-30 00:28:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality6977031892511177356.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/CTLCardinality12633546989797944669.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6977031892511177356.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-30 00:29:27] [INFO ] Flatten gal took : 71 ms
[2025-05-30 00:29:27] [INFO ] Applying decomposition
[2025-05-30 00:29:28] [INFO ] Flatten gal took : 72 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/graph10397713973335127456.txt' '-o' '/tmp/graph10397713973335127456.bin' '-w' '/tmp/graph10397713973335127456.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10397713973335127456.bin' '-l' '-1' '-v' '-w' '/tmp/graph10397713973335127456.weights' '-q' '0' '-e' '0.001'
[2025-05-30 00:29:28] [INFO ] Decomposing Gal with order
[2025-05-30 00:29:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 00:29:28] [INFO ] Removed a total of 3277 redundant transitions.
[2025-05-30 00:29:28] [INFO ] Flatten gal took : 115 ms
[2025-05-30 00:29:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 188 labels/synchronizations in 29 ms.
[2025-05-30 00:29:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality13016797163334481334.gal : 14 ms
[2025-05-30 00:29:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality14156909026512499493.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/CTLCardinality13016797163334481334.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14156909026512499493.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1378/1378 places, 2473/2473 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 1329 transition count 2424
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 1329 transition count 2424
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 107 place count 1329 transition count 2415
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 121 place count 1315 transition count 2401
Iterating global reduction 1 with 14 rules applied. Total rules applied 135 place count 1315 transition count 2401
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 141 place count 1315 transition count 2395
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 142 place count 1314 transition count 2394
Iterating global reduction 2 with 1 rules applied. Total rules applied 143 place count 1314 transition count 2394
Applied a total of 143 rules in 189 ms. Remains 1314 /1378 variables (removed 64) and now considering 2394/2473 (removed 79) transitions.
// Phase 1: matrix 2394 rows 1314 cols
[2025-05-30 00:29:58] [INFO ] Computed 21 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:29:59] [INFO ] Implicit Places using invariants in 287 ms returned []
[2025-05-30 00:29:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:30:01] [INFO ] Implicit Places using invariants and state equation in 2202 ms returned [13, 21, 188, 196, 361, 369, 534, 542, 709, 721, 889, 897, 1062, 1070]
[2025-05-30 00:30:01] [INFO ] Actually due to overlaps returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2496 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1313/1378 places, 2394/2473 transitions.
Applied a total of 0 rules in 45 ms. Remains 1313 /1313 variables (removed 0) and now considering 2394/2394 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2733 ms. Remains : 1313/1378 places, 2394/2473 transitions.
[2025-05-30 00:30:01] [INFO ] Flatten gal took : 65 ms
[2025-05-30 00:30:01] [INFO ] Flatten gal took : 68 ms
[2025-05-30 00:30:01] [INFO ] Input system was already deterministic with 2394 transitions.
[2025-05-30 00:30:01] [INFO ] Flatten gal took : 71 ms
[2025-05-30 00:30:01] [INFO ] Flatten gal took : 72 ms
[2025-05-30 00:30:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality2257081091573770046.gal : 11 ms
[2025-05-30 00:30:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality11372722504107666403.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/CTLCardinality2257081091573770046.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11372722504107666403.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-30 00:30:31] [INFO ] Flatten gal took : 77 ms
[2025-05-30 00:30:31] [INFO ] Applying decomposition
[2025-05-30 00:30:31] [INFO ] Flatten gal took : 79 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/graph16967200958933303529.txt' '-o' '/tmp/graph16967200958933303529.bin' '-w' '/tmp/graph16967200958933303529.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16967200958933303529.bin' '-l' '-1' '-v' '-w' '/tmp/graph16967200958933303529.weights' '-q' '0' '-e' '0.001'
[2025-05-30 00:30:32] [INFO ] Decomposing Gal with order
[2025-05-30 00:30:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 00:30:32] [INFO ] Removed a total of 3463 redundant transitions.
[2025-05-30 00:30:32] [INFO ] Flatten gal took : 121 ms
[2025-05-30 00:30:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 139 labels/synchronizations in 53 ms.
[2025-05-30 00:30:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality10488294345975491492.gal : 11 ms
[2025-05-30 00:30:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality11519185978620363441.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/CTLCardinality10488294345975491492.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11519185978620363441.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1378/1378 places, 2473/2473 transitions.
Graph (trivial) has 1428 edges and 1378 vertex of which 509 / 1378 are part of one of the 56 SCC in 2 ms
Free SCC test removed 453 places
Ensure Unique test removed 515 transitions
Reduce isomorphic transitions removed 515 transitions.
Graph (complete) has 4177 edges and 925 vertex of which 901 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.3 ms
Discarding 24 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 373 transitions
Trivial Post-agglo rules discarded 373 transitions
Performed 373 trivial Post agglomeration. Transition count delta: 373
Iterating post reduction 0 with 373 rules applied. Total rules applied 375 place count 900 transition count 1581
Reduce places removed 373 places and 0 transitions.
Iterating post reduction 1 with 373 rules applied. Total rules applied 748 place count 527 transition count 1581
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 62 Pre rules applied. Total rules applied 748 place count 527 transition count 1519
Deduced a syphon composed of 62 places in 1 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 2 with 124 rules applied. Total rules applied 872 place count 465 transition count 1519
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 903 place count 434 transition count 1488
Iterating global reduction 2 with 31 rules applied. Total rules applied 934 place count 434 transition count 1488
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 943 place count 434 transition count 1479
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 943 place count 434 transition count 1471
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 959 place count 426 transition count 1471
Performed 121 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 121 places in 1 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 3 with 242 rules applied. Total rules applied 1201 place count 305 transition count 1348
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 1207 place count 305 transition count 1342
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 4 with 28 rules applied. Total rules applied 1235 place count 305 transition count 1314
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 4 with 14 rules applied. Total rules applied 1249 place count 305 transition count 1300
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 1263 place count 291 transition count 1300
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 1277 place count 284 transition count 1293
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1278 place count 283 transition count 1292
Applied a total of 1278 rules in 184 ms. Remains 283 /1378 variables (removed 1095) and now considering 1292/2473 (removed 1181) transitions.
[2025-05-30 00:31:02] [INFO ] Flow matrix only has 1041 transitions (discarded 251 similar events)
// Phase 1: matrix 1041 rows 283 cols
[2025-05-30 00:31:02] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:31:03] [INFO ] Implicit Places using invariants in 437 ms returned []
[2025-05-30 00:31:03] [INFO ] Flow matrix only has 1041 transitions (discarded 251 similar events)
[2025-05-30 00:31:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:31:03] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-05-30 00:31:03] [INFO ] Implicit Places using invariants and state equation in 710 ms returned []
Implicit Place search using SMT with State Equation took 1161 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 00:31:04] [INFO ] Redundant transitions in 1000 ms returned []
Running 1235 sub problems to find dead transitions.
[2025-05-30 00:31:04] [INFO ] Flow matrix only has 1041 transitions (discarded 251 similar events)
[2025-05-30 00:31:04] [INFO ] Invariant cache hit.
[2025-05-30 00:31:04] [INFO ] State equation strengthened by 49 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1235 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1235 unsolved
At refinement iteration 2 (OVERLAPS) 1040/1316 variables, 276/283 constraints. Problems are: Problem set: 0 solved, 1235 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1316 variables, 49/332 constraints. Problems are: Problem set: 0 solved, 1235 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1316/1324 variables, and 332 constraints, problems are : Problem set: 0 solved, 1235 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 276/283 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 1235/646 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1235 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1235 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1235 unsolved
At refinement iteration 2 (OVERLAPS) 1040/1316 variables, 276/283 constraints. Problems are: Problem set: 0 solved, 1235 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1316 variables, 49/332 constraints. Problems are: Problem set: 0 solved, 1235 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1316 variables, 57/389 constraints. Problems are: Problem set: 0 solved, 1235 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1316/1324 variables, and 389 constraints, problems are : Problem set: 0 solved, 1235 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 276/283 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 646/646 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61485ms problems are : Problem set: 0 solved, 1235 unsolved
Search for dead transitions found 0 dead transitions in 61489ms
Starting structural reductions in SI_CTL mode, iteration 1 : 283/1378 places, 1292/2473 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 63843 ms. Remains : 283/1378 places, 1292/2473 transitions.
[2025-05-30 00:32:06] [INFO ] Flatten gal took : 40 ms
[2025-05-30 00:32:06] [INFO ] Flatten gal took : 43 ms
[2025-05-30 00:32:06] [INFO ] Input system was already deterministic with 1292 transitions.
[2025-05-30 00:32:06] [INFO ] Flatten gal took : 85 ms
[2025-05-30 00:32:06] [INFO ] Flatten gal took : 104 ms
[2025-05-30 00:32:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11942425817015345248.gal : 16 ms
[2025-05-30 00:32:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14168533352852649936.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/ReachabilityCardinality11942425817015345248.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14168533352852649936.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
RANDOM walk for 40000 steps (778 resets) in 1013 ms. (39 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (37 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality14168533352852649936.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 15
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :15 after 180
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :180 after 5400
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :5400 after 12840
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :12840 after 13188
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :13188 after 15948
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :15948 after 25428
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :25428 after 35178
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :35178 after 74080
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :74080 after 207985
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :207985 after 446242
Interrupted probabilistic random walk after 697760 steps, run timeout after 3001 ms. (steps per millisecond=232 ) properties seen :0 out of 1
Probabilistic random walk after 697760 steps, saw 92363 distinct states, run finished after 3008 ms. (steps per millisecond=231 ) properties seen :0
[2025-05-30 00:32:09] [INFO ] Flow matrix only has 1041 transitions (discarded 251 similar events)
[2025-05-30 00:32:09] [INFO ] Invariant cache hit.
[2025-05-30 00:32:09] [INFO ] State equation strengthened by 49 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/15 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 506/521 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/521 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 41/562 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/562 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/562 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 663/1225 variables, 204/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1225 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 98/1323 variables, 61/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1323 variables, 49/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1323 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1323 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1323/1324 variables, and 339 constraints, problems are : Problem set: 0 solved, 1 unsolved in 421 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 283/283 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/15 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 506/521 variables, 15/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/521 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 41/562 variables, 7/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/562 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/562 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 663/1225 variables, 204/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1225 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 98/1323 variables, 61/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1323 variables, 49/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1323 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1323 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1323/1324 variables, and 340 constraints, problems are : Problem set: 0 solved, 1 unsolved in 381 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 283/283 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 815ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1000 steps, including 95 resets, run visited all 1 properties in 8 ms. (steps per millisecond=125 )
FORMULA CloudDeployment-PT-7b-CTLCardinality-2025-08 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 12 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 1378/1378 places, 2473/2473 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 1328 transition count 2423
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 1328 transition count 2423
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 107 place count 1328 transition count 2416
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 123 place count 1312 transition count 2400
Iterating global reduction 1 with 16 rules applied. Total rules applied 139 place count 1312 transition count 2400
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 146 place count 1312 transition count 2393
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 147 place count 1311 transition count 2392
Iterating global reduction 2 with 1 rules applied. Total rules applied 148 place count 1311 transition count 2392
Applied a total of 148 rules in 187 ms. Remains 1311 /1378 variables (removed 67) and now considering 2392/2473 (removed 81) transitions.
// Phase 1: matrix 2392 rows 1311 cols
[2025-05-30 00:32:11] [INFO ] Computed 21 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:32:11] [INFO ] Implicit Places using invariants in 294 ms returned []
[2025-05-30 00:32:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:32:13] [INFO ] Implicit Places using invariants and state equation in 2403 ms returned [13, 21, 187, 195, 360, 368, 533, 541, 706, 716, 881, 890, 1056, 1066]
[2025-05-30 00:32:13] [INFO ] Actually due to overlaps returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2703 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1310/1378 places, 2392/2473 transitions.
Applied a total of 0 rules in 43 ms. Remains 1310 /1310 variables (removed 0) and now considering 2392/2392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2933 ms. Remains : 1310/1378 places, 2392/2473 transitions.
[2025-05-30 00:32:13] [INFO ] Flatten gal took : 67 ms
[2025-05-30 00:32:13] [INFO ] Flatten gal took : 71 ms
[2025-05-30 00:32:14] [INFO ] Input system was already deterministic with 2392 transitions.
[2025-05-30 00:32:14] [INFO ] Flatten gal took : 69 ms
[2025-05-30 00:32:14] [INFO ] Flatten gal took : 70 ms
[2025-05-30 00:32:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality16337288143231905162.gal : 12 ms
[2025-05-30 00:32:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality4952669497941333327.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/CTLCardinality16337288143231905162.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4952669497941333327.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-30 00:32:44] [INFO ] Flatten gal took : 70 ms
[2025-05-30 00:32:44] [INFO ] Applying decomposition
[2025-05-30 00:32:44] [INFO ] Flatten gal took : 72 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/graph10923591022708945216.txt' '-o' '/tmp/graph10923591022708945216.bin' '-w' '/tmp/graph10923591022708945216.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10923591022708945216.bin' '-l' '-1' '-v' '-w' '/tmp/graph10923591022708945216.weights' '-q' '0' '-e' '0.001'
[2025-05-30 00:32:44] [INFO ] Decomposing Gal with order
[2025-05-30 00:32:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 00:32:44] [INFO ] Removed a total of 3490 redundant transitions.
[2025-05-30 00:32:44] [INFO ] Flatten gal took : 104 ms
[2025-05-30 00:32:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 146 labels/synchronizations in 19 ms.
[2025-05-30 00:32:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality10451748544382658993.gal : 13 ms
[2025-05-30 00:32:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality1343845772428374816.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/CTLCardinality10451748544382658993.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1343845772428374816.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 : 1378/1378 places, 2473/2473 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 1323 transition count 2418
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 1323 transition count 2418
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 119 place count 1323 transition count 2409
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 136 place count 1306 transition count 2392
Iterating global reduction 1 with 17 rules applied. Total rules applied 153 place count 1306 transition count 2392
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 161 place count 1306 transition count 2384
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 162 place count 1305 transition count 2383
Iterating global reduction 2 with 1 rules applied. Total rules applied 163 place count 1305 transition count 2383
Applied a total of 163 rules in 174 ms. Remains 1305 /1378 variables (removed 73) and now considering 2383/2473 (removed 90) transitions.
// Phase 1: matrix 2383 rows 1305 cols
[2025-05-30 00:33:15] [INFO ] Computed 21 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:33:15] [INFO ] Implicit Places using invariants in 297 ms returned []
[2025-05-30 00:33:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:33:17] [INFO ] Implicit Places using invariants and state equation in 2032 ms returned [13, 21, 187, 195, 360, 368, 533, 541, 706, 714, 880, 888, 1053, 1061]
[2025-05-30 00:33:17] [INFO ] Actually due to overlaps returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2364 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1304/1378 places, 2383/2473 transitions.
Applied a total of 0 rules in 39 ms. Remains 1304 /1304 variables (removed 0) and now considering 2383/2383 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2577 ms. Remains : 1304/1378 places, 2383/2473 transitions.
[2025-05-30 00:33:17] [INFO ] Flatten gal took : 86 ms
[2025-05-30 00:33:17] [INFO ] Flatten gal took : 68 ms
[2025-05-30 00:33:17] [INFO ] Input system was already deterministic with 2383 transitions.
[2025-05-30 00:33:17] [INFO ] Flatten gal took : 66 ms
[2025-05-30 00:33:17] [INFO ] Flatten gal took : 68 ms
[2025-05-30 00:33:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality10252639695460850223.gal : 12 ms
[2025-05-30 00:33:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality15740643542021929642.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/CTLCardinality10252639695460850223.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15740643542021929642.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-30 00:33:48] [INFO ] Flatten gal took : 68 ms
[2025-05-30 00:33:48] [INFO ] Applying decomposition
[2025-05-30 00:33:48] [INFO ] Flatten gal took : 69 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/graph3175850975955925397.txt' '-o' '/tmp/graph3175850975955925397.bin' '-w' '/tmp/graph3175850975955925397.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3175850975955925397.bin' '-l' '-1' '-v' '-w' '/tmp/graph3175850975955925397.weights' '-q' '0' '-e' '0.001'
[2025-05-30 00:33:48] [INFO ] Decomposing Gal with order
[2025-05-30 00:33:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 00:33:48] [INFO ] Removed a total of 3362 redundant transitions.
[2025-05-30 00:33:48] [INFO ] Flatten gal took : 109 ms
[2025-05-30 00:33:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 161 labels/synchronizations in 24 ms.
[2025-05-30 00:33:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality1062858960014425746.gal : 11 ms
[2025-05-30 00:33:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality17556060849895825597.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/CTLCardinality1062858960014425746.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17556060849895825597.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 : 1378/1378 places, 2473/2473 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 1329 transition count 2424
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 1329 transition count 2424
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 106 place count 1329 transition count 2416
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 120 place count 1315 transition count 2402
Iterating global reduction 1 with 14 rules applied. Total rules applied 134 place count 1315 transition count 2402
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 140 place count 1315 transition count 2396
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 1314 transition count 2395
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 1314 transition count 2395
Applied a total of 142 rules in 168 ms. Remains 1314 /1378 variables (removed 64) and now considering 2395/2473 (removed 78) transitions.
// Phase 1: matrix 2395 rows 1314 cols
[2025-05-30 00:34:18] [INFO ] Computed 21 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:34:19] [INFO ] Implicit Places using invariants in 283 ms returned []
[2025-05-30 00:34:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:34:21] [INFO ] Implicit Places using invariants and state equation in 2268 ms returned [13, 21, 188, 196, 362, 370, 537, 546, 711, 721, 886, 896, 1062, 1070]
[2025-05-30 00:34:21] [INFO ] Actually due to overlaps returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2568 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1313/1378 places, 2395/2473 transitions.
Applied a total of 0 rules in 42 ms. Remains 1313 /1313 variables (removed 0) and now considering 2395/2395 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2779 ms. Remains : 1313/1378 places, 2395/2473 transitions.
[2025-05-30 00:34:21] [INFO ] Flatten gal took : 65 ms
[2025-05-30 00:34:21] [INFO ] Flatten gal took : 67 ms
[2025-05-30 00:34:21] [INFO ] Input system was already deterministic with 2395 transitions.
[2025-05-30 00:34:21] [INFO ] Flatten gal took : 67 ms
[2025-05-30 00:34:21] [INFO ] Flatten gal took : 70 ms
[2025-05-30 00:34:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality1302795836066632072.gal : 11 ms
[2025-05-30 00:34:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality1708894892409607366.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/CTLCardinality1302795836066632072.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1708894892409607366.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-30 00:34:52] [INFO ] Flatten gal took : 73 ms
[2025-05-30 00:34:52] [INFO ] Applying decomposition
[2025-05-30 00:34:52] [INFO ] Flatten gal took : 74 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/graph534999081481307981.txt' '-o' '/tmp/graph534999081481307981.bin' '-w' '/tmp/graph534999081481307981.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph534999081481307981.bin' '-l' '-1' '-v' '-w' '/tmp/graph534999081481307981.weights' '-q' '0' '-e' '0.001'
[2025-05-30 00:34:52] [INFO ] Decomposing Gal with order
[2025-05-30 00:34:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 00:34:52] [INFO ] Removed a total of 4318 redundant transitions.
[2025-05-30 00:34:52] [INFO ] Flatten gal took : 112 ms
[2025-05-30 00:34:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 114 labels/synchronizations in 26 ms.
[2025-05-30 00:34:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality7477016980354706256.gal : 13 ms
[2025-05-30 00:34:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality1808673080873507740.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/CTLCardinality7477016980354706256.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1808673080873507740.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1378/1378 places, 2473/2473 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 1322 transition count 2417
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 1322 transition count 2417
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 121 place count 1322 transition count 2408
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 138 place count 1305 transition count 2391
Iterating global reduction 1 with 17 rules applied. Total rules applied 155 place count 1305 transition count 2391
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 163 place count 1305 transition count 2383
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 164 place count 1304 transition count 2382
Iterating global reduction 2 with 1 rules applied. Total rules applied 165 place count 1304 transition count 2382
Applied a total of 165 rules in 175 ms. Remains 1304 /1378 variables (removed 74) and now considering 2382/2473 (removed 91) transitions.
// Phase 1: matrix 2382 rows 1304 cols
[2025-05-30 00:35:22] [INFO ] Computed 21 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:35:23] [INFO ] Implicit Places using invariants in 249 ms returned []
[2025-05-30 00:35:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:35:25] [INFO ] Implicit Places using invariants and state equation in 2208 ms returned [13, 21, 187, 195, 360, 368, 533, 541, 706, 714, 879, 887, 1052, 1060]
[2025-05-30 00:35:25] [INFO ] Actually due to overlaps returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2482 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1303/1378 places, 2382/2473 transitions.
Applied a total of 0 rules in 39 ms. Remains 1303 /1303 variables (removed 0) and now considering 2382/2382 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2696 ms. Remains : 1303/1378 places, 2382/2473 transitions.
[2025-05-30 00:35:25] [INFO ] Flatten gal took : 65 ms
[2025-05-30 00:35:25] [INFO ] Flatten gal took : 68 ms
[2025-05-30 00:35:25] [INFO ] Input system was already deterministic with 2382 transitions.
[2025-05-30 00:35:25] [INFO ] Flatten gal took : 66 ms
[2025-05-30 00:35:25] [INFO ] Flatten gal took : 67 ms
[2025-05-30 00:35:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality15676727571994850667.gal : 10 ms
[2025-05-30 00:35:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality2905826772988888118.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/CTLCardinality15676727571994850667.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2905826772988888118.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-30 00:35:55] [INFO ] Flatten gal took : 67 ms
[2025-05-30 00:35:55] [INFO ] Applying decomposition
[2025-05-30 00:35:55] [INFO ] Flatten gal took : 69 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/graph6852755271786460859.txt' '-o' '/tmp/graph6852755271786460859.bin' '-w' '/tmp/graph6852755271786460859.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6852755271786460859.bin' '-l' '-1' '-v' '-w' '/tmp/graph6852755271786460859.weights' '-q' '0' '-e' '0.001'
[2025-05-30 00:35:56] [INFO ] Decomposing Gal with order
[2025-05-30 00:35:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 00:35:56] [INFO ] Removed a total of 3559 redundant transitions.
[2025-05-30 00:35:56] [INFO ] Flatten gal took : 117 ms
[2025-05-30 00:35:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 134 labels/synchronizations in 18 ms.
[2025-05-30 00:35:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality4686113207328585262.gal : 10 ms
[2025-05-30 00:35:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality12468270094408777701.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/CTLCardinality4686113207328585262.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12468270094408777701.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 : 1378/1378 places, 2473/2473 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 1329 transition count 2424
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 1329 transition count 2424
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 107 place count 1329 transition count 2415
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 122 place count 1314 transition count 2400
Iterating global reduction 1 with 15 rules applied. Total rules applied 137 place count 1314 transition count 2400
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 145 place count 1314 transition count 2392
Applied a total of 145 rules in 137 ms. Remains 1314 /1378 variables (removed 64) and now considering 2392/2473 (removed 81) transitions.
// Phase 1: matrix 2392 rows 1314 cols
[2025-05-30 00:36:26] [INFO ] Computed 21 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:36:26] [INFO ] Implicit Places using invariants in 272 ms returned []
[2025-05-30 00:36:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:36:28] [INFO ] Implicit Places using invariants and state equation in 2065 ms returned [13, 21, 188, 196, 362, 370, 535, 543, 711, 719, 884, 892, 1057, 1066]
[2025-05-30 00:36:29] [INFO ] Actually due to overlaps returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2384 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1313/1378 places, 2392/2473 transitions.
Applied a total of 0 rules in 39 ms. Remains 1313 /1313 variables (removed 0) and now considering 2392/2392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2561 ms. Remains : 1313/1378 places, 2392/2473 transitions.
[2025-05-30 00:36:29] [INFO ] Flatten gal took : 64 ms
[2025-05-30 00:36:29] [INFO ] Flatten gal took : 67 ms
[2025-05-30 00:36:29] [INFO ] Input system was already deterministic with 2392 transitions.
[2025-05-30 00:36:29] [INFO ] Flatten gal took : 64 ms
[2025-05-30 00:36:29] [INFO ] Flatten gal took : 65 ms
[2025-05-30 00:36:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality2240011610870133768.gal : 11 ms
[2025-05-30 00:36:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality18397793657996605434.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/CTLCardinality2240011610870133768.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18397793657996605434.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-30 00:36:59] [INFO ] Flatten gal took : 66 ms
[2025-05-30 00:36:59] [INFO ] Applying decomposition
[2025-05-30 00:36:59] [INFO ] Flatten gal took : 67 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/graph9457686595635764714.txt' '-o' '/tmp/graph9457686595635764714.bin' '-w' '/tmp/graph9457686595635764714.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9457686595635764714.bin' '-l' '-1' '-v' '-w' '/tmp/graph9457686595635764714.weights' '-q' '0' '-e' '0.001'
[2025-05-30 00:36:59] [INFO ] Decomposing Gal with order
[2025-05-30 00:36:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 00:37:00] [INFO ] Removed a total of 3419 redundant transitions.
[2025-05-30 00:37:00] [INFO ] Flatten gal took : 95 ms
[2025-05-30 00:37:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 161 labels/synchronizations in 21 ms.
[2025-05-30 00:37:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality17822550303601301291.gal : 10 ms
[2025-05-30 00:37:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality13183958259452224713.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/CTLCardinality17822550303601301291.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13183958259452224713.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1378/1378 places, 2473/2473 transitions.
Graph (trivial) has 1406 edges and 1378 vertex of which 481 / 1378 are part of one of the 56 SCC in 4 ms
Free SCC test removed 425 places
Ensure Unique test removed 479 transitions
Reduce isomorphic transitions removed 479 transitions.
Graph (complete) has 4219 edges and 953 vertex of which 952 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 370 transitions
Trivial Post-agglo rules discarded 370 transitions
Performed 370 trivial Post agglomeration. Transition count delta: 370
Iterating post reduction 0 with 370 rules applied. Total rules applied 372 place count 951 transition count 1622
Reduce places removed 370 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 374 rules applied. Total rules applied 746 place count 581 transition count 1618
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 750 place count 577 transition count 1618
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 750 place count 577 transition count 1553
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 880 place count 512 transition count 1553
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 907 place count 485 transition count 1526
Iterating global reduction 3 with 27 rules applied. Total rules applied 934 place count 485 transition count 1526
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 941 place count 485 transition count 1519
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 941 place count 485 transition count 1512
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 955 place count 478 transition count 1512
Performed 125 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 125 places in 0 ms
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 4 with 250 rules applied. Total rules applied 1205 place count 353 transition count 1385
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 8 rules applied. Total rules applied 1213 place count 353 transition count 1377
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1214 place count 352 transition count 1377
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 6 with 30 rules applied. Total rules applied 1244 place count 352 transition count 1347
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 6 with 14 rules applied. Total rules applied 1258 place count 352 transition count 1333
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 1272 place count 338 transition count 1333
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 8 with 16 rules applied. Total rules applied 1288 place count 330 transition count 1325
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1289 place count 329 transition count 1324
Applied a total of 1289 rules in 257 ms. Remains 329 /1378 variables (removed 1049) and now considering 1324/2473 (removed 1149) transitions.
[2025-05-30 00:37:30] [INFO ] Flow matrix only has 1094 transitions (discarded 230 similar events)
// Phase 1: matrix 1094 rows 329 cols
[2025-05-30 00:37:30] [INFO ] Computed 21 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:37:31] [INFO ] Implicit Places using invariants in 818 ms returned []
[2025-05-30 00:37:31] [INFO ] Flow matrix only has 1094 transitions (discarded 230 similar events)
[2025-05-30 00:37:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:37:31] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-05-30 00:37:32] [INFO ] Implicit Places using invariants and state equation in 1076 ms returned []
Implicit Place search using SMT with State Equation took 1907 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 00:37:33] [INFO ] Redundant transitions in 973 ms returned []
Running 1267 sub problems to find dead transitions.
[2025-05-30 00:37:33] [INFO ] Flow matrix only has 1094 transitions (discarded 230 similar events)
[2025-05-30 00:37:33] [INFO ] Invariant cache hit.
[2025-05-30 00:37:33] [INFO ] State equation strengthened by 49 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1267 unsolved
At refinement iteration 2 (OVERLAPS) 7/329 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 1267 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 329/1423 variables, and 21 constraints, problems are : Problem set: 0 solved, 1267 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/329 constraints, ReadFeed: 0/49 constraints, PredecessorRefiner: 1267/678 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1267 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1267 unsolved
At refinement iteration 2 (OVERLAPS) 7/329 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 1267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/329 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1267 unsolved
Problem TDEAD173 is UNSAT
At refinement iteration 4 (OVERLAPS) 1093/1422 variables, 329/350 constraints. Problems are: Problem set: 1 solved, 1266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1422 variables, 49/399 constraints. Problems are: Problem set: 1 solved, 1266 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1422/1423 variables, and 1076 constraints, problems are : Problem set: 1 solved, 1266 unsolved in 30164 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 329/329 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 1266/678 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61718ms problems are : Problem set: 1 solved, 1266 unsolved
Search for dead transitions found 1 dead transitions in 61721ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 329/1378 places, 1323/2473 transitions.
Graph (complete) has 3308 edges and 329 vertex of which 328 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 24 ms. Remains 327 /329 variables (removed 2) and now considering 1323/1323 (removed 0) transitions.
[2025-05-30 00:38:35] [INFO ] Flow matrix only has 1093 transitions (discarded 230 similar events)
// Phase 1: matrix 1093 rows 327 cols
[2025-05-30 00:38:35] [INFO ] Computed 20 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:38:35] [INFO ] Implicit Places using invariants in 166 ms returned []
[2025-05-30 00:38:35] [INFO ] Flow matrix only has 1093 transitions (discarded 230 similar events)
[2025-05-30 00:38:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:38:35] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-05-30 00:38:36] [INFO ] Implicit Places using invariants and state equation in 777 ms returned [2, 6, 38, 42, 86, 90, 123, 128, 163, 167, 206, 240, 245]
[2025-05-30 00:38:36] [INFO ] Actually due to overlaps returned [2]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 964 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 326/1378 places, 1323/2473 transitions.
Applied a total of 0 rules in 23 ms. Remains 326 /326 variables (removed 0) and now considering 1323/1323 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 65892 ms. Remains : 326/1378 places, 1323/2473 transitions.
[2025-05-30 00:38:36] [INFO ] Flatten gal took : 42 ms
[2025-05-30 00:38:36] [INFO ] Flatten gal took : 44 ms
[2025-05-30 00:38:36] [INFO ] Input system was already deterministic with 1323 transitions.
[2025-05-30 00:38:36] [INFO ] Flatten gal took : 44 ms
[2025-05-30 00:38:36] [INFO ] Flatten gal took : 43 ms
[2025-05-30 00:38:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality15392482623161241151.gal : 7 ms
[2025-05-30 00:38:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality12914336161929955585.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/CTLCardinality15392482623161241151.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12914336161929955585.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-30 00:39:06] [INFO ] Flatten gal took : 44 ms
[2025-05-30 00:39:06] [INFO ] Applying decomposition
[2025-05-30 00:39:06] [INFO ] Flatten gal took : 44 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/graph1815649241394461694.txt' '-o' '/tmp/graph1815649241394461694.bin' '-w' '/tmp/graph1815649241394461694.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1815649241394461694.bin' '-l' '-1' '-v' '-w' '/tmp/graph1815649241394461694.weights' '-q' '0' '-e' '0.001'
[2025-05-30 00:39:06] [INFO ] Decomposing Gal with order
[2025-05-30 00:39:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 00:39:06] [INFO ] Removed a total of 3301 redundant transitions.
[2025-05-30 00:39:06] [INFO ] Flatten gal took : 60 ms
[2025-05-30 00:39:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 141 labels/synchronizations in 11 ms.
[2025-05-30 00:39:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality14252179097713587751.gal : 4 ms
[2025-05-30 00:39:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality2208784760307856102.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/CTLCardinality14252179097713587751.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2208784760307856102.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.49056e+22,0.190365,11072,761,85,11537,636,1155,25230,143,1842,0


Converting to forward existential form...Done !
original formula: (EG((((A(EF(((i7.u74.p1894==0)||(i1.i0.u25.p608==1))) U ((i4.u57.p1453==0)||(i2.u30.p739==1))) * (i1.i2.u22.p552==1)) + (AG((i3.u38.p986=...341
=> equivalent forward existential formula: [(FwdU((Init * EG((((!((E(!(((i4.u57.p1453==0)||(i2.u30.p739==1))) U (!(E(TRUE U ((i7.u74.p1894==0)||(i1.i0.u25....520
Reverse transition relation is NOT exact ! Due to transitions t0, t173, t435, t461, t664, t699, t721, t839, t846, t930, t958, t972, t979, t1049, t1051, t11...1035
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1378/1378 places, 2473/2473 transitions.
Graph (trivial) has 1424 edges and 1378 vertex of which 498 / 1378 are part of one of the 56 SCC in 2 ms
Free SCC test removed 442 places
Ensure Unique test removed 502 transitions
Reduce isomorphic transitions removed 502 transitions.
Graph (complete) has 4192 edges and 936 vertex of which 912 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.3 ms
Discarding 24 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 375 transitions
Trivial Post-agglo rules discarded 375 transitions
Performed 375 trivial Post agglomeration. Transition count delta: 375
Iterating post reduction 0 with 375 rules applied. Total rules applied 377 place count 911 transition count 1592
Reduce places removed 375 places and 0 transitions.
Iterating post reduction 1 with 375 rules applied. Total rules applied 752 place count 536 transition count 1592
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 752 place count 536 transition count 1528
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 880 place count 472 transition count 1528
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 910 place count 442 transition count 1498
Iterating global reduction 2 with 30 rules applied. Total rules applied 940 place count 442 transition count 1498
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 948 place count 442 transition count 1490
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 948 place count 442 transition count 1482
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 964 place count 434 transition count 1482
Performed 121 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 121 places in 1 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 3 with 242 rules applied. Total rules applied 1206 place count 313 transition count 1359
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 1212 place count 313 transition count 1353
Drop transitions (Redundant composition of simpler transitions.) removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 4 with 29 rules applied. Total rules applied 1241 place count 313 transition count 1324
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 4 with 14 rules applied. Total rules applied 1255 place count 313 transition count 1310
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 1269 place count 299 transition count 1310
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 1285 place count 291 transition count 1302
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1286 place count 290 transition count 1301
Applied a total of 1286 rules in 224 ms. Remains 290 /1378 variables (removed 1088) and now considering 1301/2473 (removed 1172) transitions.
[2025-05-30 00:39:37] [INFO ] Flow matrix only has 1057 transitions (discarded 244 similar events)
// Phase 1: matrix 1057 rows 290 cols
[2025-05-30 00:39:37] [INFO ] Computed 7 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:39:37] [INFO ] Implicit Places using invariants in 563 ms returned []
[2025-05-30 00:39:37] [INFO ] Flow matrix only has 1057 transitions (discarded 244 similar events)
[2025-05-30 00:39:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:39:37] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-05-30 00:39:38] [INFO ] Implicit Places using invariants and state equation in 799 ms returned []
Implicit Place search using SMT with State Equation took 1376 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 00:39:39] [INFO ] Redundant transitions in 746 ms returned []
Running 1244 sub problems to find dead transitions.
[2025-05-30 00:39:39] [INFO ] Flow matrix only has 1057 transitions (discarded 244 similar events)
[2025-05-30 00:39:39] [INFO ] Invariant cache hit.
[2025-05-30 00:39:39] [INFO ] State equation strengthened by 49 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/283 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1244 unsolved
At refinement iteration 2 (OVERLAPS) 1056/1339 variables, 283/290 constraints. Problems are: Problem set: 0 solved, 1244 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/1339 variables, 49/339 constraints. Problems are: Problem set: 0 solved, 1244 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1339/1347 variables, and 339 constraints, problems are : Problem set: 0 solved, 1244 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 283/290 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 1244/655 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1244 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/283 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1244 unsolved
At refinement iteration 2 (OVERLAPS) 1056/1339 variables, 283/290 constraints. Problems are: Problem set: 0 solved, 1244 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1339 variables, 49/339 constraints. Problems are: Problem set: 0 solved, 1244 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1339 variables, 65/404 constraints. Problems are: Problem set: 0 solved, 1244 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1339/1347 variables, and 404 constraints, problems are : Problem set: 0 solved, 1244 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 283/290 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 654/655 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61476ms problems are : Problem set: 0 solved, 1244 unsolved
Search for dead transitions found 0 dead transitions in 61478ms
Starting structural reductions in SI_CTL mode, iteration 1 : 290/1378 places, 1301/2473 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 63854 ms. Remains : 290/1378 places, 1301/2473 transitions.
[2025-05-30 00:40:40] [INFO ] Flatten gal took : 41 ms
[2025-05-30 00:40:40] [INFO ] Flatten gal took : 44 ms
[2025-05-30 00:40:40] [INFO ] Input system was already deterministic with 1301 transitions.
[2025-05-30 00:40:40] [INFO ] Flatten gal took : 43 ms
[2025-05-30 00:40:40] [INFO ] Flatten gal took : 43 ms
[2025-05-30 00:40:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality8165241095073586211.gal : 7 ms
[2025-05-30 00:40:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality7483778872261931288.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/CTLCardinality8165241095073586211.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7483778872261931288.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-30 00:41:11] [INFO ] Flatten gal took : 42 ms
[2025-05-30 00:41:11] [INFO ] Applying decomposition
[2025-05-30 00:41:11] [INFO ] Flatten gal took : 42 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/graph18270816995420053991.txt' '-o' '/tmp/graph18270816995420053991.bin' '-w' '/tmp/graph18270816995420053991.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18270816995420053991.bin' '-l' '-1' '-v' '-w' '/tmp/graph18270816995420053991.weights' '-q' '0' '-e' '0.001'
[2025-05-30 00:41:11] [INFO ] Decomposing Gal with order
[2025-05-30 00:41:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 00:41:11] [INFO ] Removed a total of 2938 redundant transitions.
[2025-05-30 00:41:11] [INFO ] Flatten gal took : 60 ms
[2025-05-30 00:41:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 133 labels/synchronizations in 8 ms.
[2025-05-30 00:41:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality2198608069298481602.gal : 2 ms
[2025-05-30 00:41:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality2897343449483135339.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/CTLCardinality2198608069298481602.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2897343449483135339.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,8.87705e+21,0.221193,12852,489,333,13261,9413,1028,18541,239,20356,0


Converting to forward existential form...Done !
original formula: AG(AF(((i2.u19.p662==1) + E(((i4.u50.p1477==0)||(i4.u45.p1363==1)) U (i7.u70.p2100==0)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((i2.u19.p662==1) + E(((i4.u50.p1477==0)||(i4.u45.p1363==1)) U (i7.u70.p2100==0)))))] = ...160
Reverse transition relation is NOT exact ! Due to transitions t416, t443, t608, u85.t1, i0.t419, i0.t306, i0.t147, i0.u0.t154, i0.u0.t158, i0.u1.t305, i0.u...1003
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,0,1.35759,67892,1,0,111729,38008,6995,339307,1463,131103,109090
FORMULA CloudDeployment-PT-7b-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

[2025-05-30 00:41:12] [INFO ] Flatten gal took : 69 ms
[2025-05-30 00:41:12] [INFO ] Flatten gal took : 69 ms
[2025-05-30 00:41:12] [INFO ] Applying decomposition
[2025-05-30 00:41:12] [INFO ] Flatten gal took : 68 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/graph13349203116930756768.txt' '-o' '/tmp/graph13349203116930756768.bin' '-w' '/tmp/graph13349203116930756768.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13349203116930756768.bin' '-l' '-1' '-v' '-w' '/tmp/graph13349203116930756768.weights' '-q' '0' '-e' '0.001'
[2025-05-30 00:41:13] [INFO ] Decomposing Gal with order
[2025-05-30 00:41:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 00:41:13] [INFO ] Removed a total of 3290 redundant transitions.
[2025-05-30 00:41:13] [INFO ] Flatten gal took : 107 ms
[2025-05-30 00:41:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 191 labels/synchronizations in 24 ms.
[2025-05-30 00:41:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality5997539642855611006.gal : 10 ms
[2025-05-30 00:41:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality14015499593107430962.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/CTLCardinality5997539642855611006.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14015499593107430962.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 13 CTL formulae.
Detected timeout of ITS tools.
[2025-05-30 01:07:57] [INFO ] Applying decomposition
[2025-05-30 01:07:57] [INFO ] Flatten gal took : 80 ms
[2025-05-30 01:07:57] [INFO ] Decomposing Gal with order
[2025-05-30 01:07:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 01:07:57] [INFO ] Removed a total of 3709 redundant transitions.
[2025-05-30 01:07:57] [INFO ] Flatten gal took : 114 ms
[2025-05-30 01:07:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 758 labels/synchronizations in 24 ms.
[2025-05-30 01:07:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality360541909129855378.gal : 9 ms
[2025-05-30 01:07:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality11077485196852334486.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/CTLCardinality360541909129855378.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11077485196852334486.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 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,3.87785e+33,98.7747,2123740,19046,13689,3.49528e+06,413122,1550,1.09229e+07,1772,3.32941e+06,0


Converting to forward existential form...Done !
original formula: AG(AF(((AF((i0.i0.i0.i1.i0.u36.p1626==0)) + EF((i0.i0.i0.i0.i0.i0.i0.i1.u17.p614==1))) + AF(((i0.i0.i0.i0.i0.i1.u27.p1063==0)||(i0.i0.i0....179
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((!(EG(!((i0.i0.i0.i1.i0.u36.p1626==0)))) + E(TRUE U (i0.i0.i0.i0.i0.i0.i0.i1.u17.p614==...249
Reverse transition relation is NOT exact ! Due to transitions t1425, t1953, t1962, t1974, t1987, t2000, u56.t6, u56.t7, i0.t2374, i0.t2362, i0.t2361, i0.t2...5230
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2025-05-30 01:15:18] [INFO ] Flatten gal took : 68 ms
[2025-05-30 01:15:18] [INFO ] Input system was already deterministic with 2473 transitions.
[2025-05-30 01:15:18] [INFO ] Transformed 1378 places.
[2025-05-30 01:15:18] [INFO ] Transformed 2473 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-05-30 01:15:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality9542084343457242284.gal : 11 ms
[2025-05-30 01:15:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality10569321663309516202.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/CTLCardinality9542084343457242284.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10569321663309516202.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...329
Successfully loaded order from file /home/mcc/execution/model.ord
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -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="CloudDeployment-PT-7b"
export BK_EXAMINATION="CTLCardinality"
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 CloudDeployment-PT-7b, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r044-tall-174854027800089"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudDeployment-PT-7b.tgz
mv CloudDeployment-PT-7b execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;