Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K 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 47K 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 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K 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.6K 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 184K 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 MedleyA-PT-19-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-19-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-19-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-19-CTLFireability-2024-15
FORMULA_NAME MedleyA-PT-19-CTLFireability-2025-00
FORMULA_NAME MedleyA-PT-19-CTLFireability-2025-01
FORMULA_NAME MedleyA-PT-19-CTLFireability-2025-02
FORMULA_NAME MedleyA-PT-19-CTLFireability-2025-03
FORMULA_NAME MedleyA-PT-19-CTLFireability-2025-04
FORMULA_NAME MedleyA-PT-19-CTLFireability-2025-05
FORMULA_NAME MedleyA-PT-19-CTLFireability-2025-06
FORMULA_NAME MedleyA-PT-19-CTLFireability-2025-07
FORMULA_NAME MedleyA-PT-19-CTLFireability-2025-08
FORMULA_NAME MedleyA-PT-19-CTLFireability-2025-09
FORMULA_NAME MedleyA-PT-19-CTLFireability-2025-10
FORMULA_NAME MedleyA-PT-19-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1748880233028

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-19
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-02 16:03:55] [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-02 16:03:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 16:03:56] [INFO ] Load time of PNML (sax parser for PT used): 234 ms
[2025-06-02 16:03:56] [INFO ] Transformed 272 places.
[2025-06-02 16:03:56] [INFO ] Transformed 586 transitions.
[2025-06-02 16:03:56] [INFO ] Found NUPN structural information;
[2025-06-02 16:03:56] [INFO ] Parsed PT model containing 272 places and 586 transitions and 2889 arcs in 472 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 26 ms.
Deduced a syphon composed of 3 places in 13 ms
Reduce places removed 3 places and 3 transitions.
Support contains 75 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 583/583 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 267 transition count 583
Discarding 61 places :
Symmetric choice reduction at 1 with 61 rule applications. Total rules 63 place count 206 transition count 513
Iterating global reduction 1 with 61 rules applied. Total rules applied 124 place count 206 transition count 513
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 205 transition count 511
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 205 transition count 511
Applied a total of 126 rules in 133 ms. Remains 205 /269 variables (removed 64) and now considering 511/583 (removed 72) transitions.
// Phase 1: matrix 511 rows 205 cols
[2025-06-02 16:03:56] [INFO ] Computed 22 invariants in 41 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:03:56] [INFO ] Implicit Places using invariants in 499 ms returned []
[2025-06-02 16:03:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:03:57] [INFO ] Implicit Places using invariants and state equation in 644 ms returned []
Implicit Place search using SMT with State Equation took 1216 ms to find 0 implicit places.
Running 510 sub problems to find dead transitions.
[2025-06-02 16:03:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 510 unsolved
Problem TDEAD202 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD485 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/205 variables, 6/22 constraints. Problems are: Problem set: 120 solved, 390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:04:11] [INFO ] Deduced a trap composed of 29 places in 287 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:04:11] [INFO ] Deduced a trap composed of 29 places in 154 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:04:11] [INFO ] Deduced a trap composed of 36 places in 124 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:04:11] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:04:12] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:04:12] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:04:12] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:04:12] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:04:13] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:04:13] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:04:13] [INFO ] Deduced a trap composed of 45 places in 158 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:04:14] [INFO ] Deduced a trap composed of 26 places in 148 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:04:14] [INFO ] Deduced a trap composed of 28 places in 140 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:04:14] [INFO ] Deduced a trap composed of 18 places in 144 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:04:14] [INFO ] Deduced a trap composed of 40 places in 153 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 15/37 constraints. Problems are: Problem set: 120 solved, 390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:04:20] [INFO ] Deduced a trap composed of 27 places in 163 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:04:21] [INFO ] Deduced a trap composed of 26 places in 171 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 2/39 constraints. Problems are: Problem set: 120 solved, 390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:04:24] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 1/40 constraints. Problems are: Problem set: 120 solved, 390 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 205/716 variables, and 40 constraints, problems are : Problem set: 120 solved, 390 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 0/205 constraints, PredecessorRefiner: 510/510 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 120 solved, 390 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 16/16 constraints. Problems are: Problem set: 120 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 0/16 constraints. Problems are: Problem set: 120 solved, 390 unsolved
At refinement iteration 2 (OVERLAPS) 1/205 variables, 6/22 constraints. Problems are: Problem set: 120 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 18/40 constraints. Problems are: Problem set: 120 solved, 390 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/40 constraints. Problems are: Problem set: 120 solved, 390 unsolved
At refinement iteration 5 (OVERLAPS) 511/716 variables, 205/245 constraints. Problems are: Problem set: 120 solved, 390 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/716 variables, 390/635 constraints. Problems are: Problem set: 120 solved, 390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:04:54] [INFO ] Deduced a trap composed of 17 places in 285 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:04:54] [INFO ] Deduced a trap composed of 17 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-02 16:04:54] [INFO ] Deduced a trap composed of 18 places in 189 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:04:55] [INFO ] Deduced a trap composed of 23 places in 215 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:04:55] [INFO ] Deduced a trap composed of 26 places in 188 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:04:59] [INFO ] Deduced a trap composed of 30 places in 248 ms of which 21 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 716/716 variables, and 641 constraints, problems are : Problem set: 120 solved, 390 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 390/510 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61551ms problems are : Problem set: 120 solved, 390 unsolved
Search for dead transitions found 120 dead transitions in 61591ms
Found 120 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 120 transitions
Dead transitions reduction (with SMT) removed 120 transitions
Starting structural reductions in LTL mode, iteration 1 : 205/269 places, 391/583 transitions.
Applied a total of 0 rules in 11 ms. Remains 205 /205 variables (removed 0) and now considering 391/391 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63003 ms. Remains : 205/269 places, 391/583 transitions.
Support contains 75 out of 205 places after structural reductions.
[2025-06-02 16:04:59] [INFO ] Flatten gal took : 129 ms
[2025-06-02 16:04:59] [INFO ] Flatten gal took : 70 ms
[2025-06-02 16:05:00] [INFO ] Input system was already deterministic with 391 transitions.
Support contains 72 out of 205 places (down from 75) after GAL structural reductions.
RANDOM walk for 40000 steps (19 resets) in 2319 ms. (17 steps per ms) remains 47/65 properties
BEST_FIRST walk for 4002 steps (11 resets) in 69 ms. (57 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (10 resets) in 28 ms. (138 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (12 resets) in 28 ms. (138 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (10 resets) in 22 ms. (174 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (10 resets) in 33 ms. (117 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (12 resets) in 18 ms. (210 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (11 resets) in 19 ms. (200 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (11 resets) in 26 ms. (148 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (10 resets) in 19 ms. (200 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (11 resets) in 15 ms. (250 steps per ms) remains 46/47 properties
BEST_FIRST walk for 4004 steps (14 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (14 resets) in 13 ms. (286 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (11 resets) in 9 ms. (400 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (11 resets) in 20 ms. (190 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (13 resets) in 21 ms. (181 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (10 resets) in 17 ms. (222 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (10 resets) in 16 ms. (235 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (9 resets) in 20 ms. (190 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (13 resets) in 12 ms. (308 steps per ms) remains 45/46 properties
BEST_FIRST walk for 4000 steps (11 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (11 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (11 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (13 resets) in 12 ms. (308 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (11 resets) in 11 ms. (333 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (10 resets) in 30 ms. (129 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (10 resets) in 19 ms. (200 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (9 resets) in 13 ms. (285 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (9 resets) in 13 ms. (285 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (12 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (11 resets) in 19 ms. (200 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (11 resets) in 12 ms. (307 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (10 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (10 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (11 resets) in 20 ms. (190 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (12 resets) in 20 ms. (190 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (12 resets) in 20 ms. (190 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (11 resets) in 65 ms. (60 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (10 resets) in 26 ms. (148 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (11 resets) in 28 ms. (138 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (12 resets) in 27 ms. (143 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (11 resets) in 31 ms. (125 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (11 resets) in 30 ms. (129 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (11 resets) in 31 ms. (125 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (9 resets) in 22 ms. (174 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 45/45 properties
// Phase 1: matrix 391 rows 205 cols
[2025-06-02 16:05:01] [INFO ] Computed 22 invariants in 8 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 45 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp63 is UNSAT
At refinement iteration 1 (OVERLAPS) 63/116 variables, 6/6 constraints. Problems are: Problem set: 7 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/6 constraints. Problems are: Problem set: 7 solved, 38 unsolved
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
At refinement iteration 3 (OVERLAPS) 76/192 variables, 16/22 constraints. Problems are: Problem set: 13 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/22 constraints. Problems are: Problem set: 13 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 381/573 variables, 192/214 constraints. Problems are: Problem set: 13 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 0/214 constraints. Problems are: Problem set: 13 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 15/588 variables, 8/222 constraints. Problems are: Problem set: 13 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/588 variables, 0/222 constraints. Problems are: Problem set: 13 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 8/596 variables, 5/227 constraints. Problems are: Problem set: 13 solved, 32 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/596 variables, 0/227 constraints. Problems are: Problem set: 13 solved, 32 unsolved
At refinement iteration 11 (OVERLAPS) 0/596 variables, 0/227 constraints. Problems are: Problem set: 13 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 596/596 variables, and 227 constraints, problems are : Problem set: 13 solved, 32 unsolved in 3310 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 45/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 13 solved, 32 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 13 solved, 32 unsolved
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp64 is UNSAT
At refinement iteration 1 (OVERLAPS) 66/112 variables, 6/6 constraints. Problems are: Problem set: 15 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/6 constraints. Problems are: Problem set: 15 solved, 30 unsolved
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp59 is UNSAT
At refinement iteration 3 (OVERLAPS) 77/189 variables, 15/21 constraints. Problems are: Problem set: 17 solved, 28 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:05:05] [INFO ] Deduced a trap composed of 20 places in 168 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:05:05] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 19 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 2/23 constraints. Problems are: Problem set: 17 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/23 constraints. Problems are: Problem set: 17 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 3/192 variables, 1/24 constraints. Problems are: Problem set: 17 solved, 28 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:05:06] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 1/25 constraints. Problems are: Problem set: 17 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/25 constraints. Problems are: Problem set: 17 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 381/573 variables, 192/217 constraints. Problems are: Problem set: 17 solved, 28 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/573 variables, 14/231 constraints. Problems are: Problem set: 17 solved, 28 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:05:07] [INFO ] Deduced a trap composed of 20 places in 159 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:05:07] [INFO ] Deduced a trap composed of 40 places in 148 ms of which 11 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/573 variables, 2/233 constraints. Problems are: Problem set: 17 solved, 28 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/573 variables, 0/233 constraints. Problems are: Problem set: 17 solved, 28 unsolved
At refinement iteration 13 (OVERLAPS) 15/588 variables, 8/241 constraints. Problems are: Problem set: 17 solved, 28 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/588 variables, 14/255 constraints. Problems are: Problem set: 17 solved, 28 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 588/596 variables, and 255 constraints, problems are : Problem set: 17 solved, 28 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 200/205 constraints, PredecessorRefiner: 28/44 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8451ms problems are : Problem set: 17 solved, 28 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 43 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 391/391 transitions.
Graph (complete) has 700 edges and 205 vertex of which 203 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 203 transition count 369
Reduce places removed 19 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 184 transition count 367
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 44 place count 182 transition count 367
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 44 place count 182 transition count 359
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 60 place count 174 transition count 359
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 75 place count 159 transition count 341
Iterating global reduction 3 with 15 rules applied. Total rules applied 90 place count 159 transition count 341
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 91 place count 158 transition count 339
Iterating global reduction 3 with 1 rules applied. Total rules applied 92 place count 158 transition count 339
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 136 place count 136 transition count 317
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 137 place count 136 transition count 316
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -51
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 155 place count 127 transition count 367
Drop transitions (Redundant composition of simpler transitions.) removed 59 transitions
Redundant transition composition rules discarded 59 transitions
Iterating global reduction 4 with 59 rules applied. Total rules applied 214 place count 127 transition count 308
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 216 place count 126 transition count 318
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 220 place count 126 transition count 314
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 224 place count 122 transition count 314
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 5 with 7 rules applied. Total rules applied 231 place count 122 transition count 308
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 239 place count 115 transition count 307
Partial Free-agglomeration rule applied 14 times.
Drop transitions (Partial Free agglomeration) removed 14 transitions
Iterating global reduction 6 with 14 rules applied. Total rules applied 253 place count 115 transition count 307
Applied a total of 253 rules in 217 ms. Remains 115 /205 variables (removed 90) and now considering 307/391 (removed 84) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 217 ms. Remains : 115/205 places, 307/391 transitions.
RANDOM walk for 40000 steps (52 resets) in 508 ms. (78 steps per ms) remains 24/28 properties
BEST_FIRST walk for 4003 steps (37 resets) in 20 ms. (190 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4002 steps (22 resets) in 38 ms. (102 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (38 resets) in 25 ms. (154 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (16 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (38 resets) in 17 ms. (222 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4003 steps (25 resets) in 14 ms. (266 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4001 steps (34 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (28 resets) in 28 ms. (138 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (33 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (19 resets) in 28 ms. (137 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (29 resets) in 38 ms. (102 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (39 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (30 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (42 resets) in 17 ms. (222 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4001 steps (16 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (34 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (19 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (15 resets) in 13 ms. (285 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (32 resets) in 34 ms. (114 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (49 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
// Phase 1: matrix 307 rows 115 cols
[2025-06-02 16:05:10] [INFO ] Computed 23 invariants in 5 ms
[2025-06-02 16:05:10] [INFO ] State equation strengthened by 8 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/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 28/62 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 4/66 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 46/112 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 2/114 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 307/421 variables, 114/137 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/421 variables, 8/145 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/421 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (OVERLAPS) 1/422 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/422 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (OVERLAPS) 0/422 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 146 constraints, problems are : Problem set: 0 solved, 20 unsolved in 1897 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 115/115 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 28/62 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 4/66 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 46/112 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 2/114 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 307/421 variables, 114/137 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/421 variables, 8/145 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/421 variables, 10/155 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/421 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (OVERLAPS) 1/422 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/422 variables, 10/166 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:05:14] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 10 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/422 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:05:15] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 9 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/422 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:05:16] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:05:16] [INFO ] Deduced a trap along path composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/422 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/422 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 19 (OVERLAPS) 0/422 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 170 constraints, problems are : Problem set: 0 solved, 20 unsolved in 9985 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 115/115 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 11917ms problems are : Problem set: 0 solved, 20 unsolved
Parikh walk visited 16 properties in 14462 ms.
Support contains 11 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 307/307 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 115 transition count 302
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 110 transition count 302
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 12 place count 108 transition count 300
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 108 transition count 300
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 27 rules applied. Total rules applied 41 place count 93 transition count 288
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 93 transition count 287
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 50 place count 89 transition count 317
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 3 with 16 rules applied. Total rules applied 66 place count 89 transition count 301
Free-agglomeration rule applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 74 place count 89 transition count 293
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 83 place count 81 transition count 292
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 84 place count 81 transition count 291
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 88 place count 81 transition count 344
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 101 place count 77 transition count 335
Applied a total of 101 rules in 67 ms. Remains 77 /115 variables (removed 38) and now considering 335/307 (removed -28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 77/115 places, 335/307 transitions.
RANDOM walk for 40000 steps (3625 resets) in 309 ms. (129 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (687 resets) in 83 ms. (476 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (448 resets) in 64 ms. (615 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (714 resets) in 77 ms. (512 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (445 resets) in 65 ms. (606 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 618880 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :0 out of 4
Probabilistic random walk after 618880 steps, saw 113838 distinct states, run finished after 3007 ms. (steps per millisecond=205 ) properties seen :0
// Phase 1: matrix 335 rows 77 cols
[2025-06-02 16:05:39] [INFO ] Computed 20 invariants in 2 ms
[2025-06-02 16:05:39] [INFO ] State equation strengthened by 52 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/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 35/46 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 20/66 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 10/76 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 335/411 variables, 76/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/411 variables, 52/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/412 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/412 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/412 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 412/412 variables, and 149 constraints, problems are : Problem set: 0 solved, 4 unsolved in 321 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 77/77 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 35/46 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 20/66 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 10/76 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 335/411 variables, 76/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/411 variables, 52/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/412 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/412 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/412 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/412 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 412/412 variables, and 153 constraints, problems are : Problem set: 0 solved, 4 unsolved in 944 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 77/77 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1277ms problems are : Problem set: 0 solved, 4 unsolved
Finished Parikh walk after 150 steps, including 1 resets, run visited all 2 properties in 3 ms. (steps per millisecond=50 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 184 ms.
Successfully simplified 17 atomic propositions for a total of 16 simplifications.
[2025-06-02 16:05:41] [INFO ] Flatten gal took : 40 ms
[2025-06-02 16:05:41] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA MedleyA-PT-19-CTLFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 16:05:41] [INFO ] Flatten gal took : 41 ms
[2025-06-02 16:05:41] [INFO ] Input system was already deterministic with 391 transitions.
Support contains 52 out of 205 places (down from 59) after GAL structural reductions.
Computed a total of 22 stabilizing places and 24 stable transitions
Graph (complete) has 700 edges and 205 vertex of which 203 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 391/391 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 187 transition count 369
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 187 transition count 369
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 186 transition count 367
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 186 transition count 367
Applied a total of 38 rules in 19 ms. Remains 186 /205 variables (removed 19) and now considering 367/391 (removed 24) transitions.
// Phase 1: matrix 367 rows 186 cols
[2025-06-02 16:05:41] [INFO ] Computed 22 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:05:41] [INFO ] Implicit Places using invariants in 164 ms returned []
[2025-06-02 16:05:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:05:42] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 582 ms to find 0 implicit places.
Running 366 sub problems to find dead transitions.
[2025-06-02 16:05:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (OVERLAPS) 1/186 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:05:50] [INFO ] Deduced a trap composed of 26 places in 178 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:05:50] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:05:50] [INFO ] Deduced a trap composed of 35 places in 160 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:05:51] [INFO ] Deduced a trap composed of 35 places in 132 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:05:51] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:05:51] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:05:51] [INFO ] Deduced a trap composed of 18 places in 171 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:05:52] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:05:52] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:05:52] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:05:53] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (OVERLAPS) 367/553 variables, 186/219 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:06:03] [INFO ] Deduced a trap composed of 14 places in 287 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:06:03] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:06:04] [INFO ] Deduced a trap composed of 14 places in 180 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:06:04] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:06:05] [INFO ] Deduced a trap composed of 14 places in 128 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:06:05] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 6/225 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 553/553 variables, and 225 constraints, problems are : Problem set: 0 solved, 366 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (OVERLAPS) 1/186 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 17/39 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (OVERLAPS) 367/553 variables, 186/225 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 366/591 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:06:25] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:06:26] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:06:27] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:06:27] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:06:28] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 5/596 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:06:41] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:06:42] [INFO ] Deduced a trap composed of 33 places in 136 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 553/553 variables, and 598 constraints, problems are : Problem set: 0 solved, 366 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60406ms problems are : Problem set: 0 solved, 366 unsolved
Search for dead transitions found 0 dead transitions in 60409ms
Starting structural reductions in LTL mode, iteration 1 : 186/205 places, 367/391 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61014 ms. Remains : 186/205 places, 367/391 transitions.
[2025-06-02 16:06:42] [INFO ] Flatten gal took : 26 ms
[2025-06-02 16:06:42] [INFO ] Flatten gal took : 26 ms
[2025-06-02 16:06:42] [INFO ] Input system was already deterministic with 367 transitions.
[2025-06-02 16:06:42] [INFO ] Flatten gal took : 23 ms
[2025-06-02 16:06:42] [INFO ] Flatten gal took : 21 ms
[2025-06-02 16:06:42] [INFO ] Time to serialize gal into /tmp/CTLFireability8025128749001462001.gal : 20 ms
[2025-06-02 16:06:42] [INFO ] Time to serialize properties into /tmp/CTLFireability10478964304830079315.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/CTLFireability8025128749001462001.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10478964304830079315.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 16:07:12] [INFO ] Flatten gal took : 20 ms
[2025-06-02 16:07:12] [INFO ] Applying decomposition
[2025-06-02 16:07:12] [INFO ] Flatten gal took : 17 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/graph599395842956087008.txt' '-o' '/tmp/graph599395842956087008.bin' '-w' '/tmp/graph599395842956087008.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph599395842956087008.bin' '-l' '-1' '-v' '-w' '/tmp/graph599395842956087008.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:07:13] [INFO ] Decomposing Gal with order
[2025-06-02 16:07:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:07:13] [INFO ] Removed a total of 686 redundant transitions.
[2025-06-02 16:07:13] [INFO ] Flatten gal took : 162 ms
[2025-06-02 16:07:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 21 ms.
[2025-06-02 16:07:13] [INFO ] Time to serialize gal into /tmp/CTLFireability2188021713901526646.gal : 9 ms
[2025-06-02 16:07:13] [INFO ] Time to serialize properties into /tmp/CTLFireability297593308404306559.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/CTLFireability2188021713901526646.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability297593308404306559.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,6.27849e+11,2.19625,66108,2271,44,117761,933,637,338659,62,4407,0


Converting to forward existential form...Done !
original formula: EG((((i2.u33.p148==0) + AX(((i7.u45.p196==1)||(i5.i0.u39.p162==1)))) + AG(EX((((i2.u21.p104==1)&&(i4.u31.p134==1))&&((i6.u38.p172==1)&&(i...175
=> equivalent forward existential formula: [FwdG(Init,(((i2.u33.p148==0) + !(EX(!(((i7.u45.p196==1)||(i5.i0.u39.p162==1)))))) + !(E(TRUE U !(EX((((i2.u21.p...236
Reverse transition relation is NOT exact ! Due to transitions t44, t78, t141, i0.t152, i0.t150, i0.u7.t158, i0.u7.t159, i1.t139, i1.t134, i1.i0.t125, i1.i0...988
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 391/391 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 186 transition count 368
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 186 transition count 368
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 185 transition count 366
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 185 transition count 366
Applied a total of 40 rules in 11 ms. Remains 185 /205 variables (removed 20) and now considering 366/391 (removed 25) transitions.
// Phase 1: matrix 366 rows 185 cols
[2025-06-02 16:07:43] [INFO ] Computed 22 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:07:43] [INFO ] Implicit Places using invariants in 116 ms returned []
[2025-06-02 16:07:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:07:43] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2025-06-02 16:07:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:07:52] [INFO ] Deduced a trap composed of 25 places in 183 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:07:52] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:07:52] [INFO ] Deduced a trap composed of 35 places in 166 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:07:52] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:07:53] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:07:53] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:07:53] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:07:53] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:07:53] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:07:54] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:07:54] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 366/551 variables, 185/218 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:08:04] [INFO ] Deduced a trap composed of 13 places in 239 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:08:05] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:08:05] [INFO ] Deduced a trap composed of 14 places in 184 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:08:06] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:08:06] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:08:06] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 13 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 6/224 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 551/551 variables, and 224 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 17/17 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/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 17/39 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 366/551 variables, 185/224 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 365/589 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:08:33] [INFO ] Deduced a trap composed of 40 places in 130 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:08:34] [INFO ] Deduced a trap composed of 21 places in 265 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:08:36] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:08:37] [INFO ] Deduced a trap composed of 43 places in 134 ms of which 11 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 593 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60385ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 60389ms
Starting structural reductions in LTL mode, iteration 1 : 185/205 places, 366/391 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60802 ms. Remains : 185/205 places, 366/391 transitions.
[2025-06-02 16:08:44] [INFO ] Flatten gal took : 24 ms
[2025-06-02 16:08:44] [INFO ] Flatten gal took : 25 ms
[2025-06-02 16:08:44] [INFO ] Input system was already deterministic with 366 transitions.
[2025-06-02 16:08:44] [INFO ] Flatten gal took : 24 ms
[2025-06-02 16:08:44] [INFO ] Flatten gal took : 25 ms
[2025-06-02 16:08:44] [INFO ] Time to serialize gal into /tmp/CTLFireability12744156187426147696.gal : 8 ms
[2025-06-02 16:08:44] [INFO ] Time to serialize properties into /tmp/CTLFireability10140765409313972244.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/CTLFireability12744156187426147696.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10140765409313972244.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 16:09:14] [INFO ] Flatten gal took : 15 ms
[2025-06-02 16:09:14] [INFO ] Applying decomposition
[2025-06-02 16:09:14] [INFO ] Flatten gal took : 20 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/graph919657999975114842.txt' '-o' '/tmp/graph919657999975114842.bin' '-w' '/tmp/graph919657999975114842.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph919657999975114842.bin' '-l' '-1' '-v' '-w' '/tmp/graph919657999975114842.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:09:14] [INFO ] Decomposing Gal with order
[2025-06-02 16:09:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:09:14] [INFO ] Removed a total of 606 redundant transitions.
[2025-06-02 16:09:14] [INFO ] Flatten gal took : 40 ms
[2025-06-02 16:09:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 78 labels/synchronizations in 14 ms.
[2025-06-02 16:09:14] [INFO ] Time to serialize gal into /tmp/CTLFireability1357840162239620377.gal : 5 ms
[2025-06-02 16:09:14] [INFO ] Time to serialize properties into /tmp/CTLFireability14586451967413900092.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/CTLFireability1357840162239620377.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14586451967413900092.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,6.51143e+11,2.47739,80000,2630,322,147724,17260,569,347783,135,66330,0


Converting to forward existential form...Done !
original formula: AF(E(EF((i8.u41.p193==1)) U ((EX(!(((i5.u22.p100==1)||(((i9.i1.u38.p182==1)&&(i9.i1.u53.p234==1))&&((i3.i1.u54.p238==1)&&(i9.i1.u62.p270=...276
=> equivalent forward existential formula: [FwdG(Init,!(E(E(TRUE U (i8.u41.p193==1)) U ((EX(!(((i5.u22.p100==1)||(((i9.i1.u38.p182==1)&&(i9.i1.u53.p234==1)...339
Reverse transition relation is NOT exact ! Due to transitions t44, t77, t133, t138, t140, i0.i2.t19, i0.i2.u56.t18, i1.t151, i1.t149, i1.u7.t157, i1.u7.t15...1018
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 391/391 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 185 transition count 367
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 185 transition count 367
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 184 transition count 365
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 184 transition count 365
Applied a total of 42 rules in 10 ms. Remains 184 /205 variables (removed 21) and now considering 365/391 (removed 26) transitions.
// Phase 1: matrix 365 rows 184 cols
[2025-06-02 16:09:44] [INFO ] Computed 22 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:09:45] [INFO ] Implicit Places using invariants in 147 ms returned []
[2025-06-02 16:09:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:09:45] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
Running 364 sub problems to find dead transitions.
[2025-06-02 16: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/183 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/184 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:09:53] [INFO ] Deduced a trap composed of 25 places in 172 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:09:53] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:09:53] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:09:54] [INFO ] Deduced a trap composed of 35 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-02 16:09:54] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:09:54] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:09:55] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:09:55] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:09:55] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:09:55] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (OVERLAPS) 365/549 variables, 184/216 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:10:06] [INFO ] Deduced a trap composed of 13 places in 245 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:10:06] [INFO ] Deduced a trap composed of 23 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-02 16:10:07] [INFO ] Deduced a trap composed of 14 places in 186 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:10:07] [INFO ] Deduced a trap composed of 14 places in 170 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:10:07] [INFO ] Deduced a trap composed of 24 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-02 16:10:08] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 14 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 6/222 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 549/549 variables, and 222 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 364 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/184 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (OVERLAPS) 365/549 variables, 184/222 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 364/586 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:10:37] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:10:37] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 16 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/549 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 549/549 variables, and 588 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60260ms problems are : Problem set: 0 solved, 364 unsolved
Search for dead transitions found 0 dead transitions in 60262ms
Starting structural reductions in LTL mode, iteration 1 : 184/205 places, 365/391 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60836 ms. Remains : 184/205 places, 365/391 transitions.
[2025-06-02 16:10:45] [INFO ] Flatten gal took : 23 ms
[2025-06-02 16:10:45] [INFO ] Flatten gal took : 22 ms
[2025-06-02 16:10:45] [INFO ] Input system was already deterministic with 365 transitions.
[2025-06-02 16:10:45] [INFO ] Flatten gal took : 22 ms
[2025-06-02 16:10:45] [INFO ] Flatten gal took : 22 ms
[2025-06-02 16:10:45] [INFO ] Time to serialize gal into /tmp/CTLFireability256217545269170771.gal : 5 ms
[2025-06-02 16:10:45] [INFO ] Time to serialize properties into /tmp/CTLFireability875516476813044703.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/CTLFireability256217545269170771.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability875516476813044703.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 -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 16:11:16] [INFO ] Flatten gal took : 12 ms
[2025-06-02 16:11:16] [INFO ] Applying decomposition
[2025-06-02 16:11:16] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2186905742400659344.txt' '-o' '/tmp/graph2186905742400659344.bin' '-w' '/tmp/graph2186905742400659344.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2186905742400659344.bin' '-l' '-1' '-v' '-w' '/tmp/graph2186905742400659344.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:11:16] [INFO ] Decomposing Gal with order
[2025-06-02 16:11:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:11:16] [INFO ] Removed a total of 618 redundant transitions.
[2025-06-02 16:11:16] [INFO ] Flatten gal took : 33 ms
[2025-06-02 16:11:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 9 ms.
[2025-06-02 16:11:16] [INFO ] Time to serialize gal into /tmp/CTLFireability16001254462569134763.gal : 4 ms
[2025-06-02 16:11:16] [INFO ] Time to serialize properties into /tmp/CTLFireability2494224873451519281.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/CTLFireability16001254462569134763.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2494224873451519281.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,5.64709e+11,1.02506,28648,1256,118,52638,1145,565,110896,102,3712,0


Converting to forward existential form...Done !
original formula: AF(!(E(AX(EF((((i3.u4.p26==1)&&(i3.u4.p78==1))&&((i9.i0.u39.p182==1)&&(i8.u46.p203==1))))) U AG(!((((i9.i0.u39.p182==1)&&(i8.u42.p200==1)...183
=> equivalent forward existential formula: [FwdG(Init,!(!(E(!(EX(!(E(TRUE U (((i3.u4.p26==1)&&(i3.u4.p78==1))&&((i9.i0.u39.p182==1)&&(i8.u46.p203==1)))))))...252
Reverse transition relation is NOT exact ! Due to transitions t44, t77, t103, t124, i0.i3.u56.t18, i0.i3.u56.t19, i2.t150, i2.t148, i2.t139, i2.u7.t158, i2...892
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 205/205 places, 391/391 transitions.
Graph (complete) has 700 edges and 205 vertex of which 203 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 202 transition count 357
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 36 rules applied. Total rules applied 68 place count 171 transition count 352
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 71 place count 169 transition count 351
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 72 place count 168 transition count 351
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 72 place count 168 transition count 341
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 92 place count 158 transition count 341
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 112 place count 138 transition count 314
Iterating global reduction 4 with 20 rules applied. Total rules applied 132 place count 138 transition count 314
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 133 place count 138 transition count 313
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 134 place count 137 transition count 313
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 134 place count 137 transition count 312
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 136 place count 136 transition count 312
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 137 place count 135 transition count 310
Iterating global reduction 6 with 1 rules applied. Total rules applied 138 place count 135 transition count 310
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 6 with 47 rules applied. Total rules applied 185 place count 110 transition count 288
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 188 place count 110 transition count 285
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 194 place count 107 transition count 282
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 195 place count 106 transition count 281
Applied a total of 195 rules in 73 ms. Remains 106 /205 variables (removed 99) and now considering 281/391 (removed 110) transitions.
[2025-06-02 16:11:46] [INFO ] Flow matrix only has 280 transitions (discarded 1 similar events)
// Phase 1: matrix 280 rows 106 cols
[2025-06-02 16:11:46] [INFO ] Computed 19 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:11:46] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-06-02 16:11:46] [INFO ] Flow matrix only has 280 transitions (discarded 1 similar events)
[2025-06-02 16:11:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:11:46] [INFO ] State equation strengthened by 29 read => feed constraints.
[2025-06-02 16:11:46] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:11:46] [INFO ] Redundant transitions in 89 ms returned []
Running 270 sub problems to find dead transitions.
[2025-06-02 16:11:46] [INFO ] Flow matrix only has 280 transitions (discarded 1 similar events)
[2025-06-02 16:11:46] [INFO ] Invariant cache hit.
[2025-06-02 16:11:46] [INFO ] State equation strengthened by 29 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 4/105 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (OVERLAPS) 279/384 variables, 105/124 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 28/152 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (OVERLAPS) 1/385 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 10 (OVERLAPS) 1/386 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/386 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 386/386 variables, and 154 constraints, problems are : Problem set: 0 solved, 270 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 106/106 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 4/105 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (OVERLAPS) 279/384 variables, 105/124 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 28/152 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 270/422 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/384 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (OVERLAPS) 1/385 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 385/386 variables, and 423 constraints, problems are : Problem set: 0 solved, 270 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 106/106 constraints, ReadFeed: 28/29 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60269ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 60271ms
Starting structural reductions in SI_CTL mode, iteration 1 : 106/205 places, 281/391 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60752 ms. Remains : 106/205 places, 281/391 transitions.
[2025-06-02 16:12:46] [INFO ] Flatten gal took : 24 ms
[2025-06-02 16:12:47] [INFO ] Flatten gal took : 23 ms
[2025-06-02 16:12:47] [INFO ] Input system was already deterministic with 281 transitions.
[2025-06-02 16:12:47] [INFO ] Flatten gal took : 24 ms
[2025-06-02 16:12:47] [INFO ] Flatten gal took : 28 ms
[2025-06-02 16:12:47] [INFO ] Time to serialize gal into /tmp/CTLFireability5057299777456687656.gal : 4 ms
[2025-06-02 16:12:47] [INFO ] Time to serialize properties into /tmp/CTLFireability1377279670642092402.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/CTLFireability5057299777456687656.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1377279670642092402.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,7.96733e+09,5.23572,115004,2,6485,5,507320,6,0,697,418547,0


Converting to forward existential form...Done !
original formula: EG(((EF((((p182==1)&&(p234==1))&&((p238==1)&&(p263==1)))) * AF((p195==1))) * ((p204==0)||(p207==0))))
=> equivalent forward existential formula: [FwdG(Init,((E(TRUE U (((p182==1)&&(p234==1))&&((p238==1)&&(p263==1)))) * !(EG(!((p195==1))))) * ((p204==0)||(p2...174
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t7, t8, t23, t24, t25, t27, t35, t36, t50, t52, t53, t59, t60, t74, t76, t77, t84, t8...432
Detected timeout of ITS tools.
[2025-06-02 16:13:17] [INFO ] Flatten gal took : 13 ms
[2025-06-02 16:13:17] [INFO ] Applying decomposition
[2025-06-02 16:13:17] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4660249416617963118.txt' '-o' '/tmp/graph4660249416617963118.bin' '-w' '/tmp/graph4660249416617963118.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4660249416617963118.bin' '-l' '-1' '-v' '-w' '/tmp/graph4660249416617963118.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:13:17] [INFO ] Decomposing Gal with order
[2025-06-02 16:13:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:13:17] [INFO ] Removed a total of 637 redundant transitions.
[2025-06-02 16:13:17] [INFO ] Flatten gal took : 25 ms
[2025-06-02 16:13:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 6 ms.
[2025-06-02 16:13:17] [INFO ] Time to serialize gal into /tmp/CTLFireability13555645425892461455.gal : 3 ms
[2025-06-02 16:13:17] [INFO ] Time to serialize properties into /tmp/CTLFireability14395611700635561442.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/CTLFireability13555645425892461455.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14395611700635561442.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.96733e+09,0.075583,6212,218,26,4364,153,330,8149,66,361,0


Converting to forward existential form...Done !
original formula: EG(((EF((((i4.u16.p182==1)&&(i4.u26.p234==1))&&((i5.u27.p238==1)&&(i5.u30.p263==1)))) * AF((i3.u17.p195==1))) * ((i3.u19.p204==0)||(i3.u2...168
=> equivalent forward existential formula: [FwdG(Init,((E(TRUE U (((i4.u16.p182==1)&&(i4.u26.p234==1))&&((i5.u27.p238==1)&&(i5.u30.p263==1)))) * !(EG(!((i3...223
Reverse transition relation is NOT exact ! Due to transitions t87, t95, t145, t157, t165, t166, t174, t237, t239, i0.i0.t1, i0.i0.t77, i0.i0.u1.t76, i0.i0....449
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 3
Fast SCC detection found a local 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
(forward)formula 0,0,2.64138,73412,1,0,117265,710,2130,263195,322,2313,118040
FORMULA MedleyA-PT-19-CTLFireability-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 391/391 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 185 transition count 367
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 185 transition count 367
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 184 transition count 365
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 184 transition count 365
Applied a total of 42 rules in 6 ms. Remains 184 /205 variables (removed 21) and now considering 365/391 (removed 26) transitions.
// Phase 1: matrix 365 rows 184 cols
[2025-06-02 16:13:19] [INFO ] Computed 22 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:13:20] [INFO ] Implicit Places using invariants in 156 ms returned []
[2025-06-02 16:13:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:13:20] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
Running 364 sub problems to find dead transitions.
[2025-06-02 16:13:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/184 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:28] [INFO ] Deduced a trap composed of 25 places in 182 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:28] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:28] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:29] [INFO ] Deduced a trap composed of 35 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-02 16:13:29] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:29] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:30] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:30] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:30] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:30] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (OVERLAPS) 365/549 variables, 184/216 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:41] [INFO ] Deduced a trap composed of 13 places in 271 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:41] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:42] [INFO ] Deduced a trap composed of 14 places in 184 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:42] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:42] [INFO ] Deduced a trap composed of 24 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-02 16:13:43] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 6/222 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 549/549 variables, and 222 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 364 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/184 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (OVERLAPS) 365/549 variables, 184/222 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 364/586 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:12] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:12] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 16 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/549 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 549/549 variables, and 588 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60402ms problems are : Problem set: 0 solved, 364 unsolved
Search for dead transitions found 0 dead transitions in 60406ms
Starting structural reductions in LTL mode, iteration 1 : 184/205 places, 365/391 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60933 ms. Remains : 184/205 places, 365/391 transitions.
[2025-06-02 16:14:20] [INFO ] Flatten gal took : 12 ms
[2025-06-02 16:14:20] [INFO ] Flatten gal took : 22 ms
[2025-06-02 16:14:20] [INFO ] Input system was already deterministic with 365 transitions.
[2025-06-02 16:14:20] [INFO ] Flatten gal took : 14 ms
[2025-06-02 16:14:21] [INFO ] Flatten gal took : 15 ms
[2025-06-02 16:14:21] [INFO ] Time to serialize gal into /tmp/CTLFireability5872163836376795122.gal : 3 ms
[2025-06-02 16:14:21] [INFO ] Time to serialize properties into /tmp/CTLFireability10203730007258781776.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/CTLFireability5872163836376795122.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10203730007258781776.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 16:14:51] [INFO ] Flatten gal took : 9 ms
[2025-06-02 16:14:51] [INFO ] Applying decomposition
[2025-06-02 16:14:51] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9926291806587409165.txt' '-o' '/tmp/graph9926291806587409165.bin' '-w' '/tmp/graph9926291806587409165.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9926291806587409165.bin' '-l' '-1' '-v' '-w' '/tmp/graph9926291806587409165.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:14:51] [INFO ] Decomposing Gal with order
[2025-06-02 16:14:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:14:51] [INFO ] Removed a total of 685 redundant transitions.
[2025-06-02 16:14:51] [INFO ] Flatten gal took : 32 ms
[2025-06-02 16:14:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 9 ms.
[2025-06-02 16:14:51] [INFO ] Time to serialize gal into /tmp/CTLFireability16617191354164734957.gal : 2 ms
[2025-06-02 16:14:51] [INFO ] Time to serialize properties into /tmp/CTLFireability11108050454148567618.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/CTLFireability16617191354164734957.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11108050454148567618.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.64709e+11,1.63344,42460,1262,37,76983,833,546,188823,55,3726,0


Converting to forward existential form...Done !
original formula: (AF((AX(((((i9.i0.u39.p182==1)&&(i7.u40.p188==1))&&((i3.i1.u56.p238==1)&&(i3.i1.u63.p263==1)))||(i2.i1.u18.p73==1))) + AG(EF(((i6.u21.p10...276
=> equivalent forward existential formula: [(FwdU((Init * !(!(EG(!((!(EX(!(((((i9.i0.u39.p182==1)&&(i7.u40.p188==1))&&((i3.i1.u56.p238==1)&&(i3.i1.u63.p263...363
Reverse transition relation is NOT exact ! Due to transitions t44, t77, t139, i1.t150, i1.t148, i1.u6.t156, i1.u6.t157, i2.t137, i2.t132, i2.i0.u3.t161, i2...930
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 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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 205/205 places, 391/391 transitions.
Graph (complete) has 700 edges and 205 vertex of which 203 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 202 transition count 355
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 39 rules applied. Total rules applied 73 place count 169 transition count 349
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 77 place count 166 transition count 348
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 78 place count 165 transition count 348
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 78 place count 165 transition count 338
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 98 place count 155 transition count 338
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 118 place count 135 transition count 311
Iterating global reduction 4 with 20 rules applied. Total rules applied 138 place count 135 transition count 311
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 139 place count 135 transition count 310
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 140 place count 134 transition count 310
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 140 place count 134 transition count 308
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 144 place count 132 transition count 308
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 145 place count 131 transition count 306
Iterating global reduction 6 with 1 rules applied. Total rules applied 146 place count 131 transition count 306
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 6 with 47 rules applied. Total rules applied 193 place count 106 transition count 284
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 196 place count 106 transition count 281
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 202 place count 103 transition count 278
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 204 place count 101 transition count 276
Applied a total of 204 rules in 63 ms. Remains 101 /205 variables (removed 104) and now considering 276/391 (removed 115) transitions.
[2025-06-02 16:15:21] [INFO ] Flow matrix only has 275 transitions (discarded 1 similar events)
// Phase 1: matrix 275 rows 101 cols
[2025-06-02 16:15:21] [INFO ] Computed 19 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:15:21] [INFO ] Implicit Places using invariants in 94 ms returned []
[2025-06-02 16:15:21] [INFO ] Flow matrix only has 275 transitions (discarded 1 similar events)
[2025-06-02 16:15:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:15:21] [INFO ] State equation strengthened by 29 read => feed constraints.
[2025-06-02 16:15:21] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:15:21] [INFO ] Redundant transitions in 79 ms returned []
Running 267 sub problems to find dead transitions.
[2025-06-02 16:15:21] [INFO ] Flow matrix only has 275 transitions (discarded 1 similar events)
[2025-06-02 16:15:21] [INFO ] Invariant cache hit.
[2025-06-02 16:15:21] [INFO ] State equation strengthened by 29 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (OVERLAPS) 3/101 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (OVERLAPS) 274/375 variables, 101/120 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 28/148 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 8 (OVERLAPS) 1/376 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 10 (OVERLAPS) 0/376 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 267 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 149 constraints, problems are : Problem set: 0 solved, 267 unsolved in 17814 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 101/101 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 267 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (OVERLAPS) 3/101 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (OVERLAPS) 274/375 variables, 101/120 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 28/148 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 267/415 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 9 (OVERLAPS) 1/376 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 376/376 variables, and 416 constraints, problems are : Problem set: 0 solved, 267 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 101/101 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48034ms problems are : Problem set: 0 solved, 267 unsolved
Search for dead transitions found 0 dead transitions in 48036ms
Starting structural reductions in SI_CTL mode, iteration 1 : 101/205 places, 276/391 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48568 ms. Remains : 101/205 places, 276/391 transitions.
[2025-06-02 16:16:09] [INFO ] Flatten gal took : 13 ms
[2025-06-02 16:16:09] [INFO ] Flatten gal took : 14 ms
[2025-06-02 16:16:09] [INFO ] Input system was already deterministic with 276 transitions.
[2025-06-02 16:16:09] [INFO ] Flatten gal took : 15 ms
[2025-06-02 16:16:09] [INFO ] Flatten gal took : 15 ms
[2025-06-02 16:16:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7896135764826395327.gal : 3 ms
[2025-06-02 16:16:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5447886665225779015.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7896135764826395327.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5447886665225779015.prop' '--nowitness' '--gen-order' 'FOLLOW'

RANDOM walk for 4998 steps (415 resets) in 141 ms. (35 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-19-CTLFireability-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 205/205 places, 391/391 transitions.
Graph (complete) has 700 edges and 205 vertex of which 203 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 202 transition count 358
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 36 rules applied. Total rules applied 67 place count 172 transition count 352
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 71 place count 169 transition count 351
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 72 place count 168 transition count 351
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 72 place count 168 transition count 340
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 94 place count 157 transition count 340
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 113 place count 138 transition count 315
Iterating global reduction 4 with 19 rules applied. Total rules applied 132 place count 138 transition count 315
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 132 place count 138 transition count 313
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 136 place count 136 transition count 313
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 47 rules applied. Total rules applied 183 place count 111 transition count 291
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 186 place count 111 transition count 288
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 192 place count 108 transition count 285
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 193 place count 108 transition count 285
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 195 place count 106 transition count 283
Applied a total of 195 rules in 74 ms. Remains 106 /205 variables (removed 99) and now considering 283/391 (removed 108) transitions.
[2025-06-02 16:16:10] [INFO ] Flow matrix only has 282 transitions (discarded 1 similar events)
// Phase 1: matrix 282 rows 106 cols
[2025-06-02 16:16:10] [INFO ] Computed 19 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:16:10] [INFO ] Implicit Places using invariants in 128 ms returned []
[2025-06-02 16:16:10] [INFO ] Flow matrix only has 282 transitions (discarded 1 similar events)
[2025-06-02 16:16:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:16:10] [INFO ] State equation strengthened by 62 read => feed constraints.
[2025-06-02 16:16:10] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:16:10] [INFO ] Redundant transitions in 47 ms returned []
Running 276 sub problems to find dead transitions.
[2025-06-02 16:16:10] [INFO ] Flow matrix only has 282 transitions (discarded 1 similar events)
[2025-06-02 16:16:10] [INFO ] Invariant cache hit.
[2025-06-02 16:16:10] [INFO ] State equation strengthened by 62 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 3/106 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:15] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 281/387 variables, 106/126 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 61/187 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:23] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 10 (OVERLAPS) 1/388 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/388 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 388/388 variables, and 189 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 106/106 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 3/106 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 281/387 variables, 106/127 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 61/188 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 276/464 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 10 (OVERLAPS) 1/388 variables, 1/465 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:08] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 388/388 variables, and 466 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 106/106 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60166ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 60168ms
Starting structural reductions in SI_CTL mode, iteration 1 : 106/205 places, 283/391 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60757 ms. Remains : 106/205 places, 283/391 transitions.
[2025-06-02 16:17:10] [INFO ] Flatten gal took : 9 ms
[2025-06-02 16:17:10] [INFO ] Flatten gal took : 9 ms
[2025-06-02 16:17:10] [INFO ] Input system was already deterministic with 283 transitions.
[2025-06-02 16:17:10] [INFO ] Flatten gal took : 9 ms
[2025-06-02 16:17:10] [INFO ] Flatten gal took : 8 ms
[2025-06-02 16:17:10] [INFO ] Time to serialize gal into /tmp/CTLFireability13730845306692969321.gal : 2 ms
[2025-06-02 16:17:10] [INFO ] Time to serialize properties into /tmp/CTLFireability14443123212173021452.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/CTLFireability13730845306692969321.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14443123212173021452.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.46023e+09,5.63548,133476,2,7077,5,564399,6,0,698,467095,0


Converting to forward existential form...Done !
original formula: !(A((p106!=1) U !(EG(!((EG((p150==1)) * (p157!=1)))))))
=> equivalent forward existential formula: ([FwdG((FwdU(Init,!(!(EG(!((EG((p150==1)) * (p157!=1))))))) * !((p106!=1))),!((EG((p150==1)) * (p157!=1))))] != ...226
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t5, t7, t8, t22, t23, t24, t25, t32, t35, t41, t45, t49, t51, t52, t58, t59, t73, t75...292
Detected timeout of ITS tools.
[2025-06-02 16:17:40] [INFO ] Flatten gal took : 9 ms
[2025-06-02 16:17:40] [INFO ] Applying decomposition
[2025-06-02 16:17:40] [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/graph9132293112884769551.txt' '-o' '/tmp/graph9132293112884769551.bin' '-w' '/tmp/graph9132293112884769551.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9132293112884769551.bin' '-l' '-1' '-v' '-w' '/tmp/graph9132293112884769551.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:17:40] [INFO ] Decomposing Gal with order
[2025-06-02 16:17:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:17:40] [INFO ] Removed a total of 561 redundant transitions.
[2025-06-02 16:17:40] [INFO ] Flatten gal took : 20 ms
[2025-06-02 16:17:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 6 ms.
[2025-06-02 16:17:40] [INFO ] Time to serialize gal into /tmp/CTLFireability7106835437911845453.gal : 2 ms
[2025-06-02 16:17:40] [INFO ] Time to serialize properties into /tmp/CTLFireability11970990947823921799.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/CTLFireability7106835437911845453.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11970990947823921799.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,3.46023e+09,0.060207,5580,239,102,2808,391,346,4954,118,821,0


Converting to forward existential form...Done !
original formula: !(A((i1.u8.p106!=1) U !(EG(!((EG((i4.u13.p150==1)) * (i4.u14.p157!=1)))))))
=> equivalent forward existential formula: ([FwdG((FwdU(Init,!(!(EG(!((EG((i4.u13.p150==1)) * (i4.u14.p157!=1))))))) * !((i1.u8.p106!=1))),!((EG((i4.u13.p1...274
Reverse transition relation is NOT exact ! Due to transitions t106, t269, t282, i0.i0.t1, i0.i0.t76, i0.i0.u1.t75, i0.i1.t59, i0.i1.u5.t73, i0.i1.u7.t58, i...430
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 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
(forward)formula 0,1,22.0771,448764,1,0,674356,9807,2064,1.7686e+06,631,52274,616349
FORMULA MedleyA-PT-19-CTLFireability-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 205/205 places, 391/391 transitions.
Graph (complete) has 700 edges and 205 vertex of which 203 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 202 transition count 359
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 33 rules applied. Total rules applied 63 place count 173 transition count 355
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 171 transition count 355
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 65 place count 171 transition count 345
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 85 place count 161 transition count 345
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 108 place count 138 transition count 315
Iterating global reduction 3 with 23 rules applied. Total rules applied 131 place count 138 transition count 315
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 132 place count 137 transition count 313
Iterating global reduction 3 with 1 rules applied. Total rules applied 133 place count 137 transition count 313
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 49 rules applied. Total rules applied 182 place count 111 transition count 290
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 185 place count 111 transition count 287
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 191 place count 108 transition count 284
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 192 place count 108 transition count 284
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 194 place count 106 transition count 282
Applied a total of 194 rules in 32 ms. Remains 106 /205 variables (removed 99) and now considering 282/391 (removed 109) transitions.
[2025-06-02 16:18:03] [INFO ] Flow matrix only has 281 transitions (discarded 1 similar events)
// Phase 1: matrix 281 rows 106 cols
[2025-06-02 16:18:03] [INFO ] Computed 19 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:18:03] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-02 16:18:03] [INFO ] Flow matrix only has 281 transitions (discarded 1 similar events)
[2025-06-02 16:18:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:18:03] [INFO ] State equation strengthened by 29 read => feed constraints.
[2025-06-02 16:18:03] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:18:03] [INFO ] Redundant transitions in 49 ms returned []
Running 271 sub problems to find dead transitions.
[2025-06-02 16:18:03] [INFO ] Flow matrix only has 281 transitions (discarded 1 similar events)
[2025-06-02 16:18:03] [INFO ] Invariant cache hit.
[2025-06-02 16:18:03] [INFO ] State equation strengthened by 29 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (OVERLAPS) 5/106 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (OVERLAPS) 280/386 variables, 106/125 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 28/153 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 8 (OVERLAPS) 1/387 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 10 (OVERLAPS) 0/387 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 154 constraints, problems are : Problem set: 0 solved, 271 unsolved in 21164 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 106/106 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (OVERLAPS) 5/106 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (OVERLAPS) 280/386 variables, 106/125 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 28/153 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 271/424 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 9 (OVERLAPS) 1/387 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 387/387 variables, and 425 constraints, problems are : Problem set: 0 solved, 271 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 106/106 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51427ms problems are : Problem set: 0 solved, 271 unsolved
Search for dead transitions found 0 dead transitions in 51430ms
Starting structural reductions in SI_CTL mode, iteration 1 : 106/205 places, 282/391 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 51772 ms. Remains : 106/205 places, 282/391 transitions.
[2025-06-02 16:18:54] [INFO ] Flatten gal took : 14 ms
[2025-06-02 16:18:54] [INFO ] Flatten gal took : 14 ms
[2025-06-02 16:18:54] [INFO ] Input system was already deterministic with 282 transitions.
[2025-06-02 16:18:54] [INFO ] Flatten gal took : 32 ms
[2025-06-02 16:18:54] [INFO ] Flatten gal took : 28 ms
[2025-06-02 16:18:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1822106725506099171.gal : 5 ms
[2025-06-02 16:18:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3148649886334491163.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1822106725506099171.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3148649886334491163.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
RANDOM walk for 40000 steps (2691 resets) in 380 ms. (104 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (277 resets) in 127 ms. (312 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality3148649886334491163.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 22
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :22 after 24
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :24 after 39
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :39 after 61
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :61 after 1086
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1086 after 6516
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :6516 after 81450
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :81450 after 1.53846e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.53846e+06 after 1.2493e+07
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.2493e+07 after 6.47307e+07
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :6.47307e+07 after 3.18234e+08
Interrupted probabilistic random walk after 1433039 steps, run timeout after 3001 ms. (steps per millisecond=477 ) properties seen :0 out of 1
Probabilistic random walk after 1433039 steps, saw 255438 distinct states, run finished after 3001 ms. (steps per millisecond=477 ) properties seen :0
[2025-06-02 16:18:58] [INFO ] Flow matrix only has 281 transitions (discarded 1 similar events)
[2025-06-02 16:18:58] [INFO ] Invariant cache hit.
[2025-06-02 16:18:58] [INFO ] State equation strengthened by 29 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/46 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 38/84 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/93 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 265/358 variables, 93/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 16/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/358 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 28/386 variables, 13/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/386 variables, 4/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/386 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/386 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/387 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/387 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/387 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 154 constraints, problems are : Problem set: 0 solved, 1 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 106/106 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/46 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 38/84 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/93 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 265/358 variables, 93/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 16/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/358 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 28/386 variables, 13/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/386 variables, 4/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/386 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/386 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/386 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/387 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/387 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/387 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 295 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 106/106 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 483ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 28 ms.
Support contains 5 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 282/282 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 106 transition count 279
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 21 place count 97 transition count 270
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 27 place count 97 transition count 264
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 33 place count 91 transition count 264
Free-agglomeration rule (complex) applied 24 times with reduction of 12 identical transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 57 place count 91 transition count 518
Reduce places removed 24 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 97 place count 67 transition count 502
Drop transitions (Redundant composition of simpler transitions.) removed 79 transitions
Redundant transition composition rules discarded 79 transitions
Iterating global reduction 3 with 79 rules applied. Total rules applied 176 place count 67 transition count 423
Applied a total of 176 rules in 75 ms. Remains 67 /106 variables (removed 39) and now considering 423/282 (removed -141) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 67/106 places, 423/282 transitions.
RANDOM walk for 4000000 steps (249559 resets) in 19251 ms. (207 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (22904 resets) in 3787 ms. (1055 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 7751391 steps, run timeout after 18001 ms. (steps per millisecond=430 ) properties seen :0 out of 1
Probabilistic random walk after 7751391 steps, saw 1152932 distinct states, run finished after 18001 ms. (steps per millisecond=430 ) properties seen :0
[2025-06-02 16:19:22] [INFO ] Flow matrix only has 391 transitions (discarded 32 similar events)
// Phase 1: matrix 391 rows 67 cols
[2025-06-02 16:19:22] [INFO ] Computed 20 invariants in 2 ms
[2025-06-02 16:19:22] [INFO ] State equation strengthened by 53 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/29 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/48 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/54 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 377/431 variables, 54/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 41/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:22] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 4 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 27/458 variables, 13/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/458 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/458 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/458 variables, 12/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/458 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/458 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 141 constraints, problems are : Problem set: 0 solved, 1 unsolved in 271 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 67/67 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/29 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/48 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/54 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 377/431 variables, 54/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 41/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 27/458 variables, 13/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/458 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/458 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/458 variables, 12/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/458 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/458 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/458 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 458/458 variables, and 142 constraints, problems are : Problem set: 0 solved, 1 unsolved in 383 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 67/67 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 667ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 44 ms.
Support contains 5 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 423/423 transitions.
Applied a total of 0 rules in 11 ms. Remains 67 /67 variables (removed 0) and now considering 423/423 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 67/67 places, 423/423 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 423/423 transitions.
Applied a total of 0 rules in 10 ms. Remains 67 /67 variables (removed 0) and now considering 423/423 (removed 0) transitions.
[2025-06-02 16:19:23] [INFO ] Flow matrix only has 391 transitions (discarded 32 similar events)
[2025-06-02 16:19:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:19:23] [INFO ] Implicit Places using invariants in 93 ms returned []
[2025-06-02 16:19:23] [INFO ] Flow matrix only has 391 transitions (discarded 32 similar events)
[2025-06-02 16:19:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:19:23] [INFO ] State equation strengthened by 53 read => feed constraints.
[2025-06-02 16:19:23] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:19:23] [INFO ] Redundant transitions in 35 ms returned []
Running 417 sub problems to find dead transitions.
[2025-06-02 16:19:23] [INFO ] Flow matrix only has 391 transitions (discarded 32 similar events)
[2025-06-02 16:19:23] [INFO ] Invariant cache hit.
[2025-06-02 16:19:23] [INFO ] State equation strengthened by 53 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (OVERLAPS) 2/67 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 5 (OVERLAPS) 391/458 variables, 67/87 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 53/140 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 8 (OVERLAPS) 0/458 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 417 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 140 constraints, problems are : Problem set: 0 solved, 417 unsolved in 21879 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 67/67 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 417 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (OVERLAPS) 2/67 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 5 (OVERLAPS) 391/458 variables, 67/87 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 53/140 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 417/557 constraints. Problems are: Problem set: 0 solved, 417 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/458 variables, and 557 constraints, problems are : Problem set: 0 solved, 417 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 67/67 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52619ms problems are : Problem set: 0 solved, 417 unsolved
Search for dead transitions found 0 dead transitions in 52621ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53105 ms. Remains : 67/67 places, 423/423 transitions.
RANDOM walk for 57245 steps (3566 resets) in 1128 ms. (50 steps per ms) remains 0/5 properties
RANDOM walk for 4000000 steps (249519 resets) in 20918 ms. (191 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (23011 resets) in 3782 ms. (1057 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 7776156 steps, run timeout after 18001 ms. (steps per millisecond=431 ) properties seen :0 out of 1
Probabilistic random walk after 7776156 steps, saw 1157721 distinct states, run finished after 18001 ms. (steps per millisecond=431 ) properties seen :0
[2025-06-02 16:20:41] [INFO ] Flow matrix only has 391 transitions (discarded 32 similar events)
[2025-06-02 16:20:41] [INFO ] Invariant cache hit.
[2025-06-02 16:20:41] [INFO ] State equation strengthened by 53 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/29 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/48 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/54 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 377/431 variables, 54/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 41/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:42] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 4 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 27/458 variables, 13/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/458 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/458 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/458 variables, 12/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/458 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/458 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 141 constraints, problems are : Problem set: 0 solved, 1 unsolved in 279 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 67/67 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/29 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/48 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/54 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 377/431 variables, 54/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 41/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 27/458 variables, 13/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/458 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/458 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/458 variables, 12/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/458 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/458 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/458 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 458/458 variables, and 142 constraints, problems are : Problem set: 0 solved, 1 unsolved in 354 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 67/67 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 646ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 5 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 423/423 transitions.
Applied a total of 0 rules in 10 ms. Remains 67 /67 variables (removed 0) and now considering 423/423 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 67/67 places, 423/423 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 423/423 transitions.
Applied a total of 0 rules in 8 ms. Remains 67 /67 variables (removed 0) and now considering 423/423 (removed 0) transitions.
[2025-06-02 16:20:42] [INFO ] Flow matrix only has 391 transitions (discarded 32 similar events)
[2025-06-02 16:20:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:42] [INFO ] Implicit Places using invariants in 97 ms returned []
[2025-06-02 16:20:42] [INFO ] Flow matrix only has 391 transitions (discarded 32 similar events)
[2025-06-02 16:20:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:42] [INFO ] State equation strengthened by 53 read => feed constraints.
[2025-06-02 16:20:42] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:20:42] [INFO ] Redundant transitions in 36 ms returned []
Running 417 sub problems to find dead transitions.
[2025-06-02 16:20:42] [INFO ] Flow matrix only has 391 transitions (discarded 32 similar events)
[2025-06-02 16:20:42] [INFO ] Invariant cache hit.
[2025-06-02 16:20:42] [INFO ] State equation strengthened by 53 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (OVERLAPS) 2/67 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 5 (OVERLAPS) 391/458 variables, 67/87 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 53/140 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 8 (OVERLAPS) 0/458 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 417 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 140 constraints, problems are : Problem set: 0 solved, 417 unsolved in 22473 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 67/67 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 417 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (OVERLAPS) 2/67 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 5 (OVERLAPS) 391/458 variables, 67/87 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 53/140 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 417/557 constraints. Problems are: Problem set: 0 solved, 417 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 1)
(t1 0)
(t2 43)
(t3 21)
(t4 0)
(t5 0)
(t6 0)
(t7 0)
(t8 0)
(t9 0)
(t10 0)
(t11 0)
(t12 0)
(t13 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/458 variables, and 557 constraints, problems are : Problem set: 0 solved, 417 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 67/67 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53202ms problems are : Problem set: 0 solved, 417 unsolved
Search for dead transitions found 0 dead transitions in 53204ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53683 ms. Remains : 67/67 places, 423/423 transitions.
RANDOM walk for 57751 steps (3598 resets) in 282 ms. (204 steps per ms) remains 0/5 properties
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 18 edges and 67 vertex of which 2 / 67 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 36 transitions.
Graph (complete) has 403 edges and 66 vertex of which 60 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Iterating post reduction 0 with 75 rules applied. Total rules applied 77 place count 60 transition count 312
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 1 with 9 rules applied. Total rules applied 86 place count 60 transition count 303
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 60 transition count 302
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 92 place count 59 transition count 298
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 94 place count 59 transition count 298
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 98 place count 57 transition count 296
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 100 place count 57 transition count 294
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 112 place count 57 transition count 294
Applied a total of 112 rules in 40 ms. Remains 57 /67 variables (removed 10) and now considering 294/423 (removed 129) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 57 cols
[2025-06-02 16:21:36] [INFO ] Computed 17 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 16:21:36] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2025-06-02 16:21:36] [INFO ] [Real]Absence check using 12 positive and 5 generalized place invariants in 2 ms returned sat
[2025-06-02 16:21:36] [INFO ] After 165ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 16:21:36] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2025-06-02 16:21:36] [INFO ] [Nat]Absence check using 12 positive and 5 generalized place invariants in 2 ms returned sat
[2025-06-02 16:21:36] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-02 16:21:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 16:21:36] [INFO ] After 32ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-02 16:21:36] [INFO ] After 69ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-02 16:21:36] [INFO ] After 261ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-02 16:21:36] [INFO ] Flatten gal took : 14 ms
[2025-06-02 16:21:36] [INFO ] Flatten gal took : 12 ms
[2025-06-02 16:21:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15797086382985849204.gal : 4 ms
[2025-06-02 16:21:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13703681343399811995.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15797086382985849204.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13703681343399811995.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality13703681343399811995.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 20
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :20 after 30
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :30 after 560
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :560 after 2996
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2996 after 11268
Reachability property MedleyA-PT-19-CTLFireability-2025-07 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1.49688e+06,0.182594,7716,2,329,12,7317,6,0,523,5500,0
Total reachable state count : 1496880

Verifying 1 reachability properties.
Reachability property MedleyA-PT-19-CTLFireability-2025-07 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MedleyA-PT-19-CTLFireability-2025-07,72,0.227129,7844,2,89,12,7317,7,0,538,5500,0
Over-approximation ignoring read arcs solved 0 properties in 747 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 16:21:37] [INFO ] Flatten gal took : 8 ms
[2025-06-02 16:21:37] [INFO ] Applying decomposition
[2025-06-02 16:21:37] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17709800848553028602.txt' '-o' '/tmp/graph17709800848553028602.bin' '-w' '/tmp/graph17709800848553028602.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17709800848553028602.bin' '-l' '-1' '-v' '-w' '/tmp/graph17709800848553028602.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:21:37] [INFO ] Decomposing Gal with order
[2025-06-02 16:21:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:21:37] [INFO ] Removed a total of 567 redundant transitions.
[2025-06-02 16:21:37] [INFO ] Flatten gal took : 20 ms
[2025-06-02 16:21:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 4 ms.
[2025-06-02 16:21:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10926787008070816631.gal : 2 ms
[2025-06-02 16:21:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5534692523813823418.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10926787008070816631.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5534692523813823418.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality5534692523813823418.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :12 after 62
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :62 after 231
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :231 after 606750
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :606750 after 2.63843e+08
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,8.15905e+09,0.070622,6216,211,74,4268,375,322,5795,109,789,0
Total reachable state count : 8159045926

Verifying 1 reachability properties.
Reachability property MedleyA-PT-19-CTLFireability-2025-07 is true.
FORMULA MedleyA-PT-19-CTLFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MedleyA-PT-19-CTLFireability-2025-07,19008,0.072955,6344,54,40,4268,375,333,5795,112,789,42
[2025-06-02 16:21:37] [INFO ] Flatten gal took : 22 ms
[2025-06-02 16:21:37] [INFO ] Flatten gal took : 21 ms
[2025-06-02 16:21:37] [INFO ] Time to serialize gal into /tmp/CTLFireability3374340224330176386.gal : 6 ms
[2025-06-02 16:21:37] [INFO ] Time to serialize properties into /tmp/CTLFireability7734159888301093885.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/CTLFireability3374340224330176386.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7734159888301093885.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 0 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.89914e+07,0.485863,12640,2,890,5,35302,6,0,686,24123,0


Converting to forward existential form...Done !
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 205/205 places, 391/391 transitions.
Graph (complete) has 700 edges and 205 vertex of which 203 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 202 transition count 354
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 40 rules applied. Total rules applied 75 place count 168 transition count 348
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 78 place count 165 transition count 348
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 78 place count 165 transition count 338
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 98 place count 155 transition count 338
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 117 place count 136 transition count 312
Iterating global reduction 3 with 19 rules applied. Total rules applied 136 place count 136 transition count 312
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 137 place count 136 transition count 311
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 138 place count 135 transition count 311
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 138 place count 135 transition count 309
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 142 place count 133 transition count 309
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 143 place count 132 transition count 307
Iterating global reduction 5 with 1 rules applied. Total rules applied 144 place count 132 transition count 307
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 192 place count 107 transition count 284
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 195 place count 107 transition count 281
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 201 place count 104 transition count 278
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 203 place count 102 transition count 276
Applied a total of 203 rules in 50 ms. Remains 102 /205 variables (removed 103) and now considering 276/391 (removed 115) transitions.
// Phase 1: matrix 276 rows 102 cols
[2025-06-02 16:21:37] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:21:37] [INFO ] Implicit Places using invariants in 142 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 146 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 101/205 places, 276/391 transitions.
Applied a total of 0 rules in 9 ms. Remains 101 /101 variables (removed 0) and now considering 276/276 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 205 ms. Remains : 101/205 places, 276/391 transitions.
[2025-06-02 16:21:37] [INFO ] Flatten gal took : 12 ms
[2025-06-02 16:21:37] [INFO ] Flatten gal took : 9 ms
[2025-06-02 16:21:38] [INFO ] Input system was already deterministic with 276 transitions.
RANDOM walk for 464 steps (35 resets) in 5 ms. (77 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-19-CTLFireability-2025-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-02 16:21:38] [INFO ] Flatten gal took : 9 ms
[2025-06-02 16:21:38] [INFO ] Flatten gal took : 9 ms
[2025-06-02 16:21:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9866458730033882057.gal : 2 ms
[2025-06-02 16:21:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17559174892496384567.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9866458730033882057.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17559174892496384567.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 205/205 places, 391/391 transitions.
Graph (complete) has 700 edges and 205 vertex of which 203 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 202 transition count 360
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 32 rules applied. Total rules applied 61 place count 174 transition count 356
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 63 place count 172 transition count 356
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 63 place count 172 transition count 345
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 85 place count 161 transition count 345
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 107 place count 139 transition count 317
Iterating global reduction 3 with 22 rules applied. Total rules applied 129 place count 139 transition count 317
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 130 place count 138 transition count 315
Iterating global reduction 3 with 1 rules applied. Total rules applied 131 place count 138 transition count 315
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 173 place count 116 transition count 295
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 176 place count 116 transition count 292
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 182 place count 113 transition count 289
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 183 place count 113 transition count 289
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 185 place count 111 transition count 287
Applied a total of 185 rules in 38 ms. Remains 111 /205 variables (removed 94) and now considering 287/391 (removed 104) transitions.
// Phase 1: matrix 287 rows 111 cols
[2025-06-02 16:21:38] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:21:38] [INFO ] Implicit Places using invariants in 74 ms returned []
[2025-06-02 16:21:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:21:38] [INFO ] State equation strengthened by 21 read => feed constraints.
[2025-06-02 16:21:38] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:21:38] [INFO ] Redundant transitions in 47 ms returned []
Running 276 sub problems to find dead transitions.
[2025-06-02 16:21:38] [INFO ] Invariant cache hit.
[2025-06-02 16:21:38] [INFO ] State equation strengthened by 21 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 4/110 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 1/111 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 8 (OVERLAPS) 286/397 variables, 111/131 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/397 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:21:53] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/397 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/397 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 12 (OVERLAPS) 1/398 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/398 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 14 (OVERLAPS) 0/398 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 398/398 variables, and 153 constraints, problems are : Problem set: 0 solved, 276 unsolved in 27961 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 111/111 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 4/110 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 1/111 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 8 (OVERLAPS) 286/397 variables, 111/131 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/397 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/397 variables, 276/427 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/397 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 397/398 variables, and 428 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 111/111 constraints, ReadFeed: 20/21 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 58132ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 58133ms
Starting structural reductions in SI_CTL mode, iteration 1 : 111/205 places, 287/391 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 58497 ms. Remains : 111/205 places, 287/391 transitions.
[2025-06-02 16:22:36] [INFO ] Flatten gal took : 14 ms
[2025-06-02 16:22:36] [INFO ] Flatten gal took : 22 ms
[2025-06-02 16:22:36] [INFO ] Input system was already deterministic with 287 transitions.
[2025-06-02 16:22:36] [INFO ] Flatten gal took : 15 ms
[2025-06-02 16:22:36] [INFO ] Flatten gal took : 15 ms
[2025-06-02 16:22:36] [INFO ] Time to serialize gal into /tmp/CTLFireability3206337042200503275.gal : 3 ms
[2025-06-02 16:22:36] [INFO ] Time to serialize properties into /tmp/CTLFireability17318728825540156035.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/CTLFireability3206337042200503275.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17318728825540156035.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,9.40459e+09,9.31462,192464,2,6982,5,742279,6,0,727,721218,0


Converting to forward existential form...Done !
original formula: EF(((E(((p94==1)&&(p110==1)) U ((p61==1) + A((p115==1) U ((p126==1)&&(p129==1))))) * EG((((p104==1)&&(p156==1))&&((p182==1)&&(p206==1))))...208
=> equivalent forward existential formula: [FwdG(((FwdU(Init,TRUE) * (((p94==0)||(p110==0))||((p182==0)||(p212==0)))) * E(((p94==1)&&(p110==1)) U ((p61==1)...331
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t7, t8, t22, t23, t24, t25, t33, t34, t49, t51, t52, t57, t62, t63, t79, t81, t82, t2...265
Detected timeout of ITS tools.
[2025-06-02 16:23:06] [INFO ] Flatten gal took : 9 ms
[2025-06-02 16:23:06] [INFO ] Applying decomposition
[2025-06-02 16:23:06] [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/graph17830934284333986956.txt' '-o' '/tmp/graph17830934284333986956.bin' '-w' '/tmp/graph17830934284333986956.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17830934284333986956.bin' '-l' '-1' '-v' '-w' '/tmp/graph17830934284333986956.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:23:06] [INFO ] Decomposing Gal with order
[2025-06-02 16:23:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:23:06] [INFO ] Removed a total of 632 redundant transitions.
[2025-06-02 16:23:06] [INFO ] Flatten gal took : 22 ms
[2025-06-02 16:23:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 4 ms.
[2025-06-02 16:23:06] [INFO ] Time to serialize gal into /tmp/CTLFireability13171615297239903940.gal : 2 ms
[2025-06-02 16:23:06] [INFO ] Time to serialize properties into /tmp/CTLFireability10839782775978396773.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/CTLFireability13171615297239903940.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10839782775978396773.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.40459e+09,0.090302,6472,221,57,5121,350,332,8321,104,1301,0


Converting to forward existential form...Done !
original formula: EF(((E(((i2.u9.p94==1)&&(i2.u11.p110==1)) U ((i0.u6.p61==1) + A((i3.u13.p115==1) U ((i3.u14.p126==1)&&(i3.u15.p129==1))))) * EG((((i4.u10...303
=> equivalent forward existential formula: [FwdG(((FwdU(Init,TRUE) * (((i2.u9.p94==0)||(i2.u11.p110==0))||((i6.u19.p182==0)||(i5.u25.p212==0)))) * E(((i2.u...454
Reverse transition relation is NOT exact ! Due to transitions t216, i0.t63, i0.u8.t62, i1.t82, i1.t1, i1.u1.t81, i1.u5.t79, i3.t286, i3.t57, i3.t52, i3.u12...366
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local 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
(forward)formula 0,1,3.94678,93128,1,0,148882,4984,2502,411738,551,25565,151347
FORMULA MedleyA-PT-19-CTLFireability-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 391/391 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 187 transition count 369
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 187 transition count 369
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 186 transition count 367
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 186 transition count 367
Applied a total of 38 rules in 6 ms. Remains 186 /205 variables (removed 19) and now considering 367/391 (removed 24) transitions.
// Phase 1: matrix 367 rows 186 cols
[2025-06-02 16:23:10] [INFO ] Computed 22 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:23:10] [INFO ] Implicit Places using invariants in 113 ms returned []
[2025-06-02 16:23:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:23:11] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
Running 366 sub problems to find dead transitions.
[2025-06-02 16:23:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (OVERLAPS) 1/186 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:23:19] [INFO ] Deduced a trap composed of 25 places in 175 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:23:19] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:23:20] [INFO ] Deduced a trap composed of 35 places in 142 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:23:20] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:23:20] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:23:20] [INFO ] Deduced a trap composed of 17 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-02 16:23:21] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:23:21] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:23:21] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:23:22] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (OVERLAPS) 367/553 variables, 186/218 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:23:32] [INFO ] Deduced a trap composed of 13 places in 271 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:23:33] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:23:33] [INFO ] Deduced a trap composed of 14 places in 184 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:23:34] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:23:34] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:23:34] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 6/224 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 553/553 variables, and 224 constraints, problems are : Problem set: 0 solved, 366 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (OVERLAPS) 1/186 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (OVERLAPS) 367/553 variables, 186/224 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 366/590 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:23:56] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:23:57] [INFO ] Deduced a trap composed of 21 places in 261 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:23:58] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:23:59] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:24:00] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:24:02] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 6/596 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 553/553 variables, and 596 constraints, problems are : Problem set: 0 solved, 366 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60417ms problems are : Problem set: 0 solved, 366 unsolved
Search for dead transitions found 0 dead transitions in 60422ms
Starting structural reductions in LTL mode, iteration 1 : 186/205 places, 367/391 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60883 ms. Remains : 186/205 places, 367/391 transitions.
[2025-06-02 16:24:11] [INFO ] Flatten gal took : 8 ms
[2025-06-02 16:24:11] [INFO ] Flatten gal took : 9 ms
[2025-06-02 16:24:11] [INFO ] Input system was already deterministic with 367 transitions.
[2025-06-02 16:24:11] [INFO ] Flatten gal took : 11 ms
[2025-06-02 16:24:11] [INFO ] Flatten gal took : 18 ms
[2025-06-02 16:24:11] [INFO ] Time to serialize gal into /tmp/CTLFireability4453360985410970489.gal : 2 ms
[2025-06-02 16:24:11] [INFO ] Time to serialize properties into /tmp/CTLFireability17372363379183731373.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/CTLFireability4453360985410970489.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17372363379183731373.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 16:24:41] [INFO ] Flatten gal took : 10 ms
[2025-06-02 16:24:41] [INFO ] Applying decomposition
[2025-06-02 16:24:41] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9411331584075799571.txt' '-o' '/tmp/graph9411331584075799571.bin' '-w' '/tmp/graph9411331584075799571.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9411331584075799571.bin' '-l' '-1' '-v' '-w' '/tmp/graph9411331584075799571.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:24:41] [INFO ] Decomposing Gal with order
[2025-06-02 16:24:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:24:41] [INFO ] Removed a total of 538 redundant transitions.
[2025-06-02 16:24:41] [INFO ] Flatten gal took : 27 ms
[2025-06-02 16:24:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 4 ms.
[2025-06-02 16:24:41] [INFO ] Time to serialize gal into /tmp/CTLFireability4510028918780978384.gal : 4 ms
[2025-06-02 16:24:41] [INFO ] Time to serialize properties into /tmp/CTLFireability10087707474658541872.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/CTLFireability4510028918780978384.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10087707474658541872.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,5.66159e+11,0.966526,23876,1644,199,39968,1974,495,73653,118,9844,0


Converting to forward existential form...Done !
original formula: A(AX(AF((i1.u2.p13==1))) U EG(E(A((i1.u4.p30==1) U AF((((i4.u21.p104==1)&&(i5.u31.p134==1))&&((i8.u38.p182==1)&&(i8.u38.p234==1))))) U (!...274
=> equivalent forward existential formula: [((Init * !(EG(!(EG(E(!((E(!(!(EG(!((((i4.u21.p104==1)&&(i5.u31.p134==1))&&((i8.u38.p182==1)&&(i8.u38.p234==1)))...1476
Reverse transition relation is NOT exact ! Due to transitions t9, t29, t77, t124, i0.t137, i0.t135, i0.t132, i0.t131, i0.t123, i0.u3.t162, i0.u15.t125, i0....955
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found 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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 205/205 places, 391/391 transitions.
Graph (complete) has 700 edges and 205 vertex of which 203 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 202 transition count 355
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 39 rules applied. Total rules applied 73 place count 169 transition count 349
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 76 place count 166 transition count 349
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 76 place count 166 transition count 341
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 92 place count 158 transition count 341
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 112 place count 138 transition count 314
Iterating global reduction 3 with 20 rules applied. Total rules applied 132 place count 138 transition count 314
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 133 place count 138 transition count 313
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 134 place count 137 transition count 313
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 134 place count 137 transition count 312
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 136 place count 136 transition count 312
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 137 place count 135 transition count 310
Iterating global reduction 5 with 1 rules applied. Total rules applied 138 place count 135 transition count 310
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 49 rules applied. Total rules applied 187 place count 109 transition count 287
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 190 place count 109 transition count 284
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 196 place count 106 transition count 281
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 198 place count 104 transition count 279
Applied a total of 198 rules in 43 ms. Remains 104 /205 variables (removed 101) and now considering 279/391 (removed 112) transitions.
[2025-06-02 16:25:11] [INFO ] Flow matrix only has 278 transitions (discarded 1 similar events)
// Phase 1: matrix 278 rows 104 cols
[2025-06-02 16:25:11] [INFO ] Computed 19 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:25:12] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-06-02 16:25:12] [INFO ] Flow matrix only has 278 transitions (discarded 1 similar events)
[2025-06-02 16:25:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:25:12] [INFO ] State equation strengthened by 29 read => feed constraints.
[2025-06-02 16:25:12] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:25:12] [INFO ] Redundant transitions in 58 ms returned []
Running 268 sub problems to find dead transitions.
[2025-06-02 16:25:12] [INFO ] Flow matrix only has 278 transitions (discarded 1 similar events)
[2025-06-02 16:25:12] [INFO ] Invariant cache hit.
[2025-06-02 16:25:12] [INFO ] State equation strengthened by 29 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (OVERLAPS) 5/104 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (OVERLAPS) 277/381 variables, 104/123 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 28/151 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 8 (OVERLAPS) 1/382 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/382 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 10 (OVERLAPS) 0/382 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 382/382 variables, and 152 constraints, problems are : Problem set: 0 solved, 268 unsolved in 23660 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 104/104 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (OVERLAPS) 5/104 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (OVERLAPS) 277/381 variables, 104/123 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 28/151 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 268/419 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 9 (OVERLAPS) 1/382 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 382/382 variables, and 420 constraints, problems are : Problem set: 0 solved, 268 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 104/104 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53866ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 53867ms
Starting structural reductions in SI_CTL mode, iteration 1 : 104/205 places, 279/391 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 54370 ms. Remains : 104/205 places, 279/391 transitions.
[2025-06-02 16:26:06] [INFO ] Flatten gal took : 17 ms
[2025-06-02 16:26:06] [INFO ] Flatten gal took : 17 ms
[2025-06-02 16:26:06] [INFO ] Input system was already deterministic with 279 transitions.
[2025-06-02 16:26:06] [INFO ] Flatten gal took : 13 ms
[2025-06-02 16:26:06] [INFO ] Flatten gal took : 13 ms
[2025-06-02 16:26:06] [INFO ] Time to serialize gal into /tmp/CTLFireability7921635191550592796.gal : 2 ms
[2025-06-02 16:26:06] [INFO ] Time to serialize properties into /tmp/CTLFireability46706554237441831.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/CTLFireability7921635191550592796.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability46706554237441831.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 -...281
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,7.48203e+09,5.54459,123252,2,6082,5,545201,6,0,688,415976,0


Converting to forward existential form...Done !
original formula: AF((((p26==1)&&(p78==1))&&((p182==1)&&(p203==1))))
=> equivalent forward existential formula: [FwdG(Init,!((((p26==1)&&(p78==1))&&((p182==1)&&(p203==1)))))] = FALSE
Hit Full ! (commute/partial/dont) 138/0/141
Detected timeout of ITS tools.
[2025-06-02 16:26:36] [INFO ] Flatten gal took : 9 ms
[2025-06-02 16:26:36] [INFO ] Applying decomposition
[2025-06-02 16:26:36] [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/graph7313231209754129390.txt' '-o' '/tmp/graph7313231209754129390.bin' '-w' '/tmp/graph7313231209754129390.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7313231209754129390.bin' '-l' '-1' '-v' '-w' '/tmp/graph7313231209754129390.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:26:36] [INFO ] Decomposing Gal with order
[2025-06-02 16:26:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:26:36] [INFO ] Removed a total of 624 redundant transitions.
[2025-06-02 16:26:36] [INFO ] Flatten gal took : 21 ms
[2025-06-02 16:26:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 2 ms.
[2025-06-02 16:26:36] [INFO ] Time to serialize gal into /tmp/CTLFireability17232264301557217859.gal : 2 ms
[2025-06-02 16:26:36] [INFO ] Time to serialize properties into /tmp/CTLFireability16084921947381406865.ctl : 10 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/CTLFireability17232264301557217859.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16084921947381406865.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.48203e+09,0.064533,5776,187,29,3848,157,305,5838,66,377,0


Converting to forward existential form...Done !
original formula: AF((((i0.u0.p26==1)&&(i0.u9.p78==1))&&((i5.u18.p182==1)&&(i4.u21.p203==1))))
=> equivalent forward existential formula: [FwdG(Init,!((((i0.u0.p26==1)&&(i0.u9.p78==1))&&((i5.u18.p182==1)&&(i4.u21.p203==1)))))] = FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 5
Fast SCC detection found a local 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
(forward)formula 0,0,1.61461,55568,1,0,90978,315,1207,284799,236,1108,108353
FORMULA MedleyA-PT-19-CTLFireability-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 391/391 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 186 transition count 368
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 186 transition count 368
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 185 transition count 366
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 185 transition count 366
Applied a total of 40 rules in 5 ms. Remains 185 /205 variables (removed 20) and now considering 366/391 (removed 25) transitions.
// Phase 1: matrix 366 rows 185 cols
[2025-06-02 16:26:38] [INFO ] Computed 22 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:26:38] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-06-02 16:26:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:26:38] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2025-06-02 16:26:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:26:46] [INFO ] Deduced a trap composed of 25 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-02 16:26:46] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:26:47] [INFO ] Deduced a trap composed of 35 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-02 16:26:47] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:26:47] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:26:47] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:26:48] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:26:48] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:26:48] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:26:48] [INFO ] Deduced a trap composed of 19 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-02 16:26:49] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 366/551 variables, 185/218 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:26:58] [INFO ] Deduced a trap composed of 13 places in 226 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:26:58] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:26:59] [INFO ] Deduced a trap composed of 14 places in 182 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:26:59] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:26:59] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:27:00] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 6/224 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 551/551 variables, and 224 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 17/17 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/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 17/39 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 366/551 variables, 185/224 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 365/589 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:27:23] [INFO ] Deduced a trap composed of 31 places in 216 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:27:23] [INFO ] Deduced a trap composed of 40 places in 287 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:27:23] [INFO ] Deduced a trap composed of 39 places in 273 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:27:24] [INFO ] Deduced a trap composed of 24 places in 210 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:27:24] [INFO ] Deduced a trap composed of 40 places in 144 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:27:28] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:27:28] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 7/596 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 596 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60316ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 60317ms
Starting structural reductions in LTL mode, iteration 1 : 185/205 places, 366/391 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60692 ms. Remains : 185/205 places, 366/391 transitions.
[2025-06-02 16:27:38] [INFO ] Flatten gal took : 8 ms
[2025-06-02 16:27:38] [INFO ] Flatten gal took : 9 ms
[2025-06-02 16:27:38] [INFO ] Input system was already deterministic with 366 transitions.
[2025-06-02 16:27:38] [INFO ] Flatten gal took : 9 ms
[2025-06-02 16:27:38] [INFO ] Flatten gal took : 9 ms
[2025-06-02 16:27:38] [INFO ] Time to serialize gal into /tmp/CTLFireability2402070677479600280.gal : 2 ms
[2025-06-02 16:27:38] [INFO ] Time to serialize properties into /tmp/CTLFireability3546140893776627351.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/CTLFireability2402070677479600280.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3546140893776627351.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 16:28:09] [INFO ] Flatten gal took : 9 ms
[2025-06-02 16:28:09] [INFO ] Applying decomposition
[2025-06-02 16:28:09] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11300462480656116410.txt' '-o' '/tmp/graph11300462480656116410.bin' '-w' '/tmp/graph11300462480656116410.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11300462480656116410.bin' '-l' '-1' '-v' '-w' '/tmp/graph11300462480656116410.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:28:09] [INFO ] Decomposing Gal with order
[2025-06-02 16:28:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:28:09] [INFO ] Removed a total of 671 redundant transitions.
[2025-06-02 16:28:09] [INFO ] Flatten gal took : 23 ms
[2025-06-02 16:28:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 3 ms.
[2025-06-02 16:28:09] [INFO ] Time to serialize gal into /tmp/CTLFireability11968358811417243810.gal : 3 ms
[2025-06-02 16:28:09] [INFO ] Time to serialize properties into /tmp/CTLFireability2755491654072392597.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/CTLFireability11968358811417243810.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2755491654072392597.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,5.84676e+11,0.6176,20788,1255,62,32964,471,566,72010,75,1748,0


Converting to forward existential form...Done !
original formula: !(E(AG((A(((i9.i0.i1.u21.p106==1)||(((i0.u4.p26==1)&&(i1.u5.p32==1))&&((i6.u37.p182==1)&&(i8.u44.p203==1)))) U !((((i6.u37.p182==1)&&(i6....486
=> equivalent forward existential formula: ([((FwdU(Init,!(E(TRUE U !((!((E(!(!((((i6.u37.p182==1)&&(i6.u51.p234==1))&&((i1.u53.p238==1)&&(i6.u63.p270==1))...1367
Reverse transition relation is NOT exact ! Due to transitions t44, t77, t124, i0.t165, i0.t131, i0.t123, i0.u2.t164, i0.u4.t161, i0.u15.t125, i0.u15.t130, ...963
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local 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
(forward)formula 0,1,8.01661,208820,1,0,333887,1140,3470,1.22962e+06,344,3971,487220
FORMULA MedleyA-PT-19-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 391/391 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 186 transition count 368
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 186 transition count 368
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 185 transition count 366
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 185 transition count 366
Applied a total of 40 rules in 4 ms. Remains 185 /205 variables (removed 20) and now considering 366/391 (removed 25) transitions.
// Phase 1: matrix 366 rows 185 cols
[2025-06-02 16:28:17] [INFO ] Computed 22 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:28:17] [INFO ] Implicit Places using invariants in 111 ms returned []
[2025-06-02 16:28:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:28:17] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2025-06-02 16:28:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:28:22] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:28:22] [INFO ] Deduced a trap composed of 25 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-02 16:28:22] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:28:22] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:28:23] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:28:23] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:28:23] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:28:23] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:28:23] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:28:23] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 366/551 variables, 185/217 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:28:30] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:28:30] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:28:31] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:28:31] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:28:31] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:28:31] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 6/223 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:28:39] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:28:40] [INFO ] Deduced a trap along path composed of 2 places in 18 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 551/551 variables, and 225 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 2/2 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/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 366/551 variables, 185/223 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 365/588 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:28:58] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:28:59] [INFO ] Deduced a trap composed of 21 places in 246 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:29:00] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:29:01] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:29:05] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 5/593 constraints. Problems are: Problem set: 0 solved, 365 unsolved
SMT process timed out in 60267ms, After SMT, problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 60268ms
Starting structural reductions in LTL mode, iteration 1 : 185/205 places, 366/391 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60663 ms. Remains : 185/205 places, 366/391 transitions.
[2025-06-02 16:29:17] [INFO ] Flatten gal took : 8 ms
[2025-06-02 16:29:17] [INFO ] Flatten gal took : 9 ms
[2025-06-02 16:29:17] [INFO ] Input system was already deterministic with 366 transitions.
[2025-06-02 16:29:17] [INFO ] Flatten gal took : 9 ms
[2025-06-02 16:29:17] [INFO ] Flatten gal took : 9 ms
[2025-06-02 16:29:17] [INFO ] Time to serialize gal into /tmp/CTLFireability17679815661413799891.gal : 2 ms
[2025-06-02 16:29:17] [INFO ] Time to serialize properties into /tmp/CTLFireability17705883131226096815.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/CTLFireability17679815661413799891.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17705883131226096815.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 16:29:47] [INFO ] Flatten gal took : 10 ms
[2025-06-02 16:29:47] [INFO ] Applying decomposition
[2025-06-02 16:29:47] [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/graph10385953712298955830.txt' '-o' '/tmp/graph10385953712298955830.bin' '-w' '/tmp/graph10385953712298955830.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10385953712298955830.bin' '-l' '-1' '-v' '-w' '/tmp/graph10385953712298955830.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:29:47] [INFO ] Decomposing Gal with order
[2025-06-02 16:29:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:29:48] [INFO ] Removed a total of 609 redundant transitions.
[2025-06-02 16:29:48] [INFO ] Flatten gal took : 30 ms
[2025-06-02 16:29:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 4 ms.
[2025-06-02 16:29:48] [INFO ] Time to serialize gal into /tmp/CTLFireability12407034760512279531.gal : 3 ms
[2025-06-02 16:29:48] [INFO ] Time to serialize properties into /tmp/CTLFireability3115188581311723860.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/CTLFireability12407034760512279531.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3115188581311723860.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,5.65439e+11,0.385798,16180,1169,137,26269,2259,537,42055,106,8404,0


Converting to forward existential form...Done !
original formula: AX(EG((i8.u20.p91==0)))
=> equivalent forward existential formula: [(EY(Init) * !(EG((i8.u20.p91==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t29, t77, t125, i1.i1.u53.t20, i1.i1.u53.t235, i1.i2.u54.t18, i1.i2.u54.t19, i2.t151, i2.t149...932
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 205/205 places, 391/391 transitions.
Graph (complete) has 700 edges and 205 vertex of which 203 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 202 transition count 355
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 37 rules applied. Total rules applied 71 place count 169 transition count 351
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 73 place count 167 transition count 351
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 73 place count 167 transition count 341
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 93 place count 157 transition count 341
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 113 place count 137 transition count 314
Iterating global reduction 3 with 20 rules applied. Total rules applied 133 place count 137 transition count 314
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 134 place count 137 transition count 313
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 135 place count 136 transition count 313
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 135 place count 136 transition count 312
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 137 place count 135 transition count 312
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 138 place count 134 transition count 310
Iterating global reduction 5 with 1 rules applied. Total rules applied 139 place count 134 transition count 310
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 49 rules applied. Total rules applied 188 place count 108 transition count 287
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 192 place count 108 transition count 283
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 1 rules applied. Total rules applied 193 place count 108 transition count 282
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 194 place count 107 transition count 282
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 200 place count 104 transition count 279
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 201 place count 104 transition count 279
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 202 place count 103 transition count 278
Iterating global reduction 7 with 1 rules applied. Total rules applied 203 place count 103 transition count 278
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 205 place count 101 transition count 276
Applied a total of 205 rules in 40 ms. Remains 101 /205 variables (removed 104) and now considering 276/391 (removed 115) transitions.
[2025-06-02 16:30:18] [INFO ] Flow matrix only has 275 transitions (discarded 1 similar events)
// Phase 1: matrix 275 rows 101 cols
[2025-06-02 16:30:18] [INFO ] Computed 19 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:30:18] [INFO ] Implicit Places using invariants in 82 ms returned []
[2025-06-02 16:30:18] [INFO ] Flow matrix only has 275 transitions (discarded 1 similar events)
[2025-06-02 16:30:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:30:18] [INFO ] State equation strengthened by 29 read => feed constraints.
[2025-06-02 16:30:18] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:30:18] [INFO ] Redundant transitions in 53 ms returned []
Running 266 sub problems to find dead transitions.
[2025-06-02 16:30:18] [INFO ] Flow matrix only has 275 transitions (discarded 1 similar events)
[2025-06-02 16:30:18] [INFO ] Invariant cache hit.
[2025-06-02 16:30:18] [INFO ] State equation strengthened by 29 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 4/101 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (OVERLAPS) 274/375 variables, 101/120 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 28/148 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 8 (OVERLAPS) 1/376 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 10 (OVERLAPS) 0/376 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 149 constraints, problems are : Problem set: 0 solved, 266 unsolved in 21413 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 101/101 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 4/101 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (OVERLAPS) 274/375 variables, 101/120 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 28/148 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 266/414 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 9 (OVERLAPS) 1/376 variables, 1/415 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 376/376 variables, and 415 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 101/101 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51766ms problems are : Problem set: 0 solved, 266 unsolved
Search for dead transitions found 0 dead transitions in 51768ms
Starting structural reductions in SI_CTL mode, iteration 1 : 101/205 places, 276/391 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 52153 ms. Remains : 101/205 places, 276/391 transitions.
[2025-06-02 16:31:10] [INFO ] Flatten gal took : 13 ms
[2025-06-02 16:31:10] [INFO ] Flatten gal took : 13 ms
[2025-06-02 16:31:10] [INFO ] Input system was already deterministic with 276 transitions.
[2025-06-02 16:31:10] [INFO ] Flatten gal took : 15 ms
[2025-06-02 16:31:10] [INFO ] Flatten gal took : 14 ms
[2025-06-02 16:31:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14032718660933625287.gal : 12 ms
[2025-06-02 16:31:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16300131547345880529.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14032718660933625287.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16300131547345880529.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
RANDOM walk for 40000 steps (3138 resets) in 279 ms. (142 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (374 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1053 steps, run visited all 1 properties in 9 ms. (steps per millisecond=117 )
Probabilistic random walk after 1053 steps, saw 467 distinct states, run finished after 16 ms. (steps per millisecond=65 ) properties seen :1
FORMULA MedleyA-PT-19-CTLFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 16:31:10] [INFO ] Flatten gal took : 17 ms
[2025-06-02 16:31:10] [INFO ] Flatten gal took : 17 ms
[2025-06-02 16:31:10] [INFO ] Applying decomposition
[2025-06-02 16:31:10] [INFO ] Flatten gal took : 16 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/graph6774768549630521979.txt' '-o' '/tmp/graph6774768549630521979.bin' '-w' '/tmp/graph6774768549630521979.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6774768549630521979.bin' '-l' '-1' '-v' '-w' '/tmp/graph6774768549630521979.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:31:10] [INFO ] Decomposing Gal with order
[2025-06-02 16:31:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:31:10] [INFO ] Removed a total of 645 redundant transitions.
[2025-06-02 16:31:10] [INFO ] Flatten gal took : 41 ms
[2025-06-02 16:31:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 8 ms.
[2025-06-02 16:31:10] [INFO ] Time to serialize gal into /tmp/CTLFireability11301734130077675003.gal : 6 ms
[2025-06-02 16:31:10] [INFO ] Time to serialize properties into /tmp/CTLFireability14887052299698647798.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/CTLFireability11301734130077675003.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14887052299698647798.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 6 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.74246e+12,6.98317,150552,4218,281,247555,5966,721,867108,123,39911,0


Converting to forward existential form...Done !
original formula: EG((((i6.u36.p148==0) + AX(((i9.u46.p196==1)||(i8.i0.u40.p162==1)))) + AG(EX((((i6.u22.p104==1)&&(i5.u32.p134==1))&&((i7.u39.p172==1)&&(i...175
=> equivalent forward existential formula: [FwdG(Init,(((i6.u36.p148==0) + !(EX(!(((i9.u46.p196==1)||(i8.i0.u40.p162==1)))))) + !(E(TRUE U !(EX((((i6.u22.p...236
Reverse transition relation is NOT exact ! Due to transitions t9, t143, i0.u3.t185, i0.u3.t186, i0.u7.t181, i0.u7.t182, i1.i4.t19, i1.i4.u59.t18, i2.t171, ...1562
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found 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
Detected timeout of ITS tools.
[2025-06-02 17:00:14] [INFO ] Applying decomposition
[2025-06-02 17:00:14] [INFO ] Flatten gal took : 32 ms
[2025-06-02 17:00:14] [INFO ] Decomposing Gal with order
[2025-06-02 17:00:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 17:00:15] [INFO ] Removed a total of 614 redundant transitions.
[2025-06-02 17:00:15] [INFO ] Flatten gal took : 32 ms
[2025-06-02 17:00:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 82 labels/synchronizations in 7 ms.
[2025-06-02 17:00:15] [INFO ] Time to serialize gal into /tmp/CTLFireability14427778004062694307.gal : 5 ms
[2025-06-02 17:00:15] [INFO ] Time to serialize properties into /tmp/CTLFireability70579743941555691.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/CTLFireability14427778004062694307.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability70579743941555691.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 6 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.74246e+12,4.2035,117316,1995,560,204195,7322,535,767438,201,64845,0


Converting to forward existential form...Done !
original formula: EG((((i0.i0.i1.i1.u20.p148==0) + AX(((i0.i1.i1.i0.u55.p196==1)||(i0.i1.u22.p162==1)))) + AG(EX((((i0.i0.i1.u13.p104==1)&&(i0.i0.i1.i1.i0....220
=> equivalent forward existential formula: [FwdG(Init,(((i0.i0.i1.i1.u20.p148==0) + !(EX(!(((i0.i1.i1.i0.u55.p196==1)||(i0.i1.u22.p162==1)))))) + !(E(TRUE ...281
Reverse transition relation is NOT exact ! Due to transitions i0.i0.i0.u4.t183, i0.i0.i0.u4.t185, i0.i0.i0.u4.t186, i0.i0.i0.u4.t187, i0.i0.i0.u4.t188, i0....2629
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-19"
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 MedleyA-PT-19, 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 r128-smll-174876524200242"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-19.tgz
mv MedleyA-PT-19 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 ;