Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339600266.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 ErlangenMainframeV0-PT-0404, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339600266
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 7.9K Jun 6 09:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Jun 6 09:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 6 09:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 6 09:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 6 11:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 6 11:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 11:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 11:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 9.8K Jun 6 09:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Jun 6 09:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Jun 6 09:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Jun 6 09:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 11:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 11:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 5 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 163K Jun 5 20:08 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 ErlangenMainframeV0-PT-0404-CTLFireability-2025-00
FORMULA_NAME ErlangenMainframeV0-PT-0404-CTLFireability-2025-01
FORMULA_NAME ErlangenMainframeV0-PT-0404-CTLFireability-2025-02
FORMULA_NAME ErlangenMainframeV0-PT-0404-CTLFireability-2025-03
FORMULA_NAME ErlangenMainframeV0-PT-0404-CTLFireability-2025-04
FORMULA_NAME ErlangenMainframeV0-PT-0404-CTLFireability-2025-05
FORMULA_NAME ErlangenMainframeV0-PT-0404-CTLFireability-2025-06
FORMULA_NAME ErlangenMainframeV0-PT-0404-CTLFireability-2025-07
FORMULA_NAME ErlangenMainframeV0-PT-0404-CTLFireability-2025-08
FORMULA_NAME ErlangenMainframeV0-PT-0404-CTLFireability-2025-09
FORMULA_NAME ErlangenMainframeV0-PT-0404-CTLFireability-2025-10
FORMULA_NAME ErlangenMainframeV0-PT-0404-CTLFireability-2025-11
FORMULA_NAME ErlangenMainframeV0-PT-0404-CTLFireability-2025-12
FORMULA_NAME ErlangenMainframeV0-PT-0404-CTLFireability-2025-13
FORMULA_NAME ErlangenMainframeV0-PT-0404-CTLFireability-2025-14
FORMULA_NAME ErlangenMainframeV0-PT-0404-CTLFireability-2025-15

=== Now, execution of the tool begins

BK_START 1749351694816

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV0-PT-0404
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-08 03:01:36] [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-08 03:01:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 03:01:36] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2025-06-08 03:01:36] [INFO ] Transformed 183 places.
[2025-06-08 03:01:36] [INFO ] Transformed 445 transitions.
[2025-06-08 03:01:36] [INFO ] Found NUPN structural information;
[2025-06-08 03:01:36] [INFO ] Parsed PT model containing 183 places and 445 transitions and 3331 arcs in 179 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 75 out of 183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 445/445 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 156 transition count 418
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 156 transition count 418
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 66 place count 144 transition count 406
Iterating global reduction 0 with 12 rules applied. Total rules applied 78 place count 144 transition count 406
Applied a total of 78 rules in 49 ms. Remains 144 /183 variables (removed 39) and now considering 406/445 (removed 39) transitions.
// Phase 1: matrix 406 rows 144 cols
[2025-06-08 03:01:36] [INFO ] Computed 14 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:01:36] [INFO ] Implicit Places using invariants in 208 ms returned []
[2025-06-08 03:01:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:01:36] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
Running 405 sub problems to find dead transitions.
[2025-06-08 03:01:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 405 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:41] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:41] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:41] [INFO ] Deduced a trap composed of 32 places in 228 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:42] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:42] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:42] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:42] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 5 (OVERLAPS) 406/550 variables, 144/165 constraints. Problems are: Problem set: 0 solved, 405 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:48] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:48] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:01:49] [INFO ] Deduced a trap composed of 41 places in 114 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/550 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 405 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 550/550 variables, and 168 constraints, problems are : Problem set: 0 solved, 405 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 405/405 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 405 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 405 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:09] [INFO ] Deduced a trap composed of 35 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-08 03:02:10] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:10] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 6 (OVERLAPS) 406/550 variables, 144/171 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/550 variables, 405/576 constraints. Problems are: Problem set: 0 solved, 405 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:21] [INFO ] Deduced a trap composed of 32 places in 135 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:22] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:22] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:22] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:22] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:23] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:23] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/550 variables, 7/583 constraints. Problems are: Problem set: 0 solved, 405 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:37] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:37] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/550 variables, and 585 constraints, problems are : Problem set: 0 solved, 405 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 405/405 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60911ms problems are : Problem set: 0 solved, 405 unsolved
Search for dead transitions found 0 dead transitions in 60926ms
Starting structural reductions in LTL mode, iteration 1 : 144/183 places, 406/445 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61408 ms. Remains : 144/183 places, 406/445 transitions.
Support contains 75 out of 144 places after structural reductions.
[2025-06-08 03:02:37] [INFO ] Flatten gal took : 85 ms
[2025-06-08 03:02:38] [INFO ] Flatten gal took : 49 ms
[2025-06-08 03:02:38] [INFO ] Input system was already deterministic with 406 transitions.
RANDOM walk for 40000 steps (8 resets) in 1388 ms. (28 steps per ms) remains 44/82 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 9 ms. (400 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 8 ms. (444 steps per ms) remains 44/44 properties
[2025-06-08 03:02:39] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Problem AtomicPropp50 is UNSAT
At refinement iteration 1 (OVERLAPS) 64/103 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 3 (OVERLAPS) 8/111 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 43 unsolved
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp68 is UNSAT
At refinement iteration 5 (OVERLAPS) 33/144 variables, 4/14 constraints. Problems are: Problem set: 5 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/14 constraints. Problems are: Problem set: 5 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 406/550 variables, 144/158 constraints. Problems are: Problem set: 5 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/550 variables, 0/158 constraints. Problems are: Problem set: 5 solved, 39 unsolved
At refinement iteration 9 (OVERLAPS) 0/550 variables, 0/158 constraints. Problems are: Problem set: 5 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 550/550 variables, and 158 constraints, problems are : Problem set: 5 solved, 39 unsolved in 2615 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 44/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 39 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 39 unsolved
Problem AtomicPropp46 is UNSAT
At refinement iteration 1 (OVERLAPS) 65/100 variables, 9/9 constraints. Problems are: Problem set: 6 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/9 constraints. Problems are: Problem set: 6 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 8/108 variables, 1/10 constraints. Problems are: Problem set: 6 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/10 constraints. Problems are: Problem set: 6 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 36/144 variables, 4/14 constraints. Problems are: Problem set: 6 solved, 38 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:42] [INFO ] Deduced a trap composed of 29 places in 133 ms of which 15 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 1/15 constraints. Problems are: Problem set: 6 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 0/15 constraints. Problems are: Problem set: 6 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 406/550 variables, 144/159 constraints. Problems are: Problem set: 6 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/550 variables, 30/189 constraints. Problems are: Problem set: 6 solved, 38 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:44] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:44] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:44] [INFO ] Deduced a trap composed of 24 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-08 03:02:44] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:44] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:44] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:45] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:45] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:02:45] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/550 variables, 9/198 constraints. Problems are: Problem set: 6 solved, 38 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/550 variables, and 198 constraints, problems are : Problem set: 6 solved, 38 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 39/30 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7762ms problems are : Problem set: 6 solved, 38 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 35 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 406/406 transitions.
Graph (trivial) has 83 edges and 144 vertex of which 4 / 144 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 142 transition count 378
Reduce places removed 24 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 27 rules applied. Total rules applied 52 place count 118 transition count 375
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 55 place count 115 transition count 375
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 55 place count 115 transition count 370
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 65 place count 110 transition count 370
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 76 place count 99 transition count 359
Iterating global reduction 3 with 11 rules applied. Total rules applied 87 place count 99 transition count 359
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 87 place count 99 transition count 357
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 91 place count 97 transition count 357
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 143 place count 71 transition count 331
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 145 place count 70 transition count 348
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 148 place count 70 transition count 345
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 151 place count 67 transition count 345
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 152 place count 67 transition count 344
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 154 place count 67 transition count 344
Applied a total of 154 rules in 120 ms. Remains 67 /144 variables (removed 77) and now considering 344/406 (removed 62) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 67/144 places, 344/406 transitions.
RANDOM walk for 40000 steps (8 resets) in 757 ms. (52 steps per ms) remains 28/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 9 ms. (400 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 28/28 properties
[2025-06-08 03:02:47] [INFO ] Flow matrix only has 343 transitions (discarded 1 similar events)
// Phase 1: matrix 343 rows 67 cols
[2025-06-08 03:02:47] [INFO ] Computed 14 invariants in 5 ms
[2025-06-08 03:02:47] [INFO ] State equation strengthened by 18 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 32/66 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 1/67 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 343/410 variables, 67/81 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/410 variables, 18/99 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/410 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/410 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 410/410 variables, and 99 constraints, problems are : Problem set: 0 solved, 28 unsolved in 1003 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 67/67 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 28/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 32/66 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 1/67 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 343/410 variables, 67/81 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/410 variables, 18/99 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/410 variables, 22/121 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/410 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/410 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 410/410 variables, and 121 constraints, problems are : Problem set: 0 solved, 28 unsolved in 3628 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 67/67 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 28/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4702ms problems are : Problem set: 0 solved, 28 unsolved
Fused 28 Parikh solutions to 27 different solutions.
Parikh walk visited 2 properties in 2405 ms.
Support contains 34 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 344/344 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 66 transition count 343
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 65 transition count 333
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 65 transition count 333
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 65 transition count 332
Applied a total of 5 rules in 15 ms. Remains 65 /67 variables (removed 2) and now considering 332/344 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 65/67 places, 332/344 transitions.
RANDOM walk for 40000 steps (8 resets) in 349 ms. (114 steps per ms) remains 24/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (8 resets) in 9 ms. (400 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 9 ms. (400 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (8 resets) in 8 ms. (444 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 9 ms. (400 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 9 ms. (400 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 9 ms. (400 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 24/24 properties
Interrupted probabilistic random walk after 820545 steps, run timeout after 3001 ms. (steps per millisecond=273 ) properties seen :2 out of 24
Probabilistic random walk after 820545 steps, saw 148839 distinct states, run finished after 3006 ms. (steps per millisecond=272 ) properties seen :2
// Phase 1: matrix 332 rows 65 cols
[2025-06-08 03:02:57] [INFO ] Computed 14 invariants in 3 ms
[2025-06-08 03:02:57] [INFO ] State equation strengthened by 18 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (OVERLAPS) 32/64 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 332/397 variables, 65/79 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 18/97 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 0/397 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 397/397 variables, and 97 constraints, problems are : Problem set: 0 solved, 22 unsolved in 1129 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 65/65 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 22/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (OVERLAPS) 32/64 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 332/397 variables, 65/79 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 18/97 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 17/114 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/397 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 0/397 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 397/397 variables, and 114 constraints, problems are : Problem set: 0 solved, 22 unsolved in 3026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 65/65 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 22/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4217ms problems are : Problem set: 0 solved, 22 unsolved
Fused 22 Parikh solutions to 21 different solutions.
Parikh walk visited 4 properties in 1186 ms.
Support contains 32 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 65 transition count 331
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 64 transition count 331
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 63 transition count 330
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 62 transition count 324
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 62 transition count 324
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 62 transition count 323
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 8 place count 62 transition count 322
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 9 place count 61 transition count 322
Applied a total of 9 rules in 28 ms. Remains 61 /65 variables (removed 4) and now considering 322/332 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 61/65 places, 322/332 transitions.
RANDOM walk for 40000 steps (8 resets) in 355 ms. (112 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (8 resets) in 10 ms. (363 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (8 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
Interrupted probabilistic random walk after 771921 steps, run timeout after 3001 ms. (steps per millisecond=257 ) properties seen :8 out of 17
Probabilistic random walk after 771921 steps, saw 138487 distinct states, run finished after 3001 ms. (steps per millisecond=257 ) properties seen :8
// Phase 1: matrix 322 rows 61 cols
[2025-06-08 03:03:06] [INFO ] Computed 14 invariants in 3 ms
[2025-06-08 03:03:06] [INFO ] State equation strengthened by 18 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 33/59 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1/61 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 322/383 variables, 61/75 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 18/93 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 0/383 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 93 constraints, problems are : Problem set: 0 solved, 9 unsolved in 352 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 61/61 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 9/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 33/59 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1/61 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 322/383 variables, 61/75 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 18/93 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 7/100 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 0/383 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 383/383 variables, and 100 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1396 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 61/61 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 9/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1775ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 6 properties in 2639 ms.
Support contains 17 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 322/322 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 61 transition count 321
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 60 transition count 321
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 6 place count 56 transition count 256
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 56 transition count 256
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 2 with 6 rules applied. Total rules applied 16 place count 53 transition count 253
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 52 transition count 254
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 52 transition count 252
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 51 transition count 246
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 51 transition count 246
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 51 transition count 245
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 26 place count 51 transition count 242
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 29 place count 48 transition count 242
Applied a total of 29 rules in 30 ms. Remains 48 /61 variables (removed 13) and now considering 242/322 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 48/61 places, 242/322 transitions.
RANDOM walk for 40000 steps (8 resets) in 147 ms. (270 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
// Phase 1: matrix 242 rows 48 cols
[2025-06-08 03:03:10] [INFO ] Computed 14 invariants in 3 ms
[2025-06-08 03:03:10] [INFO ] State equation strengthened by 102 read => feed constraints.
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/43 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/44 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/48 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 242/290 variables, 48/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 102/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/290 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 164 constraints, problems are : Problem set: 0 solved, 1 unsolved in 162 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 48/48 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 1/0 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 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/43 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/44 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/48 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 242/290 variables, 48/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 102/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/290 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 290/290 variables, and 164 constraints, problems are : Problem set: 0 solved, 1 unsolved in 131 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 48/48 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 316ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 14 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 242/242 transitions.
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 0 with 6 rules applied. Total rules applied 6 place count 45 transition count 245
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 9 place count 45 transition count 242
Applied a total of 9 rules in 16 ms. Remains 45 /48 variables (removed 3) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 45/48 places, 242/242 transitions.
RANDOM walk for 40000 steps (8 resets) in 176 ms. (225 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 9810 steps, run visited all 1 properties in 27 ms. (steps per millisecond=363 )
Probabilistic random walk after 9810 steps, saw 4002 distinct states, run finished after 37 ms. (steps per millisecond=265 ) properties seen :1
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
FORMULA ErlangenMainframeV0-PT-0404-CTLFireability-2025-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-08 03:03:11] [INFO ] Flatten gal took : 57 ms
[2025-06-08 03:03:11] [INFO ] Flatten gal took : 32 ms
[2025-06-08 03:03:11] [INFO ] Input system was already deterministic with 406 transitions.
Computed a total of 19 stabilizing places and 19 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 406/406 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 118 transition count 320
Ensure Unique test removed 1 places
Iterating global reduction 0 with 27 rules applied. Total rules applied 53 place count 117 transition count 320
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 65 place count 105 transition count 250
Iterating global reduction 0 with 12 rules applied. Total rules applied 77 place count 105 transition count 250
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 84 place count 98 transition count 236
Ensure Unique test removed 3 places
Iterating global reduction 0 with 10 rules applied. Total rules applied 94 place count 95 transition count 236
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 94 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 94 transition count 200
Applied a total of 96 rules in 20 ms. Remains 94 /144 variables (removed 50) and now considering 200/406 (removed 206) transitions.
// Phase 1: matrix 200 rows 94 cols
[2025-06-08 03:03:11] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:03:11] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-08 03:03:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:03:11] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Running 199 sub problems to find dead transitions.
[2025-06-08 03:03: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/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:03:12] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:03:13] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (OVERLAPS) 200/294 variables, 94/106 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (OVERLAPS) 0/294 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Real declared 294/294 variables, and 106 constraints, problems are : Problem set: 0 solved, 199 unsolved in 7055 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:03:19] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (OVERLAPS) 200/294 variables, 94/107 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 199/306 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:03:21] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:03:21] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:03:22] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:03:22] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:03:22] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:03:22] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:03:22] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:03:23] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 8/314 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:03:26] [INFO ] Deduced a trap along path composed of 3 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:03:27] [INFO ] Deduced a trap along path composed of 13 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 10 (OVERLAPS) 0/294 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Int declared 294/294 variables, and 316 constraints, problems are : Problem set: 0 solved, 199 unsolved in 29907 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 37057ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 37059ms
Starting structural reductions in LTL mode, iteration 1 : 94/144 places, 200/406 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37357 ms. Remains : 94/144 places, 200/406 transitions.
[2025-06-08 03:03:48] [INFO ] Flatten gal took : 9 ms
[2025-06-08 03:03:48] [INFO ] Flatten gal took : 9 ms
[2025-06-08 03:03:48] [INFO ] Input system was already deterministic with 200 transitions.
[2025-06-08 03:03:48] [INFO ] Flatten gal took : 8 ms
[2025-06-08 03:03:48] [INFO ] Flatten gal took : 8 ms
[2025-06-08 03:03:48] [INFO ] Time to serialize gal into /tmp/CTLFireability1348324785250814264.gal : 8 ms
[2025-06-08 03:03:48] [INFO ] Time to serialize properties into /tmp/CTLFireability15341972315809583162.ctl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1348324785250814264.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15341972315809583162.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,3.24801e+08,0.858771,33508,2,8863,5,126053,6,0,578,88135,0


Converting to forward existential form...Done !
original formula: EX(AX(EG(E((p165!=1) U E(((((p15==1)&&(p34==1))&&((p59==1)&&(p78==1)))&&((p118==1)&&(p171==1))) U ((((p21==1)&&(p34==1))&&((p53==1)&&(p78...191
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(EG(E((p165!=1) U E(((((p15==1)&&(p34==1))&&((p59==1)&&(p78==1)))&&((p118==1)&&(p171==1))) U ...242
Reverse transition relation is NOT exact ! Due to transitions t7, t9, t11, t13, t15, t40, t43, t48, t52, t55, t57, t61, t67, t68, t72, t77, t78, t79, t80, ...687
Detected timeout of ITS tools.
[2025-06-08 03:04:19] [INFO ] Flatten gal took : 10 ms
[2025-06-08 03:04:19] [INFO ] Applying decomposition
[2025-06-08 03:04:19] [INFO ] Flatten gal took : 7 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/graph1574898415606922573.txt' '-o' '/tmp/graph1574898415606922573.bin' '-w' '/tmp/graph1574898415606922573.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1574898415606922573.bin' '-l' '-1' '-v' '-w' '/tmp/graph1574898415606922573.weights' '-q' '0' '-e' '0.001'
[2025-06-08 03:04:19] [INFO ] Decomposing Gal with order
[2025-06-08 03:04:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 03:04:19] [INFO ] Removed a total of 163 redundant transitions.
[2025-06-08 03:04:19] [INFO ] Flatten gal took : 51 ms
[2025-06-08 03:04:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 5 ms.
[2025-06-08 03:04:19] [INFO ] Time to serialize gal into /tmp/CTLFireability613103581065646933.gal : 4 ms
[2025-06-08 03:04:19] [INFO ] Time to serialize properties into /tmp/CTLFireability10852403714097551275.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/CTLFireability613103581065646933.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10852403714097551275.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.24801e+08,3.64278,111132,797,2043,25675,33141,299,293995,175,1.41805e+06,0


Converting to forward existential form...Done !
original formula: EX(AX(EG(E((i7.u23.p165!=1) U E(((((u10.p15==1)&&(u10.p34==1))&&((u10.p59==1)&&(u10.p78==1)))&&((u10.p118==1)&&(u10.p171==1))) U ((((u10....246
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(EG(E((i7.u23.p165!=1) U E(((((u10.p15==1)&&(u10.p34==1))&&((u10.p59==1)&&(u10.p78==1)))&&((u...297
Reverse transition relation is NOT exact ! Due to transitions t7, t15, t58, t70, t172, u3.t72, u3.t158, u3.t159, u4.t67, u4.t160, u4.t161, u5.t61, u5.t156,...1037
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,13.0196,294568,1,0,202610,131649,2237,1.51925e+06,2822,1.61883e+06,290967
FORMULA ErlangenMainframeV0-PT-0404-CTLFireability-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 144/144 places, 406/406 transitions.
Graph (trivial) has 115 edges and 144 vertex of which 6 / 144 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 140 transition count 370
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 65 place count 108 transition count 370
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 65 place count 108 transition count 363
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 79 place count 101 transition count 363
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 95 place count 85 transition count 304
Iterating global reduction 2 with 16 rules applied. Total rules applied 111 place count 85 transition count 304
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 111 place count 85 transition count 300
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 119 place count 81 transition count 300
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 123 place count 77 transition count 153
Iterating global reduction 2 with 4 rules applied. Total rules applied 127 place count 77 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 128 place count 77 transition count 152
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 129 place count 76 transition count 140
Iterating global reduction 3 with 1 rules applied. Total rules applied 130 place count 76 transition count 140
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 131 place count 75 transition count 138
Iterating global reduction 3 with 1 rules applied. Total rules applied 132 place count 75 transition count 138
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 182 place count 50 transition count 113
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 185 place count 47 transition count 93
Iterating global reduction 3 with 3 rules applied. Total rules applied 188 place count 47 transition count 93
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 190 place count 47 transition count 91
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 191 place count 46 transition count 83
Iterating global reduction 4 with 1 rules applied. Total rules applied 192 place count 46 transition count 83
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 195 place count 46 transition count 80
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 201 place count 43 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 202 place count 42 transition count 76
Applied a total of 202 rules in 50 ms. Remains 42 /144 variables (removed 102) and now considering 76/406 (removed 330) transitions.
[2025-06-08 03:04:32] [INFO ] Flow matrix only has 73 transitions (discarded 3 similar events)
// Phase 1: matrix 73 rows 42 cols
[2025-06-08 03:04:32] [INFO ] Computed 14 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:04:32] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-08 03:04:32] [INFO ] Flow matrix only has 73 transitions (discarded 3 similar events)
[2025-06-08 03:04:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:04:32] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-08 03:04:32] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 03:04:32] [INFO ] Redundant transitions in 1 ms returned []
Running 58 sub problems to find dead transitions.
[2025-06-08 03:04:32] [INFO ] Flow matrix only has 73 transitions (discarded 3 similar events)
[2025-06-08 03:04:32] [INFO ] Invariant cache hit.
[2025-06-08 03:04:32] [INFO ] State equation strengthened by 18 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (OVERLAPS) 5/42 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 72/114 variables, 42/56 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 18/74 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 0/114 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/115 variables, and 74 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1037 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 42/42 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (OVERLAPS) 5/42 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 72/114 variables, 42/56 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 18/74 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 58/132 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (OVERLAPS) 0/114 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/115 variables, and 132 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1425 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 42/42 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2482ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 2482ms
Starting structural reductions in SI_CTL mode, iteration 1 : 42/144 places, 76/406 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2706 ms. Remains : 42/144 places, 76/406 transitions.
[2025-06-08 03:04:35] [INFO ] Flatten gal took : 8 ms
[2025-06-08 03:04:35] [INFO ] Flatten gal took : 4 ms
[2025-06-08 03:04:35] [INFO ] Input system was already deterministic with 76 transitions.
[2025-06-08 03:04:35] [INFO ] Flatten gal took : 4 ms
[2025-06-08 03:04:35] [INFO ] Flatten gal took : 8 ms
[2025-06-08 03:04:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5208838818241856676.gal : 6 ms
[2025-06-08 03:04:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13976162016533160783.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/ReachabilityCardinality5208838818241856676.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13976162016533160783.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 ...329
RANDOM walk for 40000 steps (8 resets) in 251 ms. (158 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality13976162016533160783.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :8 after 32
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :32 after 56
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :56 after 456
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :456 after 6144
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,88128,0.075517,4780,2,308,10,2452,7,0,250,2025,0
Total reachable state count : 88128

Verifying 1 reachability properties.
BEST_FIRST walk for 40003 steps (8 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
Invariant property ErlangenMainframeV0-PT-0404-CTLFireability-2025-01 does not hold.
FORMULA ErlangenMainframeV0-PT-0404-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ErlangenMainframeV0-PT-0404-CTLFireability-2025-01,1,0.076225,5036,2,43,10,2452,7,0,259,2025,0
Finished probabilistic random walk after 165148 steps, run visited all 1 properties in 136 ms. (steps per millisecond=1214 )
Probabilistic random walk after 165148 steps, saw 30328 distinct states, run finished after 150 ms. (steps per millisecond=1100 ) properties seen :1
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 406/406 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 121 transition count 357
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 121 transition count 357
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 58 place count 109 transition count 328
Iterating global reduction 0 with 12 rules applied. Total rules applied 70 place count 109 transition count 328
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 75 place count 104 transition count 305
Iterating global reduction 0 with 5 rules applied. Total rules applied 80 place count 104 transition count 305
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 82 place count 102 transition count 215
Iterating global reduction 0 with 2 rules applied. Total rules applied 84 place count 102 transition count 215
Applied a total of 84 rules in 6 ms. Remains 102 /144 variables (removed 42) and now considering 215/406 (removed 191) transitions.
// Phase 1: matrix 215 rows 102 cols
[2025-06-08 03:04:35] [INFO ] Computed 14 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:04:35] [INFO ] Implicit Places using invariants in 130 ms returned []
[2025-06-08 03:04:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:04:35] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2025-06-08 03:04:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/102 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:36] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:37] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/317 variables, 102/118 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:39] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:39] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 0/317 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 120 constraints, problems are : Problem set: 0 solved, 214 unsolved in 9171 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/102 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/317 variables, 102/120 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 214/334 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:48] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:48] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:48] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:48] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 4/338 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:54] [INFO ] Deduced a trap along path composed of 9 places in 65 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:54] [INFO ] Deduced a trap along path composed of 11 places in 40 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:04:54] [INFO ] Deduced a trap along path composed of 5 places in 17 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 3/341 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 317/317 variables, and 341 constraints, problems are : Problem set: 0 solved, 214 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 39288ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 39288ms
Starting structural reductions in LTL mode, iteration 1 : 102/144 places, 215/406 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39545 ms. Remains : 102/144 places, 215/406 transitions.
[2025-06-08 03:05:14] [INFO ] Flatten gal took : 13 ms
[2025-06-08 03:05:14] [INFO ] Flatten gal took : 9 ms
[2025-06-08 03:05:14] [INFO ] Input system was already deterministic with 215 transitions.
[2025-06-08 03:05:14] [INFO ] Flatten gal took : 9 ms
[2025-06-08 03:05:14] [INFO ] Flatten gal took : 9 ms
[2025-06-08 03:05:14] [INFO ] Time to serialize gal into /tmp/CTLFireability2747569825050671400.gal : 14 ms
[2025-06-08 03:05:14] [INFO ] Time to serialize properties into /tmp/CTLFireability6632844637531698720.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/CTLFireability2747569825050671400.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6632844637531698720.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,3.00873e+08,0.242159,12752,2,3870,5,30042,6,0,625,32190,0


Converting to forward existential form...Done !
original formula: EF((EF(((((p14==1)&&(p33==1))&&((p58==1)&&(p67==1)))&&(p116==1))) + ((AG(((((p15==1)&&(p34==1))&&((p49==1)&&(p72==1)))&&((p118==1)&&(p177...196
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,TRUE),TRUE) * ((((p14==1)&&(p33==1))&&((p58==1)&&(p67==1)))&&(p116==1)))] != FALSE + [(EY((Fwd...310
(forward)formula 0,1,0.294152,13008,1,0,7,30042,9,1,1493,32190,3
FORMULA ErlangenMainframeV0-PT-0404-CTLFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 406/406 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 122 transition count 358
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 122 transition count 358
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 54 place count 112 transition count 348
Iterating global reduction 0 with 10 rules applied. Total rules applied 64 place count 112 transition count 348
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 67 place count 109 transition count 328
Iterating global reduction 0 with 3 rules applied. Total rules applied 70 place count 109 transition count 328
Applied a total of 70 rules in 5 ms. Remains 109 /144 variables (removed 35) and now considering 328/406 (removed 78) transitions.
// Phase 1: matrix 328 rows 109 cols
[2025-06-08 03:05:15] [INFO ] Computed 14 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:05:15] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-08 03:05:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:05:15] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Running 327 sub problems to find dead transitions.
[2025-06-08 03:05:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 2 (OVERLAPS) 1/109 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 327 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:05:17] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:05:18] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 5 (OVERLAPS) 328/437 variables, 109/125 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 327 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 125 constraints, problems are : Problem set: 0 solved, 327 unsolved in 15797 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 327/327 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 327 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 2 (OVERLAPS) 1/109 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 327 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:05:32] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 6 (OVERLAPS) 328/437 variables, 109/126 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 327/453 constraints. Problems are: Problem set: 0 solved, 327 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:05:42] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:05:42] [INFO ] Deduced a trap composed of 14 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-08 03:05:43] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:05:43] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:05:44] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:05:44] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/437 variables, 6/459 constraints. Problems are: Problem set: 0 solved, 327 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 437/437 variables, and 459 constraints, problems are : Problem set: 0 solved, 327 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 327/327 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46224ms problems are : Problem set: 0 solved, 327 unsolved
Search for dead transitions found 0 dead transitions in 46225ms
Starting structural reductions in LTL mode, iteration 1 : 109/144 places, 328/406 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46393 ms. Remains : 109/144 places, 328/406 transitions.
[2025-06-08 03:06:01] [INFO ] Flatten gal took : 16 ms
[2025-06-08 03:06:01] [INFO ] Flatten gal took : 17 ms
[2025-06-08 03:06:01] [INFO ] Input system was already deterministic with 328 transitions.
[2025-06-08 03:06:01] [INFO ] Flatten gal took : 17 ms
[2025-06-08 03:06:01] [INFO ] Flatten gal took : 17 ms
[2025-06-08 03:06:01] [INFO ] Time to serialize gal into /tmp/CTLFireability5755445757137988745.gal : 5 ms
[2025-06-08 03:06:01] [INFO ] Time to serialize properties into /tmp/CTLFireability2388793835306958342.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/CTLFireability5755445757137988745.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2388793835306958342.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,5.42117e+08,0.924817,33284,2,9950,5,88781,6,0,766,104300,0


Converting to forward existential form...Done !
original formula: EF(((AF(AX((((E((p47==1) U ((((p11==1)&&(p30==1))&&((p59==1)&&(p72==1)))&&((p118==1)&&(p177==1)))) * (p21==1)) * ((p30==1)&&(p53==1))) * ...587
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * (!(EG(!(!(EX(!((((E((p47==1) U ((((p11==1)&&(p30==1))&&((p59==1)&&(p72==1)))&&((p118==1)...651
Reverse transition relation is NOT exact ! Due to transitions t0, t8, t10, t12, t15, t43, t46, t51, t55, t58, t64, t69, t70, t75, t83, t85, t101, t103, t10...738
(forward)formula 0,0,5.29666,152660,1,0,655,511097,692,329,11955,506906,720
FORMULA ErlangenMainframeV0-PT-0404-CTLFireability-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 144/144 places, 406/406 transitions.
Graph (trivial) has 106 edges and 144 vertex of which 4 / 144 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 141 transition count 371
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 65 place count 109 transition count 371
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 65 place count 109 transition count 365
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 77 place count 103 transition count 365
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 95 place count 85 transition count 287
Ensure Unique test removed 1 places
Iterating global reduction 2 with 19 rules applied. Total rules applied 114 place count 84 transition count 287
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 114 place count 84 transition count 283
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 122 place count 80 transition count 283
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 127 place count 75 transition count 179
Ensure Unique test removed 1 places
Iterating global reduction 2 with 6 rules applied. Total rules applied 133 place count 74 transition count 179
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 135 place count 72 transition count 139
Iterating global reduction 2 with 2 rules applied. Total rules applied 137 place count 72 transition count 139
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 139 place count 70 transition count 135
Iterating global reduction 2 with 2 rules applied. Total rules applied 141 place count 70 transition count 135
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 189 place count 46 transition count 111
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 194 place count 41 transition count 89
Ensure Unique test removed 2 places
Iterating global reduction 2 with 7 rules applied. Total rules applied 201 place count 39 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 203 place count 39 transition count 87
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 205 place count 38 transition count 86
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 206 place count 38 transition count 85
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 208 place count 37 transition count 84
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 209 place count 37 transition count 84
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 210 place count 36 transition count 83
Applied a total of 210 rules in 57 ms. Remains 36 /144 variables (removed 108) and now considering 83/406 (removed 323) transitions.
[2025-06-08 03:06:07] [INFO ] Flow matrix only has 82 transitions (discarded 1 similar events)
// Phase 1: matrix 82 rows 36 cols
[2025-06-08 03:06:07] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:06:07] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-08 03:06:07] [INFO ] Flow matrix only has 82 transitions (discarded 1 similar events)
[2025-06-08 03:06:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:06:07] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-08 03:06:07] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 03:06:07] [INFO ] Redundant transitions in 1 ms returned []
Running 64 sub problems to find dead transitions.
[2025-06-08 03:06:07] [INFO ] Flow matrix only has 82 transitions (discarded 1 similar events)
[2025-06-08 03:06:07] [INFO ] Invariant cache hit.
[2025-06-08 03:06:07] [INFO ] State equation strengthened by 18 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 6/36 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 81/117 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 18/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 0/117 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/118 variables, and 64 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1051 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 36/36 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 6/36 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 81/117 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 18/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 64/128 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/117 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/118 variables, and 128 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1743 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 36/36 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2819ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 2819ms
Starting structural reductions in SI_CTL mode, iteration 1 : 36/144 places, 83/406 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2983 ms. Remains : 36/144 places, 83/406 transitions.
[2025-06-08 03:06:10] [INFO ] Flatten gal took : 7 ms
[2025-06-08 03:06:10] [INFO ] Flatten gal took : 4 ms
[2025-06-08 03:06:10] [INFO ] Input system was already deterministic with 83 transitions.
[2025-06-08 03:06:10] [INFO ] Flatten gal took : 4 ms
[2025-06-08 03:06:10] [INFO ] Flatten gal took : 3 ms
[2025-06-08 03:06:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10371174154595121484.gal : 1 ms
[2025-06-08 03:06:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15825070148513954868.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/ReachabilityCardinality10371174154595121484.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15825070148513954868.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 4929 steps (0 resets) in 23 ms. (205 steps per ms) remains 0/1 properties
FORMULA ErlangenMainframeV0-PT-0404-CTLFireability-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK

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/ReachabilityCardinality15825070148513954868.prop.
ITS runner timed out or was interrupted.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 16
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :16 after 32
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :32 after 112
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :112 after 412
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 406/406 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 120 transition count 356
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 120 transition count 356
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 59 place count 109 transition count 345
Iterating global reduction 0 with 11 rules applied. Total rules applied 70 place count 109 transition count 345
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 76 place count 103 transition count 304
Iterating global reduction 0 with 6 rules applied. Total rules applied 82 place count 103 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 102 transition count 250
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 102 transition count 250
Applied a total of 84 rules in 6 ms. Remains 102 /144 variables (removed 42) and now considering 250/406 (removed 156) transitions.
// Phase 1: matrix 250 rows 102 cols
[2025-06-08 03:06:10] [INFO ] Computed 14 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:06:10] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-08 03:06:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:06:10] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
Running 249 sub problems to find dead transitions.
[2025-06-08 03:06:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (OVERLAPS) 1/102 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 249 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:06:12] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:06:12] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (OVERLAPS) 250/352 variables, 102/118 constraints. Problems are: Problem set: 0 solved, 249 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:06:14] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:06:14] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 8 (OVERLAPS) 0/352 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 120 constraints, problems are : Problem set: 0 solved, 249 unsolved in 11407 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 249 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (OVERLAPS) 1/102 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 249 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:06:22] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 6 (OVERLAPS) 250/352 variables, 102/121 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 249/370 constraints. Problems are: Problem set: 0 solved, 249 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:06:27] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:06:27] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:06:28] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:06:28] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:06:29] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 5/375 constraints. Problems are: Problem set: 0 solved, 249 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:06:36] [INFO ] Deduced a trap along path composed of 8 places in 79 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:06:36] [INFO ] Deduced a trap along path composed of 11 places in 36 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 2/377 constraints. Problems are: Problem set: 0 solved, 249 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 Int declared 352/352 variables, and 377 constraints, problems are : Problem set: 0 solved, 249 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 41599ms problems are : Problem set: 0 solved, 249 unsolved
Search for dead transitions found 0 dead transitions in 41599ms
Starting structural reductions in LTL mode, iteration 1 : 102/144 places, 250/406 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42012 ms. Remains : 102/144 places, 250/406 transitions.
[2025-06-08 03:06:52] [INFO ] Flatten gal took : 11 ms
[2025-06-08 03:06:52] [INFO ] Flatten gal took : 11 ms
[2025-06-08 03:06:52] [INFO ] Input system was already deterministic with 250 transitions.
[2025-06-08 03:06:52] [INFO ] Flatten gal took : 16 ms
[2025-06-08 03:06:52] [INFO ] Flatten gal took : 11 ms
[2025-06-08 03:06:52] [INFO ] Time to serialize gal into /tmp/CTLFireability10108303798301137159.gal : 3 ms
[2025-06-08 03:06:52] [INFO ] Time to serialize properties into /tmp/CTLFireability17818023704622993757.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/CTLFireability10108303798301137159.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17818023704622993757.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.34693e+08,0.238676,12836,2,3989,5,30959,6,0,660,31604,0


Converting to forward existential form...Done !
original formula: E(!(AX(EG(((((p21==1)&&(p34==1))&&((p53==1)&&(p72==1)))&&((p118==1)&&(p177==1)))))) U ((((p10==1)&&(p39==1))&&((p52==1)&&(p67==1)))&&(p11...162
=> equivalent forward existential formula: [(FwdU(Init,!(!(EX(!(EG(((((p21==1)&&(p34==1))&&((p53==1)&&(p72==1)))&&((p118==1)&&(p177==1))))))))) * ((((p10==...214
Reverse transition relation is NOT exact ! Due to transitions t7, t9, t11, t14, t39, t42, t47, t51, t54, t60, t61, t66, t71, t86, t88, t89, t90, t92, t98, ...603
(forward)formula 0,1,2.09755,69904,1,0,535,267521,524,263,8158,259552,642
FORMULA ErlangenMainframeV0-PT-0404-CTLFireability-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 406/406 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 121 transition count 323
Ensure Unique test removed 1 places
Iterating global reduction 0 with 24 rules applied. Total rules applied 47 place count 120 transition count 323
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 58 place count 109 transition count 254
Iterating global reduction 0 with 11 rules applied. Total rules applied 69 place count 109 transition count 254
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 74 place count 104 transition count 242
Ensure Unique test removed 2 places
Iterating global reduction 0 with 7 rules applied. Total rules applied 81 place count 102 transition count 242
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 84 place count 99 transition count 166
Iterating global reduction 0 with 3 rules applied. Total rules applied 87 place count 99 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 88 place count 98 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 89 place count 98 transition count 164
Applied a total of 89 rules in 7 ms. Remains 98 /144 variables (removed 46) and now considering 164/406 (removed 242) transitions.
// Phase 1: matrix 164 rows 98 cols
[2025-06-08 03:06:54] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:06:54] [INFO ] Implicit Places using invariants in 62 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 72 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 97/144 places, 164/406 transitions.
Applied a total of 0 rules in 1 ms. Remains 97 /97 variables (removed 0) and now considering 164/164 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 80 ms. Remains : 97/144 places, 164/406 transitions.
[2025-06-08 03:06:54] [INFO ] Flatten gal took : 4 ms
[2025-06-08 03:06:54] [INFO ] Flatten gal took : 4 ms
[2025-06-08 03:06:54] [INFO ] Input system was already deterministic with 164 transitions.
[2025-06-08 03:06:54] [INFO ] Flatten gal took : 4 ms
[2025-06-08 03:06:54] [INFO ] Flatten gal took : 4 ms
[2025-06-08 03:06:54] [INFO ] Time to serialize gal into /tmp/CTLFireability18304960237576457090.gal : 1 ms
[2025-06-08 03:06:54] [INFO ] Time to serialize properties into /tmp/CTLFireability11515515591806603473.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/CTLFireability18304960237576457090.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11515515591806603473.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.61498e+08,0.25329,14564,2,4044,5,38236,6,0,554,41593,0


Converting to forward existential form...Done !
original formula: AG((((p16==0) + E(((((p11==1)&&(p34==1))&&((p49==1)&&(p72==1)))&&((p118==1)&&(p171==1))) U (p133==1))) + AX(EF((p31==0)))))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * !(((p16==0) + E(((((p11==1)&&(p34==1))&&((p49==1)&&(p72==1)))&&((p118==1)&&(p171==1))) U...204
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t12, t15, t43, t46, t51, t55, t58, t59, t64, t69, t70, t72, t75, t77, t78, t81, t82,...363
(forward)formula 0,1,1.49506,51828,1,0,286,245950,349,156,4394,197431,341
FORMULA ErlangenMainframeV0-PT-0404-CTLFireability-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 406/406 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 120 transition count 339
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 120 transition count 339
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 60 place count 108 transition count 316
Iterating global reduction 0 with 12 rules applied. Total rules applied 72 place count 108 transition count 316
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 76 place count 104 transition count 305
Iterating global reduction 0 with 4 rules applied. Total rules applied 80 place count 104 transition count 305
Applied a total of 80 rules in 12 ms. Remains 104 /144 variables (removed 40) and now considering 305/406 (removed 101) transitions.
// Phase 1: matrix 305 rows 104 cols
[2025-06-08 03:06:56] [INFO ] Computed 14 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:06:56] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-08 03:06:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:06:56] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Running 304 sub problems to find dead transitions.
[2025-06-08 03:06:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:06:58] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:06:58] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (OVERLAPS) 305/409 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:07:02] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:07:02] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:07:02] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 3/123 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 8 (OVERLAPS) 0/409 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 304 unsolved
No progress, stopping.
After SMT solving in domain Real declared 409/409 variables, and 123 constraints, problems are : Problem set: 0 solved, 304 unsolved in 15996 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:07:13] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (OVERLAPS) 305/409 variables, 104/124 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 304/428 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:07:26] [INFO ] Deduced a trap along path composed of 4 places in 66 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:07:27] [INFO ] Deduced a trap along path composed of 20 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/409 variables, 2/430 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 409/409 variables, and 430 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 46425ms problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 46426ms
Starting structural reductions in LTL mode, iteration 1 : 104/144 places, 305/406 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46615 ms. Remains : 104/144 places, 305/406 transitions.
[2025-06-08 03:07:42] [INFO ] Flatten gal took : 12 ms
[2025-06-08 03:07:42] [INFO ] Flatten gal took : 12 ms
[2025-06-08 03:07:42] [INFO ] Input system was already deterministic with 305 transitions.
[2025-06-08 03:07:42] [INFO ] Flatten gal took : 11 ms
[2025-06-08 03:07:42] [INFO ] Flatten gal took : 11 ms
[2025-06-08 03:07:42] [INFO ] Time to serialize gal into /tmp/CTLFireability611169848138721212.gal : 3 ms
[2025-06-08 03:07:42] [INFO ] Time to serialize properties into /tmp/CTLFireability7363233272940311518.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/CTLFireability611169848138721212.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7363233272940311518.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.22151e+08,0.288141,14968,2,4404,5,36120,6,0,723,35121,0


Converting to forward existential form...Done !
original formula: AG((((p179==0) + (((EG(((((p21==0)||(p34==0))||((p53==0)||(p68==0)))||((p118==0)||(p177==0)))) * AX(((((p11==0)||(p40==0))||((p53==0)||(p...391
=> equivalent forward existential formula: ((([(((FwdU(Init,TRUE) * !((((p137==1)&&(p157==1))&&(p177==1)))) * !((p179==0))) * !(EG(((((p21==0)||(p34==0))||...730
(forward)formula 0,0,0.293901,15224,1,0,13,36120,15,6,782,35121,3
FORMULA ErlangenMainframeV0-PT-0404-CTLFireability-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 406/406 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 121 transition count 383
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 121 transition count 383
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 57 place count 110 transition count 372
Iterating global reduction 0 with 11 rules applied. Total rules applied 68 place count 110 transition count 372
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 71 place count 107 transition count 369
Iterating global reduction 0 with 3 rules applied. Total rules applied 74 place count 107 transition count 369
Applied a total of 74 rules in 10 ms. Remains 107 /144 variables (removed 37) and now considering 369/406 (removed 37) transitions.
// Phase 1: matrix 369 rows 107 cols
[2025-06-08 03:07:43] [INFO ] Computed 14 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:07:43] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-08 03:07:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:07:43] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2025-06-08 03: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/106 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:07:46] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:07:46] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (OVERLAPS) 369/476 variables, 107/123 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:07:50] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:07:50] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 8 (OVERLAPS) 0/476 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Real declared 476/476 variables, and 125 constraints, problems are : Problem set: 0 solved, 368 unsolved in 22135 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:06] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (OVERLAPS) 369/476 variables, 107/126 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 368/494 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:08:22] [INFO ] Deduced a trap along path composed of 9 places in 106 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 1/495 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 476/476 variables, and 495 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 52705ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 52706ms
Starting structural reductions in LTL mode, iteration 1 : 107/144 places, 369/406 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52871 ms. Remains : 107/144 places, 369/406 transitions.
[2025-06-08 03:08:35] [INFO ] Flatten gal took : 15 ms
[2025-06-08 03:08:35] [INFO ] Flatten gal took : 15 ms
[2025-06-08 03:08:35] [INFO ] Input system was already deterministic with 369 transitions.
[2025-06-08 03:08:35] [INFO ] Flatten gal took : 15 ms
[2025-06-08 03:08:36] [INFO ] Flatten gal took : 16 ms
[2025-06-08 03:08:36] [INFO ] Time to serialize gal into /tmp/CTLFireability7458375753340368081.gal : 4 ms
[2025-06-08 03:08:36] [INFO ] Time to serialize properties into /tmp/CTLFireability16452276727233161245.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/CTLFireability7458375753340368081.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16452276727233161245.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,3.82839e+08,0.400353,17096,2,5846,5,46242,6,0,799,39855,0


Converting to forward existential form...Done !
original formula: (EF((EX(AF(((((p21==1)&&(p30==1))&&((p53==1)&&(p78==1)))&&((p118==1)&&(p177==1))))) + AG((((((p11==0)||(p30==0))||((p53==0)||(p72==0)))||...723
=> equivalent forward existential formula: ([(EY((FwdU((Init * !(E(TRUE U (EX(!(EG(!(((((p21==1)&&(p30==1))&&((p53==1)&&(p78==1)))&&((p118==1)&&(p177==1)))...1130
Reverse transition relation is NOT exact ! Due to transitions t7, t9, t11, t14, t39, t42, t47, t51, t54, t60, t66, t71, t245, t246, t247, t248, t249, t250,...755
Detected timeout of ITS tools.
[2025-06-08 03:09:06] [INFO ] Flatten gal took : 19 ms
[2025-06-08 03:09:06] [INFO ] Applying decomposition
[2025-06-08 03:09:06] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13661256699481470867.txt' '-o' '/tmp/graph13661256699481470867.bin' '-w' '/tmp/graph13661256699481470867.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13661256699481470867.bin' '-l' '-1' '-v' '-w' '/tmp/graph13661256699481470867.weights' '-q' '0' '-e' '0.001'
[2025-06-08 03:09:06] [INFO ] Decomposing Gal with order
[2025-06-08 03:09:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 03:09:06] [INFO ] Removed a total of 391 redundant transitions.
[2025-06-08 03:09:06] [INFO ] Flatten gal took : 69 ms
[2025-06-08 03:09:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 89 labels/synchronizations in 4 ms.
[2025-06-08 03:09:06] [INFO ] Time to serialize gal into /tmp/CTLFireability1225422062995593769.gal : 4 ms
[2025-06-08 03:09:06] [INFO ] Time to serialize properties into /tmp/CTLFireability12825703182164046642.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/CTLFireability1225422062995593769.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12825703182164046642.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.82839e+08,5.01479,167508,979,2113,76408,91901,327,989437,334,1.03869e+06,0


Converting to forward existential form...Done !
original formula: (EF((EX(AF(((((i7.u9.p21==1)&&(i7.u9.p30==1))&&((i7.u9.p53==1)&&(i7.u9.p78==1)))&&((i7.u9.p118==1)&&(i7.u20.p177==1))))) + AG((((((i7.u9....1042
=> equivalent forward existential formula: ([(EY((FwdU((Init * !(E(TRUE U (EX(!(EG(!(((((i7.u9.p21==1)&&(i7.u9.p30==1))&&((i7.u9.p53==1)&&(i7.u9.p78==1)))&...1553
Reverse transition relation is NOT exact ! Due to transitions t7, t39, t54, t60, t66, t71, u2.t247, u2.t248, u3.t249, u3.t250, u4.t245, u4.t246, u5.t251, u...1288
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 406/406 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 121 transition count 357
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 121 transition count 357
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 57 place count 110 transition count 346
Iterating global reduction 0 with 11 rules applied. Total rules applied 68 place count 110 transition count 346
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 108 transition count 344
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 108 transition count 344
Applied a total of 72 rules in 6 ms. Remains 108 /144 variables (removed 36) and now considering 344/406 (removed 62) transitions.
// Phase 1: matrix 344 rows 108 cols
[2025-06-08 03:09:36] [INFO ] Computed 14 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:09:36] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-08 03:09:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:09:36] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Running 343 sub problems to find dead transitions.
[2025-06-08 03:09:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 2 (OVERLAPS) 1/108 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 343 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:09:39] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:09:39] [INFO ] Deduced a trap composed of 24 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-08 03:09:39] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 5 (OVERLAPS) 344/452 variables, 108/125 constraints. Problems are: Problem set: 0 solved, 343 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:09:43] [INFO ] Deduced a trap composed of 12 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-08 03:09:43] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/452 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 8 (OVERLAPS) 0/452 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 343 unsolved
No progress, stopping.
After SMT solving in domain Real declared 452/452 variables, and 127 constraints, problems are : Problem set: 0 solved, 343 unsolved in 19485 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 343/343 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 343 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 2 (OVERLAPS) 1/108 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 5 (OVERLAPS) 344/452 variables, 108/127 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 343/470 constraints. Problems are: Problem set: 0 solved, 343 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:10:10] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:10:10] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/452 variables, 2/472 constraints. Problems are: Problem set: 0 solved, 343 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 452/452 variables, and 472 constraints, problems are : Problem set: 0 solved, 343 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 343/343 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49965ms problems are : Problem set: 0 solved, 343 unsolved
Search for dead transitions found 0 dead transitions in 49966ms
Starting structural reductions in LTL mode, iteration 1 : 108/144 places, 344/406 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50117 ms. Remains : 108/144 places, 344/406 transitions.
[2025-06-08 03:10:26] [INFO ] Flatten gal took : 13 ms
[2025-06-08 03:10:26] [INFO ] Flatten gal took : 14 ms
[2025-06-08 03:10:26] [INFO ] Input system was already deterministic with 344 transitions.
[2025-06-08 03:10:26] [INFO ] Flatten gal took : 13 ms
[2025-06-08 03:10:26] [INFO ] Flatten gal took : 13 ms
[2025-06-08 03:10:26] [INFO ] Time to serialize gal into /tmp/CTLFireability3172632595708481335.gal : 3 ms
[2025-06-08 03:10:26] [INFO ] Time to serialize properties into /tmp/CTLFireability7059235700016694183.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/CTLFireability3172632595708481335.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7059235700016694183.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,4.48442e+08,0.354581,15948,2,5118,5,39598,6,0,778,38324,0


Converting to forward existential form...Done !
original formula: EF((EG(((AX(((((p15==0)||(p34==0))||((p53==0)||(p68==0)))||((p118==0)||(p177==0)))) * AX(((((p21==0)||(p30==0))||((p59==0)||(p78==0)))||(...665
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),((!(EX(!(((((p15==0)||(p34==0))||((p53==0)||(p68==0)))||((p118==0)||(p177==0)))))) * !(EX...1126
Reverse transition relation is NOT exact ! Due to transitions t7, t9, t11, t14, t33, t41, t44, t49, t53, t56, t62, t68, t73, t79, t85, t97, t103, t118, t13...702
Hit Full ! (commute/partial/dont) 89/0/255
(forward)formula 0,1,3.17109,97264,1,0,685,355921,735,345,12701,353000,748
FORMULA ErlangenMainframeV0-PT-0404-CTLFireability-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 406/406 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 119 transition count 338
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 119 transition count 338
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 63 place count 106 transition count 237
Iterating global reduction 0 with 13 rules applied. Total rules applied 76 place count 106 transition count 237
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 81 place count 101 transition count 214
Iterating global reduction 0 with 5 rules applied. Total rules applied 86 place count 101 transition count 214
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 88 place count 99 transition count 174
Iterating global reduction 0 with 2 rules applied. Total rules applied 90 place count 99 transition count 174
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 98 transition count 172
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 98 transition count 172
Applied a total of 92 rules in 9 ms. Remains 98 /144 variables (removed 46) and now considering 172/406 (removed 234) transitions.
// Phase 1: matrix 172 rows 98 cols
[2025-06-08 03:10:29] [INFO ] Computed 14 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:10:29] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-08 03:10:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:10:29] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Running 171 sub problems to find dead transitions.
[2025-06-08 03:10:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 171 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:10:31] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:10:31] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (OVERLAPS) 172/270 variables, 98/114 constraints. Problems are: Problem set: 0 solved, 171 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:10:32] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:10:32] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:10:32] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (OVERLAPS) 0/270 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 117 constraints, problems are : Problem set: 0 solved, 171 unsolved in 6757 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (OVERLAPS) 172/270 variables, 98/117 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 171/288 constraints. Problems are: Problem set: 0 solved, 171 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:10:39] [INFO ] Deduced a trap along path composed of 9 places in 49 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:10:39] [INFO ] Deduced a trap along path composed of 11 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 2/290 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 171 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:10:50] [INFO ] Deduced a trap along path composed of 3 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/270 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 171 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:10:54] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:10:54] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:10:54] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 3/294 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/270 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 12 (OVERLAPS) 0/270 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 294 constraints, problems are : Problem set: 0 solved, 171 unsolved in 29178 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 35977ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 35979ms
Starting structural reductions in LTL mode, iteration 1 : 98/144 places, 172/406 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36125 ms. Remains : 98/144 places, 172/406 transitions.
[2025-06-08 03:11:05] [INFO ] Flatten gal took : 10 ms
[2025-06-08 03:11:05] [INFO ] Flatten gal took : 4 ms
[2025-06-08 03:11:05] [INFO ] Input system was already deterministic with 172 transitions.
[2025-06-08 03:11:05] [INFO ] Flatten gal took : 5 ms
[2025-06-08 03:11:05] [INFO ] Flatten gal took : 5 ms
[2025-06-08 03:11:05] [INFO ] Time to serialize gal into /tmp/CTLFireability13334950374973823620.gal : 1 ms
[2025-06-08 03:11:05] [INFO ] Time to serialize properties into /tmp/CTLFireability18331232520662584717.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/CTLFireability13334950374973823620.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18331232520662584717.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,2.10512e+08,0.166204,10396,2,3327,5,24063,6,0,566,25138,0


Converting to forward existential form...Done !
original formula: EX((AG(AF(((((p20==0)||(p39==0))||((p48==0)||(p71==0)))||(p116==0)))) + AG(EF((p36!=1)))))
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U !(!(EG(!(((((p20==0)||(p39==0))||((p48==0)||(p71==0)))||(p116==0)))))))))] != FALSE + [...213
Reverse transition relation is NOT exact ! Due to transitions t7, t9, t11, t14, t39, t42, t47, t51, t54, t55, t60, t65, t67, t70, t72, t114, t115, t116, t1...373
(forward)formula 0,1,7.01621,212940,1,0,391,1.10239e+06,373,196,5417,825900,476
FORMULA ErlangenMainframeV0-PT-0404-CTLFireability-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 406/406 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 121 transition count 383
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 121 transition count 383
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 57 place count 110 transition count 372
Iterating global reduction 0 with 11 rules applied. Total rules applied 68 place count 110 transition count 372
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 72 place count 106 transition count 342
Iterating global reduction 0 with 4 rules applied. Total rules applied 76 place count 106 transition count 342
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 105 transition count 288
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 105 transition count 288
Applied a total of 78 rules in 5 ms. Remains 105 /144 variables (removed 39) and now considering 288/406 (removed 118) transitions.
// Phase 1: matrix 288 rows 105 cols
[2025-06-08 03:11:13] [INFO ] Computed 14 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:11:13] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-08 03:11:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:11:13] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Running 287 sub problems to find dead transitions.
[2025-06-08 03:11:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 287 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:15] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:15] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (OVERLAPS) 288/393 variables, 105/121 constraints. Problems are: Problem set: 0 solved, 287 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:18] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:18] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:18] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 3/124 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 287 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:24] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:24] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:24] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 5 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/393 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 10 (OVERLAPS) 0/393 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 287 unsolved
No progress, stopping.
After SMT solving in domain Real declared 393/393 variables, and 127 constraints, problems are : Problem set: 0 solved, 287 unsolved in 20327 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 287 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 287 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:34] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (OVERLAPS) 288/393 variables, 105/128 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 287/415 constraints. Problems are: Problem set: 0 solved, 287 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:42] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:42] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 2/417 constraints. Problems are: Problem set: 0 solved, 287 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:56] [INFO ] Deduced a trap along path composed of 4 places in 77 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:56] [INFO ] Deduced a trap along path composed of 11 places in 31 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 393/393 variables, and 419 constraints, problems are : Problem set: 0 solved, 287 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 50607ms problems are : Problem set: 0 solved, 287 unsolved
Search for dead transitions found 0 dead transitions in 50608ms
Starting structural reductions in LTL mode, iteration 1 : 105/144 places, 288/406 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50779 ms. Remains : 105/144 places, 288/406 transitions.
[2025-06-08 03:12:03] [INFO ] Flatten gal took : 12 ms
[2025-06-08 03:12:03] [INFO ] Flatten gal took : 11 ms
[2025-06-08 03:12:03] [INFO ] Input system was already deterministic with 288 transitions.
[2025-06-08 03:12:03] [INFO ] Flatten gal took : 11 ms
[2025-06-08 03:12:03] [INFO ] Flatten gal took : 11 ms
[2025-06-08 03:12:03] [INFO ] Time to serialize gal into /tmp/CTLFireability10636229174088271137.gal : 2 ms
[2025-06-08 03:12:03] [INFO ] Time to serialize properties into /tmp/CTLFireability1696737431498713957.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/CTLFireability10636229174088271137.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1696737431498713957.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,3.36956e+08,0.335301,15736,2,5252,5,41376,6,0,710,36144,0


Converting to forward existential form...Done !
original formula: E(AG(EF((((((p15==1)&&(p30==1))&&((p53==1)&&(p68==1)))&&((p118==1)&&(p177==1)))||((((p14==1)&&(p39==1))&&((p58==1)&&(p67==1)))&&(p116==1)...224
=> equivalent forward existential formula: [(EY(FwdU(Init,!(E(TRUE U !(E(TRUE U (((((p15==1)&&(p30==1))&&((p53==1)&&(p68==1)))&&((p118==1)&&(p177==1)))||((...288
Reverse transition relation is NOT exact ! Due to transitions t7, t9, t11, t14, t39, t42, t47, t51, t54, t60, t66, t71, t72, t191, t192, t193, t194, t195, ...597
(forward)formula 0,1,14.9229,404736,1,0,589,1.78222e+06,599,307,10654,1.34553e+06,658
FORMULA ErlangenMainframeV0-PT-0404-CTLFireability-2025-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 406/406 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 125 transition count 361
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 125 transition count 361
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 120 transition count 356
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 120 transition count 356
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 118 transition count 337
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 118 transition count 337
Applied a total of 52 rules in 10 ms. Remains 118 /144 variables (removed 26) and now considering 337/406 (removed 69) transitions.
// Phase 1: matrix 337 rows 118 cols
[2025-06-08 03:12:18] [INFO ] Computed 14 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:12:19] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-08 03:12:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:12:19] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Running 336 sub problems to find dead transitions.
[2025-06-08 03:12:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 2 (OVERLAPS) 1/118 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 336 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:12:21] [INFO ] Deduced a trap composed of 30 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-08 03:12:22] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 5 (OVERLAPS) 337/455 variables, 118/134 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 7 (OVERLAPS) 0/455 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 336 unsolved
No progress, stopping.
After SMT solving in domain Real declared 455/455 variables, and 134 constraints, problems are : Problem set: 0 solved, 336 unsolved in 16969 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 336/336 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 336 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 2 (OVERLAPS) 1/118 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 5 (OVERLAPS) 337/455 variables, 118/134 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 336/470 constraints. Problems are: Problem set: 0 solved, 336 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:12:45] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:12:45] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:12:45] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:12:45] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:12:45] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:12:46] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:12:46] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:12:46] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/455 variables, 8/478 constraints. Problems are: Problem set: 0 solved, 336 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:00] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 336 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/455 variables, and 479 constraints, problems are : Problem set: 0 solved, 336 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 336/336 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47506ms problems are : Problem set: 0 solved, 336 unsolved
Search for dead transitions found 0 dead transitions in 47508ms
Starting structural reductions in LTL mode, iteration 1 : 118/144 places, 337/406 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47686 ms. Remains : 118/144 places, 337/406 transitions.
[2025-06-08 03:13:06] [INFO ] Flatten gal took : 14 ms
[2025-06-08 03:13:06] [INFO ] Flatten gal took : 13 ms
[2025-06-08 03:13:06] [INFO ] Input system was already deterministic with 337 transitions.
[2025-06-08 03:13:06] [INFO ] Flatten gal took : 13 ms
[2025-06-08 03:13:06] [INFO ] Flatten gal took : 13 ms
[2025-06-08 03:13:06] [INFO ] Time to serialize gal into /tmp/CTLFireability5159125688089331215.gal : 3 ms
[2025-06-08 03:13:06] [INFO ] Time to serialize properties into /tmp/CTLFireability7969720855206629320.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/CTLFireability5159125688089331215.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7969720855206629320.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.6158e+09,1.11322,38708,2,10849,5,112176,6,0,811,116826,0


Converting to forward existential form...Done !
original formula: (A((EG(EX(A((p117==1) U (p43==1)))) + ((((p11==1)&&(p40==1))&&((p49==1)&&(p72==1)))&&((p118==1)&&(p171==1)))) U E((EG((p167==1)) * A(AX((...652
=> equivalent forward existential formula: ([((Init * !(EG(!(E((EG((p167==1)) * !((E(!(!(((((p14==1)&&(p29==1))&&((p58==1)&&(p77==1)))&&(p116==1)))) U (!(!...2178
Reverse transition relation is NOT exact ! Due to transitions t5, t8, t12, t13, t17, t19, t21, t28, t31, t37, t39, t41, t48, t52, t57, t61, t63, t66, t72, ...630
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,12.4697,340848,1,0,689,1.43273e+06,735,359,11521,1.21071e+06,786
FORMULA ErlangenMainframeV0-PT-0404-CTLFireability-2025-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 406/406 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 130 transition count 392
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 130 transition count 392
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 122 transition count 358
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 122 transition count 358
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 118 transition count 301
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 118 transition count 301
Applied a total of 52 rules in 13 ms. Remains 118 /144 variables (removed 26) and now considering 301/406 (removed 105) transitions.
// Phase 1: matrix 301 rows 118 cols
[2025-06-08 03:13:19] [INFO ] Computed 14 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:13:19] [INFO ] Implicit Places using invariants in 74 ms returned []
[2025-06-08 03:13:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:13:19] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2025-06-08 03:13:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 1/118 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:21] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:21] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:22] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:22] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (OVERLAPS) 301/419 variables, 118/136 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:25] [INFO ] Deduced a trap composed of 25 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-08 03:13:25] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/419 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/419 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (OVERLAPS) 0/419 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 419/419 variables, and 138 constraints, problems are : Problem set: 0 solved, 300 unsolved in 16745 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 1/118 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (OVERLAPS) 301/419 variables, 118/138 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/419 variables, 300/438 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:42] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/419 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:53] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:53] [INFO ] Deduced a trap composed of 53 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:53] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:53] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:53] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:53] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 6/445 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:03] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:04] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:04] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 419/419 variables, and 448 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47041ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 47042ms
Starting structural reductions in LTL mode, iteration 1 : 118/144 places, 301/406 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47279 ms. Remains : 118/144 places, 301/406 transitions.
[2025-06-08 03:14:06] [INFO ] Flatten gal took : 16 ms
[2025-06-08 03:14:06] [INFO ] Flatten gal took : 11 ms
[2025-06-08 03:14:06] [INFO ] Input system was already deterministic with 301 transitions.
[2025-06-08 03:14:06] [INFO ] Flatten gal took : 10 ms
[2025-06-08 03:14:06] [INFO ] Flatten gal took : 11 ms
[2025-06-08 03:14:06] [INFO ] Time to serialize gal into /tmp/CTLFireability5212529713778744375.gal : 3 ms
[2025-06-08 03:14:06] [INFO ] Time to serialize properties into /tmp/CTLFireability1395872586577693350.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/CTLFireability5212529713778744375.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1395872586577693350.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.39463e+09,1.08706,36912,2,8921,5,101920,6,0,775,136373,0


Converting to forward existential form...Done !
original formula: E(!((((A((EX((p16==1)) + EF((p60==1))) U ((EF((p103==1)) + (p23==1)) + (p95==1))) * (p10==1)) * ((p39==1)&&(p58==1))) * ((p71==1)&&(p116=...373
=> equivalent forward existential formula: [(FwdU((((FwdU(Init,!((((!((E(!(((E(TRUE U (p103==1)) + (p23==1)) + (p95==1))) U (!((EX((p16==1)) + E(TRUE U (p6...572
Reverse transition relation is NOT exact ! Due to transitions t9, t11, t13, t17, t18, t24, t27, t34, t36, t45, t48, t51, t53, t55, t60, t63, t69, t70, t72,...651
(forward)formula 0,0,24.5769,662452,1,0,649,2.89434e+06,628,334,10681,2.41491e+06,705
FORMULA ErlangenMainframeV0-PT-0404-CTLFireability-2025-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 144/144 places, 406/406 transitions.
Graph (trivial) has 113 edges and 144 vertex of which 6 / 144 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 140 transition count 371
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 109 transition count 370
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 108 transition count 370
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 65 place count 108 transition count 363
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 79 place count 101 transition count 363
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 94 place count 86 transition count 322
Iterating global reduction 3 with 15 rules applied. Total rules applied 109 place count 86 transition count 322
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 109 place count 86 transition count 318
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 117 place count 82 transition count 318
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 120 place count 79 transition count 183
Iterating global reduction 3 with 3 rules applied. Total rules applied 123 place count 79 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 124 place count 79 transition count 182
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 125 place count 78 transition count 164
Iterating global reduction 4 with 1 rules applied. Total rules applied 126 place count 78 transition count 164
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 176 place count 53 transition count 139
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 180 place count 49 transition count 107
Iterating global reduction 4 with 4 rules applied. Total rules applied 184 place count 49 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 186 place count 49 transition count 105
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 188 place count 47 transition count 85
Iterating global reduction 5 with 2 rules applied. Total rules applied 190 place count 47 transition count 85
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 194 place count 47 transition count 81
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 202 place count 43 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 203 place count 42 transition count 76
Applied a total of 203 rules in 45 ms. Remains 42 /144 variables (removed 102) and now considering 76/406 (removed 330) transitions.
[2025-06-08 03:14:31] [INFO ] Flow matrix only has 72 transitions (discarded 4 similar events)
// Phase 1: matrix 72 rows 42 cols
[2025-06-08 03:14:31] [INFO ] Computed 14 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:14:31] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-08 03:14:31] [INFO ] Flow matrix only has 72 transitions (discarded 4 similar events)
[2025-06-08 03:14:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:14:31] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-08 03:14:31] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 03:14:31] [INFO ] Redundant transitions in 1 ms returned []
Running 58 sub problems to find dead transitions.
[2025-06-08 03:14:31] [INFO ] Flow matrix only has 72 transitions (discarded 4 similar events)
[2025-06-08 03:14:31] [INFO ] Invariant cache hit.
[2025-06-08 03:14:31] [INFO ] State equation strengthened by 18 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (OVERLAPS) 5/42 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 71/113 variables, 42/56 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 18/74 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 0/113 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/114 variables, and 74 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1067 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 42/42 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (OVERLAPS) 5/42 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 71/113 variables, 42/56 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 18/74 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 58/132 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (OVERLAPS) 0/113 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/114 variables, and 132 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1465 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 42/42 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2548ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 2549ms
Starting structural reductions in SI_CTL mode, iteration 1 : 42/144 places, 76/406 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2856 ms. Remains : 42/144 places, 76/406 transitions.
[2025-06-08 03:14:34] [INFO ] Flatten gal took : 8 ms
[2025-06-08 03:14:34] [INFO ] Flatten gal took : 2 ms
[2025-06-08 03:14:34] [INFO ] Input system was already deterministic with 76 transitions.
[2025-06-08 03:14:34] [INFO ] Flatten gal took : 3 ms
[2025-06-08 03:14:34] [INFO ] Flatten gal took : 2 ms
[2025-06-08 03:14:34] [INFO ] Time to serialize gal into /tmp/CTLFireability7590804474126661422.gal : 1 ms
[2025-06-08 03:14:34] [INFO ] Time to serialize properties into /tmp/CTLFireability4152180895926104307.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/CTLFireability7590804474126661422.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4152180895926104307.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,88128,0.03203,4688,2,304,5,2433,6,0,244,2088,0


Converting to forward existential form...Done !
original formula: AG(AF(((p17==0)&&((((p14==0)||(p39==0))||((p52==0)||(p71==0)))||(p116==0)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((p17==0)&&((((p14==0)||(p39==0))||((p52==0)||(p71==0)))||(p116==0)))))] = FALSE
Hit Full ! (commute/partial/dont) 41/0/35
(forward)formula 0,0,0.065822,5840,1,0,6,7228,20,0,1991,3504,8
FORMULA ErlangenMainframeV0-PT-0404-CTLFireability-2025-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2025-06-08 03:14:34] [INFO ] Flatten gal took : 15 ms
[2025-06-08 03:14:34] [INFO ] Flatten gal took : 15 ms
[2025-06-08 03:14:34] [INFO ] Applying decomposition
[2025-06-08 03:14:34] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5104258701978018064.txt' '-o' '/tmp/graph5104258701978018064.bin' '-w' '/tmp/graph5104258701978018064.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5104258701978018064.bin' '-l' '-1' '-v' '-w' '/tmp/graph5104258701978018064.weights' '-q' '0' '-e' '0.001'
[2025-06-08 03:14:34] [INFO ] Decomposing Gal with order
[2025-06-08 03:14:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 03:14:34] [INFO ] Removed a total of 379 redundant transitions.
[2025-06-08 03:14:34] [INFO ] Flatten gal took : 40 ms
[2025-06-08 03:14:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 95 labels/synchronizations in 5 ms.
[2025-06-08 03:14:34] [INFO ] Time to serialize gal into /tmp/CTLFireability13749966618198188565.gal : 3 ms
[2025-06-08 03:14:34] [INFO ] Time to serialize properties into /tmp/CTLFireability383209706218487876.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13749966618198188565.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability383209706218487876.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.35305e+10,120.345,2427856,4260,11458,683130,907817,497,1.54326e+07,363,2.12972e+07,0


Converting to forward existential form...Done !
original formula: (EF((EX(AF(((((i6.u16.p21==1)&&(i6.u16.p30==1))&&((i6.u16.p53==1)&&(i6.u16.p78==1)))&&((i6.u16.p118==1)&&(i6.u36.p177==1))))) + AG((((((i...1099
=> equivalent forward existential formula: ([(EY((FwdU((Init * !(E(TRUE U (EX(!(EG(!(((((i6.u16.p21==1)&&(i6.u16.p30==1))&&((i6.u16.p53==1)&&(i6.u16.p78==1...1625
Reverse transition relation is NOT exact ! Due to transitions t3, t18, t26, t60, t62, t83, t98, t99, t106, u5.t101, u5.t103, u5.t286, u5.t287, i1.t109, i1....1694
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Detected timeout of ITS tools.
[2025-06-08 03:38:53] [INFO ] Applying decomposition
[2025-06-08 03:38:53] [INFO ] Flatten gal took : 24 ms
[2025-06-08 03:38:53] [INFO ] Decomposing Gal with order
[2025-06-08 03:38:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 03:38:53] [INFO ] Removed a total of 1442 redundant transitions.
[2025-06-08 03:38:53] [INFO ] Flatten gal took : 40 ms
[2025-06-08 03:38:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 139 labels/synchronizations in 8 ms.
[2025-06-08 03:38:54] [INFO ] Time to serialize gal into /tmp/CTLFireability1883553597691313370.gal : 2 ms
[2025-06-08 03:38:54] [INFO ] Time to serialize properties into /tmp/CTLFireability17006571911811279029.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/CTLFireability1883553597691313370.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17006571911811279029.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.35305e+10,0.20702,14400,750,686,14975,3086,249,65099,203,25100,0


Converting to forward existential form...Done !
original formula: (EF((EX(AF(((((i0.i0.i0.i0.u5.p21==1)&&(i0.i0.i0.i0.u6.p30==1))&&((i0.i0.i0.u7.p53==1)&&(i0.i0.u8.p78==1)))&&((i0.i1.u13.p118==1)&&(i1.u1...1348
=> equivalent forward existential formula: ([(EY((FwdU((Init * !(E(TRUE U (EX(!(EG(!(((((i0.i0.i0.i0.u5.p21==1)&&(i0.i0.i0.i0.u6.p30==1))&&((i0.i0.i0.u7.p5...1952
Reverse transition relation is NOT exact ! Due to transitions i0.t365, i0.i0.u8.t83, i0.i0.u8.t85, i0.i0.u8.t88, i0.i0.u8.t289, i0.i0.i0.u7.t3, i0.i0.i0.u7...973
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
(forward)formula 0,1,120.437,1726504,1,0,2.26128e+06,30089,2829,1.13842e+07,1306,238373,564883
FORMULA ErlangenMainframeV0-PT-0404-CTLFireability-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 2358867 ms.

BK_STOP 1749354054941

--------------------
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="ErlangenMainframeV0-PT-0404"
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 ErlangenMainframeV0-PT-0404, 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 r254-tall-174931339600266"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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