Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 820K
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 376K May 29 14:33 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 ShieldPPPt-PT-020B-CTLFireability-2023-12
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-2023-13
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-2023-14
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-2023-15
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-2025-00
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-2025-01
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-2025-02
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-2025-03
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-2025-04
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-2025-05
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-2025-06
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-2025-07
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-2025-08
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-2025-09
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-2025-10
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1749306260808

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-020B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-07 14:24:22] [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-07 14:24:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 14:24:22] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2025-06-07 14:24:22] [INFO ] Transformed 1563 places.
[2025-06-07 14:24:22] [INFO ] Transformed 1423 transitions.
[2025-06-07 14:24:22] [INFO ] Found NUPN structural information;
[2025-06-07 14:24:22] [INFO ] Parsed PT model containing 1563 places and 1423 transitions and 3566 arcs in 266 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 142 out of 1563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1563/1563 places, 1423/1423 transitions.
Discarding 185 places :
Symmetric choice reduction at 0 with 185 rule applications. Total rules 185 place count 1378 transition count 1238
Iterating global reduction 0 with 185 rules applied. Total rules applied 370 place count 1378 transition count 1238
Applied a total of 370 rules in 315 ms. Remains 1378 /1563 variables (removed 185) and now considering 1238/1423 (removed 185) transitions.
// Phase 1: matrix 1238 rows 1378 cols
[2025-06-07 14:24:23] [INFO ] Computed 221 invariants in 33 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:24:23] [INFO ] Implicit Places using invariants in 673 ms returned []
[2025-06-07 14:24:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:24:24] [INFO ] Implicit Places using invariants and state equation in 925 ms returned []
Implicit Place search using SMT with State Equation took 1630 ms to find 0 implicit places.
Running 1237 sub problems to find dead transitions.
[2025-06-07 14:24:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1377/2616 variables, and 0 constraints, problems are : Problem set: 0 solved, 1237 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/221 constraints, State Equation: 0/1378 constraints, PredecessorRefiner: 1237/1237 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1237 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1377/2616 variables, and 0 constraints, problems are : Problem set: 0 solved, 1237 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 0/221 constraints, State Equation: 0/1378 constraints, PredecessorRefiner: 0/1237 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60642ms problems are : Problem set: 0 solved, 1237 unsolved
Search for dead transitions found 0 dead transitions in 60664ms
Starting structural reductions in LTL mode, iteration 1 : 1378/1563 places, 1238/1423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62653 ms. Remains : 1378/1563 places, 1238/1423 transitions.
Support contains 142 out of 1378 places after structural reductions.
[2025-06-07 14:25:25] [INFO ] Flatten gal took : 99 ms
[2025-06-07 14:25:25] [INFO ] Flatten gal took : 58 ms
[2025-06-07 14:25:25] [INFO ] Input system was already deterministic with 1238 transitions.
RANDOM walk for 40000 steps (8 resets) in 1534 ms. (26 steps per ms) remains 38/92 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 8 ms. (444 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 38/38 properties
[2025-06-07 14:25:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 540/611 variables, 82/82 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/611 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 767/1378 variables, 139/221 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1378 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 1238/2616 variables, 1378/1599 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2616 variables, 0/1599 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 0/2616 variables, 0/1599 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2616/2616 variables, and 1599 constraints, problems are : Problem set: 0 solved, 38 unsolved in 4217 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 1378/1378 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 540/611 variables, 82/82 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:25:31] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:25:31] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:25:31] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:25:31] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/611 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/611 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 767/1378 variables, 139/225 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:25:33] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:25:33] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:25:33] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:25:33] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:25:33] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:25:33] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:25:33] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:25:34] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:25:34] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:25:34] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:25:34] [INFO ] Deduced a trap composed of 28 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-07 14:25:34] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:25:34] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:25:34] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:25:34] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:25:35] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:25:35] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:25:35] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:25:35] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:25:35] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1378 variables, 20/245 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 1)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 1)
(s39 0)
(s40 1)
(s41 0)
(s42 0)
(s43 0)
(s44 1)
(s45 0)
(s46 0)
(s47 1)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 1)
(s53 1)
(s54 0)
(s55 0)
(s56 0)
(s57 1)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 1)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 1)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 1)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 1)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 1)
(s104 0)
(s105 0)
(s106 1)
(s107 0)
(s108 0)
(s109 0)
(s110 1)
(s111 0)
(s112 1)
(s113 0)
(s114 0)
(s115 1)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 1)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 1)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 1)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 1)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 1)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 1)
(s186 0)
(s187 1)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 1)
(s197 0)
(s198 0)
(s199 1)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 1)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 1)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 1)
(s235 0)
(s236 0)
(s237 0)
(s238 1)
(s239 0)
(s240 0)
(s241 1)
(s242 0)
(s243 0)
(s244 0)
(s245 1)
(s246 0)
(s247 0)
(s248 1)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 1)
(s254 0)
(s255 1)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 1)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 1)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 1)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 1)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 1)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 1)
(s322 0)
(s323 1)
(s324 0)
(s325 0)
(s326 1)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 1)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 1)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 1)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 1)
(s371 0)
(s372 0)
(s373 1)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 1)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 1)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 1)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 1)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 1)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 1)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 1)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 1)
(s447 0)
(s448 1)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 1)
(s454 0)
(s455 1)
(s456 0)
(s457 0)
(s458 0)
(s459 1)
(s460 0)
(s461 1)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 1)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 1)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 1)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 1)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 1)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 1)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 1)
(s519 0)
(s520 0)
(s521 1)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 1)
(s527 0)
(s528 1)
(s529 0)
(s530 0)
(s531 0)
(s532 1)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 1)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 1)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 1)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 1)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 1)
(s580 0)
(s581 1)
(s582 0)
(s583 0)
(s584 1)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 1)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 1)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 1)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 0)
(s617 0)
(s618 1)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 0)
(s628 0)
(s629 0)
(s630 0)
(s631 0)
(s632 1)
(s633 0)
(s634 0)
(s635 0)
(s636 0)
(s637 0)
(s638 0)
(s639 0)
(s640 0)
(s641 0)
(s642 0)
(s643 0)
(s644 1)
(s645 0)
(s646 0)
(s647 0)
(s648 1)
(s649 0)
(s650 0)
(s651 1)
(s652 0)
(s653 0)
(s654 0)
(s655 0)
(s656 1)
(s657 0)
(s658 1)
(s659 0)
(s660 0)
(s661 0)
(s662 1)
(s663 0)
(s664 0)
(s665 1)
(s666 0)
(s667 0)
(s668 1)
(s669 0)
(s670 0)
(s671 0)
(s672 0)
(s673 0)
(s674 0)
(s675 0)
(s676 0)
(s677 0)
(s678 1)
(s679 0)
(s680 0)
(s681 0)
(s682 0)
(s683 0)
(s684 0)
(s685 0)
(s686 0)
(s687 0)
(s688 0)
(s689 0)
(s690 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1378/2616 variables, and 245 constraints, problems are : Problem set: 0 solved, 38 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 0/1378 constraints, PredecessorRefiner: 0/38 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9249ms problems are : Problem set: 0 solved, 38 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 71 out of 1378 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1378/1378 places, 1238/1238 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 249 transitions
Trivial Post-agglo rules discarded 249 transitions
Performed 249 trivial Post agglomeration. Transition count delta: 249
Iterating post reduction 0 with 249 rules applied. Total rules applied 249 place count 1378 transition count 989
Reduce places removed 249 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 251 rules applied. Total rules applied 500 place count 1129 transition count 987
Reduce places removed 1 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 2 with 12 rules applied. Total rules applied 512 place count 1128 transition count 976
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 523 place count 1117 transition count 976
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 132 Pre rules applied. Total rules applied 523 place count 1117 transition count 844
Deduced a syphon composed of 132 places in 11 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 4 with 264 rules applied. Total rules applied 787 place count 985 transition count 844
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 804 place count 968 transition count 827
Iterating global reduction 4 with 17 rules applied. Total rules applied 821 place count 968 transition count 827
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 821 place count 968 transition count 813
Deduced a syphon composed of 14 places in 10 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 849 place count 954 transition count 813
Performed 324 Post agglomeration using F-continuation condition.Transition count delta: 324
Deduced a syphon composed of 324 places in 0 ms
Reduce places removed 324 places and 0 transitions.
Iterating global reduction 4 with 648 rules applied. Total rules applied 1497 place count 630 transition count 489
Renaming transitions due to excessive name length > 1024 char.
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 44 places in 4 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 1585 place count 586 transition count 489
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1589 place count 586 transition count 485
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1593 place count 582 transition count 485
Partial Free-agglomeration rule applied 51 times.
Drop transitions (Partial Free agglomeration) removed 51 transitions
Iterating global reduction 5 with 51 rules applied. Total rules applied 1644 place count 582 transition count 485
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1645 place count 581 transition count 484
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1646 place count 580 transition count 484
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 1646 place count 580 transition count 482
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1650 place count 578 transition count 482
Applied a total of 1650 rules in 334 ms. Remains 578 /1378 variables (removed 800) and now considering 482/1238 (removed 756) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 334 ms. Remains : 578/1378 places, 482/1238 transitions.
RANDOM walk for 40000 steps (8 resets) in 870 ms. (45 steps per ms) remains 18/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 18/18 properties
// Phase 1: matrix 482 rows 578 cols
[2025-06-07 14:25:36] [INFO ] Computed 220 invariants in 3 ms
[2025-06-07 14:25:36] [INFO ] State equation strengthened by 14 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 148/189 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 22/211 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 224/435 variables, 211/277 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/435 variables, 11/288 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 205/640 variables, 117/405 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/640 variables, 37/442 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/640 variables, 1/443 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:25:37] [INFO ] Deduced a trap composed of 4 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-07 14:25:37] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/640 variables, 2/445 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:25:37] [INFO ] Deduced a trap composed of 5 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-07 14:25:37] [INFO ] Deduced a trap composed of 6 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-07 14:25:37] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:25:37] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/640 variables, 4/449 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/640 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (OVERLAPS) 21/661 variables, 17/466 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/661 variables, 12/478 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/661 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 17 (OVERLAPS) 22/683 variables, 11/489 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/683 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 19 (OVERLAPS) 128/811 variables, 87/576 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/811 variables, 20/596 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/811 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 22 (OVERLAPS) 6/817 variables, 7/603 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/817 variables, 6/609 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/817 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 25 (OVERLAPS) 6/823 variables, 3/612 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/823 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 27 (OVERLAPS) 119/942 variables, 70/682 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/942 variables, 21/703 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/942 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 30 (OVERLAPS) 11/953 variables, 9/712 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/953 variables, 7/719 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/953 variables, 0/719 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 33 (OVERLAPS) 12/965 variables, 6/725 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/965 variables, 2/727 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/965 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 36 (OVERLAPS) 47/1012 variables, 36/763 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1012 variables, 8/771 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1012 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 39 (OVERLAPS) 4/1016 variables, 2/773 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1016 variables, 0/773 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 41 (OVERLAPS) 23/1039 variables, 16/789 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1039 variables, 5/794 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1039 variables, 2/796 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1039 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 45 (OVERLAPS) 1/1040 variables, 1/797 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1040 variables, 1/798 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1040 variables, 0/798 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 48 (OVERLAPS) 1/1041 variables, 1/799 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1041 variables, 1/800 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1041 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 51 (OVERLAPS) 13/1054 variables, 8/808 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1054 variables, 4/812 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1054 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 54 (OVERLAPS) 6/1060 variables, 4/816 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1060 variables, 2/818 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1060 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 57 (OVERLAPS) 0/1060 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1060/1060 variables, and 818 constraints, problems are : Problem set: 0 solved, 18 unsolved in 5279 ms.
Refiners :[Positive P Invariants (semi-flows): 220/220 constraints, State Equation: 578/578 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 148/189 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 22/211 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 224/435 variables, 211/282 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 11/293 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/435 variables, 12/305 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/435 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (OVERLAPS) 205/640 variables, 117/422 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/640 variables, 37/459 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/640 variables, 1/460 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/640 variables, 6/466 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/640 variables, 1/467 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:25:42] [INFO ] Deduced a trap composed of 5 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-07 14:25:42] [INFO ] Deduced a trap composed of 6 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-07 14:25:42] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:25:42] [INFO ] Deduced a trap composed of 6 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-07 14:25:43] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/640 variables, 5/472 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:25:43] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 4 ms to minimize.
Problem AtomicPropp2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:25:43] [INFO ] Deduced a trap composed of 4 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-07 14:25:43] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/640 variables, 3/475 constraints. Problems are: Problem set: 1 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:25:43] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/640 variables, 1/476 constraints. Problems are: Problem set: 1 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:25:43] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/640 variables, 1/477 constraints. Problems are: Problem set: 1 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:25:44] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:25:44] [INFO ] Deduced a trap along path composed of 2 places in 46 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:25:44] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:25:44] [INFO ] Deduced a trap along path composed of 2 places in 32 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:25:44] [INFO ] Deduced a trap along path composed of 2 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-07 14:25:44] [INFO ] Deduced a trap along path composed of 4 places in 29 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/640 variables, 6/483 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/640 variables, 0/483 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 22 (OVERLAPS) 21/661 variables, 17/500 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/661 variables, 12/512 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/661 variables, 0/512 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 25 (OVERLAPS) 22/683 variables, 11/523 constraints. Problems are: Problem set: 1 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:25:46] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 0 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/683 variables, 1/524 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/683 variables, 0/524 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 28 (OVERLAPS) 128/811 variables, 87/611 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/811 variables, 20/631 constraints. Problems are: Problem set: 1 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:25:47] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/811 variables, 1/632 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/811 variables, 0/632 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 32 (OVERLAPS) 6/817 variables, 7/639 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/817 variables, 6/645 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/817 variables, 0/645 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 35 (OVERLAPS) 6/823 variables, 3/648 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/823 variables, 0/648 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 37 (OVERLAPS) 119/942 variables, 70/718 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/942 variables, 21/739 constraints. Problems are: Problem set: 1 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:25:49] [INFO ] Deduced a trap along path composed of 2 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-07 14:25:49] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:25:49] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 0 ms to minimize.
At refinement iteration 39 (INCLUDED_ONLY) 0/942 variables, 3/742 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/942 variables, 0/742 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 41 (OVERLAPS) 11/953 variables, 9/751 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/953 variables, 7/758 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/953 variables, 0/758 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 44 (OVERLAPS) 12/965 variables, 6/764 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/965 variables, 2/766 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/965 variables, 0/766 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 47 (OVERLAPS) 47/1012 variables, 36/802 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1012 variables, 8/810 constraints. Problems are: Problem set: 1 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:25:52] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 4 ms to minimize.
At refinement iteration 49 (INCLUDED_ONLY) 0/1012 variables, 1/811 constraints. Problems are: Problem set: 1 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:25:53] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:25:53] [INFO ] Deduced a trap along path composed of 2 places in 18 ms of which 0 ms to minimize.
At refinement iteration 50 (INCLUDED_ONLY) 0/1012 variables, 2/813 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1012 variables, 0/813 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 52 (OVERLAPS) 4/1016 variables, 2/815 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1016 variables, 0/815 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 54 (OVERLAPS) 23/1039 variables, 16/831 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1039 variables, 5/836 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1039 variables, 2/838 constraints. Problems are: Problem set: 1 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:25:56] [INFO ] Deduced a trap along path composed of 2 places in 15 ms of which 0 ms to minimize.
At refinement iteration 57 (INCLUDED_ONLY) 0/1039 variables, 1/839 constraints. Problems are: Problem set: 1 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:25:56] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:25:56] [INFO ] Deduced a trap along path composed of 2 places in 15 ms of which 0 ms to minimize.
At refinement iteration 58 (INCLUDED_ONLY) 0/1039 variables, 2/841 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1039 variables, 0/841 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 60 (OVERLAPS) 1/1040 variables, 1/842 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1040 variables, 1/843 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1040 variables, 0/843 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 63 (OVERLAPS) 1/1041 variables, 1/844 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1041 variables, 1/845 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1041 variables, 0/845 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 66 (OVERLAPS) 13/1054 variables, 8/853 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1054 variables, 4/857 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1054 variables, 0/857 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 69 (OVERLAPS) 6/1060 variables, 4/861 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1060 variables, 2/863 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1060 variables, 0/863 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 72 (OVERLAPS) 0/1060 variables, 0/863 constraints. Problems are: Problem set: 1 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1060/1060 variables, and 863 constraints, problems are : Problem set: 1 solved, 17 unsolved in 21595 ms.
Refiners :[Positive P Invariants (semi-flows): 220/220 constraints, State Equation: 578/578 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 16/16 constraints]
After SMT, in 26886ms problems are : Problem set: 1 solved, 17 unsolved
Fused 17 Parikh solutions to 13 different solutions.
Parikh walk visited 1 properties in 720 ms.
Support contains 34 out of 578 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 578/578 places, 482/482 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 578 transition count 473
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 569 transition count 473
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 18 place count 569 transition count 464
Deduced a syphon composed of 9 places in 4 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 36 place count 560 transition count 464
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 4 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 52 place count 552 transition count 456
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
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 66 place count 545 transition count 456
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 545 transition count 456
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 543 transition count 454
Applied a total of 70 rules in 90 ms. Remains 543 /578 variables (removed 35) and now considering 454/482 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 543/578 places, 454/482 transitions.
RANDOM walk for 40000 steps (8 resets) in 395 ms. (101 steps per ms) remains 13/16 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 139 ms. (285 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 96 ms. (412 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 95 ms. (416 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 101 ms. (392 steps per ms) remains 12/12 properties
// Phase 1: matrix 454 rows 543 cols
[2025-06-07 14:26:05] [INFO ] Computed 220 invariants in 1 ms
[2025-06-07 14:26:05] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 84/111 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 39/150 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 172/322 variables, 150/200 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 12/212 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 209/531 variables, 117/329 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/531 variables, 35/364 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/531 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/531 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 18/549 variables, 18/383 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/549 variables, 16/399 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/549 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 24/573 variables, 12/411 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/573 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (OVERLAPS) 138/711 variables, 89/500 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/711 variables, 24/524 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/711 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 20 (OVERLAPS) 7/718 variables, 7/531 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/718 variables, 5/536 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/718 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 23 (OVERLAPS) 8/726 variables, 4/540 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/726 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 25 (OVERLAPS) 115/841 variables, 72/612 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/841 variables, 23/635 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/841 variables, 1/636 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/841 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 29 (OVERLAPS) 7/848 variables, 7/643 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/848 variables, 7/650 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/848 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 32 (OVERLAPS) 10/858 variables, 5/655 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/858 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 34 (OVERLAPS) 61/919 variables, 37/692 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/919 variables, 10/702 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/919 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 37 (OVERLAPS) 4/923 variables, 3/705 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/923 variables, 2/707 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/923 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 40 (OVERLAPS) 4/927 variables, 2/709 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/927 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 42 (OVERLAPS) 46/973 variables, 31/740 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/973 variables, 9/749 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/973 variables, 2/751 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/973 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 46 (OVERLAPS) 2/975 variables, 3/754 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/975 variables, 2/756 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/975 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 49 (OVERLAPS) 1/976 variables, 1/757 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/976 variables, 1/758 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/976 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 52 (OVERLAPS) 15/991 variables, 10/768 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/991 variables, 5/773 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/991 variables, 0/773 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 55 (OVERLAPS) 6/997 variables, 4/777 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/997 variables, 2/779 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/997 variables, 0/779 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 58 (OVERLAPS) 0/997 variables, 0/779 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 997/997 variables, and 779 constraints, problems are : Problem set: 0 solved, 12 unsolved in 2808 ms.
Refiners :[Positive P Invariants (semi-flows): 220/220 constraints, State Equation: 543/543 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 84/111 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 39/150 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:08] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 172/322 variables, 150/201 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 12/213 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 5/218 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:08] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:08] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 209/531 variables, 117/337 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/531 variables, 35/372 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/531 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/531 variables, 7/380 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:08] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:08] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:08] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:08] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/531 variables, 4/384 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:08] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:08] [INFO ] Deduced a trap composed of 6 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-07 14:26:08] [INFO ] Deduced a trap composed of 5 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-07 14:26:09] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/531 variables, 4/388 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:09] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/531 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/531 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (OVERLAPS) 18/549 variables, 18/407 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/549 variables, 16/423 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/549 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 22 (OVERLAPS) 24/573 variables, 12/435 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/573 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 24 (OVERLAPS) 138/711 variables, 89/524 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/711 variables, 24/548 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:10] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/711 variables, 1/549 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/711 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 28 (OVERLAPS) 7/718 variables, 7/556 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/718 variables, 5/561 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/718 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 31 (OVERLAPS) 8/726 variables, 4/565 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/726 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 33 (OVERLAPS) 115/841 variables, 72/637 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/841 variables, 23/660 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/841 variables, 1/661 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:11] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 3 ms to minimize.
At refinement iteration 36 (INCLUDED_ONLY) 0/841 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:11] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:11] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:11] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:11] [INFO ] Deduced a trap along path composed of 2 places in 18 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:11] [INFO ] Deduced a trap along path composed of 2 places in 19 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:11] [INFO ] Deduced a trap along path composed of 2 places in 17 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:12] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
At refinement iteration 37 (INCLUDED_ONLY) 0/841 variables, 7/669 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:12] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 0 ms to minimize.
At refinement iteration 38 (INCLUDED_ONLY) 0/841 variables, 1/670 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/841 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 40 (OVERLAPS) 7/848 variables, 7/677 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/848 variables, 7/684 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/848 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 43 (OVERLAPS) 10/858 variables, 5/689 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/858 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 45 (OVERLAPS) 61/919 variables, 37/726 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/919 variables, 10/736 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:14] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:14] [INFO ] Deduced a trap along path composed of 3 places in 14 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:14] [INFO ] Deduced a trap along path composed of 2 places in 19 ms of which 0 ms to minimize.
At refinement iteration 47 (INCLUDED_ONLY) 0/919 variables, 3/739 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/919 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 49 (OVERLAPS) 4/923 variables, 3/742 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/923 variables, 2/744 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/923 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 52 (OVERLAPS) 4/927 variables, 2/746 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/927 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 54 (OVERLAPS) 46/973 variables, 31/777 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/973 variables, 9/786 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/973 variables, 2/788 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/973 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 58 (OVERLAPS) 2/975 variables, 3/791 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/975 variables, 2/793 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/975 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 61 (OVERLAPS) 1/976 variables, 1/794 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/976 variables, 1/795 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/976 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 64 (OVERLAPS) 15/991 variables, 10/805 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/991 variables, 5/810 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:18] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:18] [INFO ] Deduced a trap along path composed of 2 places in 19 ms of which 0 ms to minimize.
At refinement iteration 66 (INCLUDED_ONLY) 0/991 variables, 2/812 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/991 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 68 (OVERLAPS) 6/997 variables, 4/816 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/997 variables, 2/818 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/997 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 71 (OVERLAPS) 0/997 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 997/997 variables, and 818 constraints, problems are : Problem set: 0 solved, 12 unsolved in 12301 ms.
Refiners :[Positive P Invariants (semi-flows): 220/220 constraints, State Equation: 543/543 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 13/13 constraints]
After SMT, in 15124ms problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 6729 ms.
Support contains 27 out of 543 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 543/543 places, 454/454 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 543 transition count 451
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 540 transition count 451
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 540 transition count 449
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 538 transition count 449
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 536 transition count 447
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 534 transition count 447
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 534 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 533 transition count 446
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 532 transition count 445
Applied a total of 21 rules in 67 ms. Remains 532 /543 variables (removed 11) and now considering 445/454 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 532/543 places, 445/454 transitions.
RANDOM walk for 40000 steps (8 resets) in 379 ms. (105 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 140 ms. (283 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 125 ms. (317 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 94 ms. (421 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 102 ms. (388 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 94 ms. (421 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 155632 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :0 out of 12
Probabilistic random walk after 155632 steps, saw 111585 distinct states, run finished after 3007 ms. (steps per millisecond=51 ) properties seen :0
// Phase 1: matrix 445 rows 532 cols
[2025-06-07 14:26:30] [INFO ] Computed 220 invariants in 2 ms
[2025-06-07 14:26:30] [INFO ] State equation strengthened by 12 read => feed constraints.
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/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 81/108 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 30/138 variables, 13/46 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 161/299 variables, 138/184 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 8/192 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 209/508 variables, 115/307 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/508 variables, 36/343 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/508 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/508 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 16/524 variables, 17/361 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/524 variables, 16/377 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/524 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 24/548 variables, 12/389 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/548 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (OVERLAPS) 141/689 variables, 92/481 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/689 variables, 27/508 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/689 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 20 (OVERLAPS) 5/694 variables, 6/514 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/694 variables, 5/519 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/694 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 23 (OVERLAPS) 8/702 variables, 4/523 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/702 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 25 (OVERLAPS) 120/822 variables, 72/595 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/822 variables, 24/619 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/822 variables, 1/620 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/822 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 29 (OVERLAPS) 7/829 variables, 7/627 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/829 variables, 7/634 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/829 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 32 (OVERLAPS) 10/839 variables, 5/639 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/839 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 34 (OVERLAPS) 62/901 variables, 39/678 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/901 variables, 12/690 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/901 variables, 0/690 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 37 (OVERLAPS) 2/903 variables, 2/692 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/903 variables, 2/694 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/903 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 40 (OVERLAPS) 4/907 variables, 2/696 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/907 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 42 (OVERLAPS) 46/953 variables, 29/725 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/953 variables, 9/734 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/953 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/953 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 46 (OVERLAPS) 2/955 variables, 3/739 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/955 variables, 2/741 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/955 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 49 (OVERLAPS) 1/956 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/956 variables, 1/743 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/956 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 52 (OVERLAPS) 15/971 variables, 10/753 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/971 variables, 5/758 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/971 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 55 (OVERLAPS) 6/977 variables, 4/762 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/977 variables, 2/764 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/977 variables, 0/764 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 58 (OVERLAPS) 0/977 variables, 0/764 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 977/977 variables, and 764 constraints, problems are : Problem set: 0 solved, 12 unsolved in 2689 ms.
Refiners :[Positive P Invariants (semi-flows): 220/220 constraints, State Equation: 532/532 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 81/108 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 30/138 variables, 13/46 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:33] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:33] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 161/299 variables, 138/186 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 8/194 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 5/199 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/299 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 209/508 variables, 115/314 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/508 variables, 36/350 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/508 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/508 variables, 7/358 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:33] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:33] [INFO ] Deduced a trap composed of 5 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-07 14:26:33] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/508 variables, 3/361 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:34] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 4 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/508 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:34] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/508 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/508 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (OVERLAPS) 16/524 variables, 17/380 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/524 variables, 16/396 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/524 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 21 (OVERLAPS) 24/548 variables, 12/408 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/548 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 23 (OVERLAPS) 141/689 variables, 92/500 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/689 variables, 27/527 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:35] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:35] [INFO ] Deduced a trap along path composed of 4 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-07 14:26:35] [INFO ] Deduced a trap along path composed of 2 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-07 14:26:35] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/689 variables, 4/531 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/689 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 27 (OVERLAPS) 5/694 variables, 6/537 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/694 variables, 5/542 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/694 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 30 (OVERLAPS) 8/702 variables, 4/546 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/702 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 32 (OVERLAPS) 120/822 variables, 72/618 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/822 variables, 24/642 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/822 variables, 1/643 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:36] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 3 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/822 variables, 1/644 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:37] [INFO ] Deduced a trap along path composed of 2 places in 34 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:37] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:37] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:37] [INFO ] Deduced a trap along path composed of 2 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:37] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:37] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:37] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:37] [INFO ] Deduced a trap along path composed of 2 places in 19 ms of which 0 ms to minimize.
At refinement iteration 36 (INCLUDED_ONLY) 0/822 variables, 8/652 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/822 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 38 (OVERLAPS) 7/829 variables, 7/659 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/829 variables, 7/666 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/829 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 41 (OVERLAPS) 10/839 variables, 5/671 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/839 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 43 (OVERLAPS) 62/901 variables, 39/710 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/901 variables, 12/722 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:39] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:39] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:40] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 1 ms to minimize.
At refinement iteration 45 (INCLUDED_ONLY) 0/901 variables, 3/725 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/901 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 47 (OVERLAPS) 2/903 variables, 2/727 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/903 variables, 2/729 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/903 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 50 (OVERLAPS) 4/907 variables, 2/731 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/907 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 52 (OVERLAPS) 46/953 variables, 29/760 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/953 variables, 9/769 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/953 variables, 2/771 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:42] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:42] [INFO ] Deduced a trap along path composed of 2 places in 16 ms of which 0 ms to minimize.
At refinement iteration 55 (INCLUDED_ONLY) 0/953 variables, 2/773 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/953 variables, 0/773 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 57 (OVERLAPS) 2/955 variables, 3/776 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/955 variables, 2/778 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/955 variables, 0/778 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 60 (OVERLAPS) 1/956 variables, 1/779 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/956 variables, 1/780 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/956 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 63 (OVERLAPS) 15/971 variables, 10/790 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/971 variables, 5/795 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:45] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
At refinement iteration 65 (INCLUDED_ONLY) 0/971 variables, 1/796 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:45] [INFO ] Deduced a trap along path composed of 2 places in 16 ms of which 1 ms to minimize.
At refinement iteration 66 (INCLUDED_ONLY) 0/971 variables, 1/797 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/971 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 68 (OVERLAPS) 6/977 variables, 4/801 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/977 variables, 2/803 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/977 variables, 0/803 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 71 (OVERLAPS) 0/977 variables, 0/803 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 977/977 variables, and 803 constraints, problems are : Problem set: 0 solved, 12 unsolved in 14497 ms.
Refiners :[Positive P Invariants (semi-flows): 220/220 constraints, State Equation: 532/532 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 19/19 constraints]
After SMT, in 17196ms problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 2798 ms.
Support contains 27 out of 532 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 445/445 transitions.
Applied a total of 0 rules in 13 ms. Remains 532 /532 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 532/532 places, 445/445 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 445/445 transitions.
Applied a total of 0 rules in 13 ms. Remains 532 /532 variables (removed 0) and now considering 445/445 (removed 0) transitions.
[2025-06-07 14:26:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:26:50] [INFO ] Implicit Places using invariants in 258 ms returned [515, 519]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 260 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 530/532 places, 445/445 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 528 transition count 443
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 528 transition count 443
Applied a total of 4 rules in 19 ms. Remains 528 /530 variables (removed 2) and now considering 443/445 (removed 2) transitions.
// Phase 1: matrix 443 rows 528 cols
[2025-06-07 14:26:50] [INFO ] Computed 218 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:26:51] [INFO ] Implicit Places using invariants in 267 ms returned []
[2025-06-07 14:26:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:26:51] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-07 14:26:51] [INFO ] Implicit Places using invariants and state equation in 530 ms returned []
Implicit Place search using SMT with State Equation took 798 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 528/532 places, 443/445 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1090 ms. Remains : 528/532 places, 443/445 transitions.
RANDOM walk for 40000 steps (8 resets) in 313 ms. (127 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 138 ms. (287 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 101 ms. (392 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 92 ms. (430 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 92 ms. (430 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 146485 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 12
Probabilistic random walk after 146485 steps, saw 104697 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) properties seen :0
[2025-06-07 14:26:55] [INFO ] Invariant cache hit.
[2025-06-07 14:26:55] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 81/108 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 30/138 variables, 13/46 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 161/299 variables, 138/184 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 8/192 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 209/508 variables, 115/307 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/508 variables, 36/343 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/508 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/508 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 16/524 variables, 17/361 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/524 variables, 16/377 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/524 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 24/548 variables, 12/389 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/548 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (OVERLAPS) 141/689 variables, 92/481 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/689 variables, 27/508 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/689 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 20 (OVERLAPS) 5/694 variables, 6/514 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/694 variables, 5/519 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/694 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 23 (OVERLAPS) 8/702 variables, 4/523 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/702 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 25 (OVERLAPS) 120/822 variables, 72/595 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/822 variables, 24/619 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/822 variables, 1/620 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/822 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 29 (OVERLAPS) 7/829 variables, 7/627 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/829 variables, 7/634 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/829 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 32 (OVERLAPS) 10/839 variables, 5/639 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/839 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 34 (OVERLAPS) 62/901 variables, 39/678 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/901 variables, 12/690 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/901 variables, 0/690 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 37 (OVERLAPS) 2/903 variables, 2/692 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/903 variables, 2/694 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/903 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 40 (OVERLAPS) 4/907 variables, 2/696 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/907 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 42 (OVERLAPS) 44/951 variables, 29/725 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/951 variables, 10/735 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/951 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 45 (OVERLAPS) 1/952 variables, 2/737 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/952 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/952 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 48 (OVERLAPS) 13/965 variables, 8/746 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/965 variables, 4/750 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/965 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 51 (OVERLAPS) 6/971 variables, 4/754 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/971 variables, 2/756 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/971 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 54 (OVERLAPS) 0/971 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 971/971 variables, and 756 constraints, problems are : Problem set: 0 solved, 12 unsolved in 2456 ms.
Refiners :[Positive P Invariants (semi-flows): 218/218 constraints, State Equation: 528/528 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 81/108 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 30/138 variables, 13/46 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:57] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:57] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 161/299 variables, 138/186 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 8/194 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 5/199 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:57] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/299 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/299 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 209/508 variables, 115/315 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/508 variables, 36/351 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/508 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/508 variables, 7/359 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:58] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:58] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:58] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 4 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/508 variables, 3/362 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:58] [INFO ] Deduced a trap along path composed of 2 places in 33 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/508 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:58] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/508 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/508 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (OVERLAPS) 16/524 variables, 17/381 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/524 variables, 16/397 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/524 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 22 (OVERLAPS) 24/548 variables, 12/409 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/548 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 24 (OVERLAPS) 141/689 variables, 92/501 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/689 variables, 27/528 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:59] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:26:59] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:27:00] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/689 variables, 3/531 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/689 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 28 (OVERLAPS) 5/694 variables, 6/537 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/694 variables, 5/542 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/694 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 31 (OVERLAPS) 8/702 variables, 4/546 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/702 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 33 (OVERLAPS) 120/822 variables, 72/618 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/822 variables, 24/642 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/822 variables, 1/643 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:27:01] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:27:01] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:27:01] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:27:01] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:27:01] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:27:01] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 1 ms to minimize.
At refinement iteration 36 (INCLUDED_ONLY) 0/822 variables, 6/649 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/822 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 38 (OVERLAPS) 7/829 variables, 7/656 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/829 variables, 7/663 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/829 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 41 (OVERLAPS) 10/839 variables, 5/668 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/839 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 43 (OVERLAPS) 62/901 variables, 39/707 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/901 variables, 12/719 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:27:03] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
At refinement iteration 45 (INCLUDED_ONLY) 0/901 variables, 1/720 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:27:03] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 0 ms to minimize.
At refinement iteration 46 (INCLUDED_ONLY) 0/901 variables, 1/721 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/901 variables, 0/721 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 48 (OVERLAPS) 2/903 variables, 2/723 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/903 variables, 2/725 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/903 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 51 (OVERLAPS) 4/907 variables, 2/727 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/907 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 53 (OVERLAPS) 44/951 variables, 29/756 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/951 variables, 10/766 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/951 variables, 0/766 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 56 (OVERLAPS) 1/952 variables, 2/768 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/952 variables, 1/769 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/952 variables, 0/769 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 59 (OVERLAPS) 13/965 variables, 8/777 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/965 variables, 4/781 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:27:06] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:27:06] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
At refinement iteration 61 (INCLUDED_ONLY) 0/965 variables, 2/783 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/965 variables, 0/783 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 63 (OVERLAPS) 6/971 variables, 4/787 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/971 variables, 2/789 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/971 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 66 (OVERLAPS) 0/971 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 971/971 variables, and 789 constraints, problems are : Problem set: 0 solved, 12 unsolved in 11175 ms.
Refiners :[Positive P Invariants (semi-flows): 218/218 constraints, State Equation: 528/528 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 14/14 constraints]
After SMT, in 13641ms problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 3794 ms.
Support contains 27 out of 528 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 528/528 places, 443/443 transitions.
Applied a total of 0 rules in 17 ms. Remains 528 /528 variables (removed 0) and now considering 443/443 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 528/528 places, 443/443 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 528/528 places, 443/443 transitions.
Applied a total of 0 rules in 9 ms. Remains 528 /528 variables (removed 0) and now considering 443/443 (removed 0) transitions.
[2025-06-07 14:27:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:27:12] [INFO ] Implicit Places using invariants in 224 ms returned []
[2025-06-07 14:27:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:27:13] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-07 14:27:13] [INFO ] Implicit Places using invariants and state equation in 500 ms returned []
Implicit Place search using SMT with State Equation took 725 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 14:27:13] [INFO ] Redundant transitions in 26 ms returned []
Running 431 sub problems to find dead transitions.
[2025-06-07 14:27:13] [INFO ] Invariant cache hit.
[2025-06-07 14:27:13] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/518 variables, 187/187 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:27:17] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:27:17] [INFO ] Deduced a trap composed of 5 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-07 14:27:17] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:27:17] [INFO ] Deduced a trap composed of 5 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-07 14:27:17] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:27:17] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:27:17] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:27:17] [INFO ] Deduced a trap composed of 5 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-07 14:27:17] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:27:17] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:27:18] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:27:18] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:27:18] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:27:18] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:27:18] [INFO ] Deduced a trap composed of 5 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-07 14:27:18] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:27:18] [INFO ] Deduced a trap composed of 6 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-07 14:27:18] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:27:18] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:27:18] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/518 variables, 20/207 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:27:19] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:27:20] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:27:20] [INFO ] Deduced a trap composed of 5 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-07 14:27:20] [INFO ] Deduced a trap composed of 5 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-07 14:27:20] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:27:20] [INFO ] Deduced a trap composed of 5 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-07 14:27:20] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 7/214 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/518 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 4 (OVERLAPS) 10/528 variables, 31/245 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:27:32] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:27:32] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:27:33] [INFO ] Deduced a trap composed of 5 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-07 14:27:33] [INFO ] Deduced a trap composed of 7 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-07 14:27:33] [INFO ] Deduced a trap composed of 5 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-07 14:27:33] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:27:33] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:27:33] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:27:34] [INFO ] Deduced a trap composed of 6 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-07 14:27:34] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:27:34] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:27:34] [INFO ] Deduced a trap composed of 8 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-07 14:27:34] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 13/258 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 431 unsolved
SMT process timed out in 30051ms, After SMT, problems are : Problem set: 0 solved, 431 unsolved
Search for dead transitions found 0 dead transitions in 30052ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30822 ms. Remains : 528/528 places, 443/443 transitions.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2025-06-07 14:27:43] [INFO ] Flatten gal took : 43 ms
[2025-06-07 14:27:43] [INFO ] Flatten gal took : 42 ms
[2025-06-07 14:27:43] [INFO ] Input system was already deterministic with 1238 transitions.
Support contains 137 out of 1378 places (down from 140) after GAL structural reductions.
Computed a total of 333 stabilizing places and 333 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1378/1378 places, 1238/1238 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 1346 transition count 1206
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 1346 transition count 1206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1345 transition count 1205
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1345 transition count 1205
Applied a total of 66 rules in 121 ms. Remains 1345 /1378 variables (removed 33) and now considering 1205/1238 (removed 33) transitions.
// Phase 1: matrix 1205 rows 1345 cols
[2025-06-07 14:27:43] [INFO ] Computed 221 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:27:44] [INFO ] Implicit Places using invariants in 386 ms returned []
[2025-06-07 14:27:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:27:45] [INFO ] Implicit Places using invariants and state equation in 955 ms returned []
Implicit Place search using SMT with State Equation took 1343 ms to find 0 implicit places.
Running 1204 sub problems to find dead transitions.
[2025-06-07 14:27:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1344/2550 variables, and 0 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/221 constraints, State Equation: 0/1345 constraints, PredecessorRefiner: 1204/1204 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1204 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1344/2550 variables, and 0 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/221 constraints, State Equation: 0/1345 constraints, PredecessorRefiner: 0/1204 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60235ms problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 60238ms
Starting structural reductions in LTL mode, iteration 1 : 1345/1378 places, 1205/1238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61709 ms. Remains : 1345/1378 places, 1205/1238 transitions.
[2025-06-07 14:28:45] [INFO ] Flatten gal took : 35 ms
[2025-06-07 14:28:45] [INFO ] Flatten gal took : 42 ms
[2025-06-07 14:28:45] [INFO ] Input system was already deterministic with 1205 transitions.
[2025-06-07 14:28:45] [INFO ] Flatten gal took : 29 ms
[2025-06-07 14:28:45] [INFO ] Flatten gal took : 29 ms
[2025-06-07 14:28:45] [INFO ] Time to serialize gal into /tmp/CTLFireability1974658461953013925.gal : 33 ms
[2025-06-07 14:28:45] [INFO ] Time to serialize properties into /tmp/CTLFireability2447308158566745761.ctl : 4 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/CTLFireability1974658461953013925.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2447308158566745761.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-07 14:29:15] [INFO ] Flatten gal took : 28 ms
[2025-06-07 14:29:15] [INFO ] Applying decomposition
[2025-06-07 14:29:15] [INFO ] Flatten gal took : 28 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/graph5029550288130363735.txt' '-o' '/tmp/graph5029550288130363735.bin' '-w' '/tmp/graph5029550288130363735.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5029550288130363735.bin' '-l' '-1' '-v' '-w' '/tmp/graph5029550288130363735.weights' '-q' '0' '-e' '0.001'
[2025-06-07 14:29:15] [INFO ] Decomposing Gal with order
[2025-06-07 14:29:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 14:29:16] [INFO ] Removed a total of 197 redundant transitions.
[2025-06-07 14:29:16] [INFO ] Flatten gal took : 99 ms
[2025-06-07 14:29:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2025-06-07 14:29:16] [INFO ] Time to serialize gal into /tmp/CTLFireability10648123464123416529.gal : 16 ms
[2025-06-07 14:29:16] [INFO ] Time to serialize properties into /tmp/CTLFireability15088776502472251290.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/CTLFireability10648123464123416529.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15088776502472251290.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1378/1378 places, 1238/1238 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 1344 transition count 1204
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 1344 transition count 1204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1343 transition count 1203
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1343 transition count 1203
Applied a total of 70 rules in 135 ms. Remains 1343 /1378 variables (removed 35) and now considering 1203/1238 (removed 35) transitions.
// Phase 1: matrix 1203 rows 1343 cols
[2025-06-07 14:29:46] [INFO ] Computed 221 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:29:46] [INFO ] Implicit Places using invariants in 420 ms returned []
[2025-06-07 14:29:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:29:47] [INFO ] Implicit Places using invariants and state equation in 851 ms returned []
Implicit Place search using SMT with State Equation took 1273 ms to find 0 implicit places.
Running 1202 sub problems to find dead transitions.
[2025-06-07 14:29:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1342/2546 variables, and 0 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 0/221 constraints, State Equation: 0/1343 constraints, PredecessorRefiner: 1202/1202 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1202 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1342/2546 variables, and 0 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/221 constraints, State Equation: 0/1343 constraints, PredecessorRefiner: 0/1202 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60189ms problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 60192ms
Starting structural reductions in LTL mode, iteration 1 : 1343/1378 places, 1203/1238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61605 ms. Remains : 1343/1378 places, 1203/1238 transitions.
[2025-06-07 14:30:47] [INFO ] Flatten gal took : 28 ms
[2025-06-07 14:30:47] [INFO ] Flatten gal took : 28 ms
[2025-06-07 14:30:48] [INFO ] Input system was already deterministic with 1203 transitions.
[2025-06-07 14:30:48] [INFO ] Flatten gal took : 27 ms
[2025-06-07 14:30:48] [INFO ] Flatten gal took : 27 ms
[2025-06-07 14:30:48] [INFO ] Time to serialize gal into /tmp/CTLFireability10944914423413928762.gal : 5 ms
[2025-06-07 14:30:48] [INFO ] Time to serialize properties into /tmp/CTLFireability3748036586308659771.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/CTLFireability10944914423413928762.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3748036586308659771.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-07 14:31:18] [INFO ] Flatten gal took : 25 ms
[2025-06-07 14:31:18] [INFO ] Applying decomposition
[2025-06-07 14:31:18] [INFO ] Flatten gal took : 25 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/graph10648158832456414118.txt' '-o' '/tmp/graph10648158832456414118.bin' '-w' '/tmp/graph10648158832456414118.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10648158832456414118.bin' '-l' '-1' '-v' '-w' '/tmp/graph10648158832456414118.weights' '-q' '0' '-e' '0.001'
[2025-06-07 14:31:18] [INFO ] Decomposing Gal with order
[2025-06-07 14:31:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 14:31:18] [INFO ] Removed a total of 202 redundant transitions.
[2025-06-07 14:31:18] [INFO ] Flatten gal took : 74 ms
[2025-06-07 14:31:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2025-06-07 14:31:18] [INFO ] Time to serialize gal into /tmp/CTLFireability14031841046289103058.gal : 9 ms
[2025-06-07 14:31:18] [INFO ] Time to serialize properties into /tmp/CTLFireability2399156793225117143.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/CTLFireability14031841046289103058.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2399156793225117143.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1378/1378 places, 1238/1238 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 1342 transition count 1202
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 1342 transition count 1202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 1341 transition count 1201
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 1341 transition count 1201
Applied a total of 74 rules in 126 ms. Remains 1341 /1378 variables (removed 37) and now considering 1201/1238 (removed 37) transitions.
// Phase 1: matrix 1201 rows 1341 cols
[2025-06-07 14:31:48] [INFO ] Computed 221 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:31:49] [INFO ] Implicit Places using invariants in 390 ms returned []
[2025-06-07 14:31:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:31:50] [INFO ] Implicit Places using invariants and state equation in 906 ms returned []
Implicit Place search using SMT with State Equation took 1297 ms to find 0 implicit places.
Running 1200 sub problems to find dead transitions.
[2025-06-07 14:31:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1340/2542 variables, and 0 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 0/221 constraints, State Equation: 0/1341 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 1)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 1)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 1)
(s1057 1)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 1)
(s1065 1)
(s1066 1)
(s1067 1)
(s1068 1)
(s1069 1)
(s1070 1)
(s1071 1)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 1)
(s1077 1)
(s1078 1)
(s1079 1)
(s1080 1)
(s1081 1)
(s1082 1)
(s1083 1)
(s1084 1)
(s1085 1)
(s1086 1)
(s1087 1)
(s1088 1)
(s1089 1)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 1)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 1)
(s1104 1)
(s1105 1)
(s1106 1)
(s1107 1)
(s1108 1)
(s1109 1)
(s1110 1)
(s1111 1)
(s1112 1)
(s1113 1)
(s1114 1)
(s1115 1)
(s1116 1)
(s1117 1)
(s1118 1)
(s1119 1)
(s1120 1)
(s1121 1)
(s1122 1)
(s1123 1)
(s1124 1)
(s1125 1)
(s1126 1)
(s1127 1)
(s1128 1)
(s1129 1)
(s1130 1)
(s1131 1)
(s1132 1)
(s1133 1)
(s1134 1)
(s1135 1)
(s1136 1)
(s1137 1)
(s1138 1)
(s1139 1)
(s1140 1)
(s1141 1)
(s1142 1)
(s1143 1)
(s1144 1)
(s1145 1)
(s1146 1)
(s1147 1)
(s1148 1)
(s1149 1)
(s1150 1)
(s1151 1)
(s1152 1)
(s1153 1)
(s1154 1)
(s1155 1)
(s1156 1)
(s1157 1)
(s1158 1)
(s1159 1)
(s1160 1)
(s1161 1)
(s1162 1)
(s1163 1)
(s1164 1)
(s1165 1)
(s1166 1)
(s1167 1)
(s1168 1)
(s1169 1)
(s1170 1)
(s1171 1)
(s1172 1)
(s1173 1)
(s1174 1)
(s1175 1)
(s1176 1)
(s1177 1)
(s1178 1)
(s1179 1)
(s1180 1)
(s1181 1)
(s1182 1)
(s1183 1)
(s1184 1)
(s1185 1)
(s1186 1)
(s1187 1)
(s1188 1)
(s1189 1)
(s1190 1)
(s1191 1)
(s1192 1)
(s1193 1)
(s1194 1)
(s1195 1)
(s1196 1)
(s1197 1)
(s1198 1)
(s1199 1)
(s1200 1)
(s1201 1)
(s1202 1)
(s1203 1)
(s1204 1)
(s1205 1)
(s1206 1)
(s1207 1)
(s1208 1)
(s1209 1)
(s1210 1)
(s1211 1)
(s1212 1)
(s1213 1)
(s1214 1)
(s1215 1)
(s1216 1)
(s1217 1)
(s1218 1)
(s1219 1)
(s1220 1)
(s1221 1)
(s1222 1)
(s1223 1)
(s1224 1)
(s1225 1)
(s1226 1)
(s1227 1)
(s1228 1)
(s1229 1)
(s1230 1)
(s1231 1)
(s1232 1)
(s1233 1)
(s1234 1)
(s1235 1)
(s1236 1)
(s1237 1)
(s1238 1)
(s1239 1)
(s1240 1)
(s1241 1)
(s1242 1)
(s1243 1)
(s1244 1)
(s1245 1)
(s1246 1)
(s1247 1)
(s1248 1)
(s1249 1)
(s1250 1)
(s1251 1)
(s1252 1)
(s1253 1)
(s1254 1)
(s1255 1)
(s1256 1)
(s1257 1)
(s1258 1)
(s1259 1)
(s1260 1)
(s1261 1)
(s1262 1)
(s1263 1)
(s1264 1)
(s1265 1)
(s1266 1)
(s1267 1)
(s1268 1)
(s1269 1)
(s1270 1)
(s1271 1)
(s1272 1)
(s1273 1)
(s1274 1)
(s1275 1)
(s1276 1)
(s1277 1)
(s1278 1)
(s1279 1)
(s1280 1)
(s1281 1)
(s1282 1)
(s1283 1)
(s1284 1)
(s1285 1)
(s1286 1)
(s1287 1)
(s1288 1)
(s1289 1)
(s1290 1)
(s1291 1)
(s1292 1)
(s1293 1)
(s1294 1)
(s1295 1)
(s1296 1)
(s1297 1)
(s1298 1)
(s1299 1)
(s1300 1)
(s1301 1)
(s1302 1)
(s1303 1)
(s1304 1)
(s1305 1)
(s1306 1)
(s1307 1)
(s1308 1)
(s1309 1)
(s1310 1)
(s1311 1)
(s1312 1)
(s1313 1)
(s1314 1)
(s1315 1)
(s1316 1)
(s1317 1)
(s1318 1)
(s1319 1)
(s1320 1)
(s1321 1)
(s1322 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1340/2542 variables, and 0 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/221 constraints, State Equation: 0/1341 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60182ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 60185ms
Starting structural reductions in LTL mode, iteration 1 : 1341/1378 places, 1201/1238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61611 ms. Remains : 1341/1378 places, 1201/1238 transitions.
[2025-06-07 14:32:50] [INFO ] Flatten gal took : 21 ms
[2025-06-07 14:32:50] [INFO ] Flatten gal took : 23 ms
[2025-06-07 14:32:50] [INFO ] Input system was already deterministic with 1201 transitions.
[2025-06-07 14:32:50] [INFO ] Flatten gal took : 25 ms
[2025-06-07 14:32:50] [INFO ] Flatten gal took : 23 ms
[2025-06-07 14:32:50] [INFO ] Time to serialize gal into /tmp/CTLFireability17379173614939585999.gal : 5 ms
[2025-06-07 14:32:50] [INFO ] Time to serialize properties into /tmp/CTLFireability4128505226585462180.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/CTLFireability17379173614939585999.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4128505226585462180.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-07 14:33:20] [INFO ] Flatten gal took : 24 ms
[2025-06-07 14:33:20] [INFO ] Applying decomposition
[2025-06-07 14:33:20] [INFO ] Flatten gal took : 22 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/graph3752147572778963248.txt' '-o' '/tmp/graph3752147572778963248.bin' '-w' '/tmp/graph3752147572778963248.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3752147572778963248.bin' '-l' '-1' '-v' '-w' '/tmp/graph3752147572778963248.weights' '-q' '0' '-e' '0.001'
[2025-06-07 14:33:20] [INFO ] Decomposing Gal with order
[2025-06-07 14:33:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 14:33:20] [INFO ] Removed a total of 200 redundant transitions.
[2025-06-07 14:33:20] [INFO ] Flatten gal took : 59 ms
[2025-06-07 14:33:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2025-06-07 14:33:20] [INFO ] Time to serialize gal into /tmp/CTLFireability7893095804537996383.gal : 9 ms
[2025-06-07 14:33:20] [INFO ] Time to serialize properties into /tmp/CTLFireability7480010518874192213.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/CTLFireability7893095804537996383.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7480010518874192213.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1378/1378 places, 1238/1238 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 1345 transition count 1205
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 1345 transition count 1205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1344 transition count 1204
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1344 transition count 1204
Applied a total of 68 rules in 120 ms. Remains 1344 /1378 variables (removed 34) and now considering 1204/1238 (removed 34) transitions.
// Phase 1: matrix 1204 rows 1344 cols
[2025-06-07 14:33:50] [INFO ] Computed 221 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:33:51] [INFO ] Implicit Places using invariants in 355 ms returned []
[2025-06-07 14:33:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:33:52] [INFO ] Implicit Places using invariants and state equation in 874 ms returned []
Implicit Place search using SMT with State Equation took 1231 ms to find 0 implicit places.
Running 1203 sub problems to find dead transitions.
[2025-06-07 14:33:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1343/2548 variables, and 0 constraints, problems are : Problem set: 0 solved, 1203 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 0/221 constraints, State Equation: 0/1344 constraints, PredecessorRefiner: 1203/1203 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1203 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 timeout
1)
(s482 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1343/2548 variables, and 0 constraints, problems are : Problem set: 0 solved, 1203 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 0/221 constraints, State Equation: 0/1344 constraints, PredecessorRefiner: 0/1203 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60179ms problems are : Problem set: 0 solved, 1203 unsolved
Search for dead transitions found 0 dead transitions in 60182ms
Starting structural reductions in LTL mode, iteration 1 : 1344/1378 places, 1204/1238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61536 ms. Remains : 1344/1378 places, 1204/1238 transitions.
[2025-06-07 14:34:52] [INFO ] Flatten gal took : 20 ms
[2025-06-07 14:34:52] [INFO ] Flatten gal took : 20 ms
[2025-06-07 14:34:52] [INFO ] Input system was already deterministic with 1204 transitions.
[2025-06-07 14:34:52] [INFO ] Flatten gal took : 20 ms
[2025-06-07 14:34:52] [INFO ] Flatten gal took : 21 ms
[2025-06-07 14:34:52] [INFO ] Time to serialize gal into /tmp/CTLFireability27427998693373379.gal : 5 ms
[2025-06-07 14:34:52] [INFO ] Time to serialize properties into /tmp/CTLFireability5287970903666848711.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/CTLFireability27427998693373379.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5287970903666848711.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-07 14:35:22] [INFO ] Flatten gal took : 24 ms
[2025-06-07 14:35:22] [INFO ] Applying decomposition
[2025-06-07 14:35:22] [INFO ] Flatten gal took : 21 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/graph4165594856443954589.txt' '-o' '/tmp/graph4165594856443954589.bin' '-w' '/tmp/graph4165594856443954589.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4165594856443954589.bin' '-l' '-1' '-v' '-w' '/tmp/graph4165594856443954589.weights' '-q' '0' '-e' '0.001'
[2025-06-07 14:35:22] [INFO ] Decomposing Gal with order
[2025-06-07 14:35:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 14:35:22] [INFO ] Removed a total of 198 redundant transitions.
[2025-06-07 14:35:22] [INFO ] Flatten gal took : 42 ms
[2025-06-07 14:35:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2025-06-07 14:35:22] [INFO ] Time to serialize gal into /tmp/CTLFireability2434980307180065972.gal : 10 ms
[2025-06-07 14:35:22] [INFO ] Time to serialize properties into /tmp/CTLFireability6838162989533740583.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/CTLFireability2434980307180065972.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6838162989533740583.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1378/1378 places, 1238/1238 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 1350 transition count 1210
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 1350 transition count 1210
Applied a total of 56 rules in 87 ms. Remains 1350 /1378 variables (removed 28) and now considering 1210/1238 (removed 28) transitions.
// Phase 1: matrix 1210 rows 1350 cols
[2025-06-07 14:35:53] [INFO ] Computed 221 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:35:53] [INFO ] Implicit Places using invariants in 367 ms returned []
[2025-06-07 14:35:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:35:54] [INFO ] Implicit Places using invariants and state equation in 912 ms returned []
Implicit Place search using SMT with State Equation took 1281 ms to find 0 implicit places.
Running 1209 sub problems to find dead transitions.
[2025-06-07 14:35:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1349/2560 variables, and 0 constraints, problems are : Problem set: 0 solved, 1209 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 0/221 constraints, State Equation: 0/1350 constraints, PredecessorRefiner: 1209/1209 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1209 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1349/2560 variables, and 0 constraints, problems are : Problem set: 0 solved, 1209 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 0/221 constraints, State Equation: 0/1350 constraints, PredecessorRefiner: 0/1209 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60179ms problems are : Problem set: 0 solved, 1209 unsolved
Search for dead transitions found 0 dead transitions in 60181ms
Starting structural reductions in LTL mode, iteration 1 : 1350/1378 places, 1210/1238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61554 ms. Remains : 1350/1378 places, 1210/1238 transitions.
[2025-06-07 14:36:54] [INFO ] Flatten gal took : 23 ms
[2025-06-07 14:36:54] [INFO ] Flatten gal took : 20 ms
[2025-06-07 14:36:54] [INFO ] Input system was already deterministic with 1210 transitions.
[2025-06-07 14:36:54] [INFO ] Flatten gal took : 20 ms
[2025-06-07 14:36:54] [INFO ] Flatten gal took : 20 ms
[2025-06-07 14:36:54] [INFO ] Time to serialize gal into /tmp/CTLFireability17451409953318719240.gal : 4 ms
[2025-06-07 14:36:54] [INFO ] Time to serialize properties into /tmp/CTLFireability399039137231903807.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/CTLFireability17451409953318719240.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability399039137231903807.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1378/1378 places, 1238/1238 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 290 transitions
Trivial Post-agglo rules discarded 290 transitions
Performed 290 trivial Post agglomeration. Transition count delta: 290
Iterating post reduction 0 with 290 rules applied. Total rules applied 290 place count 1377 transition count 947
Reduce places removed 290 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 292 rules applied. Total rules applied 582 place count 1087 transition count 945
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 584 place count 1086 transition count 944
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 585 place count 1085 transition count 944
Performed 139 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 139 Pre rules applied. Total rules applied 585 place count 1085 transition count 805
Deduced a syphon composed of 139 places in 0 ms
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 4 with 278 rules applied. Total rules applied 863 place count 946 transition count 805
Discarding 28 places :
Symmetric choice reduction at 4 with 28 rule applications. Total rules 891 place count 918 transition count 777
Iterating global reduction 4 with 28 rules applied. Total rules applied 919 place count 918 transition count 777
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 22 Pre rules applied. Total rules applied 919 place count 918 transition count 755
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 963 place count 896 transition count 755
Performed 309 Post agglomeration using F-continuation condition.Transition count delta: 309
Deduced a syphon composed of 309 places in 1 ms
Reduce places removed 309 places and 0 transitions.
Iterating global reduction 4 with 618 rules applied. Total rules applied 1581 place count 587 transition count 446
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1582 place count 586 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1583 place count 585 transition count 445
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1583 place count 585 transition count 443
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1587 place count 583 transition count 443
Applied a total of 1587 rules in 158 ms. Remains 583 /1378 variables (removed 795) and now considering 443/1238 (removed 795) transitions.
// Phase 1: matrix 443 rows 583 cols
[2025-06-07 14:37:55] [INFO ] Computed 220 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:37:55] [INFO ] Implicit Places using invariants in 238 ms returned [563, 567]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 240 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 581/1378 places, 443/1238 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 579 transition count 441
Applied a total of 4 rules in 25 ms. Remains 579 /581 variables (removed 2) and now considering 441/443 (removed 2) transitions.
// Phase 1: matrix 441 rows 579 cols
[2025-06-07 14:37:55] [INFO ] Computed 218 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:37:55] [INFO ] Implicit Places using invariants in 240 ms returned []
[2025-06-07 14:37:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:37:56] [INFO ] Implicit Places using invariants and state equation in 410 ms returned []
Implicit Place search using SMT with State Equation took 652 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 579/1378 places, 441/1238 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 1077 ms. Remains : 579/1378 places, 441/1238 transitions.
[2025-06-07 14:37:56] [INFO ] Flatten gal took : 11 ms
[2025-06-07 14:37:56] [INFO ] Flatten gal took : 11 ms
[2025-06-07 14:37:56] [INFO ] Input system was already deterministic with 441 transitions.
[2025-06-07 14:37:56] [INFO ] Flatten gal took : 11 ms
[2025-06-07 14:37:56] [INFO ] Flatten gal took : 11 ms
[2025-06-07 14:37:56] [INFO ] Time to serialize gal into /tmp/CTLFireability9152575248953535047.gal : 2 ms
[2025-06-07 14:37:56] [INFO ] Time to serialize properties into /tmp/CTLFireability583143056262169123.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/CTLFireability9152575248953535047.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability583143056262169123.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.54922e+85,1.95716,69196,2,2215,5,254599,6,0,2759,444655,0


Converting to forward existential form...Done !
original formula: AF(!(A((p1409==1) U AF((EF((p392==1)) + ((p903==1)&&(p1027==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(!((E(!(!(EG(!((E(TRUE U (p392==1)) + ((p903==1)&&(p1027==1))))))) U (!((p1409==1)) * !(!(EG(!((E(...286
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...869
Detected timeout of ITS tools.
[2025-06-07 14:38:26] [INFO ] Flatten gal took : 17 ms
[2025-06-07 14:38:26] [INFO ] Applying decomposition
[2025-06-07 14:38:26] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph18297388810490432050.txt' '-o' '/tmp/graph18297388810490432050.bin' '-w' '/tmp/graph18297388810490432050.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18297388810490432050.bin' '-l' '-1' '-v' '-w' '/tmp/graph18297388810490432050.weights' '-q' '0' '-e' '0.001'
[2025-06-07 14:38:26] [INFO ] Decomposing Gal with order
[2025-06-07 14:38:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 14:38:26] [INFO ] Removed a total of 59 redundant transitions.
[2025-06-07 14:38:26] [INFO ] Flatten gal took : 17 ms
[2025-06-07 14:38:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 13 ms.
[2025-06-07 14:38:26] [INFO ] Time to serialize gal into /tmp/CTLFireability15971366588635680209.gal : 5 ms
[2025-06-07 14:38:26] [INFO ] Time to serialize properties into /tmp/CTLFireability10609774733645630201.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/CTLFireability15971366588635680209.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10609774733645630201.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.54922e+85,4.45572,144572,322,22,273618,978,830,742545,45,7068,0


Converting to forward existential form...Done !
original formula: AF(!(A((i19.i0.u147.p1409==1) U AF((EF((i3.i2.u39.p392==1)) + ((i11.i1.u94.p903==1)&&(i14.i2.u106.p1027==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(!((E(!(!(EG(!((E(TRUE U (i3.i2.u39.p392==1)) + ((i11.i1.u94.p903==1)&&(i14.i2.u106.p1027==1))))))...397
Reverse transition relation is NOT exact ! Due to transitions i0.i0.u3.t1, i0.i1.u4.t2, i0.i1.u8.t102, i0.i2.u6.t96, i0.i3.u2.t0, i0.i3.u7.t98, i0.i4.u5.t9...2234
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1378/1378 places, 1238/1238 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 291 transitions
Trivial Post-agglo rules discarded 291 transitions
Performed 291 trivial Post agglomeration. Transition count delta: 291
Iterating post reduction 0 with 291 rules applied. Total rules applied 291 place count 1377 transition count 946
Reduce places removed 291 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 293 rules applied. Total rules applied 584 place count 1086 transition count 944
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 585 place count 1085 transition count 944
Performed 140 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 140 Pre rules applied. Total rules applied 585 place count 1085 transition count 804
Deduced a syphon composed of 140 places in 1 ms
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 3 with 280 rules applied. Total rules applied 865 place count 945 transition count 804
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 894 place count 916 transition count 775
Iterating global reduction 3 with 29 rules applied. Total rules applied 923 place count 916 transition count 775
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 923 place count 916 transition count 752
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 969 place count 893 transition count 752
Performed 311 Post agglomeration using F-continuation condition.Transition count delta: 311
Deduced a syphon composed of 311 places in 1 ms
Reduce places removed 311 places and 0 transitions.
Iterating global reduction 3 with 622 rules applied. Total rules applied 1591 place count 582 transition count 441
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1593 place count 580 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1594 place count 579 transition count 439
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1594 place count 579 transition count 437
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1598 place count 577 transition count 437
Applied a total of 1598 rules in 131 ms. Remains 577 /1378 variables (removed 801) and now considering 437/1238 (removed 801) transitions.
// Phase 1: matrix 437 rows 577 cols
[2025-06-07 14:38:56] [INFO ] Computed 220 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:38:56] [INFO ] Implicit Places using invariants in 358 ms returned [557, 561]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 361 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 575/1378 places, 437/1238 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 573 transition count 435
Applied a total of 4 rules in 20 ms. Remains 573 /575 variables (removed 2) and now considering 435/437 (removed 2) transitions.
// Phase 1: matrix 435 rows 573 cols
[2025-06-07 14:38:56] [INFO ] Computed 218 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:38:57] [INFO ] Implicit Places using invariants in 257 ms returned []
[2025-06-07 14:38:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:38:57] [INFO ] Implicit Places using invariants and state equation in 428 ms returned []
Implicit Place search using SMT with State Equation took 687 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 573/1378 places, 435/1238 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 1201 ms. Remains : 573/1378 places, 435/1238 transitions.
[2025-06-07 14:38:57] [INFO ] Flatten gal took : 10 ms
[2025-06-07 14:38:57] [INFO ] Flatten gal took : 10 ms
[2025-06-07 14:38:57] [INFO ] Input system was already deterministic with 435 transitions.
[2025-06-07 14:38:57] [INFO ] Flatten gal took : 17 ms
[2025-06-07 14:38:57] [INFO ] Flatten gal took : 10 ms
[2025-06-07 14:38:57] [INFO ] Time to serialize gal into /tmp/CTLFireability12093800772618537048.gal : 2 ms
[2025-06-07 14:38:57] [INFO ] Time to serialize properties into /tmp/CTLFireability6332532739027489904.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/CTLFireability12093800772618537048.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6332532739027489904.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.37658e+85,1.44609,54784,2,1043,5,199936,6,0,2730,343588,0


Converting to forward existential form...Done !
original formula: AG(AF((p805==1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((p805==1)))] = FALSE
Hit Full ! (commute/partial/dont) 433/0/2
(forward)formula 0,0,2.42329,56516,1,0,8,341912,20,3,13239,343588,8
FORMULA ShieldPPPt-PT-020B-CTLFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 1378/1378 places, 1238/1238 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 1345 transition count 1205
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 1345 transition count 1205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1344 transition count 1204
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1344 transition count 1204
Applied a total of 68 rules in 124 ms. Remains 1344 /1378 variables (removed 34) and now considering 1204/1238 (removed 34) transitions.
// Phase 1: matrix 1204 rows 1344 cols
[2025-06-07 14:39:00] [INFO ] Computed 221 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:39:00] [INFO ] Implicit Places using invariants in 356 ms returned []
[2025-06-07 14:39:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:39:01] [INFO ] Implicit Places using invariants and state equation in 955 ms returned []
Implicit Place search using SMT with State Equation took 1312 ms to find 0 implicit places.
Running 1203 sub problems to find dead transitions.
[2025-06-07 14:39:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1343/2548 variables, and 0 constraints, problems are : Problem set: 0 solved, 1203 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 0/221 constraints, State Equation: 0/1344 constraints, PredecessorRefiner: 1203/1203 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1203 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1343/2548 variables, and 0 constraints, problems are : Problem set: 0 solved, 1203 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 0/221 constraints, State Equation: 0/1344 constraints, PredecessorRefiner: 0/1203 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60178ms problems are : Problem set: 0 solved, 1203 unsolved
Search for dead transitions found 0 dead transitions in 60180ms
Starting structural reductions in LTL mode, iteration 1 : 1344/1378 places, 1204/1238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61620 ms. Remains : 1344/1378 places, 1204/1238 transitions.
[2025-06-07 14:40:01] [INFO ] Flatten gal took : 22 ms
[2025-06-07 14:40:01] [INFO ] Flatten gal took : 20 ms
[2025-06-07 14:40:01] [INFO ] Input system was already deterministic with 1204 transitions.
[2025-06-07 14:40:01] [INFO ] Flatten gal took : 20 ms
[2025-06-07 14:40:01] [INFO ] Flatten gal took : 19 ms
[2025-06-07 14:40:01] [INFO ] Time to serialize gal into /tmp/CTLFireability3475359011829232236.gal : 4 ms
[2025-06-07 14:40:01] [INFO ] Time to serialize properties into /tmp/CTLFireability9501390787253339654.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/CTLFireability3475359011829232236.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9501390787253339654.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1378/1378 places, 1238/1238 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 1346 transition count 1206
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 1346 transition count 1206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1345 transition count 1205
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1345 transition count 1205
Applied a total of 66 rules in 138 ms. Remains 1345 /1378 variables (removed 33) and now considering 1205/1238 (removed 33) transitions.
// Phase 1: matrix 1205 rows 1345 cols
[2025-06-07 14:41:02] [INFO ] Computed 221 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:41:02] [INFO ] Implicit Places using invariants in 410 ms returned []
[2025-06-07 14:41:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:41:03] [INFO ] Implicit Places using invariants and state equation in 964 ms returned []
Implicit Place search using SMT with State Equation took 1376 ms to find 0 implicit places.
Running 1204 sub problems to find dead transitions.
[2025-06-07 14:41:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1344/2550 variables, and 0 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 0/221 constraints, State Equation: 0/1345 constraints, PredecessorRefiner: 1204/1204 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1204 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1344/2550 variables, and 0 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 0/221 constraints, State Equation: 0/1345 constraints, PredecessorRefiner: 0/1204 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60200ms problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 60202ms
Starting structural reductions in LTL mode, iteration 1 : 1345/1378 places, 1205/1238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61720 ms. Remains : 1345/1378 places, 1205/1238 transitions.
[2025-06-07 14:42:04] [INFO ] Flatten gal took : 21 ms
[2025-06-07 14:42:04] [INFO ] Flatten gal took : 20 ms
[2025-06-07 14:42:04] [INFO ] Input system was already deterministic with 1205 transitions.
[2025-06-07 14:42:04] [INFO ] Flatten gal took : 21 ms
[2025-06-07 14:42:04] [INFO ] Flatten gal took : 27 ms
[2025-06-07 14:42:04] [INFO ] Time to serialize gal into /tmp/CTLFireability11493495064186859267.gal : 3 ms
[2025-06-07 14:42:04] [INFO ] Time to serialize properties into /tmp/CTLFireability15305655162999831527.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/CTLFireability11493495064186859267.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15305655162999831527.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-07 14:42:34] [INFO ] Flatten gal took : 24 ms
[2025-06-07 14:42:34] [INFO ] Applying decomposition
[2025-06-07 14:42:34] [INFO ] Flatten gal took : 21 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/graph992295267102098158.txt' '-o' '/tmp/graph992295267102098158.bin' '-w' '/tmp/graph992295267102098158.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph992295267102098158.bin' '-l' '-1' '-v' '-w' '/tmp/graph992295267102098158.weights' '-q' '0' '-e' '0.001'
[2025-06-07 14:42:34] [INFO ] Decomposing Gal with order
[2025-06-07 14:42:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 14:42:34] [INFO ] Removed a total of 199 redundant transitions.
[2025-06-07 14:42:34] [INFO ] Flatten gal took : 40 ms
[2025-06-07 14:42:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-07 14:42:34] [INFO ] Time to serialize gal into /tmp/CTLFireability13994330563407442495.gal : 10 ms
[2025-06-07 14:42:34] [INFO ] Time to serialize properties into /tmp/CTLFireability6184687619928124310.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/CTLFireability13994330563407442495.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6184687619928124310.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1378/1378 places, 1238/1238 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 1344 transition count 1204
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 1344 transition count 1204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1343 transition count 1203
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1343 transition count 1203
Applied a total of 70 rules in 138 ms. Remains 1343 /1378 variables (removed 35) and now considering 1203/1238 (removed 35) transitions.
// Phase 1: matrix 1203 rows 1343 cols
[2025-06-07 14:43:04] [INFO ] Computed 221 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:43:05] [INFO ] Implicit Places using invariants in 394 ms returned []
[2025-06-07 14:43:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:43:06] [INFO ] Implicit Places using invariants and state equation in 981 ms returned []
Implicit Place search using SMT with State Equation took 1376 ms to find 0 implicit places.
Running 1202 sub problems to find dead transitions.
[2025-06-07 14:43:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1342/2546 variables, and 0 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/221 constraints, State Equation: 0/1343 constraints, PredecessorRefiner: 1202/1202 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1202 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1342/2546 variables, and 0 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 0/221 constraints, State Equation: 0/1343 constraints, PredecessorRefiner: 0/1202 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60202ms problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 60205ms
Starting structural reductions in LTL mode, iteration 1 : 1343/1378 places, 1203/1238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61723 ms. Remains : 1343/1378 places, 1203/1238 transitions.
[2025-06-07 14:44:06] [INFO ] Flatten gal took : 20 ms
[2025-06-07 14:44:06] [INFO ] Flatten gal took : 19 ms
[2025-06-07 14:44:06] [INFO ] Input system was already deterministic with 1203 transitions.
[2025-06-07 14:44:06] [INFO ] Flatten gal took : 20 ms
[2025-06-07 14:44:06] [INFO ] Flatten gal took : 19 ms
[2025-06-07 14:44:06] [INFO ] Time to serialize gal into /tmp/CTLFireability13705876301561683146.gal : 4 ms
[2025-06-07 14:44:06] [INFO ] Time to serialize properties into /tmp/CTLFireability9217717345565860053.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/CTLFireability13705876301561683146.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9217717345565860053.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1378/1378 places, 1238/1238 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 1346 transition count 1206
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 1346 transition count 1206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1345 transition count 1205
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1345 transition count 1205
Applied a total of 66 rules in 121 ms. Remains 1345 /1378 variables (removed 33) and now considering 1205/1238 (removed 33) transitions.
// Phase 1: matrix 1205 rows 1345 cols
[2025-06-07 14:45:06] [INFO ] Computed 221 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:45:07] [INFO ] Implicit Places using invariants in 401 ms returned []
[2025-06-07 14:45:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:45:08] [INFO ] Implicit Places using invariants and state equation in 1056 ms returned []
Implicit Place search using SMT with State Equation took 1460 ms to find 0 implicit places.
Running 1204 sub problems to find dead transitions.
[2025-06-07 14:45:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1344/2550 variables, and 0 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 0/221 constraints, State Equation: 0/1345 constraints, PredecessorRefiner: 1204/1204 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1204 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1344/2550 variables, and 0 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 0/221 constraints, State Equation: 0/1345 constraints, PredecessorRefiner: 0/1204 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60185ms problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 60187ms
Starting structural reductions in LTL mode, iteration 1 : 1345/1378 places, 1205/1238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61772 ms. Remains : 1345/1378 places, 1205/1238 transitions.
[2025-06-07 14:46:08] [INFO ] Flatten gal took : 20 ms
[2025-06-07 14:46:08] [INFO ] Flatten gal took : 19 ms
[2025-06-07 14:46:08] [INFO ] Input system was already deterministic with 1205 transitions.
[2025-06-07 14:46:08] [INFO ] Flatten gal took : 19 ms
[2025-06-07 14:46:08] [INFO ] Flatten gal took : 20 ms
[2025-06-07 14:46:08] [INFO ] Time to serialize gal into /tmp/CTLFireability18286840191577905954.gal : 3 ms
[2025-06-07 14:46:08] [INFO ] Time to serialize properties into /tmp/CTLFireability17834624851063110441.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/CTLFireability18286840191577905954.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17834624851063110441.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-07 14:46:38] [INFO ] Flatten gal took : 33 ms
[2025-06-07 14:46:38] [INFO ] Applying decomposition
[2025-06-07 14:46:38] [INFO ] Flatten gal took : 22 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/graph4929268226496835373.txt' '-o' '/tmp/graph4929268226496835373.bin' '-w' '/tmp/graph4929268226496835373.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4929268226496835373.bin' '-l' '-1' '-v' '-w' '/tmp/graph4929268226496835373.weights' '-q' '0' '-e' '0.001'
[2025-06-07 14:46:38] [INFO ] Decomposing Gal with order
[2025-06-07 14:46:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 14:46:38] [INFO ] Removed a total of 198 redundant transitions.
[2025-06-07 14:46:38] [INFO ] Flatten gal took : 37 ms
[2025-06-07 14:46:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-07 14:46:38] [INFO ] Time to serialize gal into /tmp/CTLFireability4981120903916802089.gal : 8 ms
[2025-06-07 14:46:38] [INFO ] Time to serialize properties into /tmp/CTLFireability14387746974915722290.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/CTLFireability4981120903916802089.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14387746974915722290.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1378/1378 places, 1238/1238 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 291 transitions
Trivial Post-agglo rules discarded 291 transitions
Performed 291 trivial Post agglomeration. Transition count delta: 291
Iterating post reduction 0 with 291 rules applied. Total rules applied 291 place count 1377 transition count 946
Reduce places removed 291 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 293 rules applied. Total rules applied 584 place count 1086 transition count 944
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 586 place count 1085 transition count 943
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 587 place count 1084 transition count 943
Performed 140 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 140 Pre rules applied. Total rules applied 587 place count 1084 transition count 803
Deduced a syphon composed of 140 places in 1 ms
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 4 with 280 rules applied. Total rules applied 867 place count 944 transition count 803
Discarding 29 places :
Symmetric choice reduction at 4 with 29 rule applications. Total rules 896 place count 915 transition count 774
Iterating global reduction 4 with 29 rules applied. Total rules applied 925 place count 915 transition count 774
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 22 Pre rules applied. Total rules applied 925 place count 915 transition count 752
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 969 place count 893 transition count 752
Performed 311 Post agglomeration using F-continuation condition.Transition count delta: 311
Deduced a syphon composed of 311 places in 1 ms
Reduce places removed 311 places and 0 transitions.
Iterating global reduction 4 with 622 rules applied. Total rules applied 1591 place count 582 transition count 441
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1593 place count 580 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1594 place count 579 transition count 439
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1594 place count 579 transition count 437
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1598 place count 577 transition count 437
Applied a total of 1598 rules in 136 ms. Remains 577 /1378 variables (removed 801) and now considering 437/1238 (removed 801) transitions.
// Phase 1: matrix 437 rows 577 cols
[2025-06-07 14:47:09] [INFO ] Computed 220 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:47:09] [INFO ] Implicit Places using invariants in 266 ms returned [557, 561]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 267 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 575/1378 places, 437/1238 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 573 transition count 435
Applied a total of 4 rules in 28 ms. Remains 573 /575 variables (removed 2) and now considering 435/437 (removed 2) transitions.
// Phase 1: matrix 435 rows 573 cols
[2025-06-07 14:47:09] [INFO ] Computed 218 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:47:09] [INFO ] Implicit Places using invariants in 241 ms returned []
[2025-06-07 14:47:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:47:10] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 668 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 573/1378 places, 435/1238 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 1100 ms. Remains : 573/1378 places, 435/1238 transitions.
[2025-06-07 14:47:10] [INFO ] Flatten gal took : 9 ms
[2025-06-07 14:47:10] [INFO ] Flatten gal took : 10 ms
[2025-06-07 14:47:10] [INFO ] Input system was already deterministic with 435 transitions.
[2025-06-07 14:47:10] [INFO ] Flatten gal took : 9 ms
[2025-06-07 14:47:10] [INFO ] Flatten gal took : 10 ms
[2025-06-07 14:47:10] [INFO ] Time to serialize gal into /tmp/CTLFireability1212729216920575643.gal : 2 ms
[2025-06-07 14:47:10] [INFO ] Time to serialize properties into /tmp/CTLFireability8057932505936239049.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/CTLFireability1212729216920575643.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8057932505936239049.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.52953e+85,1.2703,54760,2,1043,5,200198,6,0,2730,343616,0


Converting to forward existential form...Done !
original formula: EG(AF((p1469==1)))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((p1469==1)))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 432/0/3
Detected timeout of ITS tools.
[2025-06-07 14:47:40] [INFO ] Flatten gal took : 16 ms
[2025-06-07 14:47:40] [INFO ] Applying decomposition
[2025-06-07 14:47:40] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7645266299823005322.txt' '-o' '/tmp/graph7645266299823005322.bin' '-w' '/tmp/graph7645266299823005322.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7645266299823005322.bin' '-l' '-1' '-v' '-w' '/tmp/graph7645266299823005322.weights' '-q' '0' '-e' '0.001'
[2025-06-07 14:47:40] [INFO ] Decomposing Gal with order
[2025-06-07 14:47:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 14:47:40] [INFO ] Removed a total of 59 redundant transitions.
[2025-06-07 14:47:40] [INFO ] Flatten gal took : 14 ms
[2025-06-07 14:47:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2025-06-07 14:47:40] [INFO ] Time to serialize gal into /tmp/CTLFireability17524250511604737619.gal : 3 ms
[2025-06-07 14:47:40] [INFO ] Time to serialize properties into /tmp/CTLFireability14551385939369377557.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/CTLFireability17524250511604737619.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14551385939369377557.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.52953e+85,4.58189,164424,95,15,326411,164,566,1.00102e+06,43,910,0


Converting to forward existential form...Done !
original formula: EG(AF((i20.u151.p1469==1)))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((i20.u151.p1469==1)))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1378/1378 places, 1238/1238 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 288 transitions
Trivial Post-agglo rules discarded 288 transitions
Performed 288 trivial Post agglomeration. Transition count delta: 288
Iterating post reduction 0 with 288 rules applied. Total rules applied 288 place count 1377 transition count 949
Reduce places removed 288 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 290 rules applied. Total rules applied 578 place count 1089 transition count 947
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 582 place count 1088 transition count 944
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 585 place count 1085 transition count 944
Performed 140 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 140 Pre rules applied. Total rules applied 585 place count 1085 transition count 804
Deduced a syphon composed of 140 places in 1 ms
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 4 with 280 rules applied. Total rules applied 865 place count 945 transition count 804
Discarding 27 places :
Symmetric choice reduction at 4 with 27 rule applications. Total rules 892 place count 918 transition count 777
Iterating global reduction 4 with 27 rules applied. Total rules applied 919 place count 918 transition count 777
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 21 Pre rules applied. Total rules applied 919 place count 918 transition count 756
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 961 place count 897 transition count 756
Performed 310 Post agglomeration using F-continuation condition.Transition count delta: 310
Deduced a syphon composed of 310 places in 1 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 4 with 620 rules applied. Total rules applied 1581 place count 587 transition count 446
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1583 place count 585 transition count 444
Applied a total of 1583 rules in 105 ms. Remains 585 /1378 variables (removed 793) and now considering 444/1238 (removed 794) transitions.
// Phase 1: matrix 444 rows 585 cols
[2025-06-07 14:48:10] [INFO ] Computed 221 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:48:10] [INFO ] Implicit Places using invariants in 256 ms returned [573]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 256 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 584/1378 places, 444/1238 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 584 transition count 442
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 582 transition count 442
Applied a total of 4 rules in 11 ms. Remains 582 /584 variables (removed 2) and now considering 442/444 (removed 2) transitions.
// Phase 1: matrix 442 rows 582 cols
[2025-06-07 14:48:10] [INFO ] Computed 220 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:48:11] [INFO ] Implicit Places using invariants in 237 ms returned [560, 564]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 238 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 580/1378 places, 442/1238 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 578 transition count 440
Applied a total of 4 rules in 16 ms. Remains 578 /580 variables (removed 2) and now considering 440/442 (removed 2) transitions.
// Phase 1: matrix 440 rows 578 cols
[2025-06-07 14:48:11] [INFO ] Computed 218 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:48:11] [INFO ] Implicit Places using invariants in 246 ms returned []
[2025-06-07 14:48:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:48:11] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 669 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 578/1378 places, 440/1238 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 1295 ms. Remains : 578/1378 places, 440/1238 transitions.
[2025-06-07 14:48:11] [INFO ] Flatten gal took : 9 ms
[2025-06-07 14:48:11] [INFO ] Flatten gal took : 9 ms
[2025-06-07 14:48:11] [INFO ] Input system was already deterministic with 440 transitions.
[2025-06-07 14:48:11] [INFO ] Flatten gal took : 9 ms
[2025-06-07 14:48:11] [INFO ] Flatten gal took : 10 ms
[2025-06-07 14:48:11] [INFO ] Time to serialize gal into /tmp/CTLFireability4478868526609876719.gal : 1 ms
[2025-06-07 14:48:11] [INFO ] Time to serialize properties into /tmp/CTLFireability12684986827958578161.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/CTLFireability4478868526609876719.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12684986827958578161.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.263e+85,1.50066,56776,2,1657,5,208277,6,0,2754,358764,0


Converting to forward existential form...Done !
original formula: !(A(A((!(((p1354==1)&&(p1356==1))) * !(A((p446==1) U (p1540==1)))) U (EG((p980==1)) + (p1359!=1))) U (p1543==1)))
=> equivalent forward existential formula: (([(((FwdU((FwdU(Init,!((p1543==1))) * !((p1543==1))),!((EG((p980==1)) + (p1359!=1)))) * !((!(((p1354==1)&&(p135...426
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...921
Detected timeout of ITS tools.
[2025-06-07 14:48:41] [INFO ] Flatten gal took : 15 ms
[2025-06-07 14:48:41] [INFO ] Applying decomposition
[2025-06-07 14:48:41] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5084425013542609075.txt' '-o' '/tmp/graph5084425013542609075.bin' '-w' '/tmp/graph5084425013542609075.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5084425013542609075.bin' '-l' '-1' '-v' '-w' '/tmp/graph5084425013542609075.weights' '-q' '0' '-e' '0.001'
[2025-06-07 14:48:41] [INFO ] Decomposing Gal with order
[2025-06-07 14:48:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 14:48:41] [INFO ] Removed a total of 58 redundant transitions.
[2025-06-07 14:48:41] [INFO ] Flatten gal took : 13 ms
[2025-06-07 14:48:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-07 14:48:41] [INFO ] Time to serialize gal into /tmp/CTLFireability221518059765737054.gal : 3 ms
[2025-06-07 14:48:41] [INFO ] Time to serialize properties into /tmp/CTLFireability4232452501787242273.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/CTLFireability221518059765737054.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4232452501787242273.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.263e+85,6.06836,211024,279,25,412335,236,675,1.25074e+06,53,1107,0


Converting to forward existential form...Done !
original formula: !(A(A((!(((i19.u139.p1354==1)&&(i19.u139.p1356==1))) * !(A((i7.u45.p446==1) U (i21.u160.p1540==1)))) U (EG((i14.u101.p980==1)) + (i20.u14...192
=> equivalent forward existential formula: (([(((FwdU((FwdU(Init,!((i21.u160.p1543==1))) * !((i21.u160.p1543==1))),!((EG((i14.u101.p980==1)) + (i20.u141.p1...577
Reverse transition relation is NOT exact ! Due to transitions i0.u7.t101, i0.u3.t1, i0.u5.t95, i0.u2.t0, i0.u6.t98, i0.u8.t105, i0.u4.t2, i0.u15.t115, i1.i...2132
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1378/1378 places, 1238/1238 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 288 transitions
Trivial Post-agglo rules discarded 288 transitions
Performed 288 trivial Post agglomeration. Transition count delta: 288
Iterating post reduction 0 with 288 rules applied. Total rules applied 288 place count 1377 transition count 949
Reduce places removed 288 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 290 rules applied. Total rules applied 578 place count 1089 transition count 947
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 579 place count 1088 transition count 947
Performed 140 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 140 Pre rules applied. Total rules applied 579 place count 1088 transition count 807
Deduced a syphon composed of 140 places in 1 ms
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 3 with 280 rules applied. Total rules applied 859 place count 948 transition count 807
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 887 place count 920 transition count 779
Iterating global reduction 3 with 28 rules applied. Total rules applied 915 place count 920 transition count 779
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 915 place count 920 transition count 757
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 959 place count 898 transition count 757
Performed 309 Post agglomeration using F-continuation condition.Transition count delta: 309
Deduced a syphon composed of 309 places in 0 ms
Reduce places removed 309 places and 0 transitions.
Iterating global reduction 3 with 618 rules applied. Total rules applied 1577 place count 589 transition count 448
Renaming transitions due to excessive name length > 1024 char.
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 1578 place count 589 transition count 448
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1580 place count 587 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1581 place count 586 transition count 446
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1581 place count 586 transition count 444
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1585 place count 584 transition count 444
Applied a total of 1585 rules in 117 ms. Remains 584 /1378 variables (removed 794) and now considering 444/1238 (removed 794) transitions.
// Phase 1: matrix 444 rows 584 cols
[2025-06-07 14:49:12] [INFO ] Computed 220 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:49:12] [INFO ] Implicit Places using invariants in 229 ms returned [564, 568]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 230 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 582/1378 places, 444/1238 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 580 transition count 442
Applied a total of 4 rules in 16 ms. Remains 580 /582 variables (removed 2) and now considering 442/444 (removed 2) transitions.
// Phase 1: matrix 442 rows 580 cols
[2025-06-07 14:49:12] [INFO ] Computed 218 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:49:12] [INFO ] Implicit Places using invariants in 226 ms returned []
[2025-06-07 14:49:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:49:13] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 626 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 580/1378 places, 442/1238 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 992 ms. Remains : 580/1378 places, 442/1238 transitions.
[2025-06-07 14:49:13] [INFO ] Flatten gal took : 9 ms
[2025-06-07 14:49:13] [INFO ] Flatten gal took : 9 ms
[2025-06-07 14:49:13] [INFO ] Input system was already deterministic with 442 transitions.
[2025-06-07 14:49:13] [INFO ] Flatten gal took : 17 ms
[2025-06-07 14:49:13] [INFO ] Flatten gal took : 11 ms
[2025-06-07 14:49:13] [INFO ] Time to serialize gal into /tmp/CTLFireability6352728740532092687.gal : 2 ms
[2025-06-07 14:49:13] [INFO ] Time to serialize properties into /tmp/CTLFireability4657472845993918757.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/CTLFireability6352728740532092687.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4657472845993918757.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.42114e+85,2.4813,90040,2,1260,5,337575,6,0,2763,597801,0


Converting to forward existential form...Done !
original formula: AG(!(E(AF((((p1220==1)&&(p183==1))&&(((p123==1)&&(p175==1))||(p1146==1)))) U (p236==1))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,TRUE),!(EG(!((((p1220==1)&&(p183==1))&&(((p123==1)&&(p175==1))||(p1146==1))))))) * (p236==1))] ...162
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t10, t45, t46, t49, t57, t60, t99, t103, t105, t109, t113, t117, t119...293
Detected timeout of ITS tools.
[2025-06-07 14:49:43] [INFO ] Flatten gal took : 10 ms
[2025-06-07 14:49:43] [INFO ] Applying decomposition
[2025-06-07 14:49:43] [INFO ] Flatten gal took : 18 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/graph4263529557363477410.txt' '-o' '/tmp/graph4263529557363477410.bin' '-w' '/tmp/graph4263529557363477410.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4263529557363477410.bin' '-l' '-1' '-v' '-w' '/tmp/graph4263529557363477410.weights' '-q' '0' '-e' '0.001'
[2025-06-07 14:49:43] [INFO ] Decomposing Gal with order
[2025-06-07 14:49:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 14:49:43] [INFO ] Removed a total of 60 redundant transitions.
[2025-06-07 14:49:43] [INFO ] Flatten gal took : 15 ms
[2025-06-07 14:49:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 2 ms.
[2025-06-07 14:49:43] [INFO ] Time to serialize gal into /tmp/CTLFireability6290337254321529335.gal : 3 ms
[2025-06-07 14:49:43] [INFO ] Time to serialize properties into /tmp/CTLFireability10110382384960309995.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/CTLFireability6290337254321529335.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10110382384960309995.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.42114e+85,8.45797,280076,213,29,545619,241,644,1.74702e+06,52,1188,0


Converting to forward existential form...Done !
original formula: AG(!(E(AF((((i14.u129.p1220==1)&&(i2.u18.p183==1))&&(((i1.u12.p123==1)&&(i1.u17.p175==1))||(i15.u121.p1146==1)))) U (i2.u26.p236==1))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,TRUE),!(EG(!((((i14.u129.p1220==1)&&(i2.u18.p183==1))&&(((i1.u12.p123==1)&&(i1.u17.p175==1))||(...208
Reverse transition relation is NOT exact ! Due to transitions i0.u2.t0, i0.u5.t99, i0.u3.t1, i0.u8.t109, i0.u6.t103, i0.u7.t105, i0.u4.t2, i0.u16.t119, i1....456
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1378/1378 places, 1238/1238 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 285 transitions
Trivial Post-agglo rules discarded 285 transitions
Performed 285 trivial Post agglomeration. Transition count delta: 285
Iterating post reduction 0 with 285 rules applied. Total rules applied 285 place count 1377 transition count 952
Reduce places removed 285 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 287 rules applied. Total rules applied 572 place count 1092 transition count 950
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 576 place count 1091 transition count 947
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 579 place count 1088 transition count 947
Performed 139 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 139 Pre rules applied. Total rules applied 579 place count 1088 transition count 808
Deduced a syphon composed of 139 places in 0 ms
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 4 with 278 rules applied. Total rules applied 857 place count 949 transition count 808
Discarding 28 places :
Symmetric choice reduction at 4 with 28 rule applications. Total rules 885 place count 921 transition count 780
Iterating global reduction 4 with 28 rules applied. Total rules applied 913 place count 921 transition count 780
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 23 Pre rules applied. Total rules applied 913 place count 921 transition count 757
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 959 place count 898 transition count 757
Performed 310 Post agglomeration using F-continuation condition.Transition count delta: 310
Deduced a syphon composed of 310 places in 0 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 4 with 620 rules applied. Total rules applied 1579 place count 588 transition count 447
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1581 place count 586 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1582 place count 585 transition count 445
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1582 place count 585 transition count 443
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1586 place count 583 transition count 443
Applied a total of 1586 rules in 100 ms. Remains 583 /1378 variables (removed 795) and now considering 443/1238 (removed 795) transitions.
// Phase 1: matrix 443 rows 583 cols
[2025-06-07 14:50:13] [INFO ] Computed 220 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:50:13] [INFO ] Implicit Places using invariants in 228 ms returned [563, 567]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 229 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 581/1378 places, 443/1238 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 579 transition count 441
Applied a total of 4 rules in 16 ms. Remains 579 /581 variables (removed 2) and now considering 441/443 (removed 2) transitions.
// Phase 1: matrix 441 rows 579 cols
[2025-06-07 14:50:13] [INFO ] Computed 218 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:50:13] [INFO ] Implicit Places using invariants in 240 ms returned []
[2025-06-07 14:50:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:50:14] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 579/1378 places, 441/1238 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 976 ms. Remains : 579/1378 places, 441/1238 transitions.
[2025-06-07 14:50:14] [INFO ] Flatten gal took : 9 ms
[2025-06-07 14:50:14] [INFO ] Flatten gal took : 10 ms
[2025-06-07 14:50:14] [INFO ] Input system was already deterministic with 441 transitions.
[2025-06-07 14:50:14] [INFO ] Flatten gal took : 10 ms
[2025-06-07 14:50:14] [INFO ] Flatten gal took : 9 ms
[2025-06-07 14:50:14] [INFO ] Time to serialize gal into /tmp/CTLFireability15691277933546972793.gal : 1 ms
[2025-06-07 14:50:14] [INFO ] Time to serialize properties into /tmp/CTLFireability3617360409716391999.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/CTLFireability15691277933546972793.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3617360409716391999.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.71619e+85,2.08903,75612,2,1283,5,277923,6,0,2758,485634,0


Converting to forward existential form...Done !
original formula: EG((EF((((p1007==1)||(p375==1))&&(p327==0))) * (EG(((p738==0)||(p740==0))) + EG(((p111==0)||(p147==0))))))
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U (((p1007==1)||(p375==1))&&(p327==0))) * (EG(((p738==0)||(p740==0))) + EG(((p111==0)||(p147=...173
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t15, t58, t61, t92, t96, t100, t102, t106, ...345
Detected timeout of ITS tools.
[2025-06-07 14:50:44] [INFO ] Flatten gal took : 16 ms
[2025-06-07 14:50:44] [INFO ] Applying decomposition
[2025-06-07 14:50:44] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7230340318413297322.txt' '-o' '/tmp/graph7230340318413297322.bin' '-w' '/tmp/graph7230340318413297322.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7230340318413297322.bin' '-l' '-1' '-v' '-w' '/tmp/graph7230340318413297322.weights' '-q' '0' '-e' '0.001'
[2025-06-07 14:50:44] [INFO ] Decomposing Gal with order
[2025-06-07 14:50:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 14:50:44] [INFO ] Removed a total of 60 redundant transitions.
[2025-06-07 14:50:44] [INFO ] Flatten gal took : 13 ms
[2025-06-07 14:50:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2025-06-07 14:50:44] [INFO ] Time to serialize gal into /tmp/CTLFireability8556086574491847290.gal : 3 ms
[2025-06-07 14:50:44] [INFO ] Time to serialize properties into /tmp/CTLFireability10753653350650117395.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/CTLFireability8556086574491847290.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10753653350650117395.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.71619e+85,8.79202,309152,201,24,586333,214,634,2.12136e+06,48,1090,0


Converting to forward existential form...Done !
original formula: EG((EF((((i14.u105.p1007==1)||(i4.u40.p375==1))&&(i2.u33.p327==0))) * (EG(((i11.u77.p738==0)||(i11.u77.p740==0))) + EG(((i1.u10.p111==0)|...177
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U (((i14.u105.p1007==1)||(i4.u40.p375==1))&&(i2.u33.p327==0))) * (EG(((i11.u77.p738==0)||(i11...226
Reverse transition relation is NOT exact ! Due to transitions i0.u3.t1, i0.u7.t102, i0.u6.t100, i0.u8.t106, i0.u4.t2, i0.u16.t117, i0.u2.t0, i0.u5.t96, i1....575
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1378/1378 places, 1238/1238 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 1343 transition count 1203
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 1343 transition count 1203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 1342 transition count 1202
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 1342 transition count 1202
Applied a total of 72 rules in 137 ms. Remains 1342 /1378 variables (removed 36) and now considering 1202/1238 (removed 36) transitions.
// Phase 1: matrix 1202 rows 1342 cols
[2025-06-07 14:51:14] [INFO ] Computed 221 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:51:15] [INFO ] Implicit Places using invariants in 369 ms returned []
[2025-06-07 14:51:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:51:16] [INFO ] Implicit Places using invariants and state equation in 934 ms returned []
Implicit Place search using SMT with State Equation took 1312 ms to find 0 implicit places.
Running 1201 sub problems to find dead transitions.
[2025-06-07 14:51:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1341/2544 variables, and 0 constraints, problems are : Problem set: 0 solved, 1201 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 0/221 constraints, State Equation: 0/1342 constraints, PredecessorRefiner: 1201/1201 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1201 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1341/2544 variables, and 0 constraints, problems are : Problem set: 0 solved, 1201 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 0/221 constraints, State Equation: 0/1342 constraints, PredecessorRefiner: 0/1201 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60194ms problems are : Problem set: 0 solved, 1201 unsolved
Search for dead transitions found 0 dead transitions in 60197ms
Starting structural reductions in LTL mode, iteration 1 : 1342/1378 places, 1202/1238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61650 ms. Remains : 1342/1378 places, 1202/1238 transitions.
[2025-06-07 14:52:16] [INFO ] Flatten gal took : 20 ms
[2025-06-07 14:52:16] [INFO ] Flatten gal took : 20 ms
[2025-06-07 14:52:16] [INFO ] Input system was already deterministic with 1202 transitions.
[2025-06-07 14:52:16] [INFO ] Flatten gal took : 19 ms
[2025-06-07 14:52:16] [INFO ] Flatten gal took : 20 ms
[2025-06-07 14:52:16] [INFO ] Time to serialize gal into /tmp/CTLFireability6466209480535204035.gal : 4 ms
[2025-06-07 14:52:16] [INFO ] Time to serialize properties into /tmp/CTLFireability7887081298567349621.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/CTLFireability6466209480535204035.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7887081298567349621.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-07 14:53:16] [INFO ] Flatten gal took : 21 ms
[2025-06-07 14:53:16] [INFO ] Flatten gal took : 21 ms
[2025-06-07 14:53:16] [INFO ] Applying decomposition
[2025-06-07 14:53:16] [INFO ] Flatten gal took : 21 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/graph18025445396419969403.txt' '-o' '/tmp/graph18025445396419969403.bin' '-w' '/tmp/graph18025445396419969403.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18025445396419969403.bin' '-l' '-1' '-v' '-w' '/tmp/graph18025445396419969403.weights' '-q' '0' '-e' '0.001'
[2025-06-07 14:53:16] [INFO ] Decomposing Gal with order
[2025-06-07 14:53:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 14:53:16] [INFO ] Removed a total of 176 redundant transitions.
[2025-06-07 14:53:16] [INFO ] Flatten gal took : 50 ms
[2025-06-07 14:53:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-07 14:53:16] [INFO ] Time to serialize gal into /tmp/CTLFireability4287462322570466855.gal : 7 ms
[2025-06-07 14:53:16] [INFO ] Time to serialize properties into /tmp/CTLFireability12066541928073541252.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/CTLFireability4287462322570466855.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12066541928073541252.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 15 CTL formulae.

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="ShieldPPPt-PT-020B"
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 ShieldPPPt-PT-020B, 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 r198-tall-174894533600882"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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