About the Execution of ITS-Tools for BusinessProcesses-PT-05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 1574398.00 | 0.00 | 0.00 | TFFFTTTTTFTFFTTT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r030-smll-174853813200034.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 BusinessProcesses-PT-05, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-smll-174853813200034
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K 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 85K 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 BusinessProcesses-PT-05-CTLFireability-2023-12
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2023-13
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2023-14
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2023-15
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2025-00
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2025-01
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2025-02
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2025-03
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2025-04
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2025-05
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2025-06
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2025-07
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2025-08
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2025-09
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2025-10
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2025-11
=== Now, execution of the tool begins
BK_START 1748547624287
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-05-29 19:40:26] [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 19:40:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 19:40:27] [INFO ] Load time of PNML (sax parser for PT used): 143 ms
[2025-05-29 19:40:27] [INFO ] Transformed 368 places.
[2025-05-29 19:40:27] [INFO ] Transformed 319 transitions.
[2025-05-29 19:40:27] [INFO ] Found NUPN structural information;
[2025-05-29 19:40:27] [INFO ] Parsed PT model containing 368 places and 319 transitions and 854 arcs in 361 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 18 ms.
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 1 transitions.
Support contains 123 out of 367 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 367/367 places, 318/318 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 365 transition count 318
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 34 place count 333 transition count 286
Iterating global reduction 1 with 32 rules applied. Total rules applied 66 place count 333 transition count 286
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 78 place count 321 transition count 274
Iterating global reduction 1 with 12 rules applied. Total rules applied 90 place count 321 transition count 274
Applied a total of 90 rules in 103 ms. Remains 321 /367 variables (removed 46) and now considering 274/318 (removed 44) transitions.
// Phase 1: matrix 274 rows 321 cols
[2025-05-29 19:40:27] [INFO ] Computed 55 invariants in 37 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:40:28] [INFO ] Implicit Places using invariants in 556 ms returned []
[2025-05-29 19:40:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:40:29] [INFO ] Implicit Places using invariants and state equation in 1030 ms returned []
Implicit Place search using SMT with State Equation took 1636 ms to find 0 implicit places.
Running 273 sub problems to find dead transitions.
[2025-05-29 19:40:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/320 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (OVERLAPS) 1/321 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:38] [INFO ] Deduced a trap composed of 9 places in 252 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:38] [INFO ] Deduced a trap composed of 10 places in 206 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:38] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:38] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:38] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:38] [INFO ] Deduced a trap composed of 14 places in 151 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:39] [INFO ] Deduced a trap composed of 15 places in 189 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:39] [INFO ] Deduced a trap composed of 16 places in 176 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:39] [INFO ] Deduced a trap composed of 17 places in 212 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:39] [INFO ] Deduced a trap composed of 19 places in 178 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:39] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:40] [INFO ] Deduced a trap composed of 23 places in 178 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:40] [INFO ] Deduced a trap composed of 23 places in 183 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:40] [INFO ] Deduced a trap composed of 23 places in 166 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:40] [INFO ] Deduced a trap composed of 25 places in 195 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:40] [INFO ] Deduced a trap composed of 27 places in 174 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:41] [INFO ] Deduced a trap composed of 15 places in 232 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:41] [INFO ] Deduced a trap composed of 18 places in 182 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:41] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:41] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/321 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:42] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:43] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:43] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:43] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:43] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:43] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:43] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:44] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:44] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:44] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:44] [INFO ] Deduced a trap composed of 11 places in 250 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:44] [INFO ] Deduced a trap composed of 15 places in 256 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:45] [INFO ] Deduced a trap composed of 16 places in 245 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:45] [INFO ] Deduced a trap composed of 20 places in 252 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:45] [INFO ] Deduced a trap composed of 21 places in 235 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:46] [INFO ] Deduced a trap composed of 22 places in 254 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:46] [INFO ] Deduced a trap composed of 23 places in 263 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:46] [INFO ] Deduced a trap composed of 26 places in 265 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:46] [INFO ] Deduced a trap composed of 30 places in 250 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:47] [INFO ] Deduced a trap composed of 31 places in 242 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/321 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:51] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:51] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:51] [INFO ] Deduced a trap composed of 31 places in 151 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:52] [INFO ] Deduced a trap composed of 15 places in 202 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:52] [INFO ] Deduced a trap composed of 28 places in 173 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:52] [INFO ] Deduced a trap composed of 30 places in 209 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:52] [INFO ] Deduced a trap composed of 32 places in 231 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:53] [INFO ] Deduced a trap composed of 14 places in 191 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:53] [INFO ] Deduced a trap composed of 18 places in 187 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:53] [INFO ] Deduced a trap composed of 16 places in 186 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:53] [INFO ] Deduced a trap composed of 17 places in 179 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:54] [INFO ] Deduced a trap composed of 19 places in 192 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:54] [INFO ] Deduced a trap composed of 22 places in 193 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:54] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:54] [INFO ] Deduced a trap composed of 30 places in 181 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:54] [INFO ] Deduced a trap composed of 23 places in 198 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:55] [INFO ] Deduced a trap composed of 25 places in 199 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:55] [INFO ] Deduced a trap composed of 18 places in 188 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:55] [INFO ] Deduced a trap composed of 23 places in 190 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:55] [INFO ] Deduced a trap composed of 23 places in 203 ms of which 26 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:57] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:58] [INFO ] Deduced a trap composed of 24 places in 189 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:58] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:58] [INFO ] Deduced a trap composed of 24 places in 176 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:59] [INFO ] Deduced a trap composed of 25 places in 164 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:40:59] [INFO ] Deduced a trap composed of 25 places in 161 ms of which 24 ms to minimize.
SMT process timed out in 30137ms, After SMT, problems are : Problem set: 0 solved, 273 unsolved
Search for dead transitions found 0 dead transitions in 30159ms
Starting structural reductions in LTL mode, iteration 1 : 321/367 places, 274/318 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31925 ms. Remains : 321/367 places, 274/318 transitions.
Support contains 123 out of 321 places after structural reductions.
[2025-05-29 19:40:59] [INFO ] Flatten gal took : 103 ms
[2025-05-29 19:40:59] [INFO ] Flatten gal took : 46 ms
[2025-05-29 19:41:00] [INFO ] Input system was already deterministic with 274 transitions.
RANDOM walk for 40000 steps (370 resets) in 2865 ms. (13 steps per ms) remains 9/83 properties
BEST_FIRST walk for 40003 steps (60 resets) in 272 ms. (146 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (77 resets) in 240 ms. (165 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (68 resets) in 101 ms. (392 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (63 resets) in 153 ms. (259 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (76 resets) in 593 ms. (67 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (72 resets) in 119 ms. (333 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (66 resets) in 108 ms. (367 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (67 resets) in 115 ms. (344 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (57 resets) in 79 ms. (500 steps per ms) remains 8/8 properties
[2025-05-29 19:41:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp60 is UNSAT
At refinement iteration 1 (OVERLAPS) 260/285 variables, 52/52 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 0/52 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 13/298 variables, 3/55 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 0/55 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 252/550 variables, 298/353 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 0/353 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Problem AtomicPropp78 is UNSAT
At refinement iteration 7 (OVERLAPS) 35/585 variables, 15/368 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/585 variables, 0/368 constraints. Problems are: Problem set: 3 solved, 5 unsolved
Problem AtomicPropp51 is UNSAT
At refinement iteration 9 (OVERLAPS) 10/595 variables, 8/376 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/595 variables, 0/376 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/595 variables, 0/376 constraints. Problems are: Problem set: 4 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 595/595 variables, and 376 constraints, problems are : Problem set: 4 solved, 4 unsolved in 1402 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 144/156 variables, 24/24 constraints. Problems are: Problem set: 4 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:03] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:03] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:03] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:03] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 4/28 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/28 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 139/295 variables, 31/59 constraints. Problems are: Problem set: 4 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:03] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:03] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:04] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:04] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:04] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 5/64 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 0/64 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 249/544 variables, 295/359 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/544 variables, 1/360 constraints. Problems are: Problem set: 4 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:04] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:04] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/544 variables, 2/362 constraints. Problems are: Problem set: 4 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:04] [INFO ] Deduced a trap along path composed of 3 places in 49 ms of which 13 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/544 variables, 1/363 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/544 variables, 0/363 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 40/584 variables, 17/380 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/584 variables, 3/383 constraints. Problems are: Problem set: 4 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:05] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:05] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:06] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:06] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 9 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/584 variables, 4/387 constraints. Problems are: Problem set: 4 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:06] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 5 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/584 variables, 1/388 constraints. Problems are: Problem set: 4 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:07] [INFO ] Deduced a trap along path composed of 3 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:07] [INFO ] Deduced a trap along path composed of 3 places in 39 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:07] [INFO ] Deduced a trap along path composed of 6 places in 50 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:07] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 584/595 variables, and 392 constraints, problems are : Problem set: 4 solved, 4 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 312/321 constraints, PredecessorRefiner: 4/8 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 6434ms problems are : Problem set: 4 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 321 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 321/321 places, 274/274 transitions.
Graph (trivial) has 174 edges and 321 vertex of which 5 / 321 are part of one of the 1 SCC in 4 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 655 edges and 317 vertex of which 316 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 54 place count 316 transition count 215
Reduce places removed 52 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 53 rules applied. Total rules applied 107 place count 264 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 108 place count 263 transition count 214
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 49 Pre rules applied. Total rules applied 108 place count 263 transition count 165
Deduced a syphon composed of 49 places in 2 ms
Ensure Unique test removed 12 places
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 218 place count 202 transition count 165
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 249 place count 171 transition count 134
Iterating global reduction 3 with 31 rules applied. Total rules applied 280 place count 171 transition count 134
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 280 place count 171 transition count 131
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 288 place count 166 transition count 131
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 424 place count 98 transition count 63
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 425 place count 98 transition count 62
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 426 place count 97 transition count 62
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 427 place count 96 transition count 61
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 428 place count 95 transition count 61
Applied a total of 428 rules in 172 ms. Remains 95 /321 variables (removed 226) and now considering 61/274 (removed 213) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 173 ms. Remains : 95/321 places, 61/274 transitions.
RANDOM walk for 40000 steps (3996 resets) in 989 ms. (40 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (1454 resets) in 282 ms. (141 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1757 resets) in 119 ms. (333 steps per ms) remains 2/2 properties
// Phase 1: matrix 61 rows 95 cols
[2025-05-29 19:41:08] [INFO ] Computed 40 invariants in 2 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 47/58 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/61 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 56/117 variables, 61/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 35/152 variables, 30/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 13/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/156 variables, 4/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/156 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/156 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/156 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 156/156 variables, and 135 constraints, problems are : Problem set: 0 solved, 2 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 47/58 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:08] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:08] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/61 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 56/117 variables, 61/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp42 is UNSAT
At refinement iteration 9 (OVERLAPS) 35/152 variables, 30/118 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/152 variables, 13/131 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/152 variables, 1/132 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/152 variables, 0/132 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/156 variables, 4/136 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/156 variables, 2/138 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/156 variables, 0/138 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/156 variables, 0/138 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 156/156 variables, and 138 constraints, problems are : Problem set: 1 solved, 1 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 476ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 2 out of 95 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 95/95 places, 61/61 transitions.
Graph (trivial) has 11 edges and 95 vertex of which 2 / 95 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 94 transition count 56
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 92 transition count 56
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 5 place count 92 transition count 53
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 12 place count 88 transition count 53
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 87 transition count 52
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 87 transition count 52
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 23 place count 82 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 81 transition count 47
Applied a total of 24 rules in 19 ms. Remains 81 /95 variables (removed 14) and now considering 47/61 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 81/95 places, 47/61 transitions.
RANDOM walk for 40000 steps (1595 resets) in 268 ms. (148 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (1224 resets) in 196 ms. (203 steps per ms) remains 1/1 properties
Probably explored full state space saw : 44 states, properties seen :0
Probabilistic random walk after 93 steps, saw 44 distinct states, run finished after 13 ms. (steps per millisecond=7 ) properties seen :0
Explored full state space saw : 44 states, properties seen :0
Exhaustive walk after 93 steps, saw 44 distinct states, run finished after 2 ms. (steps per millisecond=46 ) properties seen :0
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
FORMULA BusinessProcesses-PT-05-CTLFireability-2025-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-29 19:41:09] [INFO ] Flatten gal took : 25 ms
[2025-05-29 19:41:09] [INFO ] Flatten gal took : 24 ms
[2025-05-29 19:41:09] [INFO ] Input system was already deterministic with 274 transitions.
Computed a total of 314 stabilizing places and 264 stable transitions
Graph (complete) has 661 edges and 321 vertex of which 320 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 ms
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 274/274 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 287 transition count 240
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 287 transition count 240
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 69 place count 287 transition count 239
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 83 place count 273 transition count 225
Iterating global reduction 1 with 14 rules applied. Total rules applied 97 place count 273 transition count 225
Applied a total of 97 rules in 29 ms. Remains 273 /321 variables (removed 48) and now considering 225/274 (removed 49) transitions.
// Phase 1: matrix 225 rows 273 cols
[2025-05-29 19:41:09] [INFO ] Computed 55 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:41:09] [INFO ] Implicit Places using invariants in 173 ms returned []
[2025-05-29 19:41:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:41:10] [INFO ] Implicit Places using invariants and state equation in 705 ms returned []
Implicit Place search using SMT with State Equation took 881 ms to find 0 implicit places.
Running 224 sub problems to find dead transitions.
[2025-05-29 19:41:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/273 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:16] [INFO ] Deduced a trap composed of 9 places in 177 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:16] [INFO ] Deduced a trap composed of 10 places in 176 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:16] [INFO ] Deduced a trap composed of 11 places in 179 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:17] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:17] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:17] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:17] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:17] [INFO ] Deduced a trap composed of 16 places in 267 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:18] [INFO ] Deduced a trap composed of 17 places in 192 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:18] [INFO ] Deduced a trap composed of 19 places in 182 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:18] [INFO ] Deduced a trap composed of 21 places in 175 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:18] [INFO ] Deduced a trap composed of 23 places in 186 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:18] [INFO ] Deduced a trap composed of 23 places in 191 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:19] [INFO ] Deduced a trap composed of 23 places in 195 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:19] [INFO ] Deduced a trap composed of 25 places in 176 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:19] [INFO ] Deduced a trap composed of 27 places in 172 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:20] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:20] [INFO ] Deduced a trap composed of 29 places in 201 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:20] [INFO ] Deduced a trap composed of 14 places in 174 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:20] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:22] [INFO ] Deduced a trap composed of 16 places in 166 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:22] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:22] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:23] [INFO ] Deduced a trap composed of 29 places in 179 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:23] [INFO ] Deduced a trap composed of 31 places in 182 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:23] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:23] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:23] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 8/83 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:27] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (OVERLAPS) 225/498 variables, 273/357 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:38] [INFO ] Deduced a trap composed of 8 places in 178 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:38] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:38] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:38] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:39] [INFO ] Deduced a trap composed of 61 places in 108 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:39] [INFO ] Deduced a trap composed of 61 places in 124 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:39] [INFO ] Deduced a trap composed of 64 places in 110 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:39] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:40] [INFO ] Deduced a trap composed of 11 places in 190 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:41:40] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 10 ms to minimize.
SMT process timed out in 30078ms, After SMT, problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 30081ms
Starting structural reductions in LTL mode, iteration 1 : 273/321 places, 225/274 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30993 ms. Remains : 273/321 places, 225/274 transitions.
[2025-05-29 19:41:40] [INFO ] Flatten gal took : 17 ms
[2025-05-29 19:41:40] [INFO ] Flatten gal took : 17 ms
[2025-05-29 19:41:40] [INFO ] Input system was already deterministic with 225 transitions.
[2025-05-29 19:41:40] [INFO ] Flatten gal took : 24 ms
[2025-05-29 19:41:40] [INFO ] Flatten gal took : 22 ms
[2025-05-29 19:41:40] [INFO ] Time to serialize gal into /tmp/CTLFireability990607488470563958.gal : 12 ms
[2025-05-29 19:41:40] [INFO ] Time to serialize properties into /tmp/CTLFireability10443947462802186281.ctl : 7 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/CTLFireability990607488470563958.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10443947462802186281.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.44804e+17,4.84304,114208,2,47843,5,272985,6,0,1317,640425,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-29 19:42:10] [INFO ] Flatten gal took : 14 ms
[2025-05-29 19:42:10] [INFO ] Applying decomposition
[2025-05-29 19:42:10] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3801855308887795790.txt' '-o' '/tmp/graph3801855308887795790.bin' '-w' '/tmp/graph3801855308887795790.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3801855308887795790.bin' '-l' '-1' '-v' '-w' '/tmp/graph3801855308887795790.weights' '-q' '0' '-e' '0.001'
[2025-05-29 19:42:10] [INFO ] Decomposing Gal with order
[2025-05-29 19:42:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 19:42:10] [INFO ] Removed a total of 68 redundant transitions.
[2025-05-29 19:42:11] [INFO ] Flatten gal took : 148 ms
[2025-05-29 19:42:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 22 ms.
[2025-05-29 19:42:11] [INFO ] Time to serialize gal into /tmp/CTLFireability10094415967634664075.gal : 44 ms
[2025-05-29 19:42:11] [INFO ] Time to serialize properties into /tmp/CTLFireability172073657946717521.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/CTLFireability10094415967634664075.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability172073657946717521.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,1.44804e+17,2.50405,57324,5265,33,73205,419,536,217839,45,1020,0
Converting to forward existential form...Done !
original formula: (AF(EX(AF(((i17.u90.p345==0)&&(i15.i0.u10.p26==0))))) * (EF(AG((i17.u77.p296==0))) + !(E(((i16.u58.p175!=1)||(((i15.i0.u12.p30==1)&&(i15....294
=> equivalent forward existential formula: ([FwdG(Init,!(EX(!(EG(!(((i17.u90.p345==0)&&(i15.i0.u10.p26==0))))))))] = FALSE * [FwdG(FwdU((Init * !(E(TRUE U ...381
Reverse transition relation is NOT exact ! Due to transitions t103, t162, t203, t205, t206, t207, t210, t216, i0.i0.u35.t114, i0.i0.u43.t99, i0.i1.u41.t102...875
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 274/274 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 291 transition count 244
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 291 transition count 244
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 61 place count 291 transition count 243
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 73 place count 279 transition count 231
Iterating global reduction 1 with 12 rules applied. Total rules applied 85 place count 279 transition count 231
Applied a total of 85 rules in 21 ms. Remains 279 /321 variables (removed 42) and now considering 231/274 (removed 43) transitions.
// Phase 1: matrix 231 rows 279 cols
[2025-05-29 19:42:41] [INFO ] Computed 55 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:42:41] [INFO ] Implicit Places using invariants in 165 ms returned []
[2025-05-29 19:42:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:42:42] [INFO ] Implicit Places using invariants and state equation in 978 ms returned []
Implicit Place search using SMT with State Equation took 1145 ms to find 0 implicit places.
Running 230 sub problems to find dead transitions.
[2025-05-29 19:42:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (OVERLAPS) 1/279 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 230 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:42:48] [INFO ] Deduced a trap composed of 9 places in 198 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:42:48] [INFO ] Deduced a trap composed of 10 places in 180 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:42:48] [INFO ] Deduced a trap composed of 11 places in 180 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:42:48] [INFO ] Deduced a trap composed of 12 places in 185 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:42:49] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:42:49] [INFO ] Deduced a trap composed of 14 places in 190 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:42:49] [INFO ] Deduced a trap composed of 15 places in 185 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:42:49] [INFO ] Deduced a trap composed of 16 places in 187 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:42:49] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:42:49] [INFO ] Deduced a trap composed of 19 places in 162 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:42:50] [INFO ] Deduced a trap composed of 21 places in 182 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:42:50] [INFO ] Deduced a trap composed of 23 places in 189 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:42:50] [INFO ] Deduced a trap composed of 23 places in 192 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:42:50] [INFO ] Deduced a trap composed of 23 places in 187 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:42:50] [INFO ] Deduced a trap composed of 25 places in 188 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:42:51] [INFO ] Deduced a trap composed of 27 places in 182 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:42:51] [INFO ] Deduced a trap composed of 21 places in 151 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:42:52] [INFO ] Deduced a trap composed of 15 places in 187 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:42:52] [INFO ] Deduced a trap composed of 16 places in 179 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:42:52] [INFO ] Deduced a trap composed of 18 places in 174 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/279 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 230 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:42:54] [INFO ] Deduced a trap composed of 21 places in 206 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:42:54] [INFO ] Deduced a trap composed of 22 places in 203 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:42:54] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:42:54] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:42:55] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:42:55] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:42:55] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:42:55] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 8/83 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (OVERLAPS) 231/510 variables, 279/362 constraints. Problems are: Problem set: 0 solved, 230 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:43:04] [INFO ] Deduced a trap composed of 8 places in 190 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:43:05] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:43:05] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:43:06] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/510 variables, 4/366 constraints. Problems are: Problem set: 0 solved, 230 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 510/510 variables, and 366 constraints, problems are : Problem set: 0 solved, 230 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 279/279 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 230 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (OVERLAPS) 1/279 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/279 variables, 32/87 constraints. Problems are: Problem set: 0 solved, 230 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:43:15] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:43:16] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:43:16] [INFO ] Deduced a trap composed of 25 places in 172 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:43:16] [INFO ] Deduced a trap composed of 25 places in 137 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 230 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:43:19] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:43:19] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 16 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (OVERLAPS) 231/510 variables, 279/372 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/510 variables, 230/602 constraints. Problems are: Problem set: 0 solved, 230 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:43:27] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:43:27] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:43:28] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:43:28] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:43:28] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:43:28] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:43:29] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:43:30] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:43:31] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:43:31] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:43:31] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:43:31] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:43:33] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:43:33] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:43:33] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:43:34] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:43:34] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:43:35] [INFO ] Deduced a trap composed of 19 places in 158 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:43:35] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:43:36] [INFO ] Deduced a trap composed of 30 places in 175 ms of which 27 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/510 variables, 20/622 constraints. Problems are: Problem set: 0 solved, 230 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:43:42] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 25 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 510/510 variables, and 623 constraints, problems are : Problem set: 0 solved, 230 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 279/279 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 59/59 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60082ms problems are : Problem set: 0 solved, 230 unsolved
Search for dead transitions found 0 dead transitions in 60083ms
Starting structural reductions in LTL mode, iteration 1 : 279/321 places, 231/274 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61252 ms. Remains : 279/321 places, 231/274 transitions.
[2025-05-29 19:43:42] [INFO ] Flatten gal took : 20 ms
[2025-05-29 19:43:42] [INFO ] Flatten gal took : 16 ms
[2025-05-29 19:43:42] [INFO ] Input system was already deterministic with 231 transitions.
[2025-05-29 19:43:42] [INFO ] Flatten gal took : 12 ms
[2025-05-29 19:43:42] [INFO ] Flatten gal took : 14 ms
[2025-05-29 19:43:42] [INFO ] Time to serialize gal into /tmp/CTLFireability3380260791601665484.gal : 5 ms
[2025-05-29 19:43:42] [INFO ] Time to serialize properties into /tmp/CTLFireability11357094411591628872.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3380260791601665484.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11357094411591628872.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.
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.50186e+17,7.16337,137668,2,67966,5,321601,6,0,1347,775996,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-29 19:44:12] [INFO ] Flatten gal took : 13 ms
[2025-05-29 19:44:12] [INFO ] Applying decomposition
[2025-05-29 19:44:12] [INFO ] Flatten gal took : 9 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/graph2092060113616962483.txt' '-o' '/tmp/graph2092060113616962483.bin' '-w' '/tmp/graph2092060113616962483.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2092060113616962483.bin' '-l' '-1' '-v' '-w' '/tmp/graph2092060113616962483.weights' '-q' '0' '-e' '0.001'
[2025-05-29 19:44:12] [INFO ] Decomposing Gal with order
[2025-05-29 19:44:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 19:44:12] [INFO ] Removed a total of 66 redundant transitions.
[2025-05-29 19:44:12] [INFO ] Flatten gal took : 22 ms
[2025-05-29 19:44:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 9 ms.
[2025-05-29 19:44:12] [INFO ] Time to serialize gal into /tmp/CTLFireability753571961192945713.gal : 7 ms
[2025-05-29 19:44:12] [INFO ] Time to serialize properties into /tmp/CTLFireability6562253843812686202.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/CTLFireability753571961192945713.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6562253843812686202.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.50186e+17,1.16969,29652,4577,34,42841,638,586,94404,51,1423,0
Converting to forward existential form...Done !
original formula: (EX(((((((i8.i0.u19.p63==1)&&(i8.i0.u21.p69==0)) + AF((((i6.u16.p46==0)||(i17.u61.p203==0))||(i19.u77.p367==0)))) * ((A((i0.u58.p186==1) ...668
=> equivalent forward existential formula: ([(FwdU((Init * EX(((((((i8.i0.u19.p63==1)&&(i8.i0.u21.p69==0)) + !(EG(!((((i6.u16.p46==0)||(i17.u61.p203==0))||...3168
Reverse transition relation is NOT exact ! Due to transitions t104, t170, t216, t222, i0.u39.t107, i0.u58.t80, i1.i0.u37.t111, i1.i0.u43.t100, i1.i1.u74.t3...1015
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 274/274 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 287 transition count 240
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 287 transition count 240
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 69 place count 287 transition count 239
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 84 place count 272 transition count 224
Iterating global reduction 1 with 15 rules applied. Total rules applied 99 place count 272 transition count 224
Applied a total of 99 rules in 16 ms. Remains 272 /321 variables (removed 49) and now considering 224/274 (removed 50) transitions.
// Phase 1: matrix 224 rows 272 cols
[2025-05-29 19:44:43] [INFO ] Computed 55 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:44:43] [INFO ] Implicit Places using invariants in 315 ms returned []
[2025-05-29 19:44:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:44:44] [INFO ] Implicit Places using invariants and state equation in 1165 ms returned []
Implicit Place search using SMT with State Equation took 1487 ms to find 0 implicit places.
Running 223 sub problems to find dead transitions.
[2025-05-29 19:44:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (OVERLAPS) 1/272 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:44:51] [INFO ] Deduced a trap composed of 9 places in 195 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:44:51] [INFO ] Deduced a trap composed of 10 places in 162 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:44:51] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:44:51] [INFO ] Deduced a trap composed of 12 places in 182 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:44:51] [INFO ] Deduced a trap composed of 13 places in 189 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:44:51] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:44:52] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:44:52] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:44:52] [INFO ] Deduced a trap composed of 17 places in 179 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:44:52] [INFO ] Deduced a trap composed of 19 places in 184 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:44:52] [INFO ] Deduced a trap composed of 21 places in 179 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:44:53] [INFO ] Deduced a trap composed of 23 places in 195 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:44:53] [INFO ] Deduced a trap composed of 23 places in 178 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:44:53] [INFO ] Deduced a trap composed of 23 places in 177 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:44:53] [INFO ] Deduced a trap composed of 25 places in 174 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:44:53] [INFO ] Deduced a trap composed of 27 places in 172 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:44:54] [INFO ] Deduced a trap composed of 20 places in 151 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:44:54] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:44:55] [INFO ] Deduced a trap composed of 18 places in 206 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:44:55] [INFO ] Deduced a trap composed of 14 places in 184 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:44:56] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:44:57] [INFO ] Deduced a trap composed of 16 places in 153 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:44:57] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:44:57] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:44:57] [INFO ] Deduced a trap composed of 20 places in 160 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:44:57] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:44:57] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:44:58] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 8/83 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 224/496 variables, 272/355 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:45:06] [INFO ] Deduced a trap composed of 8 places in 197 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:45:07] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:45:07] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:45:07] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:45:08] [INFO ] Deduced a trap composed of 11 places in 208 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:45:08] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/496 variables, 6/361 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 496/496 variables, and 361 constraints, problems are : Problem set: 0 solved, 223 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (OVERLAPS) 1/272 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 34/89 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:45:17] [INFO ] Deduced a trap composed of 26 places in 158 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:45:17] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:45:18] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 3/92 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:45:21] [INFO ] Deduced a trap composed of 31 places in 149 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:45:23] [INFO ] Deduced a trap composed of 32 places in 134 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:45:23] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 14 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:45:25] [INFO ] Deduced a trap composed of 28 places in 165 ms of which 17 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (OVERLAPS) 224/496 variables, 272/368 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 223/591 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:45:33] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:45:33] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:45:33] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:45:35] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:45:36] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:45:37] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:45:38] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:45:38] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:45:39] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:45:39] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:45:39] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:45:40] [INFO ] Deduced a trap composed of 54 places in 140 ms of which 16 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 12/603 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 496/496 variables, and 603 constraints, problems are : Problem set: 0 solved, 223 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 53/53 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60071ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 60073ms
Starting structural reductions in LTL mode, iteration 1 : 272/321 places, 224/274 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61578 ms. Remains : 272/321 places, 224/274 transitions.
[2025-05-29 19:45:44] [INFO ] Flatten gal took : 10 ms
[2025-05-29 19:45:44] [INFO ] Flatten gal took : 9 ms
[2025-05-29 19:45:44] [INFO ] Input system was already deterministic with 224 transitions.
[2025-05-29 19:45:44] [INFO ] Flatten gal took : 9 ms
[2025-05-29 19:45:44] [INFO ] Flatten gal took : 17 ms
[2025-05-29 19:45:44] [INFO ] Time to serialize gal into /tmp/CTLFireability9489810481595366316.gal : 2 ms
[2025-05-29 19:45:44] [INFO ] Time to serialize properties into /tmp/CTLFireability6472839737167886498.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/CTLFireability9489810481595366316.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6472839737167886498.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.44729e+17,4.20922,99760,2,42200,5,242691,6,0,1312,549457,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-29 19:46:14] [INFO ] Flatten gal took : 15 ms
[2025-05-29 19:46:14] [INFO ] Applying decomposition
[2025-05-29 19:46:14] [INFO ] Flatten gal took : 15 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/graph10599860630480957777.txt' '-o' '/tmp/graph10599860630480957777.bin' '-w' '/tmp/graph10599860630480957777.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10599860630480957777.bin' '-l' '-1' '-v' '-w' '/tmp/graph10599860630480957777.weights' '-q' '0' '-e' '0.001'
[2025-05-29 19:46:14] [INFO ] Decomposing Gal with order
[2025-05-29 19:46:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 19:46:14] [INFO ] Removed a total of 71 redundant transitions.
[2025-05-29 19:46:14] [INFO ] Flatten gal took : 34 ms
[2025-05-29 19:46:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2025-05-29 19:46:14] [INFO ] Time to serialize gal into /tmp/CTLFireability8825731111996149741.gal : 8 ms
[2025-05-29 19:46:14] [INFO ] Time to serialize properties into /tmp/CTLFireability8703240250044828849.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/CTLFireability8825731111996149741.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8703240250044828849.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,1.44729e+17,0.66509,14868,2755,24,18624,364,565,34632,38,749,0
Converting to forward existential form...Done !
original formula: (AF(((EF((i3.u13.p34==0)) + EX((i20.u89.p341==0))) * EG(AG((i7.i0.u22.p64==1))))) + AG(((i19.i0.u68.p227==1) + EF((((i0.i1.u43.p129==0)&&...202
=> equivalent forward existential formula: [((FwdU((Init * !(!(EG(!(((E(TRUE U (i3.u13.p34==0)) + EX((i20.u89.p341==0))) * EG(!(E(TRUE U !((i7.i0.u22.p64==...298
Reverse transition relation is NOT exact ! Due to transitions t102, t154, t163, t202, t205, t206, t209, t215, i0.i0.u44.t98, i0.i1.u42.t101, i1.u38.t109, i...890
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 321/321 places, 274/274 transitions.
Graph (trivial) has 177 edges and 321 vertex of which 7 / 321 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 653 edges and 315 vertex of which 314 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 313 transition count 214
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 263 transition count 214
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 57 Pre rules applied. Total rules applied 102 place count 263 transition count 157
Deduced a syphon composed of 57 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 127 rules applied. Total rules applied 229 place count 193 transition count 157
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 263 place count 159 transition count 123
Iterating global reduction 2 with 34 rules applied. Total rules applied 297 place count 159 transition count 123
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 297 place count 159 transition count 122
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 300 place count 157 transition count 122
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 137 rules applied. Total rules applied 437 place count 88 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 439 place count 87 transition count 53
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 440 place count 86 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 441 place count 85 transition count 52
Applied a total of 441 rules in 80 ms. Remains 85 /321 variables (removed 236) and now considering 52/274 (removed 222) transitions.
// Phase 1: matrix 52 rows 85 cols
[2025-05-29 19:46:45] [INFO ] Computed 39 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:46:45] [INFO ] Implicit Places using invariants in 94 ms returned []
[2025-05-29 19:46:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:46:45] [INFO ] Implicit Places using invariants and state equation in 243 ms returned [0, 1, 2, 3, 4, 5, 6, 9, 10, 11, 12, 13, 14, 15, 16, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 46, 48, 50, 56, 58, 60, 62, 64]
Discarding 36 places :
Implicit Place search using SMT with State Equation took 341 ms to find 36 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 49/321 places, 52/274 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 49 transition count 46
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 43 transition count 46
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 17 place count 38 transition count 41
Iterating global reduction 2 with 5 rules applied. Total rules applied 22 place count 38 transition count 41
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 24 place count 38 transition count 39
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 26 place count 36 transition count 39
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 27 place count 35 transition count 38
Iterating global reduction 4 with 1 rules applied. Total rules applied 28 place count 35 transition count 38
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 30 place count 34 transition count 37
Applied a total of 30 rules in 10 ms. Remains 34 /49 variables (removed 15) and now considering 37/52 (removed 15) transitions.
// Phase 1: matrix 37 rows 34 cols
[2025-05-29 19:46:45] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:46:45] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-05-29 19:46:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:46:45] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 34/321 places, 37/274 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 541 ms. Remains : 34/321 places, 37/274 transitions.
[2025-05-29 19:46:45] [INFO ] Flatten gal took : 2 ms
[2025-05-29 19:46:45] [INFO ] Flatten gal took : 1 ms
[2025-05-29 19:46:45] [INFO ] Input system was already deterministic with 37 transitions.
[2025-05-29 19:46:45] [INFO ] Flatten gal took : 1 ms
[2025-05-29 19:46:45] [INFO ] Flatten gal took : 2 ms
[2025-05-29 19:46:45] [INFO ] Time to serialize gal into /tmp/CTLFireability4468902741630953657.gal : 1 ms
[2025-05-29 19:46:45] [INFO ] Time to serialize properties into /tmp/CTLFireability5828240572544785934.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/CTLFireability4468902741630953657.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5828240572544785934.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,274,0.011743,3948,2,132,5,772,6,0,172,646,0
Converting to forward existential form...Done !
original formula: EF((EF((p328==1)) + (EG((((p68==1)&&(p219==1))&&(p320==1))) * (p240==1))))
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,TRUE),TRUE) * (p328==1))] != FALSE + [FwdG((FwdU(Init,TRUE) * (p240==1)),(((p68==1)&&(p219==1)...180
(forward)formula 0,1,0.013599,4332,1,0,6,772,9,1,311,646,3
FORMULA BusinessProcesses-PT-05-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 321/321 places, 274/274 transitions.
Graph (trivial) has 186 edges and 321 vertex of which 7 / 321 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 653 edges and 315 vertex of which 314 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 313 transition count 210
Reduce places removed 54 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 259 transition count 208
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 114 place count 257 transition count 208
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 53 Pre rules applied. Total rules applied 114 place count 257 transition count 155
Deduced a syphon composed of 53 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 119 rules applied. Total rules applied 233 place count 191 transition count 155
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 268 place count 156 transition count 120
Iterating global reduction 3 with 35 rules applied. Total rules applied 303 place count 156 transition count 120
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 303 place count 156 transition count 117
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 311 place count 151 transition count 117
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 133 rules applied. Total rules applied 444 place count 84 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 446 place count 83 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 447 place count 82 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 448 place count 81 transition count 49
Applied a total of 448 rules in 45 ms. Remains 81 /321 variables (removed 240) and now considering 49/274 (removed 225) transitions.
// Phase 1: matrix 49 rows 81 cols
[2025-05-29 19:46:45] [INFO ] Computed 38 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:46:45] [INFO ] Implicit Places using invariants in 116 ms returned []
[2025-05-29 19:46:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:46:45] [INFO ] Implicit Places using invariants and state equation in 244 ms returned [0, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62]
Discarding 28 places :
Implicit Place search using SMT with State Equation took 374 ms to find 28 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 53/321 places, 49/274 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 3 rules applied. Total rules applied 3 place count 53 transition count 46
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 50 transition count 46
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 8 place count 48 transition count 44
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 48 transition count 44
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 46 transition count 42
Applied a total of 14 rules in 13 ms. Remains 46 /53 variables (removed 7) and now considering 42/49 (removed 7) transitions.
// Phase 1: matrix 42 rows 46 cols
[2025-05-29 19:46:45] [INFO ] Computed 10 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:46:46] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-05-29 19:46:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:46:46] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 46/321 places, 42/274 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 643 ms. Remains : 46/321 places, 42/274 transitions.
[2025-05-29 19:46:46] [INFO ] Flatten gal took : 8 ms
[2025-05-29 19:46:46] [INFO ] Flatten gal took : 4 ms
[2025-05-29 19:46:46] [INFO ] Input system was already deterministic with 42 transitions.
[2025-05-29 19:46:46] [INFO ] Flatten gal took : 3 ms
[2025-05-29 19:46:46] [INFO ] Flatten gal took : 2 ms
[2025-05-29 19:46:46] [INFO ] Time to serialize gal into /tmp/CTLFireability14308358331660318591.gal : 1 ms
[2025-05-29 19:46:46] [INFO ] Time to serialize properties into /tmp/CTLFireability17896254985229515600.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/CTLFireability14308358331660318591.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17896254985229515600.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,195,0.028079,4292,2,309,5,1465,6,0,224,1228,0
Converting to forward existential form...Done !
original formula: AG((AF((p201==0)) * (p21==0)))
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),!((p201==0)))] = FALSE * [(FwdU(Init,TRUE) * !((p21==0)))] = FALSE)
(forward)formula 0,0,0.029991,4548,1,0,8,1465,9,2,229,1228,1
FORMULA BusinessProcesses-PT-05-CTLFireability-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 274/274 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 289 transition count 242
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 289 transition count 242
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 65 place count 289 transition count 241
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 81 place count 273 transition count 225
Iterating global reduction 1 with 16 rules applied. Total rules applied 97 place count 273 transition count 225
Applied a total of 97 rules in 25 ms. Remains 273 /321 variables (removed 48) and now considering 225/274 (removed 49) transitions.
// Phase 1: matrix 225 rows 273 cols
[2025-05-29 19:46:46] [INFO ] Computed 55 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:46:46] [INFO ] Implicit Places using invariants in 231 ms returned []
[2025-05-29 19:46:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:46:47] [INFO ] Implicit Places using invariants and state equation in 1116 ms returned []
Implicit Place search using SMT with State Equation took 1350 ms to find 0 implicit places.
Running 224 sub problems to find dead transitions.
[2025-05-29 19:46:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/273 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:46:53] [INFO ] Deduced a trap composed of 9 places in 174 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:46:54] [INFO ] Deduced a trap composed of 10 places in 171 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:46:54] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:46:54] [INFO ] Deduced a trap composed of 12 places in 168 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:46:54] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:46:54] [INFO ] Deduced a trap composed of 14 places in 189 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:46:55] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:46:55] [INFO ] Deduced a trap composed of 16 places in 190 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:46:55] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:46:55] [INFO ] Deduced a trap composed of 19 places in 195 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:46:55] [INFO ] Deduced a trap composed of 21 places in 173 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:46:56] [INFO ] Deduced a trap composed of 23 places in 201 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:46:56] [INFO ] Deduced a trap composed of 23 places in 183 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:46:56] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:46:56] [INFO ] Deduced a trap composed of 25 places in 185 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:46:56] [INFO ] Deduced a trap composed of 27 places in 159 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:46:57] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:46:57] [INFO ] Deduced a trap composed of 18 places in 162 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:46:57] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:46:57] [INFO ] Deduced a trap composed of 27 places in 172 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:46:58] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:46:58] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:46:59] [INFO ] Deduced a trap composed of 11 places in 213 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:46:59] [INFO ] Deduced a trap composed of 23 places in 197 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:46:59] [INFO ] Deduced a trap composed of 30 places in 207 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:47:00] [INFO ] Deduced a trap composed of 14 places in 175 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:47:00] [INFO ] Deduced a trap composed of 12 places in 184 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:47:00] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:47:00] [INFO ] Deduced a trap composed of 17 places in 167 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:47:00] [INFO ] Deduced a trap composed of 19 places in 191 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:47:01] [INFO ] Deduced a trap composed of 25 places in 156 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:47:01] [INFO ] Deduced a trap composed of 25 places in 172 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:47:01] [INFO ] Deduced a trap composed of 29 places in 172 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:47:01] [INFO ] Deduced a trap composed of 30 places in 164 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:47:01] [INFO ] Deduced a trap composed of 32 places in 161 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:47:02] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:47:02] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 17/92 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:47:05] [INFO ] Deduced a trap composed of 19 places in 165 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:47:05] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (OVERLAPS) 225/498 variables, 273/367 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:47:16] [INFO ] Deduced a trap composed of 8 places in 187 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:47:17] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:47:17] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:47:17] [INFO ] Deduced a trap composed of 64 places in 121 ms of which 12 ms to minimize.
SMT process timed out in 30084ms, After SMT, problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 30086ms
Starting structural reductions in LTL mode, iteration 1 : 273/321 places, 225/274 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31465 ms. Remains : 273/321 places, 225/274 transitions.
[2025-05-29 19:47:17] [INFO ] Flatten gal took : 11 ms
[2025-05-29 19:47:17] [INFO ] Flatten gal took : 11 ms
[2025-05-29 19:47:17] [INFO ] Input system was already deterministic with 225 transitions.
[2025-05-29 19:47:17] [INFO ] Flatten gal took : 11 ms
[2025-05-29 19:47:17] [INFO ] Flatten gal took : 10 ms
[2025-05-29 19:47:17] [INFO ] Time to serialize gal into /tmp/CTLFireability1722468391942370594.gal : 2 ms
[2025-05-29 19:47:17] [INFO ] Time to serialize properties into /tmp/CTLFireability16262296079583356006.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/CTLFireability1722468391942370594.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16262296079583356006.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.
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.43436e+17,5.94236,126368,2,46307,5,305533,6,0,1317,688791,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-29 19:47:47] [INFO ] Flatten gal took : 12 ms
[2025-05-29 19:47:47] [INFO ] Applying decomposition
[2025-05-29 19:47:47] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14312191722145917372.txt' '-o' '/tmp/graph14312191722145917372.bin' '-w' '/tmp/graph14312191722145917372.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14312191722145917372.bin' '-l' '-1' '-v' '-w' '/tmp/graph14312191722145917372.weights' '-q' '0' '-e' '0.001'
[2025-05-29 19:47:47] [INFO ] Decomposing Gal with order
[2025-05-29 19:47:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 19:47:47] [INFO ] Removed a total of 68 redundant transitions.
[2025-05-29 19:47:47] [INFO ] Flatten gal took : 30 ms
[2025-05-29 19:47:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 8 ms.
[2025-05-29 19:47:47] [INFO ] Time to serialize gal into /tmp/CTLFireability7468278455388257341.gal : 5 ms
[2025-05-29 19:47:47] [INFO ] Time to serialize properties into /tmp/CTLFireability9656311534938558625.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/CTLFireability7468278455388257341.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9656311534938558625.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,1.43436e+17,1.73183,38776,6750,29,48839,493,573,129778,45,1252,0
Converting to forward existential form...Done !
original formula: AX(EF((E(!(AX((i15.u10.p23==1))) U EX((i12.i1.u63.p205==1))) + ((A((i17.u89.p333==1) U (i14.i1.u55.p167==1)) * EF((i0.i2.u77.p262==1))) *...181
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U (E(!(!(EX(!((i15.u10.p23==1))))) U EX((i12.i1.u63.p205==1))) + ((!((E(!((i14.i1.u55.p167...321
Reverse transition relation is NOT exact ! Due to transitions t159, t164, t203, t205, t206, t210, t216, i0.i0.u43.t101, i0.i1.u41.t104, i0.i2.t34, i0.i2.u7...886
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 274/274 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 288 transition count 241
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 288 transition count 241
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 67 place count 288 transition count 240
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 82 place count 273 transition count 225
Iterating global reduction 1 with 15 rules applied. Total rules applied 97 place count 273 transition count 225
Applied a total of 97 rules in 16 ms. Remains 273 /321 variables (removed 48) and now considering 225/274 (removed 49) transitions.
// Phase 1: matrix 225 rows 273 cols
[2025-05-29 19:48:18] [INFO ] Computed 55 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:48:18] [INFO ] Implicit Places using invariants in 213 ms returned []
[2025-05-29 19:48:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:48:19] [INFO ] Implicit Places using invariants and state equation in 828 ms returned []
Implicit Place search using SMT with State Equation took 1042 ms to find 0 implicit places.
Running 224 sub problems to find dead transitions.
[2025-05-29 19:48:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/273 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:48:25] [INFO ] Deduced a trap composed of 9 places in 205 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:48:25] [INFO ] Deduced a trap composed of 10 places in 164 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:48:26] [INFO ] Deduced a trap composed of 11 places in 196 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:48:26] [INFO ] Deduced a trap composed of 12 places in 191 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:48:26] [INFO ] Deduced a trap composed of 13 places in 203 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:48:26] [INFO ] Deduced a trap composed of 14 places in 183 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:48:26] [INFO ] Deduced a trap composed of 15 places in 180 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:48:27] [INFO ] Deduced a trap composed of 16 places in 185 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:48:27] [INFO ] Deduced a trap composed of 17 places in 169 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:48:27] [INFO ] Deduced a trap composed of 19 places in 177 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:48:27] [INFO ] Deduced a trap composed of 21 places in 197 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:48:27] [INFO ] Deduced a trap composed of 23 places in 184 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:48:28] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:48:28] [INFO ] Deduced a trap composed of 23 places in 169 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:48:28] [INFO ] Deduced a trap composed of 25 places in 189 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:48:28] [INFO ] Deduced a trap composed of 27 places in 177 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:48:29] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:48:29] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:48:29] [INFO ] Deduced a trap composed of 22 places in 203 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:48:29] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:48:31] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:48:31] [INFO ] Deduced a trap composed of 15 places in 187 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:48:31] [INFO ] Deduced a trap composed of 16 places in 151 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:48:31] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:48:32] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:48:32] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:48:32] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:48:32] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 8/83 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:48:36] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:48:37] [INFO ] Deduced a trap composed of 28 places in 145 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:48:39] [INFO ] Deduced a trap composed of 31 places in 170 ms of which 24 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (OVERLAPS) 225/498 variables, 273/359 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:48:48] [INFO ] Deduced a trap composed of 8 places in 191 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:48:48] [INFO ] Deduced a trap composed of 8 places in 166 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:48:48] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:48:49] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 10 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 498/498 variables, and 363 constraints, problems are : Problem set: 0 solved, 224 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/273 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 35/90 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (OVERLAPS) 225/498 variables, 273/363 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/498 variables, 224/587 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:48:59] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:49:00] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:49:00] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:49:01] [INFO ] Deduced a trap composed of 11 places in 197 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:49:02] [INFO ] Deduced a trap composed of 14 places in 178 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:49:02] [INFO ] Deduced a trap composed of 20 places in 153 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:49:02] [INFO ] Deduced a trap composed of 21 places in 159 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:49:02] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:49:02] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:49:02] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:49:03] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:49:03] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:49:03] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:49:04] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:49:05] [INFO ] Deduced a trap composed of 28 places in 132 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:49:06] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:49:06] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:49:08] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:49:08] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:49:08] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/498 variables, 20/607 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:49:15] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:49:16] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:49:19] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:49:19] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 11 ms to minimize.
SMT process timed out in 60068ms, After SMT, problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 60069ms
Starting structural reductions in LTL mode, iteration 1 : 273/321 places, 225/274 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61128 ms. Remains : 273/321 places, 225/274 transitions.
[2025-05-29 19:49:19] [INFO ] Flatten gal took : 10 ms
[2025-05-29 19:49:19] [INFO ] Flatten gal took : 9 ms
[2025-05-29 19:49:19] [INFO ] Input system was already deterministic with 225 transitions.
[2025-05-29 19:49:19] [INFO ] Flatten gal took : 9 ms
[2025-05-29 19:49:19] [INFO ] Flatten gal took : 8 ms
[2025-05-29 19:49:19] [INFO ] Time to serialize gal into /tmp/CTLFireability3680908806640416826.gal : 3 ms
[2025-05-29 19:49:19] [INFO ] Time to serialize properties into /tmp/CTLFireability5912621100715741926.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/CTLFireability3680908806640416826.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5912621100715741926.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46575e+17,4.97173,98960,2,41477,5,237604,6,0,1317,544924,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-29 19:49:49] [INFO ] Flatten gal took : 7 ms
[2025-05-29 19:49:49] [INFO ] Applying decomposition
[2025-05-29 19:49:49] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9249803496778487668.txt' '-o' '/tmp/graph9249803496778487668.bin' '-w' '/tmp/graph9249803496778487668.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9249803496778487668.bin' '-l' '-1' '-v' '-w' '/tmp/graph9249803496778487668.weights' '-q' '0' '-e' '0.001'
[2025-05-29 19:49:49] [INFO ] Decomposing Gal with order
[2025-05-29 19:49:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 19:49:49] [INFO ] Removed a total of 71 redundant transitions.
[2025-05-29 19:49:49] [INFO ] Flatten gal took : 16 ms
[2025-05-29 19:49:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-05-29 19:49:49] [INFO ] Time to serialize gal into /tmp/CTLFireability8015261818365461037.gal : 3 ms
[2025-05-29 19:49:49] [INFO ] Time to serialize properties into /tmp/CTLFireability629917310975648400.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/CTLFireability8015261818365461037.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability629917310975648400.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46575e+17,0.464007,13768,2563,27,16365,354,565,33106,38,785,0
Converting to forward existential form...Done !
original formula: A((!(EF(AX((i16.u83.p295==1)))) + (E((((i2.u16.p44==1)&&(i14.u57.p174==1))&&(i2.u84.p299==1)) U ((((i15.i1.u65.p207==1)&&(i7.i0.u33.p103=...395
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(!((E(TRUE U !(EX(!((i1.u5.p12==1))))) + EX((i17.u85.p301==1))))))))))) * !(E(!(!(E...777
Reverse transition relation is NOT exact ! Due to transitions t105, t155, t159, t203, t205, t206, t207, t216, i0.u43.t101, i0.u76.t37, i0.u77.t34, i1.u25.t...908
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 274/274 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 285 transition count 238
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 285 transition count 238
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 73 place count 285 transition count 237
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 88 place count 270 transition count 222
Iterating global reduction 1 with 15 rules applied. Total rules applied 103 place count 270 transition count 222
Applied a total of 103 rules in 24 ms. Remains 270 /321 variables (removed 51) and now considering 222/274 (removed 52) transitions.
// Phase 1: matrix 222 rows 270 cols
[2025-05-29 19:50:19] [INFO ] Computed 55 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:50:19] [INFO ] Implicit Places using invariants in 264 ms returned []
[2025-05-29 19:50:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:50:20] [INFO ] Implicit Places using invariants and state equation in 1023 ms returned []
Implicit Place search using SMT with State Equation took 1292 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2025-05-29 19:50:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:50:27] [INFO ] Deduced a trap composed of 9 places in 186 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:50:27] [INFO ] Deduced a trap composed of 10 places in 178 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:50:27] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:50:27] [INFO ] Deduced a trap composed of 12 places in 181 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:50:27] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:50:28] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:50:28] [INFO ] Deduced a trap composed of 15 places in 180 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:50:28] [INFO ] Deduced a trap composed of 16 places in 182 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:50:28] [INFO ] Deduced a trap composed of 17 places in 167 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:50:28] [INFO ] Deduced a trap composed of 19 places in 165 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:50:29] [INFO ] Deduced a trap composed of 21 places in 181 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:50:29] [INFO ] Deduced a trap composed of 23 places in 177 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:50:29] [INFO ] Deduced a trap composed of 23 places in 185 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:50:29] [INFO ] Deduced a trap composed of 23 places in 184 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:50:29] [INFO ] Deduced a trap composed of 25 places in 157 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:50:29] [INFO ] Deduced a trap composed of 27 places in 174 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:50:30] [INFO ] Deduced a trap composed of 14 places in 190 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:50:31] [INFO ] Deduced a trap composed of 15 places in 174 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:50:31] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:50:31] [INFO ] Deduced a trap composed of 17 places in 153 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:50:33] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:50:33] [INFO ] Deduced a trap composed of 31 places in 171 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:50:33] [INFO ] Deduced a trap composed of 22 places in 185 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:50:33] [INFO ] Deduced a trap composed of 32 places in 160 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:50:33] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 5/80 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:50:38] [INFO ] Deduced a trap composed of 29 places in 163 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:50:38] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:50:40] [INFO ] Deduced a trap composed of 30 places in 171 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:50:40] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:50:40] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 21 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 3/85 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:50:43] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 222/492 variables, 270/356 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 492/492 variables, and 356 constraints, problems are : Problem set: 0 solved, 221 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 31/86 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 222/492 variables, 270/356 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/492 variables, 221/577 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:51:00] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:51:00] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:51:00] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:51:00] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:51:01] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:51:03] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:51:03] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:51:03] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:51:03] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:51:03] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:51:04] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:51:04] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:51:04] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:51:05] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:51:05] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:51:06] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:51:06] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:51:06] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:51:06] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:51:08] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 20/597 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:51:14] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:51:16] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:51:16] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:51:17] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:51:17] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:51:17] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:51:18] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 18 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 492/492 variables, and 604 constraints, problems are : Problem set: 0 solved, 221 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 58/58 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60057ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 60059ms
Starting structural reductions in LTL mode, iteration 1 : 270/321 places, 222/274 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61378 ms. Remains : 270/321 places, 222/274 transitions.
[2025-05-29 19:51:20] [INFO ] Flatten gal took : 9 ms
[2025-05-29 19:51:20] [INFO ] Flatten gal took : 10 ms
[2025-05-29 19:51:20] [INFO ] Input system was already deterministic with 222 transitions.
[2025-05-29 19:51:20] [INFO ] Flatten gal took : 13 ms
[2025-05-29 19:51:20] [INFO ] Flatten gal took : 9 ms
[2025-05-29 19:51:20] [INFO ] Time to serialize gal into /tmp/CTLFireability10317713276103774408.gal : 2 ms
[2025-05-29 19:51:20] [INFO ] Time to serialize properties into /tmp/CTLFireability7920888005361916119.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/CTLFireability10317713276103774408.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7920888005361916119.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.
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.41031e+17,4.91564,95836,2,41295,5,235767,6,0,1302,521291,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-29 19:51:50] [INFO ] Flatten gal took : 5 ms
[2025-05-29 19:51:50] [INFO ] Applying decomposition
[2025-05-29 19:51:50] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1010529879869797666.txt' '-o' '/tmp/graph1010529879869797666.bin' '-w' '/tmp/graph1010529879869797666.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1010529879869797666.bin' '-l' '-1' '-v' '-w' '/tmp/graph1010529879869797666.weights' '-q' '0' '-e' '0.001'
[2025-05-29 19:51:50] [INFO ] Decomposing Gal with order
[2025-05-29 19:51:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 19:51:51] [INFO ] Removed a total of 71 redundant transitions.
[2025-05-29 19:51:51] [INFO ] Flatten gal took : 30 ms
[2025-05-29 19:51:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 7 ms.
[2025-05-29 19:51:51] [INFO ] Time to serialize gal into /tmp/CTLFireability653111093440684676.gal : 4 ms
[2025-05-29 19:51:51] [INFO ] Time to serialize properties into /tmp/CTLFireability7873854688624436848.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/CTLFireability653111093440684676.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7873854688624436848.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.41031e+17,1.88789,50336,9434,26,62624,400,548,208245,37,878,0
Converting to forward existential form...Done !
original formula: AF(AX(((i3.i1.u85.p314==1) + AG((i3.i0.u22.p65==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(((i3.i1.u85.p314==1) + !(E(TRUE U !((i3.i0.u22.p65==0))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t101, t152, t161, t200, t207, t213, i0.u33.t116, i1.u37.t108, i2.u29.t124, i2.u31.t120, i3.i0...881
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
(forward)formula 0,0,24.9531,546144,1,0,1.03552e+06,400,3566,1.95934e+06,187,878,2254378
FORMULA BusinessProcesses-PT-05-CTLFireability-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 321/321 places, 274/274 transitions.
Graph (trivial) has 187 edges and 321 vertex of which 7 / 321 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 653 edges and 315 vertex of which 314 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 58 place count 313 transition count 208
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 114 place count 257 transition count 208
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 53 Pre rules applied. Total rules applied 114 place count 257 transition count 155
Deduced a syphon composed of 53 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 119 rules applied. Total rules applied 233 place count 191 transition count 155
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 268 place count 156 transition count 120
Iterating global reduction 2 with 35 rules applied. Total rules applied 303 place count 156 transition count 120
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 303 place count 156 transition count 117
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 311 place count 151 transition count 117
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 137 rules applied. Total rules applied 448 place count 82 transition count 49
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 450 place count 81 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 451 place count 80 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 452 place count 79 transition count 47
Applied a total of 452 rules in 36 ms. Remains 79 /321 variables (removed 242) and now considering 47/274 (removed 227) transitions.
// Phase 1: matrix 47 rows 79 cols
[2025-05-29 19:52:16] [INFO ] Computed 38 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:52:16] [INFO ] Implicit Places using invariants in 114 ms returned []
[2025-05-29 19:52:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:52:16] [INFO ] Implicit Places using invariants and state equation in 249 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 51, 52, 54, 56, 58, 60]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 365 ms to find 38 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 41/321 places, 47/274 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 41 transition count 40
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 34 transition count 40
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 19 place count 29 transition count 35
Iterating global reduction 2 with 5 rules applied. Total rules applied 24 place count 29 transition count 35
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 2 with 3 rules applied. Total rules applied 27 place count 29 transition count 32
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 30 place count 26 transition count 32
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 32 place count 25 transition count 31
Applied a total of 32 rules in 8 ms. Remains 25 /41 variables (removed 16) and now considering 31/47 (removed 16) transitions.
// Phase 1: matrix 31 rows 25 cols
[2025-05-29 19:52:16] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:52:16] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-05-29 19:52:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:52:16] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 25/321 places, 31/274 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 508 ms. Remains : 25/321 places, 31/274 transitions.
[2025-05-29 19:52:16] [INFO ] Flatten gal took : 2 ms
[2025-05-29 19:52:16] [INFO ] Flatten gal took : 1 ms
[2025-05-29 19:52:16] [INFO ] Input system was already deterministic with 31 transitions.
[2025-05-29 19:52:16] [INFO ] Flatten gal took : 1 ms
[2025-05-29 19:52:16] [INFO ] Flatten gal took : 1 ms
[2025-05-29 19:52:16] [INFO ] Time to serialize gal into /tmp/CTLFireability14260299682249062206.gal : 1 ms
[2025-05-29 19:52:16] [INFO ] Time to serialize properties into /tmp/CTLFireability9735479199215371343.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/CTLFireability14260299682249062206.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9735479199215371343.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.
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,51,0.015428,3892,2,71,5,547,6,0,130,575,0
Converting to forward existential form...Done !
original formula: EF(AG((p237==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((p237==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t10, t29, Intersection with reachable at each step enabled. (destroyed/reverse/inter...177
(forward)formula 0,1,0.033144,4276,1,0,49,2313,83,31,748,1606,71
FORMULA BusinessProcesses-PT-05-CTLFireability-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 321/321 places, 274/274 transitions.
Graph (trivial) has 186 edges and 321 vertex of which 7 / 321 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 653 edges and 315 vertex of which 314 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 57 place count 313 transition count 209
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 112 place count 258 transition count 209
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 54 Pre rules applied. Total rules applied 112 place count 258 transition count 155
Deduced a syphon composed of 54 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 121 rules applied. Total rules applied 233 place count 191 transition count 155
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 268 place count 156 transition count 120
Iterating global reduction 2 with 35 rules applied. Total rules applied 303 place count 156 transition count 120
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 303 place count 156 transition count 118
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 308 place count 153 transition count 118
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 137 rules applied. Total rules applied 445 place count 84 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 447 place count 83 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 448 place count 82 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 449 place count 81 transition count 48
Applied a total of 449 rules in 49 ms. Remains 81 /321 variables (removed 240) and now considering 48/274 (removed 226) transitions.
// Phase 1: matrix 48 rows 81 cols
[2025-05-29 19:52:16] [INFO ] Computed 39 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:52:16] [INFO ] Implicit Places using invariants in 110 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 111 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 80/321 places, 48/274 transitions.
Applied a total of 0 rules in 4 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 166 ms. Remains : 80/321 places, 48/274 transitions.
[2025-05-29 19:52:16] [INFO ] Flatten gal took : 3 ms
[2025-05-29 19:52:16] [INFO ] Flatten gal took : 3 ms
[2025-05-29 19:52:16] [INFO ] Input system was already deterministic with 48 transitions.
[2025-05-29 19:52:16] [INFO ] Flatten gal took : 2 ms
RANDOM walk for 195 steps (58 resets) in 7 ms. (24 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-05-CTLFireability-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-05-29 19:52:16] [INFO ] Flatten gal took : 2 ms
[2025-05-29 19:52:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality98029819532945421.gal : 0 ms
[2025-05-29 19:52:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9086767805167125407.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality98029819532945421.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9086767805167125407.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 274/274 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 287 transition count 240
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 287 transition count 240
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 83 place count 272 transition count 225
Iterating global reduction 0 with 15 rules applied. Total rules applied 98 place count 272 transition count 225
Applied a total of 98 rules in 27 ms. Remains 272 /321 variables (removed 49) and now considering 225/274 (removed 49) transitions.
// Phase 1: matrix 225 rows 272 cols
[2025-05-29 19:52:17] [INFO ] Computed 55 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:52:17] [INFO ] Implicit Places using invariants in 170 ms returned []
[2025-05-29 19:52:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:52:17] [INFO ] Implicit Places using invariants and state equation in 675 ms returned []
Implicit Place search using SMT with State Equation took 847 ms to find 0 implicit places.
Running 224 sub problems to find dead transitions.
[2025-05-29 19:52:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/272 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:52:23] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:52:23] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:52:23] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:52:23] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:52:23] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:52:23] [INFO ] Deduced a trap composed of 14 places in 157 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:52:23] [INFO ] Deduced a trap composed of 15 places in 188 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:52:24] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:52:24] [INFO ] Deduced a trap composed of 17 places in 185 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:52:24] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:52:24] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:52:24] [INFO ] Deduced a trap composed of 23 places in 188 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:52:24] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:52:24] [INFO ] Deduced a trap composed of 23 places in 174 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:52:25] [INFO ] Deduced a trap composed of 25 places in 170 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:52:25] [INFO ] Deduced a trap composed of 27 places in 163 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:52:25] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:52:25] [INFO ] Deduced a trap composed of 29 places in 175 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:52:26] [INFO ] Deduced a trap composed of 14 places in 160 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:52:26] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:52:27] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:52:27] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:52:27] [INFO ] Deduced a trap composed of 19 places in 159 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:52:27] [INFO ] Deduced a trap composed of 28 places in 156 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:52:28] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:52:28] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:52:28] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 7/82 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:52:31] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:52:32] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:52:34] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:52:34] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 16 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:52:36] [INFO ] Deduced a trap composed of 29 places in 171 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (OVERLAPS) 225/497 variables, 272/359 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:52:45] [INFO ] Deduced a trap composed of 8 places in 166 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:52:45] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:52:45] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:52:46] [INFO ] Deduced a trap composed of 61 places in 112 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:52:46] [INFO ] Deduced a trap composed of 64 places in 123 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:52:47] [INFO ] Deduced a trap composed of 11 places in 211 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:52:47] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 11 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 497/497 variables, and 366 constraints, problems are : Problem set: 0 solved, 224 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/272 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 39/94 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:52:51] [INFO ] Deduced a trap composed of 30 places in 182 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:52:51] [INFO ] Deduced a trap composed of 35 places in 170 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:52:51] [INFO ] Deduced a trap composed of 36 places in 168 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:52:51] [INFO ] Deduced a trap composed of 38 places in 178 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:52:52] [INFO ] Deduced a trap composed of 43 places in 184 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:52:52] [INFO ] Deduced a trap composed of 44 places in 170 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:52:52] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 7/101 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (OVERLAPS) 225/497 variables, 272/373 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 224/597 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:53:04] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:53:05] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:53:07] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:53:07] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:53:07] [INFO ] Deduced a trap composed of 55 places in 100 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:53:09] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:53:10] [INFO ] Deduced a trap composed of 30 places in 139 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:53:10] [INFO ] Deduced a trap composed of 50 places in 111 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 8/605 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 497/497 variables, and 605 constraints, problems are : Problem set: 0 solved, 224 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 54/54 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60053ms problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 60054ms
Starting structural reductions in LTL mode, iteration 1 : 272/321 places, 225/274 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60929 ms. Remains : 272/321 places, 225/274 transitions.
[2025-05-29 19:53:17] [INFO ] Flatten gal took : 5 ms
[2025-05-29 19:53:17] [INFO ] Flatten gal took : 5 ms
[2025-05-29 19:53:17] [INFO ] Input system was already deterministic with 225 transitions.
[2025-05-29 19:53:17] [INFO ] Flatten gal took : 6 ms
[2025-05-29 19:53:17] [INFO ] Flatten gal took : 6 ms
[2025-05-29 19:53:17] [INFO ] Time to serialize gal into /tmp/CTLFireability1910173156801731453.gal : 1 ms
[2025-05-29 19:53:17] [INFO ] Time to serialize properties into /tmp/CTLFireability4868061571040350191.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/CTLFireability1910173156801731453.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4868061571040350191.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.79872e+17,4.55003,107184,2,42711,5,257628,6,0,1313,592628,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-29 19:53:48] [INFO ] Flatten gal took : 6 ms
[2025-05-29 19:53:48] [INFO ] Applying decomposition
[2025-05-29 19:53:48] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph933042374656351593.txt' '-o' '/tmp/graph933042374656351593.bin' '-w' '/tmp/graph933042374656351593.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph933042374656351593.bin' '-l' '-1' '-v' '-w' '/tmp/graph933042374656351593.weights' '-q' '0' '-e' '0.001'
[2025-05-29 19:53:48] [INFO ] Decomposing Gal with order
[2025-05-29 19:53:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 19:53:48] [INFO ] Removed a total of 73 redundant transitions.
[2025-05-29 19:53:48] [INFO ] Flatten gal took : 29 ms
[2025-05-29 19:53:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 5 ms.
[2025-05-29 19:53:48] [INFO ] Time to serialize gal into /tmp/CTLFireability3610865014438023352.gal : 10 ms
[2025-05-29 19:53:48] [INFO ] Time to serialize properties into /tmp/CTLFireability9143740221912761491.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/CTLFireability3610865014438023352.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9143740221912761491.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,1.79872e+17,1.53491,46000,7158,28,61279,445,561,169310,41,1232,0
Converting to forward existential form...Done !
original formula: ((EG(AX(((EF((((i1.u28.p90==1)&&(i12.u74.p263==1))&&(i19.u75.p367==1))) + (i12.u44.p138==1)) + ((i17.u49.p150==1)||(i19.u75.p268==1))))) ...371
=> equivalent forward existential formula: [(EY((Init * !((EG(!(EX(!(((E(TRUE U (((i1.u28.p90==1)&&(i12.u74.p263==1))&&(i19.u75.p367==1))) + (i12.u44.p138=...742
Reverse transition relation is NOT exact ! Due to transitions t105, t155, t159, t164, t203, t205, t206, t207, t210, t216, i0.u32.t120, i0.u34.t116, i0.u36....858
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 274/274 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 284 transition count 237
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 284 transition count 237
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 75 place count 284 transition count 236
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 92 place count 267 transition count 219
Iterating global reduction 1 with 17 rules applied. Total rules applied 109 place count 267 transition count 219
Applied a total of 109 rules in 13 ms. Remains 267 /321 variables (removed 54) and now considering 219/274 (removed 55) transitions.
// Phase 1: matrix 219 rows 267 cols
[2025-05-29 19:54:18] [INFO ] Computed 55 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:54:18] [INFO ] Implicit Places using invariants in 204 ms returned []
[2025-05-29 19:54:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:54:19] [INFO ] Implicit Places using invariants and state equation in 621 ms returned []
Implicit Place search using SMT with State Equation took 839 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2025-05-29 19:54:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:24] [INFO ] Deduced a trap composed of 9 places in 172 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:24] [INFO ] Deduced a trap composed of 10 places in 179 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:24] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:24] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:24] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:24] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:25] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:25] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:25] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:25] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:25] [INFO ] Deduced a trap composed of 21 places in 183 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:25] [INFO ] Deduced a trap composed of 23 places in 183 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:26] [INFO ] Deduced a trap composed of 23 places in 192 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:26] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:26] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:26] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:27] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:27] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:27] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:27] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:28] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:29] [INFO ] Deduced a trap composed of 28 places in 148 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:29] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:29] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 4/79 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:32] [INFO ] Deduced a trap composed of 29 places in 148 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:33] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 219/486 variables, 267/348 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:39] [INFO ] Deduced a trap composed of 8 places in 182 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:39] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:40] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:40] [INFO ] Deduced a trap composed of 61 places in 115 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:40] [INFO ] Deduced a trap composed of 64 places in 128 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:41] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:41] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 7/355 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:45] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:45] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 2/357 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 486/486 variables, and 357 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 35/90 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:52] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:52] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:52] [INFO ] Deduced a trap composed of 35 places in 175 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:52] [INFO ] Deduced a trap composed of 36 places in 116 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:53] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:53] [INFO ] Deduced a trap composed of 32 places in 167 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:53] [INFO ] Deduced a trap composed of 37 places in 196 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:53] [INFO ] Deduced a trap composed of 38 places in 175 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:53] [INFO ] Deduced a trap composed of 43 places in 168 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:54:54] [INFO ] Deduced a trap composed of 44 places in 160 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 10/100 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 219/486 variables, 267/367 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 218/585 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:55:05] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:55:08] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:55:08] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:55:08] [INFO ] Deduced a trap composed of 30 places in 125 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:55:08] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:55:09] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:55:09] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:55:09] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:55:09] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 27 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 9/594 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/486 variables, and 594 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 54/54 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60084ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 60086ms
Starting structural reductions in LTL mode, iteration 1 : 267/321 places, 219/274 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60940 ms. Remains : 267/321 places, 219/274 transitions.
[2025-05-29 19:55:19] [INFO ] Flatten gal took : 8 ms
[2025-05-29 19:55:19] [INFO ] Flatten gal took : 7 ms
[2025-05-29 19:55:19] [INFO ] Input system was already deterministic with 219 transitions.
[2025-05-29 19:55:19] [INFO ] Flatten gal took : 8 ms
[2025-05-29 19:55:19] [INFO ] Flatten gal took : 8 ms
[2025-05-29 19:55:19] [INFO ] Time to serialize gal into /tmp/CTLFireability11521084015956521744.gal : 2 ms
[2025-05-29 19:55:19] [INFO ] Time to serialize properties into /tmp/CTLFireability14962248775979978261.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/CTLFireability11521084015956521744.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14962248775979978261.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.41012e+17,4.02108,94856,2,39435,5,233790,6,0,1287,522191,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-29 19:55:49] [INFO ] Flatten gal took : 5 ms
[2025-05-29 19:55:49] [INFO ] Applying decomposition
[2025-05-29 19:55:49] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9773054056604580607.txt' '-o' '/tmp/graph9773054056604580607.bin' '-w' '/tmp/graph9773054056604580607.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9773054056604580607.bin' '-l' '-1' '-v' '-w' '/tmp/graph9773054056604580607.weights' '-q' '0' '-e' '0.001'
[2025-05-29 19:55:49] [INFO ] Decomposing Gal with order
[2025-05-29 19:55:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 19:55:49] [INFO ] Removed a total of 70 redundant transitions.
[2025-05-29 19:55:49] [INFO ] Flatten gal took : 13 ms
[2025-05-29 19:55:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 5 ms.
[2025-05-29 19:55:49] [INFO ] Time to serialize gal into /tmp/CTLFireability6169447411067876890.gal : 4 ms
[2025-05-29 19:55:49] [INFO ] Time to serialize properties into /tmp/CTLFireability462305038310940382.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/CTLFireability6169447411067876890.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability462305038310940382.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.41012e+17,0.477052,11692,1649,28,14616,319,514,23800,38,737,0
Converting to forward existential form...Done !
original formula: EX(AG(AF(AX((((i1.i0.u28.p90==0)||(i10.u73.p263==0))||(i18.u74.p367==0))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(!(EG(!(!(EX(!((((i1.i0.u28.p90==0)||(i10.u73.p263==0))||(i18.u74.p367==0))))))))))))] ...163
Reverse transition relation is NOT exact ! Due to transitions t99, t158, t197, t199, t201, t204, t210, i0.u30.t118, i1.i0.u28.t122, i1.i1.u26.t126, i2.u22....828
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,2.38344,55596,1,0,113904,319,3214,163121,183,737,260603
FORMULA BusinessProcesses-PT-05-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 274/274 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 286 transition count 239
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 286 transition count 239
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 71 place count 286 transition count 238
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 88 place count 269 transition count 221
Iterating global reduction 1 with 17 rules applied. Total rules applied 105 place count 269 transition count 221
Applied a total of 105 rules in 13 ms. Remains 269 /321 variables (removed 52) and now considering 221/274 (removed 53) transitions.
// Phase 1: matrix 221 rows 269 cols
[2025-05-29 19:55:51] [INFO ] Computed 55 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:55:51] [INFO ] Implicit Places using invariants in 234 ms returned []
[2025-05-29 19:55:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:55:53] [INFO ] Implicit Places using invariants and state equation in 1042 ms returned []
Implicit Place search using SMT with State Equation took 1284 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2025-05-29 19:55:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:55:59] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:55:59] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:55:59] [INFO ] Deduced a trap composed of 11 places in 161 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:55:59] [INFO ] Deduced a trap composed of 12 places in 166 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:00] [INFO ] Deduced a trap composed of 13 places in 187 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:00] [INFO ] Deduced a trap composed of 14 places in 182 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:00] [INFO ] Deduced a trap composed of 15 places in 184 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:00] [INFO ] Deduced a trap composed of 16 places in 182 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:00] [INFO ] Deduced a trap composed of 17 places in 176 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:01] [INFO ] Deduced a trap composed of 19 places in 180 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:01] [INFO ] Deduced a trap composed of 21 places in 173 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:01] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:01] [INFO ] Deduced a trap composed of 23 places in 169 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:01] [INFO ] Deduced a trap composed of 23 places in 166 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:01] [INFO ] Deduced a trap composed of 25 places in 174 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:02] [INFO ] Deduced a trap composed of 27 places in 169 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:02] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:02] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:03] [INFO ] Deduced a trap composed of 26 places in 200 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:03] [INFO ] Deduced a trap composed of 14 places in 193 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:04] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:04] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:05] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:05] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:05] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:05] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:05] [INFO ] Deduced a trap composed of 29 places in 164 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:06] [INFO ] Deduced a trap composed of 31 places in 165 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:06] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:06] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:06] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:06] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 12/87 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:10] [INFO ] Deduced a trap composed of 21 places in 190 ms of which 22 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 221/490 variables, 269/357 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:19] [INFO ] Deduced a trap composed of 8 places in 208 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:19] [INFO ] Deduced a trap composed of 8 places in 160 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:19] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:20] [INFO ] Deduced a trap composed of 61 places in 99 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:20] [INFO ] Deduced a trap composed of 64 places in 109 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:21] [INFO ] Deduced a trap composed of 11 places in 209 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:21] [INFO ] Deduced a trap composed of 14 places in 178 ms of which 11 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 490/490 variables, and 364 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 40/95 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:26] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:26] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:26] [INFO ] Deduced a trap composed of 35 places in 170 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:26] [INFO ] Deduced a trap composed of 36 places in 143 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:27] [INFO ] Deduced a trap composed of 32 places in 188 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:27] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:27] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:27] [INFO ] Deduced a trap composed of 43 places in 107 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:27] [INFO ] Deduced a trap composed of 44 places in 153 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 9/104 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 221/490 variables, 269/373 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 220/593 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:33] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:35] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:35] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:35] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:36] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:36] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:36] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:36] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:37] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:37] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:37] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:38] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:38] [INFO ] Deduced a trap composed of 47 places in 133 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:39] [INFO ] Deduced a trap composed of 21 places in 172 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:39] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:41] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:42] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:56:42] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 18/611 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 490/490 variables, and 611 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 67/67 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60081ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 60082ms
Starting structural reductions in LTL mode, iteration 1 : 269/321 places, 221/274 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61381 ms. Remains : 269/321 places, 221/274 transitions.
[2025-05-29 19:56:53] [INFO ] Flatten gal took : 5 ms
[2025-05-29 19:56:53] [INFO ] Flatten gal took : 5 ms
[2025-05-29 19:56:53] [INFO ] Input system was already deterministic with 221 transitions.
[2025-05-29 19:56:53] [INFO ] Flatten gal took : 5 ms
[2025-05-29 19:56:53] [INFO ] Flatten gal took : 5 ms
[2025-05-29 19:56:53] [INFO ] Time to serialize gal into /tmp/CTLFireability7478357835194776473.gal : 2 ms
[2025-05-29 19:56:53] [INFO ] Time to serialize properties into /tmp/CTLFireability17348840499413890865.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/CTLFireability7478357835194776473.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17348840499413890865.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.
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.41016e+17,3.98309,100460,2,41462,5,243779,6,0,1297,556317,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-29 19:57:23] [INFO ] Flatten gal took : 10 ms
[2025-05-29 19:57:23] [INFO ] Applying decomposition
[2025-05-29 19:57:23] [INFO ] Flatten gal took : 9 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/graph9139562310967473740.txt' '-o' '/tmp/graph9139562310967473740.bin' '-w' '/tmp/graph9139562310967473740.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9139562310967473740.bin' '-l' '-1' '-v' '-w' '/tmp/graph9139562310967473740.weights' '-q' '0' '-e' '0.001'
[2025-05-29 19:57:23] [INFO ] Decomposing Gal with order
[2025-05-29 19:57:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 19:57:23] [INFO ] Removed a total of 69 redundant transitions.
[2025-05-29 19:57:23] [INFO ] Flatten gal took : 20 ms
[2025-05-29 19:57:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 6 ms.
[2025-05-29 19:57:23] [INFO ] Time to serialize gal into /tmp/CTLFireability15168335130644942887.gal : 5 ms
[2025-05-29 19:57:23] [INFO ] Time to serialize properties into /tmp/CTLFireability14090260424262855816.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/CTLFireability15168335130644942887.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14090260424262855816.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.41016e+17,1.32967,28796,4509,35,39629,575,540,92895,45,1402,0
Converting to forward existential form...Done !
original formula: AG(!(A(EF(AX((i4.u5.p14==1))) U A(((i12.i1.u75.p340==1)||(i5.u7.p17==1)) U EX((i17.i0.u59.p190==1))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!(!((E(!(EX((i17.i0.u59.p190==1))) U (!(((i12.i1.u75.p340==1)||(i5.u7.p17==1))) * !(EX...580
Reverse transition relation is NOT exact ! Due to transitions t101, t151, t160, t199, t201, t202, t203, t206, t212, i0.u38.t104, i1.u32.t116, i1.u34.t112, ...872
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 274/274 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 285 transition count 238
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 285 transition count 238
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 73 place count 285 transition count 237
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 90 place count 268 transition count 220
Iterating global reduction 1 with 17 rules applied. Total rules applied 107 place count 268 transition count 220
Applied a total of 107 rules in 22 ms. Remains 268 /321 variables (removed 53) and now considering 220/274 (removed 54) transitions.
// Phase 1: matrix 220 rows 268 cols
[2025-05-29 19:57:53] [INFO ] Computed 55 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:57:53] [INFO ] Implicit Places using invariants in 200 ms returned []
[2025-05-29 19:57:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:57:54] [INFO ] Implicit Places using invariants and state equation in 1014 ms returned []
Implicit Place search using SMT with State Equation took 1217 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2025-05-29 19:57:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/268 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:00] [INFO ] Deduced a trap composed of 9 places in 182 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:01] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:01] [INFO ] Deduced a trap composed of 11 places in 183 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:01] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:01] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:01] [INFO ] Deduced a trap composed of 14 places in 179 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:02] [INFO ] Deduced a trap composed of 15 places in 180 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:02] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:02] [INFO ] Deduced a trap composed of 17 places in 165 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:02] [INFO ] Deduced a trap composed of 19 places in 170 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:02] [INFO ] Deduced a trap composed of 21 places in 169 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:02] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:03] [INFO ] Deduced a trap composed of 23 places in 169 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:03] [INFO ] Deduced a trap composed of 23 places in 184 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:03] [INFO ] Deduced a trap composed of 25 places in 180 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:03] [INFO ] Deduced a trap composed of 27 places in 173 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:04] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:04] [INFO ] Deduced a trap composed of 21 places in 159 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:04] [INFO ] Deduced a trap composed of 24 places in 169 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:04] [INFO ] Deduced a trap composed of 24 places in 161 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:05] [INFO ] Deduced a trap composed of 27 places in 163 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:05] [INFO ] Deduced a trap composed of 27 places in 165 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:06] [INFO ] Deduced a trap composed of 14 places in 191 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:06] [INFO ] Deduced a trap composed of 14 places in 179 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:06] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:06] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:07] [INFO ] Deduced a trap composed of 17 places in 167 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:07] [INFO ] Deduced a trap composed of 19 places in 161 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:07] [INFO ] Deduced a trap composed of 28 places in 154 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:07] [INFO ] Deduced a trap composed of 18 places in 159 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:07] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:08] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 12/87 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 220/488 variables, 268/355 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:16] [INFO ] Deduced a trap composed of 8 places in 179 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:18] [INFO ] Deduced a trap composed of 11 places in 203 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:18] [INFO ] Deduced a trap composed of 14 places in 161 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 3/358 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 488/488 variables, and 358 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 268/268 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/268 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 35/90 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:28] [INFO ] Deduced a trap composed of 31 places in 201 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:28] [INFO ] Deduced a trap composed of 32 places in 164 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:28] [INFO ] Deduced a trap composed of 32 places in 176 ms of which 27 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 3/93 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:30] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:30] [INFO ] Deduced a trap composed of 32 places in 150 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:30] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (OVERLAPS) 220/488 variables, 268/364 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 219/583 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:38] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:38] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:38] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:39] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:40] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:41] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:41] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:41] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:43] [INFO ] Deduced a trap composed of 56 places in 137 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:43] [INFO ] Deduced a trap composed of 56 places in 137 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:43] [INFO ] Deduced a trap composed of 31 places in 139 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:43] [INFO ] Deduced a trap composed of 31 places in 161 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:43] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:44] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:44] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:45] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:45] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:46] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:46] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:46] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 19 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 20/603 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:58:52] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 18 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/488 variables, and 604 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 268/268 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 62/62 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60048ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 60049ms
Starting structural reductions in LTL mode, iteration 1 : 268/321 places, 220/274 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61291 ms. Remains : 268/321 places, 220/274 transitions.
[2025-05-29 19:58:54] [INFO ] Flatten gal took : 9 ms
[2025-05-29 19:58:54] [INFO ] Flatten gal took : 8 ms
[2025-05-29 19:58:54] [INFO ] Input system was already deterministic with 220 transitions.
[2025-05-29 19:58:54] [INFO ] Flatten gal took : 9 ms
[2025-05-29 19:58:54] [INFO ] Flatten gal took : 8 ms
[2025-05-29 19:58:54] [INFO ] Time to serialize gal into /tmp/CTLFireability8811419024684951548.gal : 2 ms
[2025-05-29 19:58:54] [INFO ] Time to serialize properties into /tmp/CTLFireability4696550592229156314.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/CTLFireability8811419024684951548.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4696550592229156314.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.44274e+17,4.42036,102128,2,41399,5,249449,6,0,1292,560916,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-29 19:59:24] [INFO ] Flatten gal took : 8 ms
[2025-05-29 19:59:24] [INFO ] Applying decomposition
[2025-05-29 19:59:24] [INFO ] Flatten gal took : 9 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/graph970381628928476482.txt' '-o' '/tmp/graph970381628928476482.bin' '-w' '/tmp/graph970381628928476482.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph970381628928476482.bin' '-l' '-1' '-v' '-w' '/tmp/graph970381628928476482.weights' '-q' '0' '-e' '0.001'
[2025-05-29 19:59:24] [INFO ] Decomposing Gal with order
[2025-05-29 19:59:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 19:59:24] [INFO ] Removed a total of 73 redundant transitions.
[2025-05-29 19:59:24] [INFO ] Flatten gal took : 12 ms
[2025-05-29 19:59:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 3 ms.
[2025-05-29 19:59:24] [INFO ] Time to serialize gal into /tmp/CTLFireability8476266894526051317.gal : 3 ms
[2025-05-29 19:59:24] [INFO ] Time to serialize properties into /tmp/CTLFireability5195402135958026261.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/CTLFireability8476266894526051317.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5195402135958026261.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,1.44274e+17,0.963077,26872,4268,23,35326,414,564,84228,38,870,0
Converting to forward existential form...Done !
original formula: EX(AG((!(A((i0.i0.u0.p1==1) U (i16.i1.u70.p250==1))) + ((i15.u52.p156==0)&&(((i10.u38.p118==0)||(i0.i0.u74.p264==0))||(i10.u91.p359==0)))...158
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !((!(!((E(!((i16.i1.u70.p250==1)) U (!((i0.i0.u0.p1==1)) * !((i16.i1.u70.p250==1)))) + E...284
Reverse transition relation is NOT exact ! Due to transitions t100, t150, t154, t159, t198, t201, t202, t205, t211, i0.i0.u74.t30, i0.i1.u76.t23, i1.i0.u27...864
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Detected timeout of ITS tools.
[2025-05-29 19:59:54] [INFO ] Flatten gal took : 6 ms
[2025-05-29 19:59:54] [INFO ] Flatten gal took : 6 ms
[2025-05-29 19:59:54] [INFO ] Applying decomposition
[2025-05-29 19:59:55] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4448110659065483198.txt' '-o' '/tmp/graph4448110659065483198.bin' '-w' '/tmp/graph4448110659065483198.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4448110659065483198.bin' '-l' '-1' '-v' '-w' '/tmp/graph4448110659065483198.weights' '-q' '0' '-e' '0.001'
[2025-05-29 19:59:55] [INFO ] Decomposing Gal with order
[2025-05-29 19:59:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 19:59:55] [INFO ] Removed a total of 64 redundant transitions.
[2025-05-29 19:59:55] [INFO ] Flatten gal took : 18 ms
[2025-05-29 19:59:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-05-29 19:59:55] [INFO ] Time to serialize gal into /tmp/CTLFireability15337558815961827956.gal : 7 ms
[2025-05-29 19:59:55] [INFO ] Time to serialize properties into /tmp/CTLFireability13862432983107688792.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/CTLFireability15337558815961827956.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13862432983107688792.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 8 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.97111e+17,0.493412,12228,2252,49,14794,705,723,27209,53,1994,0
Converting to forward existential form...Done !
original formula: (AF(EX(AF(((i17.u115.p345==0)&&(i4.i0.u10.p26==0))))) * (EF(AG((i17.u101.p296==0))) + !(E(((i3.i1.u66.p175!=1)||(((i4.i0.u12.p30==1)&&(i1...296
=> equivalent forward existential formula: ([FwdG(Init,!(EX(!(EG(!(((i17.u115.p345==0)&&(i4.i0.u10.p26==0))))))))] = FALSE * [FwdG(FwdU((Init * !(E(TRUE U ...383
Reverse transition relation is NOT exact ! Due to transitions t141, t200, t211, i0.i0.u45.t144, i0.i0.u49.t137, i0.i1.u47.t140, i1.u37.t160, i1.u39.t156, i...1343
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
(forward)formula 0,1,18.3504,324036,1,0,495263,705,4626,865169,254,1994,776449
FORMULA BusinessProcesses-PT-05-CTLFireability-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: (EX(((((((i6.u23.p63==1)&&(i6.u26.p69==0)) + AF((((i2.u19.p46==0)||(i14.u74.p203==0))||(i17.u94.p367==0)))) * ((A((i13.u69.p186==1) U (i8...690
=> equivalent forward existential formula: ([(FwdU((Init * EX(((((((i6.u23.p63==1)&&(i6.u26.p69==0)) + !(EG(!((((i2.u19.p46==0)||(i14.u74.p203==0))||(i17.u...3187
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
(forward)formula 1,1,175.594,2199484,1,0,3.04083e+06,705,2574,5.76732e+06,135,1994,1598907
FORMULA BusinessProcesses-PT-05-CTLFireability-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: (AF(((EF((i5.i1.u13.p34==0)) + EX((i17.u113.p341==0))) * EG(AG((i6.u24.p64==1))))) + AG(((i10.i1.u82.p227==1) + EF((((i0.i1.u48.p129==0)&...205
=> equivalent forward existential formula: [((FwdU((Init * !(!(EG(!(((E(TRUE U (i5.i1.u13.p34==0)) + EX((i17.u113.p341==0))) * EG(!(E(TRUE U !((i6.u24.p64=...301
(forward)formula 2,1,190.604,2199484,1,0,3.04083e+06,705,2599,5.76732e+06,136,1994,2006501
FORMULA BusinessProcesses-PT-05-CTLFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: AX(EF((E(!(AX((i5.i0.u9.p23==1))) U EX((i14.u73.p205==1))) + ((A((i17.u111.p333==1) U (i4.i1.u63.p167==1)) * EF((i16.i2.u92.p262==1))) * ...180
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U (E(!(!(EX(!((i5.i0.u9.p23==1))))) U EX((i14.u73.p205==1))) + ((!((E(!((i4.i1.u63.p167==1...318
(forward)formula 3,1,228.762,2199484,1,0,3.04083e+06,705,2723,5.76732e+06,137,1994,3001939
FORMULA BusinessProcesses-PT-05-CTLFireability-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: A((!(EF(AX((i17.u101.p295==1)))) + (E((((i3.i0.u17.p44==1)&&(i3.i1.u65.p174==1))&&(i3.i0.u102.p299==1)) U ((((i11.i1.u76.p207==1)&&(i1.u3...412
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(!((E(TRUE U !(EX(!((i15.i0.u5.p12==1))))) + EX((i19.u103.p301==1))))))))))) * !(E(...802
(forward)formula 4,0,286.243,2426624,1,0,3.46648e+06,705,2325,6.46129e+06,127,1994,598084
FORMULA BusinessProcesses-PT-05-CTLFireability-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: ((EG(AX(((EF((((i16.i0.u34.p90==1)&&(i16.i2.u92.p263==1))&&(i17.u94.p367==1))) + (i9.i1.u51.p138==1)) + ((i13.u57.p150==1)||(i17.u94.p268...396
=> equivalent forward existential formula: [(EY((Init * !((EG(!(EX(!(((E(TRUE U (((i16.i0.u34.p90==1)&&(i16.i2.u92.p263==1))&&(i17.u94.p367==1))) + (i9.i1....777
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 20
(forward)formula 5,1,342.516,2426624,1,0,3.46648e+06,705,2521,6.46129e+06,143,1994,1874667
FORMULA BusinessProcesses-PT-05-CTLFireability-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: AG(!(A(EF(AX((i2.u6.p14==1))) U A(((i17.u93.p340==1)||(i5.i0.u7.p17==1)) U EX((i13.u69.p190==1))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!(!((E(!(EX((i13.u69.p190==1))) U (!(((i17.u93.p340==1)||(i5.i0.u7.p17==1))) * !(EX((i...553
Fast SCC detection found an SCC at level 20
(forward)formula 6,0,384.442,2426624,1,0,3.46648e+06,705,2535,6.46129e+06,144,1994,2675395
FORMULA BusinessProcesses-PT-05-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EX(AG((!(A((i0.i0.u0.p1==1) U (i9.i2.u88.p250==1))) + ((i12.i1.u60.p156==0)&&(((i16.i2.u44.p118==0)||(i16.i2.u92.p264==0))||(i8.u120.p359...164
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !((!(!((E(!((i9.i2.u88.p250==1)) U (!((i0.i0.u0.p1==1)) * !((i9.i2.u88.p250==1)))) + EG(...288
(forward)formula 7,0,402.732,2522752,1,0,3.46648e+06,772,2838,6.46129e+06,150,1994,3068598
FORMULA BusinessProcesses-PT-05-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1571730 ms.
BK_STOP 1748549198685
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-05"
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 BusinessProcesses-PT-05, 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 r030-smll-174853813200034"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-05.tgz
mv BusinessProcesses-PT-05 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 '
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 ;