Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.3M
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 19K 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 8.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K 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 4.8M 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-6b-CTLFireability-2023-12
FORMULA_NAME CloudDeployment-PT-6b-CTLFireability-2023-13
FORMULA_NAME CloudDeployment-PT-6b-CTLFireability-2023-14
FORMULA_NAME CloudDeployment-PT-6b-CTLFireability-2023-15
FORMULA_NAME CloudDeployment-PT-6b-CTLFireability-2025-00
FORMULA_NAME CloudDeployment-PT-6b-CTLFireability-2025-01
FORMULA_NAME CloudDeployment-PT-6b-CTLFireability-2025-02
FORMULA_NAME CloudDeployment-PT-6b-CTLFireability-2025-03
FORMULA_NAME CloudDeployment-PT-6b-CTLFireability-2025-04
FORMULA_NAME CloudDeployment-PT-6b-CTLFireability-2025-05
FORMULA_NAME CloudDeployment-PT-6b-CTLFireability-2025-06
FORMULA_NAME CloudDeployment-PT-6b-CTLFireability-2025-07
FORMULA_NAME CloudDeployment-PT-6b-CTLFireability-2025-08
FORMULA_NAME CloudDeployment-PT-6b-CTLFireability-2025-09
FORMULA_NAME CloudDeployment-PT-6b-CTLFireability-2025-10
FORMULA_NAME CloudDeployment-PT-6b-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1748561197096

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-6b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-05-29 23:26:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-29 23:26:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 23:26:39] [INFO ] Load time of PNML (sax parser for PT used): 677 ms
[2025-05-29 23:26:39] [INFO ] Transformed 1888 places.
[2025-05-29 23:26:40] [INFO ] Transformed 6804 transitions.
[2025-05-29 23:26:40] [INFO ] Found NUPN structural information;
[2025-05-29 23:26:43] [INFO ] Parsed PT model containing 1888 places and 6804 transitions and 91831 arcs in 4527 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 22 ms.
Support contains 90 out of 1888 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1888/1888 places, 6804/6804 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 1882 transition count 6804
Discarding 512 places :
Symmetric choice reduction at 1 with 512 rule applications. Total rules 518 place count 1370 transition count 6292
Iterating global reduction 1 with 512 rules applied. Total rules applied 1030 place count 1370 transition count 6292
Discarding 193 places :
Symmetric choice reduction at 1 with 193 rule applications. Total rules 1223 place count 1177 transition count 6099
Iterating global reduction 1 with 193 rules applied. Total rules applied 1416 place count 1177 transition count 6099
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 1441 place count 1177 transition count 6074
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1458 place count 1160 transition count 6057
Iterating global reduction 2 with 17 rules applied. Total rules applied 1475 place count 1160 transition count 6057
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1477 place count 1158 transition count 6055
Iterating global reduction 2 with 2 rules applied. Total rules applied 1479 place count 1158 transition count 6055
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1480 place count 1157 transition count 6054
Iterating global reduction 2 with 1 rules applied. Total rules applied 1481 place count 1157 transition count 6054
Applied a total of 1481 rules in 747 ms. Remains 1157 /1888 variables (removed 731) and now considering 6054/6804 (removed 750) transitions.
// Phase 1: matrix 6054 rows 1157 cols
[2025-05-29 23:26:44] [INFO ] Computed 19 invariants in 105 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:26:45] [INFO ] Implicit Places using invariants in 767 ms returned []
[2025-05-29 23:26:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:26:49] [INFO ] Implicit Places using invariants and state equation in 3806 ms returned []
Implicit Place search using SMT with State Equation took 4605 ms to find 0 implicit places.
Running 6053 sub problems to find dead transitions.
[2025-05-29 23:26:49] [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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1156 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 6053 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1156/7211 variables, and 19 constraints, problems are : Problem set: 0 solved, 6053 unsolved in 30221 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/1157 constraints, PredecessorRefiner: 6053/1524 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6053 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1156 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 6053 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1156/7211 variables, and 19 constraints, problems are : Problem set: 0 solved, 6053 unsolved in 30095 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/1157 constraints, PredecessorRefiner: 4529/1524 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 72424ms problems are : Problem set: 0 solved, 6053 unsolved
Search for dead transitions found 0 dead transitions in 72528ms
Starting structural reductions in LTL mode, iteration 1 : 1157/1888 places, 6054/6804 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77934 ms. Remains : 1157/1888 places, 6054/6804 transitions.
Support contains 90 out of 1157 places after structural reductions.
[2025-05-29 23:28:03] [INFO ] Flatten gal took : 1136 ms
[2025-05-29 23:28:04] [INFO ] Flatten gal took : 841 ms
[2025-05-29 23:28:05] [INFO ] Input system was already deterministic with 6054 transitions.
Support contains 88 out of 1157 places (down from 90) after GAL structural reductions.
RANDOM walk for 40000 steps (208 resets) in 2784 ms. (14 steps per ms) remains 65/79 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 103 ms. (38 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 102 ms. (38 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 65/65 properties
[2025-05-29 23:28:06] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
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/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 225/295 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 5099/5394 variables, 295/314 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5394 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 65 unsolved
SMT process timed out in 5316ms, After SMT, problems are : Problem set: 0 solved, 65 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 70 out of 1157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1157/1157 places, 6054/6054 transitions.
Graph (trivial) has 1104 edges and 1157 vertex of which 346 / 1157 are part of one of the 39 SCC in 8 ms
Free SCC test removed 307 places
Drop transitions (Empty/Sink Transition effects.) removed 389 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 390 transitions.
Graph (complete) has 3324 edges and 850 vertex of which 849 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.21 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 311 transitions
Trivial Post-agglo rules discarded 311 transitions
Performed 311 trivial Post agglomeration. Transition count delta: 311
Iterating post reduction 0 with 317 rules applied. Total rules applied 319 place count 849 transition count 5347
Reduce places removed 311 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 325 rules applied. Total rules applied 644 place count 538 transition count 5333
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 657 place count 526 transition count 5332
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 78 Pre rules applied. Total rules applied 657 place count 526 transition count 5254
Deduced a syphon composed of 78 places in 2 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 813 place count 448 transition count 5254
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 815 place count 446 transition count 5252
Iterating global reduction 3 with 2 rules applied. Total rules applied 817 place count 446 transition count 5252
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 818 place count 446 transition count 5251
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 818 place count 446 transition count 5250
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 820 place count 445 transition count 5250
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 116
Deduced a syphon composed of 116 places in 3 ms
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 4 with 232 rules applied. Total rules applied 1052 place count 329 transition count 5134
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -245
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 1128 place count 291 transition count 5379
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 4 with 41 rules applied. Total rules applied 1169 place count 291 transition count 5338
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1170 place count 290 transition count 5325
Iterating global reduction 5 with 1 rules applied. Total rules applied 1171 place count 290 transition count 5325
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 1181 place count 285 transition count 5375
Drop transitions (Redundant composition of simpler transitions.) removed 104 transitions
Redundant transition composition rules discarded 104 transitions
Iterating global reduction 5 with 104 rules applied. Total rules applied 1285 place count 285 transition count 5271
Free-agglomeration rule applied 49 times with reduction of 11 identical transitions.
Iterating global reduction 5 with 49 rules applied. Total rules applied 1334 place count 285 transition count 5211
Reduce places removed 49 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 43 transitions
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 107 transitions.
Iterating post reduction 5 with 156 rules applied. Total rules applied 1490 place count 236 transition count 5104
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1492 place count 234 transition count 5089
Iterating global reduction 6 with 2 rules applied. Total rules applied 1494 place count 234 transition count 5089
Drop transitions (Redundant composition of simpler transitions.) removed 98 transitions
Redundant transition composition rules discarded 98 transitions
Iterating global reduction 6 with 98 rules applied. Total rules applied 1592 place count 234 transition count 4991
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 1596 place count 234 transition count 4991
Applied a total of 1596 rules in 815 ms. Remains 234 /1157 variables (removed 923) and now considering 4991/6054 (removed 1063) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 816 ms. Remains : 234/1157 places, 4991/6054 transitions.
RANDOM walk for 40000 steps (825 resets) in 2874 ms. (13 steps per ms) remains 57/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 57/57 properties
[2025-05-29 23:28:13] [INFO ] Flow matrix only has 4686 transitions (discarded 305 similar events)
// Phase 1: matrix 4686 rows 234 cols
[2025-05-29 23:28:13] [INFO ] Computed 25 invariants in 70 ms
[2025-05-29 23:28:13] [INFO ] State equation strengthened by 241 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
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/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 174/233 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (OVERLAPS) 4686/4919 variables, 233/258 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4919 variables, 241/499 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4919 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp78 is UNSAT
At refinement iteration 7 (OVERLAPS) 1/4920 variables, 1/500 constraints. Problems are: Problem set: 41 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4920 variables, 0/500 constraints. Problems are: Problem set: 41 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/4920 variables, 0/500 constraints. Problems are: Problem set: 41 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4920/4920 variables, and 500 constraints, problems are : Problem set: 41 solved, 16 unsolved in 20701 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 234/234 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 57/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 41 solved, 16 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 1/1 constraints. Problems are: Problem set: 41 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 41 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 180/233 variables, 24/25 constraints. Problems are: Problem set: 41 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 0/25 constraints. Problems are: Problem set: 41 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 4686/4919 variables, 233/258 constraints. Problems are: Problem set: 41 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4919 variables, 241/499 constraints. Problems are: Problem set: 41 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4919 variables, 8/507 constraints. Problems are: Problem set: 41 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4919 variables, 0/507 constraints. Problems are: Problem set: 41 solved, 16 unsolved
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp41 is UNSAT
At refinement iteration 8 (OVERLAPS) 1/4920 variables, 1/508 constraints. Problems are: Problem set: 44 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4920 variables, 0/508 constraints. Problems are: Problem set: 44 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 0/4920 variables, 0/508 constraints. Problems are: Problem set: 44 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4920/4920 variables, and 508 constraints, problems are : Problem set: 44 solved, 13 unsolved in 14023 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 234/234 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 16/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34964ms problems are : Problem set: 44 solved, 13 unsolved
Fused 13 Parikh solutions to 11 different solutions.
Parikh walk visited 5 properties in 2635 ms.
Support contains 15 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 4991/4991 transitions.
Graph (trivial) has 118 edges and 234 vertex of which 19 / 234 are part of one of the 9 SCC in 1 ms
Free SCC test removed 10 places
Drop transitions (Empty/Sink Transition effects.) removed 4115 transitions
Reduce isomorphic transitions removed 4115 transitions.
Graph (complete) has 1781 edges and 224 vertex of which 192 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.1 ms
Discarding 32 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 17 rules applied. Total rules applied 19 place count 192 transition count 859
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 24 place count 189 transition count 857
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 26 place count 187 transition count 857
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 26 place count 187 transition count 855
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 30 place count 185 transition count 855
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 34 place count 181 transition count 839
Iterating global reduction 3 with 4 rules applied. Total rules applied 38 place count 181 transition count 839
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 38 place count 181 transition count 838
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 40 place count 180 transition count 838
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 64 place count 168 transition count 826
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 79 place count 168 transition count 811
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -31
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 85 place count 165 transition count 842
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 94 place count 165 transition count 833
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 5 with 17 rules applied. Total rules applied 111 place count 165 transition count 816
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 117 place count 165 transition count 810
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 5 with 28 rules applied. Total rules applied 145 place count 159 transition count 788
Applied a total of 145 rules in 88 ms. Remains 159 /234 variables (removed 75) and now considering 788/4991 (removed 4203) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 159/234 places, 788/4991 transitions.
RANDOM walk for 40000 steps (434 resets) in 1776 ms. (22 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40004 steps (22 resets) in 55 ms. (714 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (21 resets) in 48 ms. (816 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (21 resets) in 45 ms. (869 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (41 resets) in 57 ms. (689 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (20 resets) in 42 ms. (930 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40003 steps (43 resets) in 54 ms. (727 steps per ms) remains 4/5 properties
[2025-05-29 23:28:52] [INFO ] Flow matrix only has 480 transitions (discarded 308 similar events)
// Phase 1: matrix 480 rows 159 cols
[2025-05-29 23:28:52] [INFO ] Computed 20 invariants in 2 ms
[2025-05-29 23:28:52] [INFO ] State equation strengthened by 234 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 31/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 54/93 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 52/145 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:28:57] [INFO ] Deduced a trap composed of 17 places in 5658 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 458/603 variables, 145/166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/603 variables, 191/357 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/603 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 36/639 variables, 14/371 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/639 variables, 43/414 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/639 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/639 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 639/639 variables, and 414 constraints, problems are : Problem set: 0 solved, 4 unsolved in 6321 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 159/159 constraints, ReadFeed: 234/234 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 31/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 54/93 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 52/145 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 458/603 variables, 145/166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/603 variables, 191/357 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/603 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 36/639 variables, 14/371 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/639 variables, 43/414 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/639 variables, 1/415 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/639 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/639 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 639/639 variables, and 415 constraints, problems are : Problem set: 0 solved, 4 unsolved in 901 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 159/159 constraints, ReadFeed: 234/234 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7267ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 3 properties in 233 ms.
Support contains 5 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 788/788 transitions.
Graph (trivial) has 64 edges and 159 vertex of which 6 / 159 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 156 transition count 779
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 155 transition count 779
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 154 transition count 778
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 154 transition count 778
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 153 transition count 777
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 153 transition count 777
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 15 place count 149 transition count 773
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 16 place count 148 transition count 766
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 148 transition count 766
Drop transitions (Redundant composition of simpler transitions.) removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 0 with 56 rules applied. Total rules applied 73 place count 148 transition count 710
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 79 place count 148 transition count 704
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 33 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 0 with 41 rules applied. Total rules applied 120 place count 142 transition count 669
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 122 place count 140 transition count 649
Iterating global reduction 1 with 2 rules applied. Total rules applied 124 place count 140 transition count 649
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 126 place count 140 transition count 647
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 2 with 18 rules applied. Total rules applied 144 place count 140 transition count 629
Applied a total of 144 rules in 75 ms. Remains 140 /159 variables (removed 19) and now considering 629/788 (removed 159) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 140/159 places, 629/788 transitions.
RANDOM walk for 40000 steps (559 resets) in 233 ms. (170 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (27 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1059769 steps, run timeout after 3001 ms. (steps per millisecond=353 ) properties seen :0 out of 1
Probabilistic random walk after 1059769 steps, saw 130229 distinct states, run finished after 3007 ms. (steps per millisecond=352 ) properties seen :0
[2025-05-29 23:29:02] [INFO ] Flow matrix only has 328 transitions (discarded 301 similar events)
// Phase 1: matrix 328 rows 140 cols
[2025-05-29 23:29:02] [INFO ] Computed 22 invariants in 2 ms
[2025-05-29 23:29:02] [INFO ] State equation strengthened by 195 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 65/86 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 50/136 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 327/463 variables, 136/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/463 variables, 182/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/463 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/468 variables, 4/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/468 variables, 13/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/468 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/468 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 468/468 variables, and 357 constraints, problems are : Problem set: 0 solved, 1 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 140/140 constraints, ReadFeed: 195/195 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 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 65/86 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 50/136 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 327/463 variables, 136/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/463 variables, 182/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/463 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/468 variables, 4/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/468 variables, 13/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/468 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/468 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/468 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 468/468 variables, and 358 constraints, problems are : Problem set: 0 solved, 1 unsolved in 351 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 140/140 constraints, ReadFeed: 195/195 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 657ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 254 steps, including 6 resets, run visited all 1 properties in 4 ms. (steps per millisecond=63 )
Parikh walk visited 1 properties in 9 ms.
Successfully simplified 44 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA CloudDeployment-PT-6b-CTLFireability-2025-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-29 23:29:04] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2025-05-29 23:29:04] [INFO ] Flatten gal took : 840 ms
[2025-05-29 23:29:04] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA CloudDeployment-PT-6b-CTLFireability-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6b-CTLFireability-2025-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6b-CTLFireability-2025-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6b-CTLFireability-2025-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-29 23:29:05] [INFO ] Flatten gal took : 922 ms
[2025-05-29 23:29:06] [INFO ] Input system was already deterministic with 6054 transitions.
Support contains 52 out of 1157 places (down from 62) after GAL structural reductions.
Computed a total of 182 stabilizing places and 4756 stable transitions
Graph (complete) has 3793 edges and 1157 vertex of which 1124 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.54 ms
Starting structural reductions in LTL mode, iteration 0 : 1157/1157 places, 6054/6054 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1156 transition count 6054
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 28 place count 1129 transition count 1944
Iterating global reduction 1 with 27 rules applied. Total rules applied 55 place count 1129 transition count 1944
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 57 place count 1129 transition count 1942
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 64 place count 1122 transition count 1935
Iterating global reduction 2 with 7 rules applied. Total rules applied 71 place count 1122 transition count 1935
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 73 place count 1122 transition count 1933
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 75 place count 1120 transition count 1931
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 1120 transition count 1931
Applied a total of 77 rules in 340 ms. Remains 1120 /1157 variables (removed 37) and now considering 1931/6054 (removed 4123) transitions.
// Phase 1: matrix 1931 rows 1120 cols
[2025-05-29 23:29:07] [INFO ] Computed 18 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:29:07] [INFO ] Implicit Places using invariants in 250 ms returned []
[2025-05-29 23:29:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:29:08] [INFO ] Implicit Places using invariants and state equation in 1428 ms returned [12, 20, 188, 196, 361, 369, 535, 543, 708, 716, 881, 890]
[2025-05-29 23:29:08] [INFO ] Actually due to overlaps returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1684 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1119/1157 places, 1931/6054 transitions.
Applied a total of 0 rules in 33 ms. Remains 1119 /1119 variables (removed 0) and now considering 1931/1931 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2058 ms. Remains : 1119/1157 places, 1931/6054 transitions.
[2025-05-29 23:29:08] [INFO ] Flatten gal took : 58 ms
[2025-05-29 23:29:08] [INFO ] Flatten gal took : 61 ms
[2025-05-29 23:29:08] [INFO ] Input system was already deterministic with 1931 transitions.
[2025-05-29 23:29:09] [INFO ] Flatten gal took : 63 ms
[2025-05-29 23:29:09] [INFO ] Flatten gal took : 64 ms
[2025-05-29 23:29:09] [INFO ] Time to serialize gal into /tmp/CTLFireability10761417966140815082.gal : 41 ms
[2025-05-29 23:29:09] [INFO ] Time to serialize properties into /tmp/CTLFireability3764112244327484204.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/CTLFireability10761417966140815082.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3764112244327484204.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-29 23:29:39] [INFO ] Flatten gal took : 57 ms
[2025-05-29 23:29:39] [INFO ] Applying decomposition
[2025-05-29 23:29:39] [INFO ] Flatten gal took : 59 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/graph9507868559045748370.txt' '-o' '/tmp/graph9507868559045748370.bin' '-w' '/tmp/graph9507868559045748370.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9507868559045748370.bin' '-l' '-1' '-v' '-w' '/tmp/graph9507868559045748370.weights' '-q' '0' '-e' '0.001'
[2025-05-29 23:29:39] [INFO ] Decomposing Gal with order
[2025-05-29 23:29:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:29:40] [INFO ] Removed a total of 2484 redundant transitions.
[2025-05-29 23:29:40] [INFO ] Flatten gal took : 223 ms
[2025-05-29 23:29:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 96 labels/synchronizations in 52 ms.
[2025-05-29 23:29:40] [INFO ] Time to serialize gal into /tmp/CTLFireability11926871525236796304.gal : 21 ms
[2025-05-29 23:29:40] [INFO ] Time to serialize properties into /tmp/CTLFireability8813669755209609584.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/CTLFireability11926871525236796304.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8813669755209609584.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 : 1157/1157 places, 6054/6054 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1156 transition count 6054
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 30 place count 1127 transition count 1942
Iterating global reduction 1 with 29 rules applied. Total rules applied 59 place count 1127 transition count 1942
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 62 place count 1127 transition count 1939
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 69 place count 1120 transition count 1932
Iterating global reduction 2 with 7 rules applied. Total rules applied 76 place count 1120 transition count 1932
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 78 place count 1120 transition count 1930
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 80 place count 1118 transition count 1928
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 1118 transition count 1928
Applied a total of 82 rules in 345 ms. Remains 1118 /1157 variables (removed 39) and now considering 1928/6054 (removed 4126) transitions.
// Phase 1: matrix 1928 rows 1118 cols
[2025-05-29 23:30:10] [INFO ] Computed 18 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:30:11] [INFO ] Implicit Places using invariants in 282 ms returned []
[2025-05-29 23:30:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:30:12] [INFO ] Implicit Places using invariants and state equation in 1874 ms returned [12, 20, 186, 194, 359, 367, 532, 540, 705, 713, 880, 888]
[2025-05-29 23:30:12] [INFO ] Actually due to overlaps returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2164 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1117/1157 places, 1928/6054 transitions.
Applied a total of 0 rules in 28 ms. Remains 1117 /1117 variables (removed 0) and now considering 1928/1928 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2537 ms. Remains : 1117/1157 places, 1928/6054 transitions.
[2025-05-29 23:30:13] [INFO ] Flatten gal took : 65 ms
[2025-05-29 23:30:13] [INFO ] Flatten gal took : 62 ms
[2025-05-29 23:30:13] [INFO ] Input system was already deterministic with 1928 transitions.
[2025-05-29 23:30:13] [INFO ] Flatten gal took : 57 ms
[2025-05-29 23:30:13] [INFO ] Flatten gal took : 59 ms
[2025-05-29 23:30:13] [INFO ] Time to serialize gal into /tmp/CTLFireability1650370220869640611.gal : 11 ms
[2025-05-29 23:30:13] [INFO ] Time to serialize properties into /tmp/CTLFireability10542271649497957931.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/CTLFireability1650370220869640611.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10542271649497957931.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-29 23:30:43] [INFO ] Flatten gal took : 59 ms
[2025-05-29 23:30:43] [INFO ] Applying decomposition
[2025-05-29 23:30:43] [INFO ] Flatten gal took : 59 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/graph17454913458780564379.txt' '-o' '/tmp/graph17454913458780564379.bin' '-w' '/tmp/graph17454913458780564379.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17454913458780564379.bin' '-l' '-1' '-v' '-w' '/tmp/graph17454913458780564379.weights' '-q' '0' '-e' '0.001'
[2025-05-29 23:30:43] [INFO ] Decomposing Gal with order
[2025-05-29 23:30:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:30:44] [INFO ] Removed a total of 2530 redundant transitions.
[2025-05-29 23:30:44] [INFO ] Flatten gal took : 196 ms
[2025-05-29 23:30:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 103 labels/synchronizations in 73 ms.
[2025-05-29 23:30:44] [INFO ] Time to serialize gal into /tmp/CTLFireability368865785100521974.gal : 26 ms
[2025-05-29 23:30:44] [INFO ] Time to serialize properties into /tmp/CTLFireability14480203040068604368.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/CTLFireability368865785100521974.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14480203040068604368.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 : 1157/1157 places, 6054/6054 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1156 transition count 6054
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 31 place count 1126 transition count 1941
Iterating global reduction 1 with 30 rules applied. Total rules applied 61 place count 1126 transition count 1941
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 64 place count 1126 transition count 1938
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 72 place count 1118 transition count 1930
Iterating global reduction 2 with 8 rules applied. Total rules applied 80 place count 1118 transition count 1930
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 82 place count 1118 transition count 1928
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 84 place count 1116 transition count 1926
Iterating global reduction 3 with 2 rules applied. Total rules applied 86 place count 1116 transition count 1926
Applied a total of 86 rules in 310 ms. Remains 1116 /1157 variables (removed 41) and now considering 1926/6054 (removed 4128) transitions.
// Phase 1: matrix 1926 rows 1116 cols
[2025-05-29 23:31:14] [INFO ] Computed 18 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:31:15] [INFO ] Implicit Places using invariants in 222 ms returned []
[2025-05-29 23:31:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:31:16] [INFO ] Implicit Places using invariants and state equation in 1470 ms returned [12, 20, 186, 194, 359, 367, 532, 540, 705, 713, 878, 886]
[2025-05-29 23:31:16] [INFO ] Actually due to overlaps returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1737 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1115/1157 places, 1926/6054 transitions.
Applied a total of 0 rules in 24 ms. Remains 1115 /1115 variables (removed 0) and now considering 1926/1926 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2072 ms. Remains : 1115/1157 places, 1926/6054 transitions.
[2025-05-29 23:31:16] [INFO ] Flatten gal took : 54 ms
[2025-05-29 23:31:16] [INFO ] Flatten gal took : 56 ms
[2025-05-29 23:31:16] [INFO ] Input system was already deterministic with 1926 transitions.
[2025-05-29 23:31:16] [INFO ] Flatten gal took : 59 ms
[2025-05-29 23:31:17] [INFO ] Flatten gal took : 70 ms
[2025-05-29 23:31:17] [INFO ] Time to serialize gal into /tmp/CTLFireability1772954126531814367.gal : 11 ms
[2025-05-29 23:31:17] [INFO ] Time to serialize properties into /tmp/CTLFireability517505518065646353.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/CTLFireability1772954126531814367.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability517505518065646353.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-29 23:31:47] [INFO ] Flatten gal took : 62 ms
[2025-05-29 23:31:47] [INFO ] Applying decomposition
[2025-05-29 23:31:47] [INFO ] Flatten gal took : 62 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/graph6886207815014408810.txt' '-o' '/tmp/graph6886207815014408810.bin' '-w' '/tmp/graph6886207815014408810.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6886207815014408810.bin' '-l' '-1' '-v' '-w' '/tmp/graph6886207815014408810.weights' '-q' '0' '-e' '0.001'
[2025-05-29 23:31:47] [INFO ] Decomposing Gal with order
[2025-05-29 23:31:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:31:47] [INFO ] Removed a total of 2439 redundant transitions.
[2025-05-29 23:31:47] [INFO ] Flatten gal took : 214 ms
[2025-05-29 23:31:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 127 labels/synchronizations in 45 ms.
[2025-05-29 23:31:47] [INFO ] Time to serialize gal into /tmp/CTLFireability2666386809861150422.gal : 29 ms
[2025-05-29 23:31:47] [INFO ] Time to serialize properties into /tmp/CTLFireability13877209751745542862.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/CTLFireability2666386809861150422.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13877209751745542862.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 : 1157/1157 places, 6054/6054 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1156 transition count 6054
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 31 place count 1126 transition count 1941
Iterating global reduction 1 with 30 rules applied. Total rules applied 61 place count 1126 transition count 1941
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 64 place count 1126 transition count 1938
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 72 place count 1118 transition count 1930
Iterating global reduction 2 with 8 rules applied. Total rules applied 80 place count 1118 transition count 1930
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 82 place count 1118 transition count 1928
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 84 place count 1116 transition count 1926
Iterating global reduction 3 with 2 rules applied. Total rules applied 86 place count 1116 transition count 1926
Applied a total of 86 rules in 301 ms. Remains 1116 /1157 variables (removed 41) and now considering 1926/6054 (removed 4128) transitions.
[2025-05-29 23:32:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:32:18] [INFO ] Implicit Places using invariants in 225 ms returned []
[2025-05-29 23:32:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:32:20] [INFO ] Implicit Places using invariants and state equation in 1597 ms returned [12, 20, 186, 194, 359, 367, 532, 540, 705, 713, 878, 886]
[2025-05-29 23:32:20] [INFO ] Actually due to overlaps returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1832 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1115/1157 places, 1926/6054 transitions.
Applied a total of 0 rules in 28 ms. Remains 1115 /1115 variables (removed 0) and now considering 1926/1926 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2162 ms. Remains : 1115/1157 places, 1926/6054 transitions.
[2025-05-29 23:32:20] [INFO ] Flatten gal took : 52 ms
[2025-05-29 23:32:20] [INFO ] Flatten gal took : 55 ms
[2025-05-29 23:32:20] [INFO ] Input system was already deterministic with 1926 transitions.
[2025-05-29 23:32:20] [INFO ] Flatten gal took : 56 ms
[2025-05-29 23:32:20] [INFO ] Flatten gal took : 53 ms
[2025-05-29 23:32:20] [INFO ] Time to serialize gal into /tmp/CTLFireability6577114050879285182.gal : 9 ms
[2025-05-29 23:32:20] [INFO ] Time to serialize properties into /tmp/CTLFireability5191394723371078687.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/CTLFireability6577114050879285182.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5191394723371078687.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-29 23:32:50] [INFO ] Flatten gal took : 96 ms
[2025-05-29 23:32:50] [INFO ] Applying decomposition
[2025-05-29 23:32:50] [INFO ] Flatten gal took : 56 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/graph13859965169233553545.txt' '-o' '/tmp/graph13859965169233553545.bin' '-w' '/tmp/graph13859965169233553545.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13859965169233553545.bin' '-l' '-1' '-v' '-w' '/tmp/graph13859965169233553545.weights' '-q' '0' '-e' '0.001'
[2025-05-29 23:32:50] [INFO ] Decomposing Gal with order
[2025-05-29 23:32:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:32:50] [INFO ] Removed a total of 2505 redundant transitions.
[2025-05-29 23:32:50] [INFO ] Flatten gal took : 93 ms
[2025-05-29 23:32:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 97 labels/synchronizations in 21 ms.
[2025-05-29 23:32:51] [INFO ] Time to serialize gal into /tmp/CTLFireability10671825098373346158.gal : 15 ms
[2025-05-29 23:32:51] [INFO ] Time to serialize properties into /tmp/CTLFireability15178209365167846492.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/CTLFireability10671825098373346158.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15178209365167846492.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 : 1157/1157 places, 6054/6054 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1140 transition count 6037
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1140 transition count 6037
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 1140 transition count 6034
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 45 place count 1132 transition count 6026
Iterating global reduction 1 with 8 rules applied. Total rules applied 53 place count 1132 transition count 6026
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 55 place count 1132 transition count 6024
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 57 place count 1130 transition count 6022
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 1130 transition count 6022
Applied a total of 59 rules in 169 ms. Remains 1130 /1157 variables (removed 27) and now considering 6022/6054 (removed 32) transitions.
// Phase 1: matrix 6022 rows 1130 cols
[2025-05-29 23:33:21] [INFO ] Computed 19 invariants in 63 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:33:22] [INFO ] Implicit Places using invariants in 1608 ms returned []
[2025-05-29 23:33:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:33:34] [INFO ] Implicit Places using invariants and state equation in 11717 ms returned []
Implicit Place search using SMT with State Equation took 13348 ms to find 0 implicit places.
Running 6021 sub problems to find dead transitions.
[2025-05-29 23:33:34] [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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1129 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 6021 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1129/7152 variables, and 19 constraints, problems are : Problem set: 0 solved, 6021 unsolved in 30084 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/1130 constraints, PredecessorRefiner: 6021/1492 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6021 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1129 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 6021 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1129/7152 variables, and 19 constraints, problems are : Problem set: 0 solved, 6021 unsolved in 30086 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/1130 constraints, PredecessorRefiner: 4529/1492 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 72483ms problems are : Problem set: 0 solved, 6021 unsolved
Search for dead transitions found 0 dead transitions in 72514ms
Starting structural reductions in LTL mode, iteration 1 : 1130/1157 places, 6022/6054 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86061 ms. Remains : 1130/1157 places, 6022/6054 transitions.
[2025-05-29 23:34:47] [INFO ] Flatten gal took : 781 ms
[2025-05-29 23:34:48] [INFO ] Flatten gal took : 812 ms
[2025-05-29 23:34:50] [INFO ] Input system was already deterministic with 6022 transitions.
[2025-05-29 23:34:50] [INFO ] Flatten gal took : 851 ms
[2025-05-29 23:34:51] [INFO ] Flatten gal took : 790 ms
[2025-05-29 23:34:51] [INFO ] Time to serialize gal into /tmp/CTLFireability921490673041790178.gal : 105 ms
[2025-05-29 23:34:51] [INFO ] Time to serialize properties into /tmp/CTLFireability7513248858114841115.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/CTLFireability921490673041790178.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7513248858114841115.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-29 23:35:22] [INFO ] Flatten gal took : 759 ms
[2025-05-29 23:35:22] [INFO ] Applying decomposition
[2025-05-29 23:35:23] [INFO ] Flatten gal took : 772 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/graph18401493350217578300.txt' '-o' '/tmp/graph18401493350217578300.bin' '-w' '/tmp/graph18401493350217578300.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18401493350217578300.bin' '-l' '-1' '-v' '-w' '/tmp/graph18401493350217578300.weights' '-q' '0' '-e' '0.001'
[2025-05-29 23:35:24] [INFO ] Decomposing Gal with order
[2025-05-29 23:35:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:35:29] [INFO ] Removed a total of 45486 redundant transitions.
[2025-05-29 23:35:30] [INFO ] Flatten gal took : 5127 ms
[2025-05-29 23:35:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 8298 labels/synchronizations in 1138 ms.
[2025-05-29 23:35:31] [INFO ] Time to serialize gal into /tmp/CTLFireability5918898494321821718.gal : 61 ms
[2025-05-29 23:35:31] [INFO ] Time to serialize properties into /tmp/CTLFireability16508255747531303785.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/CTLFireability5918898494321821718.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16508255747531303785.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 : 1157/1157 places, 6054/6054 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1156 transition count 6054
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 31 place count 1126 transition count 1941
Iterating global reduction 1 with 30 rules applied. Total rules applied 61 place count 1126 transition count 1941
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 64 place count 1126 transition count 1938
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 72 place count 1118 transition count 1930
Iterating global reduction 2 with 8 rules applied. Total rules applied 80 place count 1118 transition count 1930
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 82 place count 1118 transition count 1928
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 84 place count 1116 transition count 1926
Iterating global reduction 3 with 2 rules applied. Total rules applied 86 place count 1116 transition count 1926
Applied a total of 86 rules in 304 ms. Remains 1116 /1157 variables (removed 41) and now considering 1926/6054 (removed 4128) transitions.
// Phase 1: matrix 1926 rows 1116 cols
[2025-05-29 23:36:02] [INFO ] Computed 18 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:36:02] [INFO ] Implicit Places using invariants in 250 ms returned []
[2025-05-29 23:36:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:36:04] [INFO ] Implicit Places using invariants and state equation in 1597 ms returned [12, 20, 186, 194, 359, 367, 532, 540, 705, 713, 878, 886]
[2025-05-29 23:36:04] [INFO ] Actually due to overlaps returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1854 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1115/1157 places, 1926/6054 transitions.
Applied a total of 0 rules in 31 ms. Remains 1115 /1115 variables (removed 0) and now considering 1926/1926 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2191 ms. Remains : 1115/1157 places, 1926/6054 transitions.
[2025-05-29 23:36:04] [INFO ] Flatten gal took : 60 ms
[2025-05-29 23:36:04] [INFO ] Flatten gal took : 64 ms
[2025-05-29 23:36:04] [INFO ] Input system was already deterministic with 1926 transitions.
[2025-05-29 23:36:04] [INFO ] Flatten gal took : 63 ms
[2025-05-29 23:36:04] [INFO ] Flatten gal took : 67 ms
[2025-05-29 23:36:04] [INFO ] Time to serialize gal into /tmp/CTLFireability11337749070409706193.gal : 11 ms
[2025-05-29 23:36:04] [INFO ] Time to serialize properties into /tmp/CTLFireability18331165447145134740.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/CTLFireability11337749070409706193.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18331165447145134740.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-29 23:36:34] [INFO ] Flatten gal took : 56 ms
[2025-05-29 23:36:34] [INFO ] Applying decomposition
[2025-05-29 23:36:34] [INFO ] Flatten gal took : 57 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/graph16336145980662756208.txt' '-o' '/tmp/graph16336145980662756208.bin' '-w' '/tmp/graph16336145980662756208.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16336145980662756208.bin' '-l' '-1' '-v' '-w' '/tmp/graph16336145980662756208.weights' '-q' '0' '-e' '0.001'
[2025-05-29 23:36:34] [INFO ] Decomposing Gal with order
[2025-05-29 23:36:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:36:35] [INFO ] Removed a total of 2441 redundant transitions.
[2025-05-29 23:36:35] [INFO ] Flatten gal took : 94 ms
[2025-05-29 23:36:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 113 labels/synchronizations in 24 ms.
[2025-05-29 23:36:35] [INFO ] Time to serialize gal into /tmp/CTLFireability11637925253001159363.gal : 11 ms
[2025-05-29 23:36:35] [INFO ] Time to serialize properties into /tmp/CTLFireability12740855519525295663.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/CTLFireability11637925253001159363.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12740855519525295663.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 : 1157/1157 places, 6054/6054 transitions.
Graph (trivial) has 1167 edges and 1157 vertex of which 418 / 1157 are part of one of the 46 SCC in 2 ms
Free SCC test removed 372 places
Ensure Unique test removed 424 transitions
Reduce isomorphic transitions removed 424 transitions.
Graph (complete) has 3315 edges and 785 vertex of which 752 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.17 ms
Discarding 33 places :
Also discarding 4097 output transitions
Drop transitions (Output transitions of discarded places.) removed 4097 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 301 transitions
Trivial Post-agglo rules discarded 301 transitions
Performed 301 trivial Post agglomeration. Transition count delta: 301
Iterating post reduction 0 with 301 rules applied. Total rules applied 303 place count 752 transition count 1232
Reduce places removed 301 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 308 rules applied. Total rules applied 611 place count 451 transition count 1225
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 618 place count 445 transition count 1224
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 618 place count 445 transition count 1164
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 738 place count 385 transition count 1164
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 747 place count 376 transition count 1155
Iterating global reduction 3 with 9 rules applied. Total rules applied 756 place count 376 transition count 1155
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 759 place count 376 transition count 1152
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 759 place count 376 transition count 1151
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 761 place count 375 transition count 1151
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 762 place count 374 transition count 1150
Iterating global reduction 4 with 1 rules applied. Total rules applied 763 place count 374 transition count 1150
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: 105
Deduced a syphon composed of 105 places in 1 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 4 with 210 rules applied. Total rules applied 973 place count 269 transition count 1045
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 4 with 24 rules applied. Total rules applied 997 place count 269 transition count 1021
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 4 with 12 rules applied. Total rules applied 1009 place count 269 transition count 1009
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 1021 place count 257 transition count 1009
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 1033 place count 251 transition count 1003
Applied a total of 1033 rules in 205 ms. Remains 251 /1157 variables (removed 906) and now considering 1003/6054 (removed 5051) transitions.
[2025-05-29 23:37:05] [INFO ] Flow matrix only has 814 transitions (discarded 189 similar events)
// Phase 1: matrix 814 rows 251 cols
[2025-05-29 23:37:05] [INFO ] Computed 6 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:37:05] [INFO ] Implicit Places using invariants in 104 ms returned []
[2025-05-29 23:37:05] [INFO ] Flow matrix only has 814 transitions (discarded 189 similar events)
[2025-05-29 23:37:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:37:05] [INFO ] State equation strengthened by 233 read => feed constraints.
[2025-05-29 23:37:06] [INFO ] Implicit Places using invariants and state equation in 736 ms returned []
Implicit Place search using SMT with State Equation took 844 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 23:37:06] [INFO ] Redundant transitions in 693 ms returned []
Running 1002 sub problems to find dead transitions.
[2025-05-29 23:37:06] [INFO ] Flow matrix only has 814 transitions (discarded 189 similar events)
[2025-05-29 23:37:06] [INFO ] Invariant cache hit.
[2025-05-29 23:37:06] [INFO ] State equation strengthened by 233 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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1002 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1002 unsolved
At refinement iteration 2 (OVERLAPS) 813/1063 variables, 250/256 constraints. Problems are: Problem set: 0 solved, 1002 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1063 variables, 232/488 constraints. Problems are: Problem set: 0 solved, 1002 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1063/1065 variables, and 488 constraints, problems are : Problem set: 0 solved, 1002 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 250/251 constraints, ReadFeed: 232/233 constraints, PredecessorRefiner: 1002/569 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1002 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1002 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1002 unsolved
At refinement iteration 2 (OVERLAPS) 813/1063 variables, 250/256 constraints. Problems are: Problem set: 0 solved, 1002 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1063 variables, 232/488 constraints. Problems are: Problem set: 0 solved, 1002 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1063 variables, 569/1057 constraints. Problems are: Problem set: 0 solved, 1002 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1063/1065 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1002 unsolved in 30047 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 250/251 constraints, ReadFeed: 232/233 constraints, PredecessorRefiner: 1002/569 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61326ms problems are : Problem set: 0 solved, 1002 unsolved
Search for dead transitions found 0 dead transitions in 61330ms
Starting structural reductions in SI_CTL mode, iteration 1 : 251/1157 places, 1003/6054 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 63084 ms. Remains : 251/1157 places, 1003/6054 transitions.
[2025-05-29 23:38:08] [INFO ] Flatten gal took : 29 ms
[2025-05-29 23:38:08] [INFO ] Flatten gal took : 31 ms
[2025-05-29 23:38:08] [INFO ] Input system was already deterministic with 1003 transitions.
[2025-05-29 23:38:08] [INFO ] Flatten gal took : 31 ms
[2025-05-29 23:38:08] [INFO ] Flatten gal took : 30 ms
[2025-05-29 23:38:08] [INFO ] Time to serialize gal into /tmp/CTLFireability4355283464966087427.gal : 6 ms
[2025-05-29 23:38:08] [INFO ] Time to serialize properties into /tmp/CTLFireability3845644732639497821.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/CTLFireability4355283464966087427.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3845644732639497821.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-29 23:38:38] [INFO ] Flatten gal took : 32 ms
[2025-05-29 23:38:38] [INFO ] Applying decomposition
[2025-05-29 23:38:38] [INFO ] Flatten gal took : 30 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/graph14307370458402640762.txt' '-o' '/tmp/graph14307370458402640762.bin' '-w' '/tmp/graph14307370458402640762.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14307370458402640762.bin' '-l' '-1' '-v' '-w' '/tmp/graph14307370458402640762.weights' '-q' '0' '-e' '0.001'
[2025-05-29 23:38:38] [INFO ] Decomposing Gal with order
[2025-05-29 23:38:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:38:38] [INFO ] Removed a total of 2397 redundant transitions.
[2025-05-29 23:38:38] [INFO ] Flatten gal took : 57 ms
[2025-05-29 23:38:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 116 labels/synchronizations in 8 ms.
[2025-05-29 23:38:38] [INFO ] Time to serialize gal into /tmp/CTLFireability4278386806503137877.gal : 3 ms
[2025-05-29 23:38:38] [INFO ] Time to serialize properties into /tmp/CTLFireability17871216504095714364.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/CTLFireability4278386806503137877.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17871216504095714364.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.51315e+19,0.101735,7256,412,71,4670,683,777,6453,116,1390,0


Converting to forward existential form...Done !
original formula: (EF((((((i6.u46.p1252==1)&&(i6.u47.p1293==1))&&((i6.u55.p1489==1)&&(u79.p1863==1)))&&(u79.p1884==1))||(i6.u44.p1242==1))) + AG((((i1.u11....231
=> equivalent forward existential formula: [(FwdU((FwdU((Init * !(E(TRUE U (((((i6.u46.p1252==1)&&(i6.u47.p1293==1))&&((i6.u55.p1489==1)&&(u79.p1863==1)))&...304
Reverse transition relation is NOT exact ! Due to transitions t300, t317, t493, u79.t1, i0.t303, i0.t118, i0.u0.t129, i0.u1.t125, i0.u2.t208, i0.u2.t209, i...899
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1157/1157 places, 6054/6054 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1156 transition count 6054
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 31 place count 1126 transition count 1941
Iterating global reduction 1 with 30 rules applied. Total rules applied 61 place count 1126 transition count 1941
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 64 place count 1126 transition count 1938
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 72 place count 1118 transition count 1930
Iterating global reduction 2 with 8 rules applied. Total rules applied 80 place count 1118 transition count 1930
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 82 place count 1118 transition count 1928
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 84 place count 1116 transition count 1926
Iterating global reduction 3 with 2 rules applied. Total rules applied 86 place count 1116 transition count 1926
Applied a total of 86 rules in 295 ms. Remains 1116 /1157 variables (removed 41) and now considering 1926/6054 (removed 4128) transitions.
// Phase 1: matrix 1926 rows 1116 cols
[2025-05-29 23:39:09] [INFO ] Computed 18 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:39:09] [INFO ] Implicit Places using invariants in 226 ms returned []
[2025-05-29 23:39:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:39:10] [INFO ] Implicit Places using invariants and state equation in 1470 ms returned [12, 20, 186, 194, 359, 367, 532, 540, 705, 713, 878, 886]
[2025-05-29 23:39:10] [INFO ] Actually due to overlaps returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1718 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1115/1157 places, 1926/6054 transitions.
Applied a total of 0 rules in 27 ms. Remains 1115 /1115 variables (removed 0) and now considering 1926/1926 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2041 ms. Remains : 1115/1157 places, 1926/6054 transitions.
[2025-05-29 23:39:11] [INFO ] Flatten gal took : 56 ms
[2025-05-29 23:39:11] [INFO ] Flatten gal took : 62 ms
[2025-05-29 23:39:11] [INFO ] Input system was already deterministic with 1926 transitions.
[2025-05-29 23:39:11] [INFO ] Flatten gal took : 55 ms
[2025-05-29 23:39:11] [INFO ] Flatten gal took : 55 ms
[2025-05-29 23:39:11] [INFO ] Time to serialize gal into /tmp/CTLFireability4269659976296371677.gal : 9 ms
[2025-05-29 23:39:11] [INFO ] Time to serialize properties into /tmp/CTLFireability4509194508180484583.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/CTLFireability4269659976296371677.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4509194508180484583.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-29 23:39:41] [INFO ] Flatten gal took : 56 ms
[2025-05-29 23:39:41] [INFO ] Applying decomposition
[2025-05-29 23:39:41] [INFO ] Flatten gal took : 55 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/graph1580323049541409705.txt' '-o' '/tmp/graph1580323049541409705.bin' '-w' '/tmp/graph1580323049541409705.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1580323049541409705.bin' '-l' '-1' '-v' '-w' '/tmp/graph1580323049541409705.weights' '-q' '0' '-e' '0.001'
[2025-05-29 23:39:41] [INFO ] Decomposing Gal with order
[2025-05-29 23:39:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:39:41] [INFO ] Removed a total of 2426 redundant transitions.
[2025-05-29 23:39:41] [INFO ] Flatten gal took : 91 ms
[2025-05-29 23:39:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 133 labels/synchronizations in 15 ms.
[2025-05-29 23:39:41] [INFO ] Time to serialize gal into /tmp/CTLFireability3878051990828800094.gal : 10 ms
[2025-05-29 23:39:41] [INFO ] Time to serialize properties into /tmp/CTLFireability6300629146236735207.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/CTLFireability3878051990828800094.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6300629146236735207.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 : 1157/1157 places, 6054/6054 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1156 transition count 6054
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 29 place count 1128 transition count 1943
Iterating global reduction 1 with 28 rules applied. Total rules applied 57 place count 1128 transition count 1943
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 60 place count 1128 transition count 1940
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 67 place count 1121 transition count 1933
Iterating global reduction 2 with 7 rules applied. Total rules applied 74 place count 1121 transition count 1933
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 76 place count 1121 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 77 place count 1120 transition count 1930
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 1120 transition count 1930
Applied a total of 78 rules in 306 ms. Remains 1120 /1157 variables (removed 37) and now considering 1930/6054 (removed 4124) transitions.
// Phase 1: matrix 1930 rows 1120 cols
[2025-05-29 23:40:12] [INFO ] Computed 18 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:40:12] [INFO ] Implicit Places using invariants in 229 ms returned []
[2025-05-29 23:40:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:40:14] [INFO ] Implicit Places using invariants and state equation in 1633 ms returned [12, 20, 186, 194, 359, 367, 535, 543, 709, 717, 882, 890]
[2025-05-29 23:40:14] [INFO ] Actually due to overlaps returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1866 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1119/1157 places, 1930/6054 transitions.
Applied a total of 0 rules in 34 ms. Remains 1119 /1119 variables (removed 0) and now considering 1930/1930 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2207 ms. Remains : 1119/1157 places, 1930/6054 transitions.
[2025-05-29 23:40:14] [INFO ] Flatten gal took : 55 ms
[2025-05-29 23:40:14] [INFO ] Flatten gal took : 57 ms
[2025-05-29 23:40:14] [INFO ] Input system was already deterministic with 1930 transitions.
[2025-05-29 23:40:14] [INFO ] Flatten gal took : 52 ms
[2025-05-29 23:40:14] [INFO ] Flatten gal took : 53 ms
[2025-05-29 23:40:14] [INFO ] Time to serialize gal into /tmp/CTLFireability8259491648578953640.gal : 9 ms
[2025-05-29 23:40:14] [INFO ] Time to serialize properties into /tmp/CTLFireability569680590377687997.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/CTLFireability8259491648578953640.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability569680590377687997.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-29 23:40:44] [INFO ] Flatten gal took : 54 ms
[2025-05-29 23:40:44] [INFO ] Applying decomposition
[2025-05-29 23:40:44] [INFO ] Flatten gal took : 55 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/graph13830546076944242769.txt' '-o' '/tmp/graph13830546076944242769.bin' '-w' '/tmp/graph13830546076944242769.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13830546076944242769.bin' '-l' '-1' '-v' '-w' '/tmp/graph13830546076944242769.weights' '-q' '0' '-e' '0.001'
[2025-05-29 23:40:44] [INFO ] Decomposing Gal with order
[2025-05-29 23:40:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:40:45] [INFO ] Removed a total of 2593 redundant transitions.
[2025-05-29 23:40:45] [INFO ] Flatten gal took : 117 ms
[2025-05-29 23:40:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 78 labels/synchronizations in 11 ms.
[2025-05-29 23:40:45] [INFO ] Time to serialize gal into /tmp/CTLFireability3737499876158778753.gal : 8 ms
[2025-05-29 23:40:45] [INFO ] Time to serialize properties into /tmp/CTLFireability6288075350478793684.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/CTLFireability3737499876158778753.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6288075350478793684.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1157/1157 places, 6054/6054 transitions.
Graph (trivial) has 1189 edges and 1157 vertex of which 436 / 1157 are part of one of the 48 SCC in 2 ms
Free SCC test removed 388 places
Ensure Unique test removed 442 transitions
Reduce isomorphic transitions removed 442 transitions.
Graph (complete) has 3283 edges and 769 vertex of which 736 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.6 ms
Discarding 33 places :
Also discarding 4097 output transitions
Drop transitions (Output transitions of discarded places.) removed 4097 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 300 transitions
Trivial Post-agglo rules discarded 300 transitions
Performed 300 trivial Post agglomeration. Transition count delta: 300
Iterating post reduction 0 with 300 rules applied. Total rules applied 302 place count 735 transition count 1214
Reduce places removed 300 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 301 rules applied. Total rules applied 603 place count 435 transition count 1213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 604 place count 434 transition count 1213
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 58 Pre rules applied. Total rules applied 604 place count 434 transition count 1155
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 720 place count 376 transition count 1155
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 731 place count 365 transition count 1144
Iterating global reduction 3 with 11 rules applied. Total rules applied 742 place count 365 transition count 1144
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 745 place count 365 transition count 1141
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 745 place count 365 transition count 1138
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 751 place count 362 transition count 1138
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 752 place count 361 transition count 1137
Iterating global reduction 4 with 1 rules applied. Total rules applied 753 place count 361 transition count 1137
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 955 place count 260 transition count 1036
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 957 place count 260 transition count 1034
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 5 with 24 rules applied. Total rules applied 981 place count 260 transition count 1010
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 5 with 12 rules applied. Total rules applied 993 place count 260 transition count 998
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 1005 place count 248 transition count 998
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 7 with 12 rules applied. Total rules applied 1017 place count 242 transition count 992
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1018 place count 241 transition count 991
Applied a total of 1018 rules in 161 ms. Remains 241 /1157 variables (removed 916) and now considering 991/6054 (removed 5063) transitions.
[2025-05-29 23:41:15] [INFO ] Flow matrix only has 800 transitions (discarded 191 similar events)
// Phase 1: matrix 800 rows 241 cols
[2025-05-29 23:41:15] [INFO ] Computed 6 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:41:15] [INFO ] Implicit Places using invariants in 390 ms returned []
[2025-05-29 23:41:15] [INFO ] Flow matrix only has 800 transitions (discarded 191 similar events)
[2025-05-29 23:41:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:41:15] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-05-29 23:41:16] [INFO ] Implicit Places using invariants and state equation in 515 ms returned []
Implicit Place search using SMT with State Equation took 908 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 23:41:17] [INFO ] Redundant transitions in 769 ms returned []
Running 942 sub problems to find dead transitions.
[2025-05-29 23:41:17] [INFO ] Flow matrix only has 800 transitions (discarded 191 similar events)
[2025-05-29 23:41:17] [INFO ] Invariant cache hit.
[2025-05-29 23:41:17] [INFO ] State equation strengthened by 36 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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 942 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 942 unsolved
At refinement iteration 2 (OVERLAPS) 799/1034 variables, 235/241 constraints. Problems are: Problem set: 0 solved, 942 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1034 variables, 36/277 constraints. Problems are: Problem set: 0 solved, 942 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1034/1041 variables, and 277 constraints, problems are : Problem set: 0 solved, 942 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 235/241 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 942/509 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 942 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 942 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 942 unsolved
At refinement iteration 2 (OVERLAPS) 799/1034 variables, 235/241 constraints. Problems are: Problem set: 0 solved, 942 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1034 variables, 36/277 constraints. Problems are: Problem set: 0 solved, 942 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1034 variables, 50/327 constraints. Problems are: Problem set: 0 solved, 942 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1034/1041 variables, and 327 constraints, problems are : Problem set: 0 solved, 942 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 235/241 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 483/509 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61132ms problems are : Problem set: 0 solved, 942 unsolved
Search for dead transitions found 0 dead transitions in 61134ms
Starting structural reductions in SI_CTL mode, iteration 1 : 241/1157 places, 991/6054 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 62981 ms. Remains : 241/1157 places, 991/6054 transitions.
[2025-05-29 23:42:18] [INFO ] Flatten gal took : 31 ms
[2025-05-29 23:42:18] [INFO ] Flatten gal took : 33 ms
[2025-05-29 23:42:18] [INFO ] Input system was already deterministic with 991 transitions.
[2025-05-29 23:42:18] [INFO ] Flatten gal took : 33 ms
[2025-05-29 23:42:18] [INFO ] Flatten gal took : 33 ms
[2025-05-29 23:42:18] [INFO ] Time to serialize gal into /tmp/CTLFireability9947855084028651252.gal : 5 ms
[2025-05-29 23:42:18] [INFO ] Time to serialize properties into /tmp/CTLFireability5112997694640793952.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/CTLFireability9947855084028651252.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5112997694640793952.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-29 23:42:48] [INFO ] Flatten gal took : 38 ms
[2025-05-29 23:42:48] [INFO ] Applying decomposition
[2025-05-29 23:42:48] [INFO ] Flatten gal took : 33 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/graph3212095505876616961.txt' '-o' '/tmp/graph3212095505876616961.bin' '-w' '/tmp/graph3212095505876616961.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3212095505876616961.bin' '-l' '-1' '-v' '-w' '/tmp/graph3212095505876616961.weights' '-q' '0' '-e' '0.001'
[2025-05-29 23:42:48] [INFO ] Decomposing Gal with order
[2025-05-29 23:42:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:42:48] [INFO ] Removed a total of 2264 redundant transitions.
[2025-05-29 23:42:48] [INFO ] Flatten gal took : 44 ms
[2025-05-29 23:42:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 111 labels/synchronizations in 6 ms.
[2025-05-29 23:42:48] [INFO ] Time to serialize gal into /tmp/CTLFireability6766355916641963429.gal : 3 ms
[2025-05-29 23:42:48] [INFO ] Time to serialize properties into /tmp/CTLFireability3679177215913982387.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/CTLFireability6766355916641963429.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3679177215913982387.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,6.39226e+18,0.103886,7128,419,116,4319,800,764,6656,132,1901,0


Converting to forward existential form...Done !
original formula: AF(AG((i3.u27.p856==1)))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((i3.u27.p856==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t338, t361, t482, u76.t1, i0.t341, i0.t117, i0.u0.t128, i0.u1.t124, i0.u2.t243, i0.u2.t244, i...895
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,0,0.710041,32984,1,0,58271,7348,6229,134824,805,32535,83633
FORMULA CloudDeployment-PT-6b-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 1157/1157 places, 6054/6054 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1156 transition count 6054
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 31 place count 1126 transition count 1941
Iterating global reduction 1 with 30 rules applied. Total rules applied 61 place count 1126 transition count 1941
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 64 place count 1126 transition count 1938
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 72 place count 1118 transition count 1930
Iterating global reduction 2 with 8 rules applied. Total rules applied 80 place count 1118 transition count 1930
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 82 place count 1118 transition count 1928
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 84 place count 1116 transition count 1926
Iterating global reduction 3 with 2 rules applied. Total rules applied 86 place count 1116 transition count 1926
Applied a total of 86 rules in 310 ms. Remains 1116 /1157 variables (removed 41) and now considering 1926/6054 (removed 4128) transitions.
// Phase 1: matrix 1926 rows 1116 cols
[2025-05-29 23:42:49] [INFO ] Computed 18 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:42:49] [INFO ] Implicit Places using invariants in 237 ms returned []
[2025-05-29 23:42:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:42:51] [INFO ] Implicit Places using invariants and state equation in 1482 ms returned [12, 20, 186, 194, 359, 367, 532, 540, 705, 713, 878, 886]
[2025-05-29 23:42:51] [INFO ] Actually due to overlaps returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1724 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1115/1157 places, 1926/6054 transitions.
Applied a total of 0 rules in 26 ms. Remains 1115 /1115 variables (removed 0) and now considering 1926/1926 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2064 ms. Remains : 1115/1157 places, 1926/6054 transitions.
[2025-05-29 23:42:51] [INFO ] Flatten gal took : 58 ms
[2025-05-29 23:42:51] [INFO ] Flatten gal took : 58 ms
[2025-05-29 23:42:51] [INFO ] Input system was already deterministic with 1926 transitions.
[2025-05-29 23:42:51] [INFO ] Flatten gal took : 56 ms
[2025-05-29 23:42:51] [INFO ] Flatten gal took : 74 ms
[2025-05-29 23:42:51] [INFO ] Time to serialize gal into /tmp/CTLFireability938435127997705619.gal : 12 ms
[2025-05-29 23:42:51] [INFO ] Time to serialize properties into /tmp/CTLFireability17347553758536075195.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/CTLFireability938435127997705619.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17347553758536075195.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-29 23:43:22] [INFO ] Flatten gal took : 55 ms
[2025-05-29 23:43:22] [INFO ] Applying decomposition
[2025-05-29 23:43:22] [INFO ] Flatten gal took : 55 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/graph1645291633085405842.txt' '-o' '/tmp/graph1645291633085405842.bin' '-w' '/tmp/graph1645291633085405842.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1645291633085405842.bin' '-l' '-1' '-v' '-w' '/tmp/graph1645291633085405842.weights' '-q' '0' '-e' '0.001'
[2025-05-29 23:43:22] [INFO ] Decomposing Gal with order
[2025-05-29 23:43:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:43:22] [INFO ] Removed a total of 3210 redundant transitions.
[2025-05-29 23:43:22] [INFO ] Flatten gal took : 76 ms
[2025-05-29 23:43:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 79 labels/synchronizations in 14 ms.
[2025-05-29 23:43:22] [INFO ] Time to serialize gal into /tmp/CTLFireability1808089906177085538.gal : 8 ms
[2025-05-29 23:43:22] [INFO ] Time to serialize properties into /tmp/CTLFireability4290792476952681804.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/CTLFireability1808089906177085538.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4290792476952681804.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.
[2025-05-29 23:43:53] [INFO ] Flatten gal took : 802 ms
[2025-05-29 23:43:54] [INFO ] Flatten gal took : 786 ms
[2025-05-29 23:43:54] [INFO ] Applying decomposition
[2025-05-29 23:43:55] [INFO ] Flatten gal took : 873 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/graph13799809755850160869.txt' '-o' '/tmp/graph13799809755850160869.bin' '-w' '/tmp/graph13799809755850160869.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13799809755850160869.bin' '-l' '-1' '-v' '-w' '/tmp/graph13799809755850160869.weights' '-q' '0' '-e' '0.001'
[2025-05-29 23:43:56] [INFO ] Decomposing Gal with order
[2025-05-29 23:43:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:44:00] [INFO ] Removed a total of 43403 redundant transitions.
[2025-05-29 23:44:01] [INFO ] Flatten gal took : 3856 ms
[2025-05-29 23:44:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 8318 labels/synchronizations in 792 ms.
[2025-05-29 23:44:02] [INFO ] Time to serialize gal into /tmp/CTLFireability8980207097276015312.gal : 68 ms
[2025-05-29 23:44:02] [INFO ] Time to serialize properties into /tmp/CTLFireability10426863250130481175.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/CTLFireability8980207097276015312.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10426863250130481175.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 10 CTL formulae.
Detected timeout of ITS tools.
[2025-05-30 00:09:51] [INFO ] Applying decomposition
[2025-05-30 00:09:56] [INFO ] Flatten gal took : 5307 ms
[2025-05-30 00:09:57] [INFO ] Decomposing Gal with order
[2025-05-30 00:09:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 00:10:00] [INFO ] Removed a total of 84573 redundant transitions.
[2025-05-30 00:10:01] [INFO ] Flatten gal took : 2710 ms
[2025-05-30 00:10:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 775 labels/synchronizations in 455 ms.
[2025-05-30 00:10:01] [INFO ] Time to serialize gal into /tmp/CTLFireability6770173254549879876.gal : 36 ms
[2025-05-30 00:10:01] [INFO ] Time to serialize properties into /tmp/CTLFireability14561668043779687846.ctl : 6 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/CTLFireability6770173254549879876.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14561668043779687846.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 10 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.91292e+28,10.5328,277416,5352,12225,323080,255527,1130,896210,1466,1.57235e+06,0


Converting to forward existential form...Done !
original formula: E(EF((i0.i0.i0.i0.i0.i0.i0.u11.p242==1)) U E(A((i0.i0.i1.i0.u34.p1544==1) U AX(FALSE)) U (i0.i0.i0.i0.i0.i1.i0.u20.p660==1)))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,E(TRUE U (i0.i0.i0.i0.i0.i0.i0.u11.p242==1))),!((E(!(!(EX(!(FALSE)))) U (!((i0.i0.i1.i0.u34.p15...261
Reverse transition relation is NOT exact ! Due to transitions t5034, t5648, t5686, t5699, t5709, u48.t2, u48.t3, i0.t5972, i0.t5964, i0.t5963, i0.t5961, i0...3536

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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