Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r100-smll-174867008300658.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 HealthRecord-PT-16, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867008300658
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 125K 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 HealthRecord-PT-16-CTLFireability-2023-12
FORMULA_NAME HealthRecord-PT-16-CTLFireability-2023-13
FORMULA_NAME HealthRecord-PT-16-CTLFireability-2023-14
FORMULA_NAME HealthRecord-PT-16-CTLFireability-2023-15
FORMULA_NAME HealthRecord-PT-16-CTLFireability-2025-00
FORMULA_NAME HealthRecord-PT-16-CTLFireability-2025-01
FORMULA_NAME HealthRecord-PT-16-CTLFireability-2025-02
FORMULA_NAME HealthRecord-PT-16-CTLFireability-2025-03
FORMULA_NAME HealthRecord-PT-16-CTLFireability-2025-04
FORMULA_NAME HealthRecord-PT-16-CTLFireability-2025-05
FORMULA_NAME HealthRecord-PT-16-CTLFireability-2025-06
FORMULA_NAME HealthRecord-PT-16-CTLFireability-2025-07
FORMULA_NAME HealthRecord-PT-16-CTLFireability-2025-08
FORMULA_NAME HealthRecord-PT-16-CTLFireability-2025-09
FORMULA_NAME HealthRecord-PT-16-CTLFireability-2025-10
FORMULA_NAME HealthRecord-PT-16-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1749006317649

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-04 03:05:20] [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-06-04 03:05:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 03:05:20] [INFO ] Load time of PNML (sax parser for PT used): 166 ms
[2025-06-04 03:05:20] [INFO ] Transformed 453 places.
[2025-06-04 03:05:20] [INFO ] Transformed 594 transitions.
[2025-06-04 03:05:20] [INFO ] Found NUPN structural information;
[2025-06-04 03:05:20] [INFO ] Parsed PT model containing 453 places and 594 transitions and 1333 arcs in 373 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 19 ms.
Support contains 98 out of 453 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 453/453 places, 594/594 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 390 transition count 523
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 390 transition count 523
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 151 place count 365 transition count 489
Iterating global reduction 0 with 25 rules applied. Total rules applied 176 place count 365 transition count 489
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 178 place count 365 transition count 487
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 188 place count 355 transition count 469
Iterating global reduction 1 with 10 rules applied. Total rules applied 198 place count 355 transition count 469
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 199 place count 354 transition count 467
Iterating global reduction 1 with 1 rules applied. Total rules applied 200 place count 354 transition count 467
Applied a total of 200 rules in 163 ms. Remains 354 /453 variables (removed 99) and now considering 467/594 (removed 127) transitions.
// Phase 1: matrix 467 rows 354 cols
[2025-06-04 03:05:21] [INFO ] Computed 14 invariants in 43 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:05:21] [INFO ] Implicit Places using invariants in 591 ms returned []
[2025-06-04 03:05:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:05:22] [INFO ] Implicit Places using invariants and state equation in 535 ms returned []
Implicit Place search using SMT with State Equation took 1231 ms to find 0 implicit places.
Running 466 sub problems to find dead transitions.
[2025-06-04 03:05:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 1/354 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:39] [INFO ] Deduced a trap composed of 44 places in 379 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:39] [INFO ] Deduced a trap composed of 129 places in 287 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:40] [INFO ] Deduced a trap composed of 90 places in 431 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:40] [INFO ] Deduced a trap composed of 141 places in 371 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:41] [INFO ] Deduced a trap composed of 151 places in 438 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:41] [INFO ] Deduced a trap composed of 156 places in 398 ms of which 123 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:42] [INFO ] Deduced a trap composed of 68 places in 397 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:42] [INFO ] Deduced a trap composed of 42 places in 390 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:43] [INFO ] Deduced a trap composed of 69 places in 439 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:43] [INFO ] Deduced a trap composed of 55 places in 360 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:43] [INFO ] Deduced a trap composed of 57 places in 410 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:44] [INFO ] Deduced a trap composed of 71 places in 404 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:44] [INFO ] Deduced a trap composed of 55 places in 273 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:45] [INFO ] Deduced a trap composed of 57 places in 393 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:45] [INFO ] Deduced a trap composed of 71 places in 336 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:45] [INFO ] Deduced a trap composed of 69 places in 336 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:46] [INFO ] Deduced a trap composed of 70 places in 332 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:46] [INFO ] Deduced a trap composed of 73 places in 357 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:47] [INFO ] Deduced a trap composed of 78 places in 355 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:47] [INFO ] Deduced a trap composed of 62 places in 400 ms of which 40 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 354/821 variables, and 34 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/354 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 466 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 1/354 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:59] [INFO ] Deduced a trap composed of 83 places in 235 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:00] [INFO ] Deduced a trap composed of 48 places in 334 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:00] [INFO ] Deduced a trap composed of 56 places in 125 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:01] [INFO ] Deduced a trap composed of 54 places in 161 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:01] [INFO ] Deduced a trap composed of 56 places in 142 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:02] [INFO ] Deduced a trap composed of 64 places in 182 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:02] [INFO ] Deduced a trap composed of 70 places in 173 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:02] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:02] [INFO ] Deduced a trap composed of 66 places in 171 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:02] [INFO ] Deduced a trap composed of 43 places in 219 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:03] [INFO ] Deduced a trap composed of 70 places in 169 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:03] [INFO ] Deduced a trap composed of 76 places in 138 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:03] [INFO ] Deduced a trap composed of 72 places in 256 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:04] [INFO ] Deduced a trap composed of 68 places in 270 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:04] [INFO ] Deduced a trap composed of 73 places in 266 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:05] [INFO ] Deduced a trap composed of 71 places in 286 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:05] [INFO ] Deduced a trap composed of 69 places in 295 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:06] [INFO ] Deduced a trap composed of 76 places in 262 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:06] [INFO ] Deduced a trap composed of 73 places in 260 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:07] [INFO ] Deduced a trap composed of 69 places in 256 ms of which 31 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:09] [INFO ] Deduced a trap composed of 58 places in 126 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:10] [INFO ] Deduced a trap composed of 66 places in 141 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:11] [INFO ] Deduced a trap composed of 43 places in 240 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:13] [INFO ] Deduced a trap composed of 88 places in 228 ms of which 28 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:16] [INFO ] Deduced a trap composed of 71 places in 351 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:16] [INFO ] Deduced a trap composed of 157 places in 263 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:18] [INFO ] Deduced a trap composed of 66 places in 313 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:18] [INFO ] Deduced a trap composed of 90 places in 352 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:22] [INFO ] Deduced a trap composed of 86 places in 293 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:22] [INFO ] Deduced a trap composed of 130 places in 271 ms of which 43 ms to minimize.
SMT process timed out in 60382ms, After SMT, problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 60418ms
Starting structural reductions in LTL mode, iteration 1 : 354/453 places, 467/594 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61859 ms. Remains : 354/453 places, 467/594 transitions.
Support contains 98 out of 354 places after structural reductions.
[2025-06-04 03:06:23] [INFO ] Flatten gal took : 114 ms
[2025-06-04 03:06:23] [INFO ] Flatten gal took : 52 ms
[2025-06-04 03:06:23] [INFO ] Input system was already deterministic with 467 transitions.
Support contains 94 out of 354 places (down from 98) after GAL structural reductions.
RANDOM walk for 40000 steps (180 resets) in 3117 ms. (12 steps per ms) remains 43/70 properties
BEST_FIRST walk for 4002 steps (8 resets) in 60 ms. (65 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (8 resets) in 19 ms. (200 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 43/43 properties
[2025-06-04 03:06:24] [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/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 43 unsolved
Problem AtomicPropp63 is UNSAT
At refinement iteration 1 (OVERLAPS) 106/170 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 184/354 variables, 6/14 constraints. Problems are: Problem set: 1 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:26] [INFO ] Deduced a trap composed of 55 places in 229 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:26] [INFO ] Deduced a trap composed of 57 places in 301 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:26] [INFO ] Deduced a trap composed of 88 places in 200 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:26] [INFO ] Deduced a trap composed of 89 places in 190 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:27] [INFO ] Deduced a trap composed of 43 places in 385 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:27] [INFO ] Deduced a trap composed of 44 places in 365 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:28] [INFO ] Deduced a trap composed of 54 places in 285 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:28] [INFO ] Deduced a trap composed of 58 places in 303 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:28] [INFO ] Deduced a trap composed of 78 places in 232 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:29] [INFO ] Deduced a trap composed of 65 places in 257 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:29] [INFO ] Deduced a trap composed of 89 places in 212 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:29] [INFO ] Deduced a trap composed of 95 places in 267 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:29] [INFO ] Deduced a trap composed of 56 places in 251 ms of which 28 ms to minimize.
SMT process timed out in 5063ms, After SMT, problems are : Problem set: 1 solved, 42 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 62 out of 354 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 354/354 places, 467/467 transitions.
Graph (trivial) has 270 edges and 354 vertex of which 24 / 354 are part of one of the 12 SCC in 6 ms
Free SCC test removed 12 places
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 673 edges and 342 vertex of which 334 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 113 transitions
Trivial Post-agglo rules discarded 113 transitions
Performed 113 trivial Post agglomeration. Transition count delta: 113
Iterating post reduction 0 with 113 rules applied. Total rules applied 115 place count 334 transition count 330
Reduce places removed 113 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 1 with 124 rules applied. Total rules applied 239 place count 221 transition count 319
Reduce places removed 6 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 2 with 15 rules applied. Total rules applied 254 place count 215 transition count 310
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 263 place count 206 transition count 310
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 263 place count 206 transition count 302
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 279 place count 198 transition count 302
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 283 place count 194 transition count 295
Iterating global reduction 4 with 4 rules applied. Total rules applied 287 place count 194 transition count 295
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 2 rules applied. Total rules applied 289 place count 194 transition count 293
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 291 place count 192 transition count 293
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 293 place count 190 transition count 289
Iterating global reduction 6 with 2 rules applied. Total rules applied 295 place count 190 transition count 289
Performed 30 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 355 place count 160 transition count 258
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 357 place count 160 transition count 256
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 361 place count 156 transition count 248
Iterating global reduction 7 with 4 rules applied. Total rules applied 365 place count 156 transition count 248
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 381 place count 148 transition count 283
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 7 with 12 rules applied. Total rules applied 393 place count 148 transition count 271
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 399 place count 145 transition count 298
Free-agglomeration rule applied 5 times.
Iterating global reduction 7 with 5 rules applied. Total rules applied 404 place count 145 transition count 293
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 409 place count 140 transition count 293
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 410 place count 140 transition count 292
Partial Free-agglomeration rule applied 13 times.
Drop transitions (Partial Free agglomeration) removed 13 transitions
Iterating global reduction 8 with 13 rules applied. Total rules applied 423 place count 140 transition count 292
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 424 place count 139 transition count 290
Iterating global reduction 8 with 1 rules applied. Total rules applied 425 place count 139 transition count 290
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 428 place count 139 transition count 287
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 429 place count 138 transition count 286
Iterating global reduction 8 with 1 rules applied. Total rules applied 430 place count 138 transition count 286
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 434 place count 138 transition count 286
Applied a total of 434 rules in 326 ms. Remains 138 /354 variables (removed 216) and now considering 286/467 (removed 181) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 327 ms. Remains : 138/354 places, 286/467 transitions.
RANDOM walk for 40000 steps (2890 resets) in 791 ms. (50 steps per ms) remains 30/42 properties
BEST_FIRST walk for 4004 steps (32 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (35 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (37 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (53 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (39 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (36 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (36 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (34 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (37 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (34 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (19 resets) in 14 ms. (266 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4003 steps (39 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (35 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (40 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (36 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (38 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (35 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (36 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (36 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (35 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (38 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (35 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (36 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (39 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (34 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (40 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (38 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (32 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (41 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (37 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
[2025-06-04 03:06:30] [INFO ] Flow matrix only has 283 transitions (discarded 3 similar events)
// Phase 1: matrix 283 rows 138 cols
[2025-06-04 03:06:30] [INFO ] Computed 6 invariants in 7 ms
[2025-06-04 03:06:30] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 97/138 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Problem AtomicPropp66 is UNSAT
At refinement iteration 3 (OVERLAPS) 283/421 variables, 138/144 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/421 variables, 4/148 constraints. Problems are: Problem set: 1 solved, 28 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:31] [INFO ] Deduced a trap composed of 33 places in 138 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:32] [INFO ] Deduced a trap composed of 36 places in 168 ms of which 23 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/421 variables, 2/150 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/421 variables, 0/150 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 0/421 variables, 0/150 constraints. Problems are: Problem set: 1 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 421/421 variables, and 150 constraints, problems are : Problem set: 1 solved, 28 unsolved in 2915 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 138/138 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 28 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 99/138 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 2/8 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 28 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 4 (OVERLAPS) 283/421 variables, 138/146 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/421 variables, 4/150 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/421 variables, 27/177 constraints. Problems are: Problem set: 2 solved, 27 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:35] [INFO ] Deduced a trap composed of 35 places in 160 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/421 variables, 1/178 constraints. Problems are: Problem set: 2 solved, 27 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:36] [INFO ] Deduced a trap composed of 51 places in 126 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:36] [INFO ] Deduced a trap composed of 35 places in 130 ms of which 15 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 2/180 constraints. Problems are: Problem set: 2 solved, 27 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:37] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:38] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 2/182 constraints. Problems are: Problem set: 2 solved, 27 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:40] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 13 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/421 variables, 1/183 constraints. Problems are: Problem set: 2 solved, 27 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:41] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:41] [INFO ] Deduced a trap composed of 43 places in 162 ms of which 18 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/421 variables, 2/185 constraints. Problems are: Problem set: 2 solved, 27 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:42] [INFO ] Deduced a trap composed of 35 places in 148 ms of which 16 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/421 variables, 1/186 constraints. Problems are: Problem set: 2 solved, 27 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:43] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/421 variables, 1/187 constraints. Problems are: Problem set: 2 solved, 27 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:45] [INFO ] Deduced a trap composed of 37 places in 168 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:45] [INFO ] Deduced a trap composed of 35 places in 134 ms of which 9 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/421 variables, 2/189 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/421 variables, 0/189 constraints. Problems are: Problem set: 2 solved, 27 unsolved
At refinement iteration 16 (OVERLAPS) 0/421 variables, 0/189 constraints. Problems are: Problem set: 2 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 421/421 variables, and 189 constraints, problems are : Problem set: 2 solved, 27 unsolved in 16828 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 138/138 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 27/29 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19768ms problems are : Problem set: 2 solved, 27 unsolved
Fused 27 Parikh solutions to 26 different solutions.
Parikh walk visited 20 properties in 6489 ms.
Support contains 16 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 286/286 transitions.
Graph (trivial) has 121 edges and 138 vertex of which 8 / 138 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 134 transition count 265
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 30 place count 121 transition count 262
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 120 transition count 262
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 31 place count 120 transition count 258
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 39 place count 116 transition count 258
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 55 place count 100 transition count 220
Iterating global reduction 3 with 16 rules applied. Total rules applied 71 place count 100 transition count 220
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 3 with 3 rules applied. Total rules applied 74 place count 100 transition count 217
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 77 place count 97 transition count 217
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 86 place count 88 transition count 199
Iterating global reduction 5 with 9 rules applied. Total rules applied 95 place count 88 transition count 199
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 97 place count 88 transition count 197
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 101 place count 84 transition count 191
Iterating global reduction 6 with 4 rules applied. Total rules applied 105 place count 84 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 106 place count 84 transition count 190
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 107 place count 83 transition count 186
Iterating global reduction 7 with 1 rules applied. Total rules applied 108 place count 83 transition count 186
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 109 place count 83 transition count 185
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 8 with 12 rules applied. Total rules applied 121 place count 77 transition count 179
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 124 place count 74 transition count 167
Iterating global reduction 8 with 3 rules applied. Total rules applied 127 place count 74 transition count 167
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 128 place count 73 transition count 164
Iterating global reduction 8 with 1 rules applied. Total rules applied 129 place count 73 transition count 164
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 130 place count 72 transition count 163
Iterating global reduction 8 with 1 rules applied. Total rules applied 131 place count 72 transition count 163
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 8 with 2 rules applied. Total rules applied 133 place count 71 transition count 162
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 135 place count 70 transition count 164
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 137 place count 70 transition count 162
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 139 place count 69 transition count 170
Free-agglomeration rule applied 7 times.
Iterating global reduction 8 with 7 rules applied. Total rules applied 146 place count 69 transition count 163
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 153 place count 62 transition count 163
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 154 place count 62 transition count 162
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 159 place count 62 transition count 162
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 160 place count 62 transition count 161
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 161 place count 61 transition count 157
Iterating global reduction 10 with 1 rules applied. Total rules applied 162 place count 61 transition count 157
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 164 place count 59 transition count 150
Iterating global reduction 10 with 2 rules applied. Total rules applied 166 place count 59 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 167 place count 59 transition count 149
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 168 place count 59 transition count 149
Applied a total of 168 rules in 85 ms. Remains 59 /138 variables (removed 79) and now considering 149/286 (removed 137) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 59/138 places, 149/286 transitions.
RANDOM walk for 40000 steps (4622 resets) in 783 ms. (51 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (598 resets) in 91 ms. (434 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (548 resets) in 78 ms. (506 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (521 resets) in 86 ms. (459 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40002 steps (539 resets) in 81 ms. (487 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (552 resets) in 88 ms. (449 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (550 resets) in 101 ms. (392 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (549 resets) in 108 ms. (367 steps per ms) remains 6/6 properties
[2025-06-04 03:06:57] [INFO ] Flow matrix only has 136 transitions (discarded 13 similar events)
// Phase 1: matrix 136 rows 59 cols
[2025-06-04 03:06:57] [INFO ] Computed 6 invariants in 3 ms
[2025-06-04 03:06:57] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 46/59 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 136/195 variables, 59/65 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 12/77 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/195 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 77 constraints, problems are : Problem set: 0 solved, 6 unsolved in 351 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 59/59 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 46/59 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 136/195 variables, 59/65 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 12/77 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:06:58] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/195 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 84 constraints, problems are : Problem set: 0 solved, 6 unsolved in 685 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 59/59 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1047ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 2 properties in 305 ms.
Support contains 11 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 149/149 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 59 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 58 transition count 148
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 57 transition count 146
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 57 transition count 146
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 55 transition count 144
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
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 10 place count 54 transition count 146
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 54 transition count 144
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 52 transition count 144
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 15 place count 51 transition count 140
Iterating global reduction 3 with 1 rules applied. Total rules applied 16 place count 51 transition count 140
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 17 place count 50 transition count 137
Iterating global reduction 3 with 1 rules applied. Total rules applied 18 place count 50 transition count 137
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 50 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 20 place count 49 transition count 136
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 24 place count 49 transition count 132
Applied a total of 24 rules in 49 ms. Remains 49 /59 variables (removed 10) and now considering 132/149 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 49/59 places, 132/149 transitions.
RANDOM walk for 40000 steps (4720 resets) in 247 ms. (161 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (627 resets) in 90 ms. (439 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (587 resets) in 56 ms. (701 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (595 resets) in 57 ms. (689 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (576 resets) in 52 ms. (754 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 2179 steps, run visited all 4 properties in 46 ms. (steps per millisecond=47 )
Probabilistic random walk after 2179 steps, saw 713 distinct states, run finished after 56 ms. (steps per millisecond=38 ) properties seen :4
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
FORMULA HealthRecord-PT-16-CTLFireability-2025-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-04 03:06:59] [INFO ] Flatten gal took : 44 ms
[2025-06-04 03:06:59] [INFO ] Flatten gal took : 44 ms
[2025-06-04 03:06:59] [INFO ] Input system was already deterministic with 467 transitions.
Support contains 85 out of 354 places (down from 88) after GAL structural reductions.
Computed a total of 96 stabilizing places and 106 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 467/467 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 326 transition count 428
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 326 transition count 428
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 67 place count 315 transition count 412
Iterating global reduction 0 with 11 rules applied. Total rules applied 78 place count 315 transition count 412
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 80 place count 315 transition count 410
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 87 place count 308 transition count 396
Iterating global reduction 1 with 7 rules applied. Total rules applied 94 place count 308 transition count 396
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 98 place count 304 transition count 390
Iterating global reduction 1 with 4 rules applied. Total rules applied 102 place count 304 transition count 390
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 105 place count 301 transition count 384
Iterating global reduction 1 with 3 rules applied. Total rules applied 108 place count 301 transition count 384
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 111 place count 298 transition count 380
Iterating global reduction 1 with 3 rules applied. Total rules applied 114 place count 298 transition count 380
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 116 place count 296 transition count 377
Iterating global reduction 1 with 2 rules applied. Total rules applied 118 place count 296 transition count 377
Applied a total of 118 rules in 98 ms. Remains 296 /354 variables (removed 58) and now considering 377/467 (removed 90) transitions.
// Phase 1: matrix 377 rows 296 cols
[2025-06-04 03:06:59] [INFO ] Computed 14 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:06:59] [INFO ] Implicit Places using invariants in 164 ms returned []
[2025-06-04 03:06:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:07:00] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 593 ms to find 0 implicit places.
Running 376 sub problems to find dead transitions.
[2025-06-04 03:07:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/295 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (OVERLAPS) 1/296 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 376 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:10] [INFO ] Deduced a trap composed of 32 places in 317 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:10] [INFO ] Deduced a trap composed of 137 places in 297 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:11] [INFO ] Deduced a trap composed of 113 places in 292 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:11] [INFO ] Deduced a trap composed of 55 places in 272 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:12] [INFO ] Deduced a trap composed of 43 places in 228 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:12] [INFO ] Deduced a trap composed of 34 places in 287 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:12] [INFO ] Deduced a trap composed of 45 places in 272 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:13] [INFO ] Deduced a trap composed of 44 places in 279 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:13] [INFO ] Deduced a trap composed of 61 places in 269 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:17] [INFO ] Deduced a trap composed of 48 places in 147 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 376 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:22] [INFO ] Deduced a trap composed of 57 places in 278 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:22] [INFO ] Deduced a trap composed of 140 places in 350 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:23] [INFO ] Deduced a trap composed of 46 places in 302 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:23] [INFO ] Deduced a trap composed of 112 places in 338 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:26] [INFO ] Deduced a trap composed of 48 places in 263 ms of which 36 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 376 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:29] [INFO ] Deduced a trap composed of 113 places in 282 ms of which 53 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 296/673 variables, and 30 constraints, problems are : Problem set: 0 solved, 376 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/296 constraints, PredecessorRefiner: 376/376 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 376 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/295 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (OVERLAPS) 1/296 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 16/30 constraints. Problems are: Problem set: 0 solved, 376 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:35] [INFO ] Deduced a trap composed of 46 places in 172 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:36] [INFO ] Deduced a trap composed of 72 places in 273 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:37] [INFO ] Deduced a trap composed of 68 places in 249 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:37] [INFO ] Deduced a trap composed of 114 places in 320 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:37] [INFO ] Deduced a trap composed of 115 places in 287 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:38] [INFO ] Deduced a trap composed of 68 places in 214 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:38] [INFO ] Deduced a trap composed of 72 places in 209 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:39] [INFO ] Deduced a trap composed of 73 places in 209 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:40] [INFO ] Deduced a trap composed of 75 places in 206 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:40] [INFO ] Deduced a trap composed of 74 places in 214 ms of which 29 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 376 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:44] [INFO ] Deduced a trap composed of 52 places in 218 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:44] [INFO ] Deduced a trap composed of 140 places in 224 ms of which 14 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 376 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:52] [INFO ] Deduced a trap composed of 65 places in 280 ms of which 49 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 376 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:55] [INFO ] Deduced a trap composed of 51 places in 258 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:56] [INFO ] Deduced a trap composed of 60 places in 251 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:56] [INFO ] Deduced a trap composed of 61 places in 211 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:57] [INFO ] Deduced a trap composed of 63 places in 212 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:07:58] [INFO ] Deduced a trap composed of 62 places in 239 ms of which 26 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 376 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 296/673 variables, and 48 constraints, problems are : Problem set: 0 solved, 376 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/296 constraints, PredecessorRefiner: 0/376 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60107ms problems are : Problem set: 0 solved, 376 unsolved
Search for dead transitions found 0 dead transitions in 60111ms
Starting structural reductions in LTL mode, iteration 1 : 296/354 places, 377/467 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60806 ms. Remains : 296/354 places, 377/467 transitions.
[2025-06-04 03:08:00] [INFO ] Flatten gal took : 21 ms
[2025-06-04 03:08:00] [INFO ] Flatten gal took : 19 ms
[2025-06-04 03:08:00] [INFO ] Input system was already deterministic with 377 transitions.
[2025-06-04 03:08:00] [INFO ] Flatten gal took : 17 ms
[2025-06-04 03:08:00] [INFO ] Flatten gal took : 17 ms
[2025-06-04 03:08:00] [INFO ] Time to serialize gal into /tmp/CTLFireability16773338546032795813.gal : 13 ms
[2025-06-04 03:08:00] [INFO ] Time to serialize properties into /tmp/CTLFireability9375595447389608633.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16773338546032795813.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9375595447389608633.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,2.19409e+11,4.9029,99892,2,11737,5,282007,6,0,1563,634997,0


Converting to forward existential form...Done !
original formula: EX((EG(((p236==0) + ((AG((p317==0)) * ((p334==0)||(p375==0))) * (p122==0)))) * (AX((E(((((p81==1)&&(p131==1))&&((p167==1)&&(p203==1)))&&(...280
=> equivalent forward existential formula: ([((EY(Init) * EG(((p236==0) + ((!(E(TRUE U !((p317==0)))) * ((p334==0)||(p375==0))) * (p122==0))))) * !(EX(!((E...522
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t31, t33, t34, t35, t36, t39, t40, t41, t42...708
Detected timeout of ITS tools.
[2025-06-04 03:08:30] [INFO ] Flatten gal took : 17 ms
[2025-06-04 03:08:30] [INFO ] Applying decomposition
[2025-06-04 03:08:30] [INFO ] Flatten gal took : 23 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/graph5231350692081096380.txt' '-o' '/tmp/graph5231350692081096380.bin' '-w' '/tmp/graph5231350692081096380.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5231350692081096380.bin' '-l' '-1' '-v' '-w' '/tmp/graph5231350692081096380.weights' '-q' '0' '-e' '0.001'
[2025-06-04 03:08:30] [INFO ] Decomposing Gal with order
[2025-06-04 03:08:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 03:08:30] [INFO ] Removed a total of 111 redundant transitions.
[2025-06-04 03:08:30] [INFO ] Flatten gal took : 93 ms
[2025-06-04 03:08:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 20 ms.
[2025-06-04 03:08:31] [INFO ] Time to serialize gal into /tmp/CTLFireability12665878859490433805.gal : 21 ms
[2025-06-04 03:08:31] [INFO ] Time to serialize properties into /tmp/CTLFireability629304824878372579.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/CTLFireability12665878859490433805.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability629304824878372579.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.19409e+11,2.50546,54048,2185,124,79902,2957,701,247391,104,12085,0


Converting to forward existential form...Done !
original formula: EX((EG(((i12.u67.p236==0) + ((AG((i18.i0.i1.u87.p317==0)) * ((i3.u85.p334==0)||(i3.u112.p375==0))) * (i5.u28.p122==0)))) * (AX((E(((((i2....434
=> equivalent forward existential formula: ([((EY(Init) * EG(((i12.u67.p236==0) + ((!(E(TRUE U !((i18.i0.i1.u87.p317==0)))) * ((i3.u85.p334==0)||(i3.u112.p...748
Reverse transition relation is NOT exact ! Due to transitions t12, t93, t208, t311, t322, t323, t324, t325, t326, t338, i2.t297, i2.t295, i2.t293, i2.t281,...1171
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 354/354 places, 467/467 transitions.
Graph (trivial) has 405 edges and 354 vertex of which 44 / 354 are part of one of the 16 SCC in 1 ms
Free SCC test removed 28 places
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 144 transitions
Trivial Post-agglo rules discarded 144 transitions
Performed 144 trivial Post agglomeration. Transition count delta: 144
Iterating post reduction 0 with 144 rules applied. Total rules applied 145 place count 325 transition count 291
Reduce places removed 144 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 163 rules applied. Total rules applied 308 place count 181 transition count 272
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 317 place count 172 transition count 272
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 317 place count 172 transition count 265
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 331 place count 165 transition count 265
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 367 place count 129 transition count 199
Iterating global reduction 3 with 36 rules applied. Total rules applied 403 place count 129 transition count 199
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 4 rules applied. Total rules applied 407 place count 129 transition count 195
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 411 place count 125 transition count 195
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 421 place count 115 transition count 178
Iterating global reduction 5 with 10 rules applied. Total rules applied 431 place count 115 transition count 178
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 434 place count 115 transition count 175
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 435 place count 114 transition count 175
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 437 place count 112 transition count 171
Iterating global reduction 7 with 2 rules applied. Total rules applied 439 place count 112 transition count 171
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 440 place count 111 transition count 169
Iterating global reduction 7 with 1 rules applied. Total rules applied 441 place count 111 transition count 169
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 465 place count 99 transition count 157
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 467 place count 99 transition count 155
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 470 place count 96 transition count 149
Iterating global reduction 8 with 3 rules applied. Total rules applied 473 place count 96 transition count 149
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 477 place count 92 transition count 144
Iterating global reduction 8 with 4 rules applied. Total rules applied 481 place count 92 transition count 144
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 484 place count 89 transition count 140
Iterating global reduction 8 with 3 rules applied. Total rules applied 487 place count 89 transition count 140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 488 place count 89 transition count 139
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 490 place count 87 transition count 135
Iterating global reduction 9 with 2 rules applied. Total rules applied 492 place count 87 transition count 135
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 494 place count 85 transition count 131
Iterating global reduction 9 with 2 rules applied. Total rules applied 496 place count 85 transition count 131
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 497 place count 84 transition count 129
Iterating global reduction 9 with 1 rules applied. Total rules applied 498 place count 84 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 499 place count 84 transition count 128
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 501 place count 84 transition count 126
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 10 with 1 rules applied. Total rules applied 502 place count 84 transition count 125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 503 place count 83 transition count 125
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 504 place count 82 transition count 123
Iterating global reduction 12 with 1 rules applied. Total rules applied 505 place count 82 transition count 123
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 506 place count 81 transition count 121
Iterating global reduction 12 with 1 rules applied. Total rules applied 507 place count 81 transition count 121
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 508 place count 80 transition count 120
Iterating global reduction 12 with 1 rules applied. Total rules applied 509 place count 80 transition count 120
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 12 with 2 rules applied. Total rules applied 511 place count 79 transition count 119
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 512 place count 79 transition count 118
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 514 place count 79 transition count 118
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 515 place count 78 transition count 117
Applied a total of 515 rules in 132 ms. Remains 78 /354 variables (removed 276) and now considering 117/467 (removed 350) transitions.
[2025-06-04 03:09:01] [INFO ] Flow matrix only has 109 transitions (discarded 8 similar events)
// Phase 1: matrix 109 rows 78 cols
[2025-06-04 03:09:01] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:09:01] [INFO ] Implicit Places using invariants in 201 ms returned []
[2025-06-04 03:09:01] [INFO ] Flow matrix only has 109 transitions (discarded 8 similar events)
[2025-06-04 03:09:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:09:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-04 03:09:01] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 03:09:01] [INFO ] Redundant transitions in 3 ms returned []
Running 103 sub problems to find dead transitions.
[2025-06-04 03:09:01] [INFO ] Flow matrix only has 109 transitions (discarded 8 similar events)
[2025-06-04 03:09:01] [INFO ] Invariant cache hit.
[2025-06-04 03:09:01] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (OVERLAPS) 7/78 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:09:02] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:09:02] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (OVERLAPS) 108/186 variables, 78/87 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 1/187 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (OVERLAPS) 0/187 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 89 constraints, problems are : Problem set: 0 solved, 103 unsolved in 9541 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 78/78 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (OVERLAPS) 7/78 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:09:11] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:09:12] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:09:12] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 108/186 variables, 78/90 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 103/194 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 11 (OVERLAPS) 1/187 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/187 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 13 (OVERLAPS) 0/187 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 195 constraints, problems are : Problem set: 0 solved, 103 unsolved in 12263 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 78/78 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21838ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 21839ms
Starting structural reductions in SI_CTL mode, iteration 1 : 78/354 places, 117/467 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22339 ms. Remains : 78/354 places, 117/467 transitions.
[2025-06-04 03:09:23] [INFO ] Flatten gal took : 6 ms
[2025-06-04 03:09:23] [INFO ] Flatten gal took : 5 ms
[2025-06-04 03:09:23] [INFO ] Input system was already deterministic with 117 transitions.
[2025-06-04 03:09:23] [INFO ] Flatten gal took : 5 ms
[2025-06-04 03:09:23] [INFO ] Flatten gal took : 5 ms
[2025-06-04 03:09:23] [INFO ] Time to serialize gal into /tmp/CTLFireability100648384556258855.gal : 1 ms
[2025-06-04 03:09:23] [INFO ] Time to serialize properties into /tmp/CTLFireability8061820626200726007.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/CTLFireability100648384556258855.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8061820626200726007.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.72958e+07,0.120822,7724,2,1190,5,18435,6,0,421,16356,0


Converting to forward existential form...Done !
original formula: AG(EF(((p343==1) * EF((p59==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((p343==1) * E(TRUE U (p59==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t6, t7, t9, t11, t12, t16, t18, t22, t106, t108, t110, t112, t113, Intersection ...241
(forward)formula 0,0,0.656162,24048,1,0,181,118028,247,91,2620,70399,240
FORMULA HealthRecord-PT-16-CTLFireability-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 354/354 places, 467/467 transitions.
Graph (trivial) has 406 edges and 354 vertex of which 46 / 354 are part of one of the 17 SCC in 2 ms
Free SCC test removed 29 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 145 transitions
Trivial Post-agglo rules discarded 145 transitions
Performed 145 trivial Post agglomeration. Transition count delta: 145
Iterating post reduction 0 with 145 rules applied. Total rules applied 146 place count 324 transition count 289
Reduce places removed 145 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 164 rules applied. Total rules applied 310 place count 179 transition count 270
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 319 place count 170 transition count 270
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 319 place count 170 transition count 263
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 333 place count 163 transition count 263
Discarding 34 places :
Symmetric choice reduction at 3 with 34 rule applications. Total rules 367 place count 129 transition count 201
Iterating global reduction 3 with 34 rules applied. Total rules applied 401 place count 129 transition count 201
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 3 with 3 rules applied. Total rules applied 404 place count 129 transition count 198
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 407 place count 126 transition count 198
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 416 place count 117 transition count 183
Iterating global reduction 5 with 9 rules applied. Total rules applied 425 place count 117 transition count 183
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 427 place count 117 transition count 181
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 428 place count 116 transition count 180
Iterating global reduction 6 with 1 rules applied. Total rules applied 429 place count 116 transition count 180
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 457 place count 102 transition count 166
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 460 place count 102 transition count 163
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 466 place count 96 transition count 151
Iterating global reduction 7 with 6 rules applied. Total rules applied 472 place count 96 transition count 151
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 477 place count 91 transition count 143
Iterating global reduction 7 with 5 rules applied. Total rules applied 482 place count 91 transition count 143
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 486 place count 87 transition count 138
Iterating global reduction 7 with 4 rules applied. Total rules applied 490 place count 87 transition count 138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 491 place count 87 transition count 137
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 493 place count 85 transition count 133
Iterating global reduction 8 with 2 rules applied. Total rules applied 495 place count 85 transition count 133
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 497 place count 83 transition count 129
Iterating global reduction 8 with 2 rules applied. Total rules applied 499 place count 83 transition count 129
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 500 place count 82 transition count 127
Iterating global reduction 8 with 1 rules applied. Total rules applied 501 place count 82 transition count 127
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 504 place count 82 transition count 124
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 1 rules applied. Total rules applied 505 place count 82 transition count 123
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 506 place count 81 transition count 123
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 506 place count 81 transition count 122
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 508 place count 80 transition count 122
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 509 place count 79 transition count 120
Iterating global reduction 10 with 1 rules applied. Total rules applied 510 place count 79 transition count 120
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 511 place count 78 transition count 118
Iterating global reduction 10 with 1 rules applied. Total rules applied 512 place count 78 transition count 118
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 513 place count 77 transition count 117
Iterating global reduction 10 with 1 rules applied. Total rules applied 514 place count 77 transition count 117
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 10 with 2 rules applied. Total rules applied 516 place count 76 transition count 116
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 517 place count 76 transition count 115
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 518 place count 75 transition count 114
Applied a total of 518 rules in 54 ms. Remains 75 /354 variables (removed 279) and now considering 114/467 (removed 353) transitions.
[2025-06-04 03:09:24] [INFO ] Flow matrix only has 106 transitions (discarded 8 similar events)
// Phase 1: matrix 106 rows 75 cols
[2025-06-04 03:09:24] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:09:24] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-06-04 03:09:24] [INFO ] Flow matrix only has 106 transitions (discarded 8 similar events)
[2025-06-04 03:09:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:09:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 03:09:24] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 03:09:24] [INFO ] Redundant transitions in 5 ms returned []
Running 100 sub problems to find dead transitions.
[2025-06-04 03:09:24] [INFO ] Flow matrix only has 106 transitions (discarded 8 similar events)
[2025-06-04 03:09:24] [INFO ] Invariant cache hit.
[2025-06-04 03:09:24] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 7/75 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:09:25] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:09:25] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:09:25] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 105/180 variables, 75/85 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 1/181 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 0/181 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/181 variables, and 86 constraints, problems are : Problem set: 0 solved, 100 unsolved in 8501 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 75/75 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 7/75 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:09:33] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:09:33] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:09:34] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 105/180 variables, 75/88 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 100/188 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (OVERLAPS) 1/181 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/181 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 12 (OVERLAPS) 0/181 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/181 variables, and 189 constraints, problems are : Problem set: 0 solved, 100 unsolved in 11195 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 75/75 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19718ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 19720ms
Starting structural reductions in SI_CTL mode, iteration 1 : 75/354 places, 114/467 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20031 ms. Remains : 75/354 places, 114/467 transitions.
[2025-06-04 03:09:44] [INFO ] Flatten gal took : 8 ms
[2025-06-04 03:09:44] [INFO ] Flatten gal took : 8 ms
[2025-06-04 03:09:44] [INFO ] Input system was already deterministic with 114 transitions.
[2025-06-04 03:09:44] [INFO ] Flatten gal took : 7 ms
[2025-06-04 03:09:44] [INFO ] Flatten gal took : 7 ms
[2025-06-04 03:09:44] [INFO ] Time to serialize gal into /tmp/CTLFireability8195885994057290181.gal : 2 ms
[2025-06-04 03:09:44] [INFO ] Time to serialize properties into /tmp/CTLFireability13277529993574731340.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/CTLFireability8195885994057290181.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13277529993574731340.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.98902e+07,0.117871,5960,2,779,5,9857,6,0,406,8457,0


Converting to forward existential form...Done !
original formula: AG(AF(E(EG((p306==1)) U (p67!=1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(E(EG((p306==1)) U (p67!=1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t6, t7, t9, t11, t12, t15, t17, t18, t19, t55, t56, t61, t62, t63, t64, t65, t77,...285
(forward)formula 0,0,0.814582,19380,1,0,235,88901,249,113,2520,68464,294
FORMULA HealthRecord-PT-16-CTLFireability-2025-03 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 : 354/354 places, 467/467 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 321 transition count 422
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 321 transition count 422
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 321 transition count 421
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 81 place count 307 transition count 400
Iterating global reduction 1 with 14 rules applied. Total rules applied 95 place count 307 transition count 400
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 97 place count 307 transition count 398
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 105 place count 299 transition count 382
Iterating global reduction 2 with 8 rules applied. Total rules applied 113 place count 299 transition count 382
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 118 place count 294 transition count 375
Iterating global reduction 2 with 5 rules applied. Total rules applied 123 place count 294 transition count 375
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 127 place count 290 transition count 368
Iterating global reduction 2 with 4 rules applied. Total rules applied 131 place count 290 transition count 368
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 132 place count 290 transition count 367
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 134 place count 288 transition count 364
Iterating global reduction 3 with 2 rules applied. Total rules applied 136 place count 288 transition count 364
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 138 place count 286 transition count 361
Iterating global reduction 3 with 2 rules applied. Total rules applied 140 place count 286 transition count 361
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 141 place count 285 transition count 359
Iterating global reduction 3 with 1 rules applied. Total rules applied 142 place count 285 transition count 359
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 143 place count 285 transition count 358
Applied a total of 143 rules in 69 ms. Remains 285 /354 variables (removed 69) and now considering 358/467 (removed 109) transitions.
// Phase 1: matrix 358 rows 285 cols
[2025-06-04 03:09:45] [INFO ] Computed 14 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:09:45] [INFO ] Implicit Places using invariants in 192 ms returned []
[2025-06-04 03:09:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:09:45] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 617 ms to find 0 implicit places.
Running 357 sub problems to find dead transitions.
[2025-06-04 03:09:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 1 (OVERLAPS) 1/285 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 357 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:09:54] [INFO ] Deduced a trap composed of 28 places in 201 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:09:54] [INFO ] Deduced a trap composed of 135 places in 186 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:09:54] [INFO ] Deduced a trap composed of 107 places in 185 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:09:55] [INFO ] Deduced a trap composed of 51 places in 191 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:09:55] [INFO ] Deduced a trap composed of 45 places in 230 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:09:55] [INFO ] Deduced a trap composed of 135 places in 168 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:09:56] [INFO ] Deduced a trap composed of 112 places in 156 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:09:56] [INFO ] Deduced a trap composed of 40 places in 218 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:09:56] [INFO ] Deduced a trap composed of 43 places in 255 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:09:57] [INFO ] Deduced a trap composed of 47 places in 255 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:09:57] [INFO ] Deduced a trap composed of 52 places in 232 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:09:57] [INFO ] Deduced a trap composed of 114 places in 303 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:09:58] [INFO ] Deduced a trap composed of 51 places in 152 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:09:58] [INFO ] Deduced a trap composed of 57 places in 155 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:09:58] [INFO ] Deduced a trap composed of 52 places in 146 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:09:59] [INFO ] Deduced a trap composed of 57 places in 202 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:09:59] [INFO ] Deduced a trap composed of 53 places in 199 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:09:59] [INFO ] Deduced a trap composed of 53 places in 221 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:10:00] [INFO ] Deduced a trap composed of 58 places in 203 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:10:00] [INFO ] Deduced a trap composed of 58 places in 200 ms of which 25 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 357 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:10:04] [INFO ] Deduced a trap composed of 136 places in 191 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:10:06] [INFO ] Deduced a trap composed of 47 places in 92 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 357 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:10:07] [INFO ] Deduced a trap composed of 40 places in 163 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:10:08] [INFO ] Deduced a trap composed of 64 places in 126 ms of which 12 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 357 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:10:12] [INFO ] Deduced a trap composed of 137 places in 167 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:10:14] [INFO ] Deduced a trap composed of 68 places in 124 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:10:15] [INFO ] Deduced a trap composed of 69 places in 133 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:10:15] [INFO ] Deduced a trap composed of 70 places in 140 ms of which 16 ms to minimize.
SMT process timed out in 30064ms, After SMT, problems are : Problem set: 0 solved, 357 unsolved
Search for dead transitions found 0 dead transitions in 30069ms
Starting structural reductions in LTL mode, iteration 1 : 285/354 places, 358/467 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30757 ms. Remains : 285/354 places, 358/467 transitions.
[2025-06-04 03:10:15] [INFO ] Flatten gal took : 19 ms
[2025-06-04 03:10:15] [INFO ] Flatten gal took : 19 ms
[2025-06-04 03:10:15] [INFO ] Input system was already deterministic with 358 transitions.
[2025-06-04 03:10:15] [INFO ] Flatten gal took : 18 ms
[2025-06-04 03:10:15] [INFO ] Flatten gal took : 18 ms
[2025-06-04 03:10:15] [INFO ] Time to serialize gal into /tmp/CTLFireability262086724636500900.gal : 4 ms
[2025-06-04 03:10:15] [INFO ] Time to serialize properties into /tmp/CTLFireability4443898319318278067.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/CTLFireability262086724636500900.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4443898319318278067.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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.51982e+11,2.77324,67148,2,9400,5,198911,6,0,1500,409762,0


Converting to forward existential form...Done !
original formula: AF(E(A((!(AG((p241==1))) * EX(((p156==1)&&(p446==1)))) U !(((p451!=1)&&(!((p77==1)&&(p414==1)))))) U AF((EF((p225==1)) * AG((p247==1)))))...156
=> equivalent forward existential formula: [FwdG(Init,!(E(!((E(!(!(((p451!=1)&&(!((p77==1)&&(p414==1)))))) U (!((!(!(E(TRUE U !((p241==1))))) * EX(((p156==...346
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t31, t34, t35, t36, t39, t40, t41, t44, t49...633
Detected timeout of ITS tools.
[2025-06-04 03:10:46] [INFO ] Flatten gal took : 11 ms
[2025-06-04 03:10:46] [INFO ] Applying decomposition
[2025-06-04 03:10:46] [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/graph14288614855901652698.txt' '-o' '/tmp/graph14288614855901652698.bin' '-w' '/tmp/graph14288614855901652698.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14288614855901652698.bin' '-l' '-1' '-v' '-w' '/tmp/graph14288614855901652698.weights' '-q' '0' '-e' '0.001'
[2025-06-04 03:10:46] [INFO ] Decomposing Gal with order
[2025-06-04 03:10:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 03:10:46] [INFO ] Removed a total of 84 redundant transitions.
[2025-06-04 03:10:46] [INFO ] Flatten gal took : 31 ms
[2025-06-04 03:10:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 13 ms.
[2025-06-04 03:10:46] [INFO ] Time to serialize gal into /tmp/CTLFireability803589549529482211.gal : 9 ms
[2025-06-04 03:10:46] [INFO ] Time to serialize properties into /tmp/CTLFireability17911065954173178472.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/CTLFireability803589549529482211.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17911065954173178472.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.51982e+11,1.62369,36412,1486,203,50956,4511,719,118992,173,20256,0


Converting to forward existential form...Done !
original formula: AF(E(A((!(AG((i13.i1.u66.p241==1))) * EX(((i8.i0.u34.p156==1)&&(i21.i1.u105.p446==1)))) U !(((i0.i1.u96.p451!=1)&&(!((i2.i0.u4.p77==1)&&(...242
=> equivalent forward existential formula: [FwdG(Init,!(E(!((E(!(!(((i0.i1.u96.p451!=1)&&(!((i2.i0.u4.p77==1)&&(i21.i1.u105.p414==1)))))) U (!((!(!(E(TRUE ...494
Reverse transition relation is NOT exact ! Due to transitions t230, t322, i2.i0.u4.t268, i2.i0.u4.t270, i2.i0.u4.t271, i2.i0.u4.t277, i2.i0.u4.t278, i2.i0....1321
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 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local 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
Fast SCC detection found an SCC at level 21
(forward)formula 0,0,16.1786,322748,1,0,640238,16940,5906,844876,1005,69908,1316939
FORMULA HealthRecord-PT-16-CTLFireability-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 467/467 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 321 transition count 422
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 321 transition count 422
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 321 transition count 421
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 80 place count 308 transition count 401
Iterating global reduction 1 with 13 rules applied. Total rules applied 93 place count 308 transition count 401
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 95 place count 308 transition count 399
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 100 place count 303 transition count 390
Iterating global reduction 2 with 5 rules applied. Total rules applied 105 place count 303 transition count 390
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 109 place count 299 transition count 384
Iterating global reduction 2 with 4 rules applied. Total rules applied 113 place count 299 transition count 384
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 115 place count 297 transition count 379
Iterating global reduction 2 with 2 rules applied. Total rules applied 117 place count 297 transition count 379
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 119 place count 295 transition count 377
Iterating global reduction 2 with 2 rules applied. Total rules applied 121 place count 295 transition count 377
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 122 place count 294 transition count 376
Iterating global reduction 2 with 1 rules applied. Total rules applied 123 place count 294 transition count 376
Applied a total of 123 rules in 48 ms. Remains 294 /354 variables (removed 60) and now considering 376/467 (removed 91) transitions.
// Phase 1: matrix 376 rows 294 cols
[2025-06-04 03:11:02] [INFO ] Computed 14 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:11:02] [INFO ] Implicit Places using invariants in 185 ms returned []
[2025-06-04 03:11:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:11:03] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 604 ms to find 0 implicit places.
Running 375 sub problems to find dead transitions.
[2025-06-04 03:11:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/293 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (OVERLAPS) 1/294 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/294 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:11:14] [INFO ] Deduced a trap composed of 28 places in 285 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:11:14] [INFO ] Deduced a trap composed of 40 places in 266 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:11:14] [INFO ] Deduced a trap composed of 116 places in 290 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:11:15] [INFO ] Deduced a trap composed of 136 places in 275 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:11:15] [INFO ] Deduced a trap composed of 109 places in 279 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:11:15] [INFO ] Deduced a trap composed of 56 places in 279 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:11:16] [INFO ] Deduced a trap composed of 70 places in 263 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:11:16] [INFO ] Deduced a trap composed of 142 places in 233 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:11:16] [INFO ] Deduced a trap composed of 45 places in 272 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:11:17] [INFO ] Deduced a trap composed of 43 places in 287 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:11:17] [INFO ] Deduced a trap composed of 75 places in 271 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:11:18] [INFO ] Deduced a trap composed of 71 places in 251 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:11:18] [INFO ] Deduced a trap composed of 70 places in 216 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:11:19] [INFO ] Deduced a trap composed of 74 places in 136 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:11:21] [INFO ] Deduced a trap composed of 51 places in 120 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/294 variables, 15/29 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:11:24] [INFO ] Deduced a trap composed of 140 places in 226 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:11:24] [INFO ] Deduced a trap composed of 47 places in 196 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:11:25] [INFO ] Deduced a trap composed of 51 places in 162 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:11:25] [INFO ] Deduced a trap composed of 42 places in 190 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:11:25] [INFO ] Deduced a trap composed of 52 places in 217 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:11:26] [INFO ] Deduced a trap composed of 53 places in 203 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:11:26] [INFO ] Deduced a trap composed of 58 places in 204 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:11:26] [INFO ] Deduced a trap composed of 58 places in 117 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 8/37 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:11:30] [INFO ] Deduced a trap composed of 116 places in 321 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:11:31] [INFO ] Deduced a trap composed of 75 places in 267 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:11:31] [INFO ] Deduced a trap composed of 76 places in 221 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:11:32] [INFO ] Deduced a trap composed of 76 places in 231 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:11:32] [INFO ] Deduced a trap composed of 142 places in 208 ms of which 13 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 294/670 variables, and 42 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/294 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 375 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/293 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (OVERLAPS) 1/294 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/294 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/294 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:11:37] [INFO ] Deduced a trap composed of 140 places in 166 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:11:42] [INFO ] Deduced a trap composed of 53 places in 134 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:11:42] [INFO ] Deduced a trap composed of 53 places in 134 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:11:45] [INFO ] Deduced a trap composed of 68 places in 171 ms of which 18 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:11:50] [INFO ] Deduced a trap composed of 57 places in 246 ms of which 40 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:11:52] [INFO ] Deduced a trap composed of 125 places in 270 ms of which 56 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 9 (OVERLAPS) 376/670 variables, 294/342 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 670/670 variables, and 717 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 294/294 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60102ms problems are : Problem set: 0 solved, 375 unsolved
Search for dead transitions found 0 dead transitions in 60104ms
Starting structural reductions in LTL mode, iteration 1 : 294/354 places, 376/467 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60759 ms. Remains : 294/354 places, 376/467 transitions.
[2025-06-04 03:12:03] [INFO ] Flatten gal took : 15 ms
[2025-06-04 03:12:03] [INFO ] Flatten gal took : 13 ms
[2025-06-04 03:12:03] [INFO ] Input system was already deterministic with 376 transitions.
[2025-06-04 03:12:03] [INFO ] Flatten gal took : 21 ms
[2025-06-04 03:12:03] [INFO ] Flatten gal took : 14 ms
[2025-06-04 03:12:03] [INFO ] Time to serialize gal into /tmp/CTLFireability4441087810098520180.gal : 5 ms
[2025-06-04 03:12:03] [INFO ] Time to serialize properties into /tmp/CTLFireability8187098590064893114.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/CTLFireability4441087810098520180.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8187098590064893114.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.93163e+11,4.03876,93740,2,10577,5,272278,6,0,1554,588319,0


Converting to forward existential form...Done !
original formula: (AG(AF((p54==0))) + (EF((p450==1)) * EX((EG(AG(((p31==1)&&(p446==1)))) * AX((((p334==1)&&(p445==1))&&(p128==1)))))))
=> equivalent forward existential formula: [FwdG(FwdU((Init * !((E(TRUE U (p450==1)) * EX((EG(!(E(TRUE U !(((p31==1)&&(p446==1)))))) * !(EX(!((((p334==1)&&...213
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t16, t19, t22, t24, t26, t29, t31, t32, t34, t35, t36, t37, t40, t41, t42...688
Detected timeout of ITS tools.
[2025-06-04 03:12:33] [INFO ] Flatten gal took : 9 ms
[2025-06-04 03:12:33] [INFO ] Applying decomposition
[2025-06-04 03:12:33] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11843824500226001415.txt' '-o' '/tmp/graph11843824500226001415.bin' '-w' '/tmp/graph11843824500226001415.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11843824500226001415.bin' '-l' '-1' '-v' '-w' '/tmp/graph11843824500226001415.weights' '-q' '0' '-e' '0.001'
[2025-06-04 03:12:33] [INFO ] Decomposing Gal with order
[2025-06-04 03:12:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 03:12:33] [INFO ] Removed a total of 124 redundant transitions.
[2025-06-04 03:12:33] [INFO ] Flatten gal took : 40 ms
[2025-06-04 03:12:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 12 ms.
[2025-06-04 03:12:33] [INFO ] Time to serialize gal into /tmp/CTLFireability6522132643498695319.gal : 9 ms
[2025-06-04 03:12:33] [INFO ] Time to serialize properties into /tmp/CTLFireability588292261556232225.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/CTLFireability6522132643498695319.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability588292261556232225.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.93163e+11,1.91717,47040,1775,68,70677,692,734,232892,92,2232,0


Converting to forward existential form...Done !
original formula: (AG(AF((i3.i0.u11.p54==0))) + (EF((i2.i0.u114.p450==1)) * EX((EG(AG(((i3.i1.u8.p31==1)&&(i2.i0.u4.p446==1)))) * AX((((i2.i0.u87.p334==1)&...202
=> equivalent forward existential formula: [FwdG(FwdU((Init * !((E(TRUE U (i2.i0.u114.p450==1)) * EX((EG(!(E(TRUE U !(((i3.i1.u8.p31==1)&&(i2.i0.u4.p446==1...281
Reverse transition relation is NOT exact ! Due to transitions t55, t92, t309, t336, t359, i2.t352, i2.t58, i2.t35, i2.t19, i2.i0.t12, i2.i0.t13, i2.i0.t14,...1269
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 1
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
(forward)formula 0,0,9.36926,179264,1,0,314683,1034,6151,713963,477,3641,587800
FORMULA HealthRecord-PT-16-CTLFireability-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 354/354 places, 467/467 transitions.
Graph (trivial) has 403 edges and 354 vertex of which 46 / 354 are part of one of the 17 SCC in 4 ms
Free SCC test removed 29 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 141 place count 324 transition count 294
Reduce places removed 140 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 159 rules applied. Total rules applied 300 place count 184 transition count 275
Reduce places removed 9 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 11 rules applied. Total rules applied 311 place count 175 transition count 273
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 313 place count 173 transition count 273
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 313 place count 173 transition count 265
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 329 place count 165 transition count 265
Discarding 34 places :
Symmetric choice reduction at 4 with 34 rule applications. Total rules 363 place count 131 transition count 203
Iterating global reduction 4 with 34 rules applied. Total rules applied 397 place count 131 transition count 203
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 4 rules applied. Total rules applied 401 place count 131 transition count 199
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 405 place count 127 transition count 199
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 415 place count 117 transition count 182
Iterating global reduction 6 with 10 rules applied. Total rules applied 425 place count 117 transition count 182
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 427 place count 117 transition count 180
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 429 place count 115 transition count 177
Iterating global reduction 7 with 2 rules applied. Total rules applied 431 place count 115 transition count 177
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 451 place count 105 transition count 167
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 454 place count 105 transition count 164
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 459 place count 100 transition count 154
Iterating global reduction 8 with 5 rules applied. Total rules applied 464 place count 100 transition count 154
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 469 place count 95 transition count 147
Iterating global reduction 8 with 5 rules applied. Total rules applied 474 place count 95 transition count 147
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 477 place count 92 transition count 143
Iterating global reduction 8 with 3 rules applied. Total rules applied 480 place count 92 transition count 143
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 483 place count 89 transition count 137
Iterating global reduction 8 with 3 rules applied. Total rules applied 486 place count 89 transition count 137
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 489 place count 86 transition count 131
Iterating global reduction 8 with 3 rules applied. Total rules applied 492 place count 86 transition count 131
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 493 place count 85 transition count 129
Iterating global reduction 8 with 1 rules applied. Total rules applied 494 place count 85 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 495 place count 85 transition count 128
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 498 place count 85 transition count 125
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 1 rules applied. Total rules applied 499 place count 85 transition count 124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 500 place count 84 transition count 124
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 500 place count 84 transition count 123
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 502 place count 83 transition count 123
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 503 place count 82 transition count 121
Iterating global reduction 11 with 1 rules applied. Total rules applied 504 place count 82 transition count 121
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 505 place count 81 transition count 119
Iterating global reduction 11 with 1 rules applied. Total rules applied 506 place count 81 transition count 119
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 507 place count 80 transition count 118
Iterating global reduction 11 with 1 rules applied. Total rules applied 508 place count 80 transition count 118
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 11 with 2 rules applied. Total rules applied 510 place count 79 transition count 117
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 511 place count 79 transition count 116
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 512 place count 79 transition count 116
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 513 place count 78 transition count 115
Applied a total of 513 rules in 72 ms. Remains 78 /354 variables (removed 276) and now considering 115/467 (removed 352) transitions.
[2025-06-04 03:12:43] [INFO ] Flow matrix only has 107 transitions (discarded 8 similar events)
// Phase 1: matrix 107 rows 78 cols
[2025-06-04 03:12:43] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:12:43] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-04 03:12:43] [INFO ] Flow matrix only has 107 transitions (discarded 8 similar events)
[2025-06-04 03:12:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:12:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 03:12:43] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 03:12:43] [INFO ] Redundant transitions in 3 ms returned []
Running 110 sub problems to find dead transitions.
[2025-06-04 03:12:43] [INFO ] Flow matrix only has 107 transitions (discarded 8 similar events)
[2025-06-04 03:12:43] [INFO ] Invariant cache hit.
[2025-06-04 03:12:43] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 3/78 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 110 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:12:44] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:12:44] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:12:44] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 106/184 variables, 78/88 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 1/185 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/185 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 89 constraints, problems are : Problem set: 0 solved, 110 unsolved in 8993 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 78/78 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 3/78 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 110 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:12:53] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 106/184 variables, 78/89 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 110/199 constraints. Problems are: Problem set: 0 solved, 110 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:12:55] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (OVERLAPS) 1/185 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 11 (OVERLAPS) 0/185 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 201 constraints, problems are : Problem set: 0 solved, 110 unsolved in 14670 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 78/78 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23676ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 23677ms
Starting structural reductions in SI_CTL mode, iteration 1 : 78/354 places, 115/467 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23922 ms. Remains : 78/354 places, 115/467 transitions.
[2025-06-04 03:13:06] [INFO ] Flatten gal took : 5 ms
[2025-06-04 03:13:06] [INFO ] Flatten gal took : 5 ms
[2025-06-04 03:13:06] [INFO ] Input system was already deterministic with 115 transitions.
[2025-06-04 03:13:06] [INFO ] Flatten gal took : 7 ms
[2025-06-04 03:13:06] [INFO ] Flatten gal took : 3 ms
[2025-06-04 03:13:06] [INFO ] Time to serialize gal into /tmp/CTLFireability9950011923930936203.gal : 1 ms
[2025-06-04 03:13:06] [INFO ] Time to serialize properties into /tmp/CTLFireability9474956350866608082.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/CTLFireability9950011923930936203.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9474956350866608082.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,2.58051e+07,0.067343,5728,2,831,5,8346,6,0,418,7318,0


Converting to forward existential form...Done !
original formula: A((p93==1) U AF(EG(A(AF((p370==1)) U E((p309==1) U (p205==1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(EG(!((E(!(E((p309==1) U (p205==1))) U (!(!(EG(!((p370==1))))) * !(E((p309==1) U (p205==1...529
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t6, t7, t9, t11, t13, t14, t16, t17, t18, t19, t77, t85, t103, t105, t107, t109, ...266
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,7.29991,164188,1,0,753,971162,263,440,2746,1.06879e+06,833
FORMULA HealthRecord-PT-16-CTLFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 354/354 places, 467/467 transitions.
Graph (trivial) has 406 edges and 354 vertex of which 46 / 354 are part of one of the 17 SCC in 1 ms
Free SCC test removed 29 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 142 transitions
Trivial Post-agglo rules discarded 142 transitions
Performed 142 trivial Post agglomeration. Transition count delta: 142
Iterating post reduction 0 with 142 rules applied. Total rules applied 143 place count 324 transition count 292
Reduce places removed 142 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 161 rules applied. Total rules applied 304 place count 182 transition count 273
Reduce places removed 9 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 11 rules applied. Total rules applied 315 place count 173 transition count 271
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 317 place count 171 transition count 271
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 317 place count 171 transition count 264
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 331 place count 164 transition count 264
Discarding 36 places :
Symmetric choice reduction at 4 with 36 rule applications. Total rules 367 place count 128 transition count 198
Iterating global reduction 4 with 36 rules applied. Total rules applied 403 place count 128 transition count 198
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 4 rules applied. Total rules applied 407 place count 128 transition count 194
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 411 place count 124 transition count 194
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 422 place count 113 transition count 175
Iterating global reduction 6 with 11 rules applied. Total rules applied 433 place count 113 transition count 175
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 436 place count 113 transition count 172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 437 place count 112 transition count 172
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 440 place count 109 transition count 167
Iterating global reduction 8 with 3 rules applied. Total rules applied 443 place count 109 transition count 167
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 444 place count 108 transition count 165
Iterating global reduction 8 with 1 rules applied. Total rules applied 445 place count 108 transition count 165
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 24 rules applied. Total rules applied 469 place count 96 transition count 153
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 472 place count 96 transition count 150
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 476 place count 92 transition count 142
Iterating global reduction 9 with 4 rules applied. Total rules applied 480 place count 92 transition count 142
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 485 place count 87 transition count 136
Iterating global reduction 9 with 5 rules applied. Total rules applied 490 place count 87 transition count 136
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 494 place count 83 transition count 130
Iterating global reduction 9 with 4 rules applied. Total rules applied 498 place count 83 transition count 130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 499 place count 83 transition count 129
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 502 place count 80 transition count 123
Iterating global reduction 10 with 3 rules applied. Total rules applied 505 place count 80 transition count 123
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 508 place count 77 transition count 117
Iterating global reduction 10 with 3 rules applied. Total rules applied 511 place count 77 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 512 place count 77 transition count 116
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 513 place count 76 transition count 114
Iterating global reduction 11 with 1 rules applied. Total rules applied 514 place count 76 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 515 place count 76 transition count 113
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 12 with 3 rules applied. Total rules applied 518 place count 76 transition count 110
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 12 with 2 rules applied. Total rules applied 520 place count 76 transition count 108
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 522 place count 74 transition count 108
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 523 place count 73 transition count 106
Iterating global reduction 14 with 1 rules applied. Total rules applied 524 place count 73 transition count 106
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 525 place count 72 transition count 104
Iterating global reduction 14 with 1 rules applied. Total rules applied 526 place count 72 transition count 104
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 527 place count 71 transition count 103
Iterating global reduction 14 with 1 rules applied. Total rules applied 528 place count 71 transition count 103
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 14 with 2 rules applied. Total rules applied 530 place count 70 transition count 102
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 531 place count 70 transition count 101
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 532 place count 69 transition count 100
Applied a total of 532 rules in 44 ms. Remains 69 /354 variables (removed 285) and now considering 100/467 (removed 367) transitions.
[2025-06-04 03:13:14] [INFO ] Flow matrix only has 92 transitions (discarded 8 similar events)
// Phase 1: matrix 92 rows 69 cols
[2025-06-04 03:13:14] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:13:14] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-04 03:13:14] [INFO ] Flow matrix only has 92 transitions (discarded 8 similar events)
[2025-06-04 03:13:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:13:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 03:13:14] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 03:13:14] [INFO ] Redundant transitions in 2 ms returned []
Running 86 sub problems to find dead transitions.
[2025-06-04 03:13:14] [INFO ] Flow matrix only has 92 transitions (discarded 8 similar events)
[2025-06-04 03:13:14] [INFO ] Invariant cache hit.
[2025-06-04 03:13:14] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 7/69 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:13:15] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:13:15] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:13:15] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (OVERLAPS) 91/160 variables, 69/79 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 1/161 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (OVERLAPS) 0/161 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 161/161 variables, and 80 constraints, problems are : Problem set: 0 solved, 86 unsolved in 5393 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 69/69 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 7/69 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:13:20] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:13:20] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 91/160 variables, 69/81 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 86/167 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (OVERLAPS) 1/161 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/161 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 11 (OVERLAPS) 0/161 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 161/161 variables, and 168 constraints, problems are : Problem set: 0 solved, 86 unsolved in 7149 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 69/69 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12551ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 12551ms
Starting structural reductions in SI_CTL mode, iteration 1 : 69/354 places, 100/467 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12765 ms. Remains : 69/354 places, 100/467 transitions.
[2025-06-04 03:13:27] [INFO ] Flatten gal took : 11 ms
[2025-06-04 03:13:27] [INFO ] Flatten gal took : 5 ms
[2025-06-04 03:13:27] [INFO ] Input system was already deterministic with 100 transitions.
[2025-06-04 03:13:27] [INFO ] Flatten gal took : 4 ms
[2025-06-04 03:13:27] [INFO ] Flatten gal took : 4 ms
[2025-06-04 03:13:27] [INFO ] Time to serialize gal into /tmp/CTLFireability1931027457445282924.gal : 1 ms
[2025-06-04 03:13:27] [INFO ] Time to serialize properties into /tmp/CTLFireability3295640206456806641.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/CTLFireability1931027457445282924.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3295640206456806641.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.3824e+07,0.073976,5172,2,510,5,6573,6,0,368,5112,0


Converting to forward existential form...Done !
original formula: AF(EG(EF((p161==0))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(E(TRUE U (p161==0)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t6, t7, t9, t12, t14, t93, t95, Intersection with reachable at each step enabled...205
(forward)formula 0,1,0.940466,23092,1,0,203,123744,219,106,2357,91234,276
FORMULA HealthRecord-PT-16-CTLFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 467/467 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 331 transition count 437
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 331 transition count 437
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 331 transition count 436
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 57 place count 321 transition count 420
Iterating global reduction 1 with 10 rules applied. Total rules applied 67 place count 321 transition count 420
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 68 place count 321 transition count 419
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 72 place count 317 transition count 411
Iterating global reduction 2 with 4 rules applied. Total rules applied 76 place count 317 transition count 411
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 79 place count 314 transition count 407
Iterating global reduction 2 with 3 rules applied. Total rules applied 82 place count 314 transition count 407
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 84 place count 312 transition count 404
Iterating global reduction 2 with 2 rules applied. Total rules applied 86 place count 312 transition count 404
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 87 place count 312 transition count 403
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 88 place count 311 transition count 402
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 311 transition count 402
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 90 place count 310 transition count 401
Iterating global reduction 3 with 1 rules applied. Total rules applied 91 place count 310 transition count 401
Applied a total of 91 rules in 30 ms. Remains 310 /354 variables (removed 44) and now considering 401/467 (removed 66) transitions.
// Phase 1: matrix 401 rows 310 cols
[2025-06-04 03:13:28] [INFO ] Computed 14 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:13:28] [INFO ] Implicit Places using invariants in 124 ms returned []
[2025-06-04 03:13:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:13:28] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2025-06-04 03:13:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (OVERLAPS) 1/310 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:13:38] [INFO ] Deduced a trap composed of 32 places in 291 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:13:39] [INFO ] Deduced a trap composed of 44 places in 290 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:13:39] [INFO ] Deduced a trap composed of 143 places in 252 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:13:40] [INFO ] Deduced a trap composed of 34 places in 253 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:13:40] [INFO ] Deduced a trap composed of 46 places in 258 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:13:40] [INFO ] Deduced a trap composed of 52 places in 198 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:13:41] [INFO ] Deduced a trap composed of 56 places in 252 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:13:41] [INFO ] Deduced a trap composed of 143 places in 148 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:13:41] [INFO ] Deduced a trap composed of 44 places in 261 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:13:41] [INFO ] Deduced a trap composed of 42 places in 265 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:13:42] [INFO ] Deduced a trap composed of 43 places in 273 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:13:42] [INFO ] Deduced a trap composed of 120 places in 255 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:13:43] [INFO ] Deduced a trap composed of 144 places in 253 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:13:43] [INFO ] Deduced a trap composed of 32 places in 281 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:13:43] [INFO ] Deduced a trap composed of 43 places in 266 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:13:45] [INFO ] Deduced a trap composed of 43 places in 288 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:13:45] [INFO ] Deduced a trap composed of 52 places in 327 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:13:45] [INFO ] Deduced a trap composed of 56 places in 163 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:13:46] [INFO ] Deduced a trap composed of 56 places in 168 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:13:46] [INFO ] Deduced a trap composed of 58 places in 204 ms of which 23 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:13:50] [INFO ] Deduced a trap composed of 139 places in 202 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:13:50] [INFO ] Deduced a trap composed of 111 places in 314 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:13:51] [INFO ] Deduced a trap composed of 119 places in 254 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:13:52] [INFO ] Deduced a trap composed of 62 places in 134 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:13:52] [INFO ] Deduced a trap composed of 59 places in 135 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:13:52] [INFO ] Deduced a trap composed of 64 places in 225 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:13:53] [INFO ] Deduced a trap composed of 61 places in 216 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:13:53] [INFO ] Deduced a trap composed of 63 places in 175 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:13:53] [INFO ] Deduced a trap composed of 65 places in 219 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:13:54] [INFO ] Deduced a trap composed of 62 places in 213 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:13:55] [INFO ] Deduced a trap composed of 80 places in 154 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:13:56] [INFO ] Deduced a trap composed of 54 places in 149 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 12/46 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:13:57] [INFO ] Deduced a trap composed of 44 places in 273 ms of which 41 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 310/711 variables, and 47 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/310 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (OVERLAPS) 1/310 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:14:03] [INFO ] Deduced a trap composed of 145 places in 190 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:14:04] [INFO ] Deduced a trap composed of 54 places in 171 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:14:05] [INFO ] Deduced a trap composed of 45 places in 196 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:14:05] [INFO ] Deduced a trap composed of 46 places in 200 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:14:06] [INFO ] Deduced a trap composed of 70 places in 121 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:14:06] [INFO ] Deduced a trap composed of 74 places in 116 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:14:07] [INFO ] Deduced a trap composed of 74 places in 113 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:14:08] [INFO ] Deduced a trap composed of 76 places in 127 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:14:08] [INFO ] Deduced a trap composed of 75 places in 202 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:14:09] [INFO ] Deduced a trap composed of 56 places in 309 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:14:09] [INFO ] Deduced a trap composed of 53 places in 303 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:14:10] [INFO ] Deduced a trap composed of 67 places in 196 ms of which 33 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 12/59 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:14:11] [INFO ] Deduced a trap composed of 44 places in 288 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:14:11] [INFO ] Deduced a trap composed of 75 places in 185 ms of which 25 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:14:18] [INFO ] Deduced a trap composed of 53 places in 115 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:14:18] [INFO ] Deduced a trap composed of 55 places in 232 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:14:18] [INFO ] Deduced a trap composed of 57 places in 96 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:14:24] [INFO ] Deduced a trap composed of 59 places in 240 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:14:24] [INFO ] Deduced a trap composed of 57 places in 210 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:14:26] [INFO ] Deduced a trap composed of 67 places in 300 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:14:27] [INFO ] Deduced a trap composed of 67 places in 313 ms of which 52 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 310/711 variables, and 68 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/310 constraints, PredecessorRefiner: 0/400 constraints, Known Traps: 54/54 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60085ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 60087ms
Starting structural reductions in LTL mode, iteration 1 : 310/354 places, 401/467 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60571 ms. Remains : 310/354 places, 401/467 transitions.
[2025-06-04 03:14:28] [INFO ] Flatten gal took : 13 ms
[2025-06-04 03:14:28] [INFO ] Flatten gal took : 12 ms
[2025-06-04 03:14:28] [INFO ] Input system was already deterministic with 401 transitions.
[2025-06-04 03:14:28] [INFO ] Flatten gal took : 12 ms
[2025-06-04 03:14:28] [INFO ] Flatten gal took : 12 ms
[2025-06-04 03:14:28] [INFO ] Time to serialize gal into /tmp/CTLFireability12625807615994685500.gal : 4 ms
[2025-06-04 03:14:28] [INFO ] Time to serialize properties into /tmp/CTLFireability5096258658492395576.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/CTLFireability12625807615994685500.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5096258658492395576.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,2.39493e+11,10.2958,206152,2,19295,5,575534,6,0,1643,1.40763e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-04 03:14:58] [INFO ] Flatten gal took : 8 ms
[2025-06-04 03:14:58] [INFO ] Applying decomposition
[2025-06-04 03:14:58] [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/graph6813839402645147421.txt' '-o' '/tmp/graph6813839402645147421.bin' '-w' '/tmp/graph6813839402645147421.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6813839402645147421.bin' '-l' '-1' '-v' '-w' '/tmp/graph6813839402645147421.weights' '-q' '0' '-e' '0.001'
[2025-06-04 03:14:58] [INFO ] Decomposing Gal with order
[2025-06-04 03:14:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 03:14:58] [INFO ] Removed a total of 125 redundant transitions.
[2025-06-04 03:14:58] [INFO ] Flatten gal took : 23 ms
[2025-06-04 03:14:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 9 ms.
[2025-06-04 03:14:58] [INFO ] Time to serialize gal into /tmp/CTLFireability171022617126266781.gal : 6 ms
[2025-06-04 03:14:58] [INFO ] Time to serialize properties into /tmp/CTLFireability14689026913626825197.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/CTLFireability171022617126266781.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14689026913626825197.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.39493e+11,2.49502,63604,1962,218,84882,2935,822,343605,126,13506,0


Converting to forward existential form...Done !
original formula: (AG((((E((i2.i1.u9.p55==1) U EF((i11.i0.u62.p217==1))) + AX(AF((i0.u16.p91==1)))) + (AG(AX((i20.i0.u1.p0==1))) + E((i2.i1.u7.p36==1) U (i...527
=> equivalent forward existential formula: ([FwdG((Init * !(!(E(TRUE U !((((E((i2.i1.u9.p55==1) U E(TRUE U (i11.i0.u62.p217==1))) + !(EX(!(!(EG(!((i0.u16.p...1594
Reverse transition relation is NOT exact ! Due to transitions t333, t344, t345, t346, t347, t348, t357, t358, u23.t281, u74.t147, i2.i1.t294, i2.i1.t298, i...1602
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 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 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
(forward)formula 0,1,15.7585,313392,1,0,435410,12126,6052,1.86759e+06,621,51288,833167
FORMULA HealthRecord-PT-16-CTLFireability-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 467/467 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 324 transition count 427
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 324 transition count 427
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 324 transition count 426
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 74 place count 311 transition count 406
Iterating global reduction 1 with 13 rules applied. Total rules applied 87 place count 311 transition count 406
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 89 place count 311 transition count 404
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 96 place count 304 transition count 390
Iterating global reduction 2 with 7 rules applied. Total rules applied 103 place count 304 transition count 390
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 107 place count 300 transition count 385
Iterating global reduction 2 with 4 rules applied. Total rules applied 111 place count 300 transition count 385
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 115 place count 296 transition count 378
Iterating global reduction 2 with 4 rules applied. Total rules applied 119 place count 296 transition count 378
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 120 place count 296 transition count 377
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 122 place count 294 transition count 375
Iterating global reduction 3 with 2 rules applied. Total rules applied 124 place count 294 transition count 375
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 125 place count 293 transition count 374
Iterating global reduction 3 with 1 rules applied. Total rules applied 126 place count 293 transition count 374
Applied a total of 126 rules in 36 ms. Remains 293 /354 variables (removed 61) and now considering 374/467 (removed 93) transitions.
// Phase 1: matrix 374 rows 293 cols
[2025-06-04 03:15:14] [INFO ] Computed 14 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:15:14] [INFO ] Implicit Places using invariants in 157 ms returned []
[2025-06-04 03:15:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:15:15] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 641 ms to find 0 implicit places.
Running 373 sub problems to find dead transitions.
[2025-06-04 03:15:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/292 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 1 (OVERLAPS) 1/293 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/293 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 373 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:15:26] [INFO ] Deduced a trap composed of 31 places in 298 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:15:27] [INFO ] Deduced a trap composed of 43 places in 300 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:15:28] [INFO ] Deduced a trap composed of 136 places in 252 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:15:28] [INFO ] Deduced a trap composed of 33 places in 263 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:15:28] [INFO ] Deduced a trap composed of 45 places in 243 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:15:28] [INFO ] Deduced a trap composed of 43 places in 147 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:15:32] [INFO ] Deduced a trap composed of 51 places in 154 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:15:32] [INFO ] Deduced a trap composed of 52 places in 156 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 373 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:15:37] [INFO ] Deduced a trap composed of 138 places in 263 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:15:37] [INFO ] Deduced a trap composed of 140 places in 248 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:15:40] [INFO ] Deduced a trap composed of 43 places in 255 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:15:40] [INFO ] Deduced a trap composed of 44 places in 221 ms of which 36 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 373 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:15:42] [INFO ] Deduced a trap composed of 75 places in 315 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:15:42] [INFO ] Deduced a trap composed of 53 places in 318 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:15:43] [INFO ] Deduced a trap composed of 64 places in 144 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:15:44] [INFO ] Deduced a trap composed of 69 places in 145 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:15:44] [INFO ] Deduced a trap composed of 73 places in 143 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:15:45] [INFO ] Deduced a trap composed of 69 places in 218 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:15:45] [INFO ] Deduced a trap composed of 70 places in 162 ms of which 22 ms to minimize.
SMT process timed out in 30119ms, After SMT, problems are : Problem set: 0 solved, 373 unsolved
Search for dead transitions found 0 dead transitions in 30123ms
Starting structural reductions in LTL mode, iteration 1 : 293/354 places, 374/467 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30801 ms. Remains : 293/354 places, 374/467 transitions.
[2025-06-04 03:15:45] [INFO ] Flatten gal took : 7 ms
[2025-06-04 03:15:45] [INFO ] Flatten gal took : 7 ms
[2025-06-04 03:15:45] [INFO ] Input system was already deterministic with 374 transitions.
[2025-06-04 03:15:45] [INFO ] Flatten gal took : 7 ms
[2025-06-04 03:15:45] [INFO ] Flatten gal took : 7 ms
[2025-06-04 03:15:45] [INFO ] Time to serialize gal into /tmp/CTLFireability18429824131669884394.gal : 2 ms
[2025-06-04 03:15:45] [INFO ] Time to serialize properties into /tmp/CTLFireability6415923031223895056.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/CTLFireability18429824131669884394.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6415923031223895056.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.85823e+11,6.53544,125680,2,13969,5,356266,6,0,1548,828868,0


Converting to forward existential form...Done !
original formula: EG(((p113==0) + ((AF((p367==0)) * EG((p367==1))) * ((EX((p399==1)) + (p301==1)) + ((p240==1)||(((p69==1)&&(p446==1))&&(p425==1)))))))
=> equivalent forward existential formula: [FwdG(Init,((p113==0) + ((!(EG(!((p367==0)))) * EG((p367==1))) * ((EX((p399==1)) + (p301==1)) + ((p240==1)||(((p...200
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t31, t32, t33, t35, t36, t37, t38, t41, t42...746
Detected timeout of ITS tools.
[2025-06-04 03:16:15] [INFO ] Flatten gal took : 9 ms
[2025-06-04 03:16:15] [INFO ] Applying decomposition
[2025-06-04 03:16:15] [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/graph6307604578992064158.txt' '-o' '/tmp/graph6307604578992064158.bin' '-w' '/tmp/graph6307604578992064158.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6307604578992064158.bin' '-l' '-1' '-v' '-w' '/tmp/graph6307604578992064158.weights' '-q' '0' '-e' '0.001'
[2025-06-04 03:16:15] [INFO ] Decomposing Gal with order
[2025-06-04 03:16:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 03:16:15] [INFO ] Removed a total of 110 redundant transitions.
[2025-06-04 03:16:15] [INFO ] Flatten gal took : 19 ms
[2025-06-04 03:16:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 5 ms.
[2025-06-04 03:16:15] [INFO ] Time to serialize gal into /tmp/CTLFireability16230354408586669169.gal : 5 ms
[2025-06-04 03:16:15] [INFO ] Time to serialize properties into /tmp/CTLFireability8008431851189876226.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/CTLFireability16230354408586669169.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8008431851189876226.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.85823e+11,0.822474,24736,1241,102,38287,842,751,79279,114,2085,0


Converting to forward existential form...Done !
original formula: EG(((i4.i0.u22.p113==0) + ((AF((i20.u113.p367==0)) * EG((i20.u113.p367==1))) * ((EX((i19.u103.p399==1)) + (i16.u85.p301==1)) + ((i13.i2.u...234
=> equivalent forward existential formula: [FwdG(Init,((i4.i0.u22.p113==0) + ((!(EG(!((i20.u113.p367==0)))) * EG((i20.u113.p367==1))) * ((EX((i19.u103.p399...283
Reverse transition relation is NOT exact ! Due to transitions t12, t178, t310, t320, t321, t322, t323, t324, t332, t333, t334, t335, i0.i0.t282, i0.i0.t291...1333
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 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 : 354/354 places, 467/467 transitions.
Graph (trivial) has 397 edges and 354 vertex of which 44 / 354 are part of one of the 16 SCC in 1 ms
Free SCC test removed 28 places
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 141 place count 325 transition count 295
Reduce places removed 140 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 159 rules applied. Total rules applied 300 place count 185 transition count 276
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 310 place count 176 transition count 275
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 311 place count 175 transition count 275
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 311 place count 175 transition count 268
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 325 place count 168 transition count 268
Discarding 35 places :
Symmetric choice reduction at 4 with 35 rule applications. Total rules 360 place count 133 transition count 207
Iterating global reduction 4 with 35 rules applied. Total rules applied 395 place count 133 transition count 207
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 4 rules applied. Total rules applied 399 place count 133 transition count 203
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 403 place count 129 transition count 203
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 415 place count 117 transition count 182
Iterating global reduction 6 with 12 rules applied. Total rules applied 427 place count 117 transition count 182
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 429 place count 117 transition count 180
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 432 place count 114 transition count 175
Iterating global reduction 7 with 3 rules applied. Total rules applied 435 place count 114 transition count 175
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 436 place count 113 transition count 174
Iterating global reduction 7 with 1 rules applied. Total rules applied 437 place count 113 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 438 place count 113 transition count 173
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 24 rules applied. Total rules applied 462 place count 101 transition count 161
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 465 place count 101 transition count 158
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 469 place count 97 transition count 150
Iterating global reduction 9 with 4 rules applied. Total rules applied 473 place count 97 transition count 150
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 477 place count 93 transition count 145
Iterating global reduction 9 with 4 rules applied. Total rules applied 481 place count 93 transition count 145
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 484 place count 90 transition count 140
Iterating global reduction 9 with 3 rules applied. Total rules applied 487 place count 90 transition count 140
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 490 place count 87 transition count 134
Iterating global reduction 9 with 3 rules applied. Total rules applied 493 place count 87 transition count 134
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 496 place count 84 transition count 128
Iterating global reduction 9 with 3 rules applied. Total rules applied 499 place count 84 transition count 128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 500 place count 84 transition count 127
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 501 place count 83 transition count 125
Iterating global reduction 10 with 1 rules applied. Total rules applied 502 place count 83 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 503 place count 83 transition count 124
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 505 place count 83 transition count 122
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 505 place count 83 transition count 121
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 507 place count 82 transition count 121
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 11 with 2 rules applied. Total rules applied 509 place count 81 transition count 120
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 11 with 4 rules applied. Total rules applied 513 place count 81 transition count 120
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 514 place count 80 transition count 119
Iterating global reduction 11 with 1 rules applied. Total rules applied 515 place count 80 transition count 119
Applied a total of 515 rules in 58 ms. Remains 80 /354 variables (removed 274) and now considering 119/467 (removed 348) transitions.
[2025-06-04 03:16:45] [INFO ] Flow matrix only has 112 transitions (discarded 7 similar events)
// Phase 1: matrix 112 rows 80 cols
[2025-06-04 03:16:45] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:16:46] [INFO ] Implicit Places using invariants in 98 ms returned []
[2025-06-04 03:16:46] [INFO ] Flow matrix only has 112 transitions (discarded 7 similar events)
[2025-06-04 03:16:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:16:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 03:16:46] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 03:16:46] [INFO ] Redundant transitions in 5 ms returned []
Running 117 sub problems to find dead transitions.
[2025-06-04 03:16:46] [INFO ] Flow matrix only has 112 transitions (discarded 7 similar events)
[2025-06-04 03:16:46] [INFO ] Invariant cache hit.
[2025-06-04 03:16:46] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:16:47] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:16:47] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:16:48] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 111/191 variables, 80/90 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (OVERLAPS) 1/192 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 91 constraints, problems are : Problem set: 0 solved, 117 unsolved in 9578 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 80/80 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:16:56] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (OVERLAPS) 111/191 variables, 80/91 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 117/208 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (OVERLAPS) 1/192 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (OVERLAPS) 0/192 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 209 constraints, problems are : Problem set: 0 solved, 117 unsolved in 17592 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 80/80 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27187ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 27189ms
Starting structural reductions in SI_CTL mode, iteration 1 : 80/354 places, 119/467 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27531 ms. Remains : 80/354 places, 119/467 transitions.
[2025-06-04 03:17:13] [INFO ] Flatten gal took : 5 ms
[2025-06-04 03:17:13] [INFO ] Flatten gal took : 4 ms
[2025-06-04 03:17:13] [INFO ] Input system was already deterministic with 119 transitions.
[2025-06-04 03:17:13] [INFO ] Flatten gal took : 4 ms
[2025-06-04 03:17:13] [INFO ] Flatten gal took : 4 ms
[2025-06-04 03:17:13] [INFO ] Time to serialize gal into /tmp/CTLFireability9498581289554603102.gal : 1 ms
[2025-06-04 03:17:13] [INFO ] Time to serialize properties into /tmp/CTLFireability3071688247145152090.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/CTLFireability9498581289554603102.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3071688247145152090.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,2.96387e+07,0.048303,4656,2,331,5,3640,6,0,431,2512,0


Converting to forward existential form...Done !
original formula: (EG(((p124==0)||(p446==0))) + AG(((p199==0) * AF(((p381==1)||(p332==1))))))
=> equivalent forward existential formula: ([(FwdU((Init * !(EG(((p124==0)||(p446==0))))),TRUE) * !((p199==0)))] = FALSE * [FwdG(FwdU((Init * !(EG(((p124==...215
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t4, t6, t8, t9, t11, t13, t14, t17, t18, t19, t20, t22, t79, t82, t106, t111, In...252
(forward)formula 0,1,1.20435,34600,1,0,352,182775,262,171,2626,162580,430
FORMULA HealthRecord-PT-16-CTLFireability-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 467/467 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 322 transition count 424
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 322 transition count 424
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 322 transition count 423
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 78 place count 309 transition count 403
Iterating global reduction 1 with 13 rules applied. Total rules applied 91 place count 309 transition count 403
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 93 place count 309 transition count 401
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 100 place count 302 transition count 387
Iterating global reduction 2 with 7 rules applied. Total rules applied 107 place count 302 transition count 387
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 111 place count 298 transition count 382
Iterating global reduction 2 with 4 rules applied. Total rules applied 115 place count 298 transition count 382
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 118 place count 295 transition count 378
Iterating global reduction 2 with 3 rules applied. Total rules applied 121 place count 295 transition count 378
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 122 place count 295 transition count 377
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 124 place count 293 transition count 374
Iterating global reduction 3 with 2 rules applied. Total rules applied 126 place count 293 transition count 374
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 128 place count 291 transition count 371
Iterating global reduction 3 with 2 rules applied. Total rules applied 130 place count 291 transition count 371
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 131 place count 290 transition count 369
Iterating global reduction 3 with 1 rules applied. Total rules applied 132 place count 290 transition count 369
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 133 place count 290 transition count 368
Applied a total of 133 rules in 61 ms. Remains 290 /354 variables (removed 64) and now considering 368/467 (removed 99) transitions.
// Phase 1: matrix 368 rows 290 cols
[2025-06-04 03:17:14] [INFO ] Computed 14 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:17:14] [INFO ] Implicit Places using invariants in 159 ms returned []
[2025-06-04 03:17:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:17:15] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 623 ms to find 0 implicit places.
Running 367 sub problems to find dead transitions.
[2025-06-04 03:17:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/289 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (OVERLAPS) 1/290 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:17:26] [INFO ] Deduced a trap composed of 31 places in 316 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:17:26] [INFO ] Deduced a trap composed of 43 places in 290 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:17:27] [INFO ] Deduced a trap composed of 137 places in 293 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:17:27] [INFO ] Deduced a trap composed of 110 places in 286 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:17:27] [INFO ] Deduced a trap composed of 52 places in 281 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:17:28] [INFO ] Deduced a trap composed of 43 places in 310 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:17:28] [INFO ] Deduced a trap composed of 137 places in 274 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:17:29] [INFO ] Deduced a trap composed of 33 places in 291 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:17:29] [INFO ] Deduced a trap composed of 45 places in 281 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:17:29] [INFO ] Deduced a trap composed of 49 places in 276 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:17:30] [INFO ] Deduced a trap composed of 73 places in 278 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:17:31] [INFO ] Deduced a trap composed of 69 places in 251 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:17:33] [INFO ] Deduced a trap composed of 137 places in 294 ms of which 68 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 13/27 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:17:38] [INFO ] Deduced a trap composed of 138 places in 269 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:17:38] [INFO ] Deduced a trap composed of 116 places in 264 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:17:40] [INFO ] Deduced a trap composed of 69 places in 181 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:17:40] [INFO ] Deduced a trap composed of 43 places in 245 ms of which 35 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:17:43] [INFO ] Deduced a trap composed of 70 places in 164 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:17:43] [INFO ] Deduced a trap composed of 71 places in 159 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:17:43] [INFO ] Deduced a trap composed of 65 places in 113 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:17:45] [INFO ] Deduced a trap composed of 71 places in 210 ms of which 26 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 290/658 variables, and 35 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/290 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 367 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/289 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (OVERLAPS) 1/290 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:17:49] [INFO ] Deduced a trap composed of 55 places in 197 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:17:49] [INFO ] Deduced a trap composed of 44 places in 194 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:17:52] [INFO ] Deduced a trap composed of 54 places in 246 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:17:52] [INFO ] Deduced a trap composed of 57 places in 225 ms of which 41 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (OVERLAPS) 368/658 variables, 290/329 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/658 variables, 367/696 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:18:05] [INFO ] Deduced a trap composed of 54 places in 228 ms of which 32 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/658 variables, 1/697 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 658/658 variables, and 697 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 290/290 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60081ms problems are : Problem set: 0 solved, 367 unsolved
Search for dead transitions found 0 dead transitions in 60082ms
Starting structural reductions in LTL mode, iteration 1 : 290/354 places, 368/467 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60768 ms. Remains : 290/354 places, 368/467 transitions.
[2025-06-04 03:18:15] [INFO ] Flatten gal took : 6 ms
[2025-06-04 03:18:15] [INFO ] Flatten gal took : 11 ms
[2025-06-04 03:18:15] [INFO ] Input system was already deterministic with 368 transitions.
[2025-06-04 03:18:15] [INFO ] Flatten gal took : 6 ms
[2025-06-04 03:18:15] [INFO ] Flatten gal took : 6 ms
[2025-06-04 03:18:15] [INFO ] Time to serialize gal into /tmp/CTLFireability5637054764942917976.gal : 1 ms
[2025-06-04 03:18:15] [INFO ] Time to serialize properties into /tmp/CTLFireability5597546666880734318.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/CTLFireability5637054764942917976.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5597546666880734318.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.72135e+11,6.7395,146852,2,14965,5,408388,6,0,1530,980071,0


Converting to forward existential form...Done !
original formula: AX((AG(AF(EG((p301==0)))) + (((p275==1) * EX(EF((p41==1)))) * (EG((p229==1)) + EG(AX((p423==1)))))))
=> equivalent forward existential formula: [FwdG(FwdU((EY(Init) * !((((p275==1) * EX(E(TRUE U (p41==1)))) * (EG((p229==1)) + EG(!(EX(!((p423==1))))))))),TR...185
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t31, t32, t35, t36, t37, t40, t41, t42, t43...725
Detected timeout of ITS tools.
[2025-06-04 03:18:45] [INFO ] Flatten gal took : 11 ms
[2025-06-04 03:18:45] [INFO ] Applying decomposition
[2025-06-04 03:18:45] [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/graph90497320684507278.txt' '-o' '/tmp/graph90497320684507278.bin' '-w' '/tmp/graph90497320684507278.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph90497320684507278.bin' '-l' '-1' '-v' '-w' '/tmp/graph90497320684507278.weights' '-q' '0' '-e' '0.001'
[2025-06-04 03:18:45] [INFO ] Decomposing Gal with order
[2025-06-04 03:18:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 03:18:45] [INFO ] Removed a total of 109 redundant transitions.
[2025-06-04 03:18:45] [INFO ] Flatten gal took : 18 ms
[2025-06-04 03:18:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 6 ms.
[2025-06-04 03:18:45] [INFO ] Time to serialize gal into /tmp/CTLFireability14659338802409443874.gal : 5 ms
[2025-06-04 03:18:45] [INFO ] Time to serialize properties into /tmp/CTLFireability6068580819520415884.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/CTLFireability14659338802409443874.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6068580819520415884.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.72135e+11,7.0237,128036,3103,120,196706,3329,743,569683,103,17109,0


Converting to forward existential form...Done !
original formula: AX((AG(AF(EG((i17.i1.u84.p301==0)))) + (((i15.i2.u68.p275==1) * EX(EF((i2.i0.u6.p41==1)))) * (EG((i13.i1.u60.p229==1)) + EG(AX((i21.i1.u1...172
=> equivalent forward existential formula: [FwdG(FwdU((EY(Init) * !((((i15.i2.u68.p275==1) * EX(E(TRUE U (i2.i0.u6.p41==1)))) * (EG((i13.i1.u60.p229==1)) +...239
Reverse transition relation is NOT exact ! Due to transitions t91, t170, t235, t314, t315, t316, t317, t318, t330, i2.i0.t273, i2.i0.t282, i2.i0.t286, i2.i...1401
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 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local 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 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 21
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 467/467 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 322 transition count 424
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 322 transition count 424
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 322 transition count 423
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 77 place count 310 transition count 405
Iterating global reduction 1 with 12 rules applied. Total rules applied 89 place count 310 transition count 405
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 90 place count 310 transition count 404
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 98 place count 302 transition count 388
Iterating global reduction 2 with 8 rules applied. Total rules applied 106 place count 302 transition count 388
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 111 place count 297 transition count 381
Iterating global reduction 2 with 5 rules applied. Total rules applied 116 place count 297 transition count 381
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 120 place count 293 transition count 374
Iterating global reduction 2 with 4 rules applied. Total rules applied 124 place count 293 transition count 374
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 125 place count 293 transition count 373
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 128 place count 290 transition count 369
Iterating global reduction 3 with 3 rules applied. Total rules applied 131 place count 290 transition count 369
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 133 place count 288 transition count 366
Iterating global reduction 3 with 2 rules applied. Total rules applied 135 place count 288 transition count 366
Applied a total of 135 rules in 29 ms. Remains 288 /354 variables (removed 66) and now considering 366/467 (removed 101) transitions.
// Phase 1: matrix 366 rows 288 cols
[2025-06-04 03:19:15] [INFO ] Computed 14 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:19:15] [INFO ] Implicit Places using invariants in 190 ms returned []
[2025-06-04 03:19:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:19:16] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 642 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2025-06-04 03:19:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/287 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/288 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/288 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:19:27] [INFO ] Deduced a trap composed of 29 places in 237 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:19:27] [INFO ] Deduced a trap composed of 136 places in 156 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:19:27] [INFO ] Deduced a trap composed of 109 places in 244 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:19:28] [INFO ] Deduced a trap composed of 51 places in 277 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:19:28] [INFO ] Deduced a trap composed of 43 places in 298 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:19:29] [INFO ] Deduced a trap composed of 31 places in 273 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:19:29] [INFO ] Deduced a trap composed of 45 places in 284 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:19:29] [INFO ] Deduced a trap composed of 41 places in 243 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:19:30] [INFO ] Deduced a trap composed of 136 places in 316 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:19:30] [INFO ] Deduced a trap composed of 64 places in 205 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:19:31] [INFO ] Deduced a trap composed of 70 places in 223 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:19:32] [INFO ] Deduced a trap composed of 69 places in 188 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:19:32] [INFO ] Deduced a trap composed of 71 places in 196 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:19:33] [INFO ] Deduced a trap composed of 75 places in 190 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:19:33] [INFO ] Deduced a trap composed of 70 places in 195 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:19:34] [INFO ] Deduced a trap composed of 47 places in 287 ms of which 46 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/288 variables, 16/30 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:19:38] [INFO ] Deduced a trap composed of 42 places in 243 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:19:38] [INFO ] Deduced a trap composed of 114 places in 262 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:19:39] [INFO ] Deduced a trap composed of 53 places in 159 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:19:40] [INFO ] Deduced a trap composed of 55 places in 158 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:19:40] [INFO ] Deduced a trap composed of 54 places in 191 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:19:41] [INFO ] Deduced a trap composed of 60 places in 229 ms of which 35 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 6/36 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:19:43] [INFO ] Deduced a trap composed of 71 places in 260 ms of which 22 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 288/654 variables, and 37 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/288 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/287 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/288 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/288 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/288 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:19:51] [INFO ] Deduced a trap composed of 43 places in 252 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:19:52] [INFO ] Deduced a trap composed of 136 places in 197 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:19:53] [INFO ] Deduced a trap composed of 52 places in 241 ms of which 29 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:19:55] [INFO ] Deduced a trap composed of 45 places in 184 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:19:57] [INFO ] Deduced a trap composed of 76 places in 189 ms of which 24 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 7 (OVERLAPS) 366/654 variables, 288/330 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/654 variables, 365/695 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:12] [INFO ] Deduced a trap composed of 48 places in 229 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:12] [INFO ] Deduced a trap composed of 67 places in 225 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:13] [INFO ] Deduced a trap composed of 73 places in 204 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:13] [INFO ] Deduced a trap composed of 73 places in 196 ms of which 27 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 654/654 variables, and 699 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 288/288 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60086ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 60088ms
Starting structural reductions in LTL mode, iteration 1 : 288/354 places, 366/467 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60763 ms. Remains : 288/354 places, 366/467 transitions.
[2025-06-04 03:20:16] [INFO ] Flatten gal took : 11 ms
[2025-06-04 03:20:16] [INFO ] Flatten gal took : 11 ms
[2025-06-04 03:20:16] [INFO ] Input system was already deterministic with 366 transitions.
[2025-06-04 03:20:16] [INFO ] Flatten gal took : 10 ms
[2025-06-04 03:20:16] [INFO ] Flatten gal took : 11 ms
[2025-06-04 03:20:16] [INFO ] Time to serialize gal into /tmp/CTLFireability9329603450204174050.gal : 3 ms
[2025-06-04 03:20:16] [INFO ] Time to serialize properties into /tmp/CTLFireability15780638714133485447.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/CTLFireability9329603450204174050.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15780638714133485447.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.68976e+11,4.4832,96332,2,11357,5,280449,6,0,1520,591986,0


Converting to forward existential form...Done !
original formula: AG(EX(((p98==0) + ((EF((p309==0)) * (p245==0)) * ((p168==0)&&(p352==0))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(((p98==0) + ((E(TRUE U (p309==0)) * (p245==0)) * ((p168==0)&&(p352==0)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t31, t33, t34, t35, t36, t39, t40, t41, t42...724
(forward)formula 0,0,19.6851,322196,1,0,605,1.06342e+06,756,331,8464,1.37538e+06,752
FORMULA HealthRecord-PT-16-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 467/467 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 321 transition count 422
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 321 transition count 422
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 321 transition count 421
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 81 place count 307 transition count 400
Iterating global reduction 1 with 14 rules applied. Total rules applied 95 place count 307 transition count 400
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 97 place count 307 transition count 398
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 105 place count 299 transition count 382
Iterating global reduction 2 with 8 rules applied. Total rules applied 113 place count 299 transition count 382
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 117 place count 295 transition count 376
Iterating global reduction 2 with 4 rules applied. Total rules applied 121 place count 295 transition count 376
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 124 place count 292 transition count 370
Iterating global reduction 2 with 3 rules applied. Total rules applied 127 place count 292 transition count 370
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 130 place count 289 transition count 366
Iterating global reduction 2 with 3 rules applied. Total rules applied 133 place count 289 transition count 366
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 135 place count 287 transition count 363
Iterating global reduction 2 with 2 rules applied. Total rules applied 137 place count 287 transition count 363
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 138 place count 286 transition count 361
Iterating global reduction 2 with 1 rules applied. Total rules applied 139 place count 286 transition count 361
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 140 place count 286 transition count 360
Applied a total of 140 rules in 51 ms. Remains 286 /354 variables (removed 68) and now considering 360/467 (removed 107) transitions.
// Phase 1: matrix 360 rows 286 cols
[2025-06-04 03:20:36] [INFO ] Computed 14 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:20:36] [INFO ] Implicit Places using invariants in 147 ms returned []
[2025-06-04 03:20:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:20:36] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
Running 359 sub problems to find dead transitions.
[2025-06-04 03:20:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 1 (OVERLAPS) 1/286 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 359 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:46] [INFO ] Deduced a trap composed of 28 places in 238 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:46] [INFO ] Deduced a trap composed of 43 places in 265 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:47] [INFO ] Deduced a trap composed of 138 places in 244 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:47] [INFO ] Deduced a trap composed of 30 places in 258 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:48] [INFO ] Deduced a trap composed of 45 places in 264 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:48] [INFO ] Deduced a trap composed of 47 places in 221 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:48] [INFO ] Deduced a trap composed of 134 places in 228 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:48] [INFO ] Deduced a trap composed of 112 places in 191 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:48] [INFO ] Deduced a trap composed of 40 places in 188 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:51] [INFO ] Deduced a trap composed of 51 places in 242 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:51] [INFO ] Deduced a trap composed of 54 places in 246 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:52] [INFO ] Deduced a trap composed of 49 places in 154 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 359 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:56] [INFO ] Deduced a trap composed of 134 places in 246 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:56] [INFO ] Deduced a trap composed of 136 places in 225 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:57] [INFO ] Deduced a trap composed of 107 places in 186 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:57] [INFO ] Deduced a trap composed of 114 places in 259 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:58] [INFO ] Deduced a trap composed of 47 places in 231 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:58] [INFO ] Deduced a trap composed of 51 places in 213 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:59] [INFO ] Deduced a trap composed of 56 places in 198 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:59] [INFO ] Deduced a trap composed of 52 places in 242 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:20:59] [INFO ] Deduced a trap composed of 57 places in 229 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:21:00] [INFO ] Deduced a trap composed of 53 places in 233 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:21:00] [INFO ] Deduced a trap composed of 58 places in 198 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:21:01] [INFO ] Deduced a trap composed of 53 places in 247 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:21:01] [INFO ] Deduced a trap composed of 58 places in 227 ms of which 24 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 13/39 constraints. Problems are: Problem set: 0 solved, 359 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:21:04] [INFO ] Deduced a trap composed of 71 places in 184 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:21:04] [INFO ] Deduced a trap composed of 67 places in 156 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:21:07] [INFO ] Deduced a trap composed of 53 places in 88 ms of which 8 ms to minimize.
SMT process timed out in 30090ms, After SMT, problems are : Problem set: 0 solved, 359 unsolved
Search for dead transitions found 0 dead transitions in 30093ms
Starting structural reductions in LTL mode, iteration 1 : 286/354 places, 360/467 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30636 ms. Remains : 286/354 places, 360/467 transitions.
[2025-06-04 03:21:07] [INFO ] Flatten gal took : 6 ms
[2025-06-04 03:21:07] [INFO ] Flatten gal took : 7 ms
[2025-06-04 03:21:07] [INFO ] Input system was already deterministic with 360 transitions.
[2025-06-04 03:21:07] [INFO ] Flatten gal took : 11 ms
[2025-06-04 03:21:07] [INFO ] Flatten gal took : 6 ms
[2025-06-04 03:21:07] [INFO ] Time to serialize gal into /tmp/CTLFireability10514322652459964581.gal : 2 ms
[2025-06-04 03:21:07] [INFO ] Time to serialize properties into /tmp/CTLFireability4087054856525327181.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/CTLFireability10514322652459964581.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4087054856525327181.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.59308e+11,3.32749,72140,2,9375,5,208861,6,0,1506,444368,0


Converting to forward existential form...Done !
original formula: EF(EX(A((p27==1) U EX((p402==1)))))
=> equivalent forward existential formula: [((EY(FwdU(Init,TRUE)) * !(EG(!(EX((p402==1)))))) * !(E(!(EX((p402==1))) U (!((p27==1)) * !(EX((p402==1)))))))] ...163
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t31, t33, t34, t35, t36, t40, t41, t42, t45...638
Detected timeout of ITS tools.
[2025-06-04 03:21:37] [INFO ] Flatten gal took : 7 ms
[2025-06-04 03:21:37] [INFO ] Applying decomposition
[2025-06-04 03:21:37] [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/graph17820921897040332821.txt' '-o' '/tmp/graph17820921897040332821.bin' '-w' '/tmp/graph17820921897040332821.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17820921897040332821.bin' '-l' '-1' '-v' '-w' '/tmp/graph17820921897040332821.weights' '-q' '0' '-e' '0.001'
[2025-06-04 03:21:37] [INFO ] Decomposing Gal with order
[2025-06-04 03:21:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 03:21:37] [INFO ] Removed a total of 114 redundant transitions.
[2025-06-04 03:21:37] [INFO ] Flatten gal took : 18 ms
[2025-06-04 03:21:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 4 ms.
[2025-06-04 03:21:37] [INFO ] Time to serialize gal into /tmp/CTLFireability6070849884465244789.gal : 4 ms
[2025-06-04 03:21:37] [INFO ] Time to serialize properties into /tmp/CTLFireability1551666974513658967.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/CTLFireability6070849884465244789.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1551666974513658967.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.59308e+11,0.524112,18336,1051,33,27327,415,732,54742,78,900,0


Converting to forward existential form...Done !
original formula: EF(EX(A((i1.i0.u8.p27==1) U EX((i19.u101.p402==1)))))
=> equivalent forward existential formula: [((EY(FwdU(Init,TRUE)) * !(EG(!(EX((i19.u101.p402==1)))))) * !(E(!(EX((i19.u101.p402==1))) U (!((i1.i0.u8.p27==1...199
Reverse transition relation is NOT exact ! Due to transitions t230, t325, i1.i0.t268, i1.i0.t277, i1.i0.t282, i1.i0.t284, i1.i0.t286, i1.i0.t298, i1.i0.u3....1181
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
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 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
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
(forward)formula 0,1,21.4361,359328,1,0,593952,596,4294,1.16036e+06,321,1086,540270
FORMULA HealthRecord-PT-16-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 467/467 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 321 transition count 423
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 321 transition count 423
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 321 transition count 422
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 81 place count 307 transition count 401
Iterating global reduction 1 with 14 rules applied. Total rules applied 95 place count 307 transition count 401
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 97 place count 307 transition count 399
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 104 place count 300 transition count 385
Iterating global reduction 2 with 7 rules applied. Total rules applied 111 place count 300 transition count 385
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 115 place count 296 transition count 379
Iterating global reduction 2 with 4 rules applied. Total rules applied 119 place count 296 transition count 379
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 122 place count 293 transition count 373
Iterating global reduction 2 with 3 rules applied. Total rules applied 125 place count 293 transition count 373
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 128 place count 290 transition count 369
Iterating global reduction 2 with 3 rules applied. Total rules applied 131 place count 290 transition count 369
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 133 place count 288 transition count 366
Iterating global reduction 2 with 2 rules applied. Total rules applied 135 place count 288 transition count 366
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 136 place count 287 transition count 364
Iterating global reduction 2 with 1 rules applied. Total rules applied 137 place count 287 transition count 364
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 138 place count 287 transition count 363
Applied a total of 138 rules in 71 ms. Remains 287 /354 variables (removed 67) and now considering 363/467 (removed 104) transitions.
// Phase 1: matrix 363 rows 287 cols
[2025-06-04 03:21:58] [INFO ] Computed 14 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:21:59] [INFO ] Implicit Places using invariants in 185 ms returned []
[2025-06-04 03:21:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:21:59] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 612 ms to find 0 implicit places.
Running 362 sub problems to find dead transitions.
[2025-06-04 03:21:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (OVERLAPS) 1/287 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/287 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:22:09] [INFO ] Deduced a trap composed of 28 places in 156 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:22:09] [INFO ] Deduced a trap composed of 43 places in 152 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:22:09] [INFO ] Deduced a trap composed of 139 places in 158 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:22:10] [INFO ] Deduced a trap composed of 30 places in 261 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:22:10] [INFO ] Deduced a trap composed of 46 places in 269 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:22:10] [INFO ] Deduced a trap composed of 40 places in 211 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:22:13] [INFO ] Deduced a trap composed of 72 places in 202 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:22:14] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:22:14] [INFO ] Deduced a trap composed of 48 places in 105 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:22:18] [INFO ] Deduced a trap composed of 134 places in 162 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:22:18] [INFO ] Deduced a trap composed of 107 places in 253 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:22:19] [INFO ] Deduced a trap composed of 54 places in 182 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:22:19] [INFO ] Deduced a trap composed of 73 places in 290 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:22:20] [INFO ] Deduced a trap composed of 71 places in 122 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:22:20] [INFO ] Deduced a trap composed of 73 places in 127 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:22:21] [INFO ] Deduced a trap composed of 68 places in 117 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:22:21] [INFO ] Deduced a trap composed of 53 places in 150 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:22:21] [INFO ] Deduced a trap composed of 40 places in 160 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:22:21] [INFO ] Deduced a trap composed of 113 places in 279 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:22:22] [INFO ] Deduced a trap composed of 54 places in 228 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:22:22] [INFO ] Deduced a trap composed of 73 places in 110 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:22:22] [INFO ] Deduced a trap composed of 49 places in 212 ms of which 20 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 13/36 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:22:24] [INFO ] Deduced a trap composed of 135 places in 173 ms of which 13 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 287/650 variables, and 37 constraints, problems are : Problem set: 0 solved, 362 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/287 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 362 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (OVERLAPS) 1/287 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/287 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 5 (OVERLAPS) 363/650 variables, 287/324 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 362/686 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:22:49] [INFO ] Deduced a trap along path composed of 2 places in 42 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:22:49] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:22:54] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:22:55] [INFO ] Deduced a trap along path composed of 2 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:22:57] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:22:58] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/650 variables, and 692 constraints, problems are : Problem set: 0 solved, 362 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 60089ms problems are : Problem set: 0 solved, 362 unsolved
Search for dead transitions found 0 dead transitions in 60091ms
Starting structural reductions in LTL mode, iteration 1 : 287/354 places, 363/467 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60777 ms. Remains : 287/354 places, 363/467 transitions.
[2025-06-04 03:22:59] [INFO ] Flatten gal took : 6 ms
[2025-06-04 03:22:59] [INFO ] Flatten gal took : 6 ms
[2025-06-04 03:22:59] [INFO ] Input system was already deterministic with 363 transitions.
[2025-06-04 03:22:59] [INFO ] Flatten gal took : 6 ms
[2025-06-04 03:22:59] [INFO ] Flatten gal took : 6 ms
[2025-06-04 03:22:59] [INFO ] Time to serialize gal into /tmp/CTLFireability2976384965979505512.gal : 2 ms
[2025-06-04 03:22:59] [INFO ] Time to serialize properties into /tmp/CTLFireability7338992616760351697.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/CTLFireability2976384965979505512.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7338992616760351697.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.67336e+11,3.65568,75312,2,9609,5,215061,6,0,1513,467569,0


Converting to forward existential form...Done !
original formula: (AG((AX((AX((p220==0)) * (p26==0))) * (p274==0))) + AX(FALSE))
=> equivalent forward existential formula: [(EY((Init * !(!(E(TRUE U !((!(EX(!((!(EX(!((p220==0)))) * (p26==0))))) * (p274==0)))))))) * !(FALSE))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t31, t33, t34, t35, t36, t39, t40, t41, t44...668
(forward)formula 0,0,21.7732,393640,1,0,607,1.57677e+06,750,341,8612,1.94317e+06,771
FORMULA HealthRecord-PT-16-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 354/354 places, 467/467 transitions.
Graph (trivial) has 399 edges and 354 vertex of which 46 / 354 are part of one of the 17 SCC in 0 ms
Free SCC test removed 29 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 139 transitions
Trivial Post-agglo rules discarded 139 transitions
Performed 139 trivial Post agglomeration. Transition count delta: 139
Iterating post reduction 0 with 139 rules applied. Total rules applied 140 place count 324 transition count 295
Reduce places removed 139 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 156 rules applied. Total rules applied 296 place count 185 transition count 278
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 10 rules applied. Total rules applied 306 place count 177 transition count 276
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 308 place count 175 transition count 276
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 308 place count 175 transition count 269
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 322 place count 168 transition count 269
Discarding 35 places :
Symmetric choice reduction at 4 with 35 rule applications. Total rules 357 place count 133 transition count 205
Iterating global reduction 4 with 35 rules applied. Total rules applied 392 place count 133 transition count 205
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 4 rules applied. Total rules applied 396 place count 133 transition count 201
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 400 place count 129 transition count 201
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 411 place count 118 transition count 182
Iterating global reduction 6 with 11 rules applied. Total rules applied 422 place count 118 transition count 182
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 425 place count 118 transition count 179
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 426 place count 117 transition count 179
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 429 place count 114 transition count 174
Iterating global reduction 8 with 3 rules applied. Total rules applied 432 place count 114 transition count 174
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 433 place count 113 transition count 172
Iterating global reduction 8 with 1 rules applied. Total rules applied 434 place count 113 transition count 172
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 24 rules applied. Total rules applied 458 place count 101 transition count 160
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 461 place count 101 transition count 157
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 465 place count 97 transition count 149
Iterating global reduction 9 with 4 rules applied. Total rules applied 469 place count 97 transition count 149
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 474 place count 92 transition count 143
Iterating global reduction 9 with 5 rules applied. Total rules applied 479 place count 92 transition count 143
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 483 place count 88 transition count 137
Iterating global reduction 9 with 4 rules applied. Total rules applied 487 place count 88 transition count 137
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 488 place count 88 transition count 136
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 491 place count 85 transition count 130
Iterating global reduction 10 with 3 rules applied. Total rules applied 494 place count 85 transition count 130
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 497 place count 82 transition count 124
Iterating global reduction 10 with 3 rules applied. Total rules applied 500 place count 82 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 501 place count 82 transition count 123
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 502 place count 81 transition count 121
Iterating global reduction 11 with 1 rules applied. Total rules applied 503 place count 81 transition count 121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 504 place count 81 transition count 120
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 12 with 3 rules applied. Total rules applied 507 place count 81 transition count 117
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 12 with 1 rules applied. Total rules applied 508 place count 81 transition count 116
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 509 place count 80 transition count 116
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 509 place count 80 transition count 115
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 511 place count 79 transition count 115
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 512 place count 78 transition count 113
Iterating global reduction 14 with 1 rules applied. Total rules applied 513 place count 78 transition count 113
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 514 place count 77 transition count 111
Iterating global reduction 14 with 1 rules applied. Total rules applied 515 place count 77 transition count 111
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 516 place count 76 transition count 110
Iterating global reduction 14 with 1 rules applied. Total rules applied 517 place count 76 transition count 110
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 14 with 2 rules applied. Total rules applied 519 place count 75 transition count 109
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 520 place count 75 transition count 108
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 521 place count 75 transition count 108
Applied a total of 521 rules in 59 ms. Remains 75 /354 variables (removed 279) and now considering 108/467 (removed 359) transitions.
[2025-06-04 03:23:21] [INFO ] Flow matrix only has 100 transitions (discarded 8 similar events)
// Phase 1: matrix 100 rows 75 cols
[2025-06-04 03:23:21] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:23:21] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-06-04 03:23:21] [INFO ] Flow matrix only has 100 transitions (discarded 8 similar events)
[2025-06-04 03:23:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:23:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 03:23:21] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 03:23:21] [INFO ] Redundant transitions in 2 ms returned []
Running 106 sub problems to find dead transitions.
[2025-06-04 03:23:21] [INFO ] Flow matrix only has 100 transitions (discarded 8 similar events)
[2025-06-04 03:23:21] [INFO ] Invariant cache hit.
[2025-06-04 03:23:21] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:23:23] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:23:23] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 99/174 variables, 75/84 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 1/175 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 0/175 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 175/175 variables, and 85 constraints, problems are : Problem set: 0 solved, 106 unsolved in 8567 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 75/75 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:23:30] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 99/174 variables, 75/85 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 106/191 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:23:33] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (OVERLAPS) 1/175 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/175 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 11 (OVERLAPS) 0/175 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 175/175 variables, and 193 constraints, problems are : Problem set: 0 solved, 106 unsolved in 13680 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 75/75 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22261ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 22264ms
Starting structural reductions in SI_CTL mode, iteration 1 : 75/354 places, 108/467 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22534 ms. Remains : 75/354 places, 108/467 transitions.
[2025-06-04 03:23:44] [INFO ] Flatten gal took : 4 ms
[2025-06-04 03:23:44] [INFO ] Flatten gal took : 4 ms
[2025-06-04 03:23:44] [INFO ] Input system was already deterministic with 108 transitions.
[2025-06-04 03:23:44] [INFO ] Flatten gal took : 3 ms
[2025-06-04 03:23:44] [INFO ] Flatten gal took : 3 ms
[2025-06-04 03:23:44] [INFO ] Time to serialize gal into /tmp/CTLFireability11006392155825117106.gal : 1 ms
[2025-06-04 03:23:44] [INFO ] Time to serialize properties into /tmp/CTLFireability2217653889393055686.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/CTLFireability11006392155825117106.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2217653889393055686.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,2.22106e+07,0.066092,5740,2,896,5,9204,6,0,399,7567,0


Converting to forward existential form...Done !
original formula: AG(AF(!(E(((AF(((p334==1)&&(p442==1))) * (p141==1)) * (p125==1)) U (p348==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(!(E(((!(EG(!(((p334==1)&&(p442==1))))) * (p141==1)) * (p125==1)) U (p348==1)))))] = FALS...156
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t6, t7, t9, t12, t13, t14, t15, t17, t55, t59, t60, t61, t62, t63, t76, t77, t99,...261
(forward)formula 0,0,3.52729,91420,1,0,395,549590,240,179,2491,498615,469
FORMULA HealthRecord-PT-16-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-04 03:23:47] [INFO ] Flatten gal took : 8 ms
[2025-06-04 03:23:47] [INFO ] Flatten gal took : 8 ms
[2025-06-04 03:23:47] [INFO ] Applying decomposition
[2025-06-04 03:23:47] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7057342727500972428.txt' '-o' '/tmp/graph7057342727500972428.bin' '-w' '/tmp/graph7057342727500972428.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7057342727500972428.bin' '-l' '-1' '-v' '-w' '/tmp/graph7057342727500972428.weights' '-q' '0' '-e' '0.001'
[2025-06-04 03:23:47] [INFO ] Decomposing Gal with order
[2025-06-04 03:23:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 03:23:47] [INFO ] Removed a total of 127 redundant transitions.
[2025-06-04 03:23:47] [INFO ] Flatten gal took : 30 ms
[2025-06-04 03:23:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 4 ms.
[2025-06-04 03:23:47] [INFO ] Time to serialize gal into /tmp/CTLFireability12044296817308861337.gal : 5 ms
[2025-06-04 03:23:47] [INFO ] Time to serialize properties into /tmp/CTLFireability3479274069969062416.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/CTLFireability12044296817308861337.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3479274069969062416.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 3 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.37081e+11,7.51115,155252,2798,1178,196971,54274,883,603093,255,337602,0


Converting to forward existential form...Done !
original formula: EX((EG(((i12.i2.u77.p236==0) + ((AG((i16.i0.u100.p317==0)) * ((i20.u124.p334==0)||(i20.u124.p375==0))) * (i4.i0.u34.p122==0)))) * (AX((E(...462
=> equivalent forward existential formula: ([((EY(Init) * EG(((i12.i2.u77.p236==0) + ((!(E(TRUE U !((i16.i0.u100.p317==0)))) * ((i20.u124.p334==0)||(i20.u1...777
Reverse transition relation is NOT exact ! Due to transitions t137, t414, t415, u28.t322, u82.t180, i1.t372, i1.i4.t335, i1.i4.t336, i1.i4.t358, i1.i4.t363...1907
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 5
Fast SCC detection found a local 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 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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local 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 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,95.225,1408104,1,0,1.92442e+06,255522,6442,4.34416e+06,1440,917234,2495765
FORMULA HealthRecord-PT-16-CTLFireability-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG(((i4.i1.u31.p113==0) + ((AF((i0.i1.u114.p367==0)) * EG((i0.i1.u114.p367==1))) * ((EX((i20.u124.p399==1)) + (i16.i2.u98.p301==1)) + ((i...242
=> equivalent forward existential formula: [FwdG(Init,((i4.i1.u31.p113==0) + ((!(EG(!((i0.i1.u114.p367==0)))) * EG((i0.i1.u114.p367==1))) * ((EX((i20.u124....291
(forward)formula 1,1,707.546,3094148,1,0,3.79915e+06,268032,1798,9.27908e+06,639,1.04186e+06,1175639
FORMULA HealthRecord-PT-16-CTLFireability-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AX((AG(AF(EG((i16.i2.u98.p301==0)))) + (((i14.i2.u92.p275==1) * EX(EF((i1.i4.u17.p41==1)))) * (EG((i12.i1.u74.p229==1)) + EG(AX((i20.u124...170
=> equivalent forward existential formula: [FwdG(FwdU((EY(Init) * !((((i14.i2.u92.p275==1) * EX(E(TRUE U (i1.i4.u17.p41==1)))) * (EG((i12.i1.u74.p229==1)) ...237
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 2,0,727.827,3094148,1,0,3.79915e+06,293472,4430,9.27908e+06,956,1.29292e+06,2283661
FORMULA HealthRecord-PT-16-CTLFireability-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Total runtime 1837184 ms.

BK_STOP 1749008157547

--------------------
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="HealthRecord-PT-16"
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 HealthRecord-PT-16, 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 r100-smll-174867008300658"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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