About the Execution of ITS-Tools for DES-PT-10b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | ????T?????F??F?? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r058-smll-174854063900290.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 DES-PT-10b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854063900290
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K 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 58K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 79K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME DES-PT-10b-CTLFireability-2023-12
FORMULA_NAME DES-PT-10b-CTLFireability-2023-13
FORMULA_NAME DES-PT-10b-CTLFireability-2023-14
FORMULA_NAME DES-PT-10b-CTLFireability-2023-15
FORMULA_NAME DES-PT-10b-CTLFireability-2025-00
FORMULA_NAME DES-PT-10b-CTLFireability-2025-01
FORMULA_NAME DES-PT-10b-CTLFireability-2025-02
FORMULA_NAME DES-PT-10b-CTLFireability-2025-03
FORMULA_NAME DES-PT-10b-CTLFireability-2025-04
FORMULA_NAME DES-PT-10b-CTLFireability-2025-05
FORMULA_NAME DES-PT-10b-CTLFireability-2025-06
FORMULA_NAME DES-PT-10b-CTLFireability-2025-07
FORMULA_NAME DES-PT-10b-CTLFireability-2025-08
FORMULA_NAME DES-PT-10b-CTLFireability-2025-09
FORMULA_NAME DES-PT-10b-CTLFireability-2025-10
FORMULA_NAME DES-PT-10b-CTLFireability-2025-11
=== Now, execution of the tool begins
BK_START 1748685752814
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-10b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-05-31 10:02:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-31 10:02:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 10:02:35] [INFO ] Load time of PNML (sax parser for PT used): 204 ms
[2025-05-31 10:02:35] [INFO ] Transformed 320 places.
[2025-05-31 10:02:35] [INFO ] Transformed 271 transitions.
[2025-05-31 10:02:35] [INFO ] Found NUPN structural information;
[2025-05-31 10:02:35] [INFO ] Parsed PT model containing 320 places and 271 transitions and 827 arcs in 443 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 33 ms.
Support contains 117 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 271/271 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 317 transition count 271
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 13 place count 307 transition count 261
Iterating global reduction 1 with 10 rules applied. Total rules applied 23 place count 307 transition count 261
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 29 place count 301 transition count 255
Iterating global reduction 1 with 6 rules applied. Total rules applied 35 place count 301 transition count 255
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 40 place count 301 transition count 250
Applied a total of 40 rules in 172 ms. Remains 301 /320 variables (removed 19) and now considering 250/271 (removed 21) transitions.
// Phase 1: matrix 250 rows 301 cols
[2025-05-31 10:02:36] [INFO ] Computed 62 invariants in 42 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 10:02:37] [INFO ] Implicit Places using invariants in 698 ms returned []
[2025-05-31 10:02:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 10:02:37] [INFO ] Implicit Places using invariants and state equation in 731 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1501 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 300/320 places, 250/271 transitions.
Applied a total of 0 rules in 11 ms. Remains 300 /300 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1716 ms. Remains : 300/320 places, 250/271 transitions.
Support contains 117 out of 300 places after structural reductions.
[2025-05-31 10:02:38] [INFO ] Flatten gal took : 73 ms
[2025-05-31 10:02:38] [INFO ] Flatten gal took : 36 ms
[2025-05-31 10:02:38] [INFO ] Input system was already deterministic with 250 transitions.
Support contains 116 out of 300 places (down from 117) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 97 to 95
RANDOM walk for 40000 steps (349 resets) in 1976 ms. (20 steps per ms) remains 12/95 properties
BEST_FIRST walk for 40004 steps (57 resets) in 245 ms. (162 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40003 steps (46 resets) in 315 ms. (126 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (59 resets) in 236 ms. (168 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (46 resets) in 245 ms. (162 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (44 resets) in 103 ms. (384 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (48 resets) in 200 ms. (199 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40002 steps (49 resets) in 135 ms. (294 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (59 resets) in 157 ms. (253 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (53 resets) in 171 ms. (232 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (46 resets) in 139 ms. (285 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (50 resets) in 200 ms. (199 steps per ms) remains 10/10 properties
// Phase 1: matrix 250 rows 300 cols
[2025-05-31 10:02:39] [INFO ] Computed 61 invariants in 15 ms
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/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 171/189 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 90/279 variables, 26/59 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 4/283 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 236/519 variables, 283/344 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/519 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 19/538 variables, 11/355 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/538 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp56 is UNSAT
At refinement iteration 11 (OVERLAPS) 6/544 variables, 3/358 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:02:41] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:02:41] [INFO ] Deduced a trap composed of 16 places in 135 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:02:41] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:02:41] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:02:41] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:02:41] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:02:42] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:02:42] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:02:42] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:02:42] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 11 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/544 variables, 10/368 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/544 variables, 0/368 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 4/548 variables, 2/370 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/548 variables, 0/370 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 2/550 variables, 1/371 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/550 variables, 0/371 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 0/550 variables, 0/371 constraints. Problems are: Problem set: 1 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 550/550 variables, and 371 constraints, problems are : Problem set: 1 solved, 9 unsolved in 3650 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 9 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 136/152 variables, 27/27 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/27 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 36/188 variables, 6/33 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/33 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 90/278 variables, 26/59 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 6/65 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 0/65 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 4/282 variables, 2/67 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 0/67 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 235/517 variables, 282/349 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/517 variables, 9/358 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:02:44] [INFO ] Deduced a trap along path composed of 3 places in 87 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:02:44] [INFO ] Deduced a trap along path composed of 3 places in 57 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:02:44] [INFO ] Deduced a trap along path composed of 3 places in 61 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/517 variables, 3/361 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/517 variables, 0/361 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 21/538 variables, 12/373 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/538 variables, 4/377 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:02:46] [INFO ] Deduced a trap composed of 29 places in 191 ms of which 21 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/538 variables, 1/378 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/538 variables, 0/378 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 6/544 variables, 3/381 constraints. Problems are: Problem set: 1 solved, 9 unsolved
(s240 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
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 1)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 0)
(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 0)
(s39 0)
(s40 0)
(s41 1)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 1)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 1)
(s64 1)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 1)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 1)
(s89 0)
(s90 0)
(s91 0)
(s92 1)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 1)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s108 0)
(s109 1)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 1)
(s125 0)
(s126 1)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 1)
(s141 0)
(s142 0)
(s143 1)
(s144 1)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 1)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 1)
(s163 0)
(s164 0)
(s165 1)
(s166 0)
(s167 0)
(s168 0)
(s169 1)
(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 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 1)
(s202 0)
(s203 0)
(s204 0)
(s205 1)
(s206 0)
(s207 1)
(s208 0)
(s209 0)
(s210 1)
(s211 0)
(s212 0)
(s213 1)
(s214 0)
(s215 0)
(s216 0)
(s217 1)
(s218 0)
(s219 1)
(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 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 544/550 variables, and 381 constraints, problems are : Problem set: 1 solved, 9 unsolved in 5026 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 297/300 constraints, PredecessorRefiner: 9/10 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 8736ms problems are : Problem set: 1 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 16 out of 300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 250/250 transitions.
Graph (complete) has 578 edges and 300 vertex of which 294 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 294 transition count 227
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 37 place count 277 transition count 227
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 37 place count 277 transition count 217
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 57 place count 267 transition count 217
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 69 place count 255 transition count 205
Iterating global reduction 2 with 12 rules applied. Total rules applied 81 place count 255 transition count 205
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 2 with 4 rules applied. Total rules applied 85 place count 255 transition count 201
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 86 place count 254 transition count 201
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 86 place count 254 transition count 200
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 88 place count 253 transition count 200
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 93 place count 248 transition count 195
Iterating global reduction 4 with 5 rules applied. Total rules applied 98 place count 248 transition count 195
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 4 with 5 rules applied. Total rules applied 103 place count 248 transition count 190
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 105 place count 247 transition count 189
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 105 place count 247 transition count 187
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 109 place count 245 transition count 187
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 6 with 142 rules applied. Total rules applied 251 place count 174 transition count 116
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 259 place count 170 transition count 125
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 260 place count 170 transition count 124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 261 place count 169 transition count 124
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 262 place count 168 transition count 123
Applied a total of 262 rules in 352 ms. Remains 168 /300 variables (removed 132) and now considering 123/250 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 353 ms. Remains : 168/300 places, 123/250 transitions.
RANDOM walk for 40000 steps (1457 resets) in 1057 ms. (37 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (259 resets) in 231 ms. (172 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (282 resets) in 150 ms. (264 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (245 resets) in 161 ms. (246 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (260 resets) in 157 ms. (253 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (266 resets) in 149 ms. (266 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (277 resets) in 120 ms. (330 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (263 resets) in 113 ms. (350 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (272 resets) in 130 ms. (305 steps per ms) remains 8/8 properties
// Phase 1: matrix 123 rows 168 cols
[2025-05-31 10:02:49] [INFO ] Computed 61 invariants in 7 ms
[2025-05-31 10:02:49] [INFO ] State equation strengthened by 16 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/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 35/48 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 62/110 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 50/160 variables, 24/61 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 123/283 variables, 160/221 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 16/237 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/283 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 8/291 variables, 8/245 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/291 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 0/291 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 245 constraints, problems are : Problem set: 0 solved, 8 unsolved in 802 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 168/168 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 35/48 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 62/110 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 50/160 variables, 24/61 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 123/283 variables, 160/221 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 16/237 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/283 variables, 6/243 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:02:51] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 12 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/283 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/283 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 8/291 variables, 8/252 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/291 variables, 2/254 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/291 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:02:54] [INFO ] Deduced a trap along path composed of 3 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:02:54] [INFO ] Deduced a trap along path composed of 4 places in 46 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/291 variables, 2/256 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:02:54] [INFO ] Deduced a trap along path composed of 5 places in 36 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/291 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/291 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 0/291 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 257 constraints, problems are : Problem set: 0 solved, 8 unsolved in 6509 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 168/168 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 7342ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 8792 ms.
Support contains 13 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 123/123 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 167 transition count 122
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 166 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 166 transition count 119
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 12 place count 166 transition count 111
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 165 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 164 transition count 110
Applied a total of 14 rules in 32 ms. Remains 164 /168 variables (removed 4) and now considering 110/123 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 164/168 places, 110/123 transitions.
RANDOM walk for 40000 steps (1546 resets) in 249 ms. (160 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (303 resets) in 98 ms. (404 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (322 resets) in 115 ms. (344 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (297 resets) in 99 ms. (400 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (317 resets) in 118 ms. (336 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (313 resets) in 111 ms. (357 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (309 resets) in 125 ms. (317 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (303 resets) in 115 ms. (344 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (334 resets) in 137 ms. (289 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 554977 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :0 out of 8
Probabilistic random walk after 554977 steps, saw 87129 distinct states, run finished after 3008 ms. (steps per millisecond=184 ) properties seen :0
// Phase 1: matrix 110 rows 164 cols
[2025-05-31 10:03:09] [INFO ] Computed 60 invariants in 3 ms
[2025-05-31 10:03:09] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 34/47 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 57/104 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 51/155 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 1/156 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 110/266 variables, 156/216 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/266 variables, 6/222 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/266 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 8/274 variables, 8/230 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/274 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 0/274 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 230 constraints, problems are : Problem set: 0 solved, 8 unsolved in 554 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 164/164 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 34/47 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 57/104 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 51/155 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 1/156 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 110/266 variables, 156/216 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/266 variables, 6/222 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/266 variables, 6/228 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:03:10] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 17 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 8/274 variables, 8/237 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/274 variables, 2/239 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/274 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 0/274 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 274/274 variables, and 239 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3118 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 164/164 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3691ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 5755 ms.
Support contains 13 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 110/110 transitions.
Applied a total of 0 rules in 11 ms. Remains 164 /164 variables (removed 0) and now considering 110/110 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 164/164 places, 110/110 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 110/110 transitions.
Applied a total of 0 rules in 7 ms. Remains 164 /164 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2025-05-31 10:03:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 10:03:19] [INFO ] Implicit Places using invariants in 200 ms returned []
[2025-05-31 10:03:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 10:03:19] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-05-31 10:03:19] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 10:03:19] [INFO ] Redundant transitions in 3 ms returned []
Running 107 sub problems to find dead transitions.
[2025-05-31 10:03:19] [INFO ] Invariant cache hit.
[2025-05-31 10:03:19] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (OVERLAPS) 3/164 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (OVERLAPS) 110/274 variables, 164/224 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 6/230 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (OVERLAPS) 0/274 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 230 constraints, problems are : Problem set: 0 solved, 107 unsolved in 8445 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 164/164 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (OVERLAPS) 3/164 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (OVERLAPS) 110/274 variables, 164/224 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 6/230 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 107/337 constraints. Problems are: Problem set: 0 solved, 107 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:03:34] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:03:36] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:03:36] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:03:37] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:03:38] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 5/342 constraints. Problems are: Problem set: 0 solved, 107 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:03:44] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 12 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 107 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:03:54] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 274/274 variables, and 344 constraints, problems are : Problem set: 0 solved, 107 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 164/164 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38539ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 38541ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39039 ms. Remains : 164/164 places, 110/110 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 10 ms. Remains 164 /164 variables (removed 0) and now considering 110/110 (removed 0) transitions.
Running SMT prover for 8 properties.
[2025-05-31 10:03:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 10:03:58] [INFO ] [Real]Absence check using 36 positive place invariants in 12 ms returned sat
[2025-05-31 10:03:58] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2025-05-31 10:03:58] [INFO ] After 293ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 10:03:58] [INFO ] [Nat]Absence check using 36 positive place invariants in 14 ms returned sat
[2025-05-31 10:03:58] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 16 ms returned sat
[2025-05-31 10:03:58] [INFO ] After 238ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:03:58] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 14 ms to minimize.
[2025-05-31 10:03:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
TRAPS : Iteration 1
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:03:59] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 5 ms to minimize.
[2025-05-31 10:03:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:03:59] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 10 ms to minimize.
[2025-05-31 10:03:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
TRAPS : Iteration 2
[2025-05-31 10:03:59] [INFO ] After 1114ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
[2025-05-31 10:03:59] [INFO ] After 1453ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Over-approximation ignoring read arcs solved 0 properties in 1785 ms.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2025-05-31 10:03:59] [INFO ] Flatten gal took : 37 ms
[2025-05-31 10:03:59] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DES-PT-10b-CTLFireability-2025-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-31 10:03:59] [INFO ] Flatten gal took : 39 ms
[2025-05-31 10:03:59] [INFO ] Input system was already deterministic with 250 transitions.
Support contains 104 out of 300 places (down from 115) after GAL structural reductions.
Computed a total of 105 stabilizing places and 98 stable transitions
Graph (complete) has 578 edges and 300 vertex of which 294 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.12 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 300/300 places, 250/250 transitions.
Graph (complete) has 578 edges and 300 vertex of which 294 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 293 transition count 227
Reduce places removed 18 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 275 transition count 226
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 39 place count 274 transition count 226
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 39 place count 274 transition count 217
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 57 place count 265 transition count 217
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 70 place count 252 transition count 204
Iterating global reduction 3 with 13 rules applied. Total rules applied 83 place count 252 transition count 204
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 87 place count 252 transition count 200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 88 place count 251 transition count 200
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 88 place count 251 transition count 199
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 90 place count 250 transition count 199
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 96 place count 244 transition count 193
Iterating global reduction 5 with 6 rules applied. Total rules applied 102 place count 244 transition count 193
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 6 rules applied. Total rules applied 108 place count 244 transition count 187
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 110 place count 243 transition count 186
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 3 Pre rules applied. Total rules applied 110 place count 243 transition count 183
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 116 place count 240 transition count 183
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 7 with 142 rules applied. Total rules applied 258 place count 169 transition count 112
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 260 place count 167 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 261 place count 166 transition count 110
Applied a total of 261 rules in 115 ms. Remains 166 /300 variables (removed 134) and now considering 110/250 (removed 140) transitions.
// Phase 1: matrix 110 rows 166 cols
[2025-05-31 10:03:59] [INFO ] Computed 58 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 10:04:00] [INFO ] Implicit Places using invariants in 247 ms returned []
[2025-05-31 10:04:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 10:04:00] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 569 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 10:04:00] [INFO ] Redundant transitions in 3 ms returned []
Running 107 sub problems to find dead transitions.
[2025-05-31 10:04:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (OVERLAPS) 2/165 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 110/275 variables, 165/223 constraints. Problems are: Problem set: 0 solved, 107 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:04:03] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:04:03] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:04:03] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:04:04] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 4/227 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 1/276 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 107 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:04:07] [INFO ] Deduced a trap composed of 18 places in 147 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:04:07] [INFO ] Deduced a trap composed of 19 places in 155 ms of which 18 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/276 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 11 (OVERLAPS) 0/276 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/276 variables, and 230 constraints, problems are : Problem set: 0 solved, 107 unsolved in 11727 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 2/165 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (OVERLAPS) 110/275 variables, 165/229 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 107/336 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (OVERLAPS) 1/276 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/276 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 107 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 276/276 variables, and 337 constraints, problems are : Problem set: 0 solved, 107 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41762ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 41763ms
Starting structural reductions in SI_CTL mode, iteration 1 : 166/300 places, 110/250 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42458 ms. Remains : 166/300 places, 110/250 transitions.
[2025-05-31 10:04:42] [INFO ] Flatten gal took : 20 ms
[2025-05-31 10:04:42] [INFO ] Flatten gal took : 21 ms
[2025-05-31 10:04:42] [INFO ] Input system was already deterministic with 110 transitions.
[2025-05-31 10:04:42] [INFO ] Flatten gal took : 18 ms
[2025-05-31 10:04:42] [INFO ] Flatten gal took : 18 ms
[2025-05-31 10:04:42] [INFO ] Time to serialize gal into /tmp/CTLFireability6044704222074932661.gal : 8 ms
[2025-05-31 10:04:42] [INFO ] Time to serialize properties into /tmp/CTLFireability2873673973625512333.ctl : 6 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/CTLFireability6044704222074932661.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2873673973625512333.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-05-31 10:05:12] [INFO ] Flatten gal took : 10 ms
[2025-05-31 10:05:12] [INFO ] Applying decomposition
[2025-05-31 10:05:12] [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/graph6798805881206772200.txt' '-o' '/tmp/graph6798805881206772200.bin' '-w' '/tmp/graph6798805881206772200.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6798805881206772200.bin' '-l' '-1' '-v' '-w' '/tmp/graph6798805881206772200.weights' '-q' '0' '-e' '0.001'
[2025-05-31 10:05:12] [INFO ] Decomposing Gal with order
[2025-05-31 10:05:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 10:05:12] [INFO ] Removed a total of 8 redundant transitions.
[2025-05-31 10:05:12] [INFO ] Flatten gal took : 72 ms
[2025-05-31 10:05:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 9 ms.
[2025-05-31 10:05:12] [INFO ] Time to serialize gal into /tmp/CTLFireability11386317403064101786.gal : 12 ms
[2025-05-31 10:05:12] [INFO ] Time to serialize properties into /tmp/CTLFireability17863112145542624715.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/CTLFireability11386317403064101786.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17863112145542624715.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.78053e+13,0.423487,17824,2072,616,38544,1549,313,28296,149,6031,0
Converting to forward existential form...Done !
original formula: AG(EF((i0.u3.p84==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (i0.u3.p84==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t71, t92, t95, t98, u15.t32, u16.t74, u51.t2, u51.t100, i0.t51, i0.u2.t13, i0.u2.t17,...382
(forward)formula 0,1,2.17627,74784,1,0,188652,7903,1670,143316,1311,29940,257874
FORMULA DES-PT-10b-CTLFireability-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 250/250 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 283 transition count 233
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 283 transition count 233
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 283 transition count 230
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 43 place count 277 transition count 224
Iterating global reduction 1 with 6 rules applied. Total rules applied 49 place count 277 transition count 224
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 54 place count 277 transition count 219
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 276 transition count 218
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 276 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 276 transition count 217
Applied a total of 57 rules in 23 ms. Remains 276 /300 variables (removed 24) and now considering 217/250 (removed 33) transitions.
// Phase 1: matrix 217 rows 276 cols
[2025-05-31 10:05:15] [INFO ] Computed 61 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 10:05:15] [INFO ] Implicit Places using invariants in 310 ms returned []
[2025-05-31 10:05:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 10:05:15] [INFO ] Implicit Places using invariants and state equation in 540 ms returned []
Implicit Place search using SMT with State Equation took 852 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2025-05-31 10:05:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 1/276 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (OVERLAPS) 217/493 variables, 276/337 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:23] [INFO ] Deduced a trap composed of 7 places in 268 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:23] [INFO ] Deduced a trap composed of 8 places in 265 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:24] [INFO ] Deduced a trap composed of 10 places in 210 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:24] [INFO ] Deduced a trap composed of 12 places in 190 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:24] [INFO ] Deduced a trap composed of 13 places in 202 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:24] [INFO ] Deduced a trap composed of 19 places in 186 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:24] [INFO ] Deduced a trap composed of 21 places in 150 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:25] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:25] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:25] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:25] [INFO ] Deduced a trap composed of 25 places in 154 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:25] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:25] [INFO ] Deduced a trap composed of 30 places in 141 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:26] [INFO ] Deduced a trap composed of 26 places in 186 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:26] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:26] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:26] [INFO ] Deduced a trap composed of 22 places in 175 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:27] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:27] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:27] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/493 variables, 20/357 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:31] [INFO ] Deduced a trap composed of 13 places in 197 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:31] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:31] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:31] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:31] [INFO ] Deduced a trap composed of 30 places in 184 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:32] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:32] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:33] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:33] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:33] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:34] [INFO ] Deduced a trap composed of 29 places in 135 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:34] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:34] [INFO ] Deduced a trap composed of 13 places in 192 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:34] [INFO ] Deduced a trap composed of 14 places in 191 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:34] [INFO ] Deduced a trap composed of 40 places in 147 ms of which 27 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/493 variables, 15/372 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:36] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:36] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:36] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:36] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:37] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:38] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:38] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:38] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:38] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:38] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:38] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/493 variables, 11/383 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:41] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:41] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:41] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:41] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:41] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:41] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:41] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:42] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:42] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:42] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:43] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 8 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/493 variables, 11/394 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 493/493 variables, and 394 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 57/57 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 1/276 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 57/118 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:48] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:48] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:48] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:48] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:48] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:49] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:49] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 7/125 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:51] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:05:53] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 17 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 9 (OVERLAPS) 217/493 variables, 276/403 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/493 variables, 216/619 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:06:06] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:06:06] [INFO ] Deduced a trap composed of 27 places in 201 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:06:07] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:06:09] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:06:09] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:06:09] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:06:09] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:06:11] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 493/493 variables, and 627 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 74/74 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60069ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 60072ms
Starting structural reductions in LTL mode, iteration 1 : 276/300 places, 217/250 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60949 ms. Remains : 276/300 places, 217/250 transitions.
[2025-05-31 10:06:16] [INFO ] Flatten gal took : 23 ms
[2025-05-31 10:06:16] [INFO ] Flatten gal took : 23 ms
[2025-05-31 10:06:16] [INFO ] Input system was already deterministic with 217 transitions.
[2025-05-31 10:06:16] [INFO ] Flatten gal took : 21 ms
[2025-05-31 10:06:16] [INFO ] Flatten gal took : 22 ms
[2025-05-31 10:06:16] [INFO ] Time to serialize gal into /tmp/CTLFireability11107034303215238181.gal : 9 ms
[2025-05-31 10:06:16] [INFO ] Time to serialize properties into /tmp/CTLFireability11685899541355039185.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11107034303215238181.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11685899541355039185.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-05-31 10:06:46] [INFO ] Flatten gal took : 14 ms
[2025-05-31 10:06:46] [INFO ] Applying decomposition
[2025-05-31 10:06:46] [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/graph6634244752981202549.txt' '-o' '/tmp/graph6634244752981202549.bin' '-w' '/tmp/graph6634244752981202549.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6634244752981202549.bin' '-l' '-1' '-v' '-w' '/tmp/graph6634244752981202549.weights' '-q' '0' '-e' '0.001'
[2025-05-31 10:06:46] [INFO ] Decomposing Gal with order
[2025-05-31 10:06:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 10:06:46] [INFO ] Removed a total of 11 redundant transitions.
[2025-05-31 10:06:46] [INFO ] Flatten gal took : 29 ms
[2025-05-31 10:06:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2025-05-31 10:06:46] [INFO ] Time to serialize gal into /tmp/CTLFireability1735064657022977320.gal : 10 ms
[2025-05-31 10:06:46] [INFO ] Time to serialize properties into /tmp/CTLFireability16529509094037903020.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/CTLFireability1735064657022977320.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16529509094037903020.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,2.76854e+19,24.3042,510152,27368,438,1.35376e+06,2614,629,969617,160,7546,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 250/250 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 282 transition count 232
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 282 transition count 232
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 282 transition count 230
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 44 place count 276 transition count 224
Iterating global reduction 1 with 6 rules applied. Total rules applied 50 place count 276 transition count 224
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 54 place count 276 transition count 220
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 275 transition count 219
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 275 transition count 219
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 275 transition count 218
Applied a total of 57 rules in 24 ms. Remains 275 /300 variables (removed 25) and now considering 218/250 (removed 32) transitions.
// Phase 1: matrix 218 rows 275 cols
[2025-05-31 10:07:16] [INFO ] Computed 61 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 10:07:16] [INFO ] Implicit Places using invariants in 244 ms returned []
[2025-05-31 10:07:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 10:07:17] [INFO ] Implicit Places using invariants and state equation in 481 ms returned []
Implicit Place search using SMT with State Equation took 728 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2025-05-31 10:07:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/275 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 217 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 218/493 variables, 275/336 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:24] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:25] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:25] [INFO ] Deduced a trap composed of 8 places in 186 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:25] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:25] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:25] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:26] [INFO ] Deduced a trap composed of 30 places in 140 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:26] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:26] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:26] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:26] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:26] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:27] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:27] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:27] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:27] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:27] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:27] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:27] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:28] [INFO ] Deduced a trap composed of 11 places in 225 ms of which 18 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/493 variables, 20/356 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:29] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:29] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:29] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:30] [INFO ] Deduced a trap composed of 38 places in 129 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:31] [INFO ] Deduced a trap composed of 40 places in 144 ms of which 26 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/493 variables, 5/361 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:33] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:34] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:34] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:34] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:35] [INFO ] Deduced a trap composed of 21 places in 167 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:35] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:35] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:35] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:35] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:35] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/493 variables, 10/371 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:38] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/493 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:44] [INFO ] Deduced a trap along path composed of 4 places in 61 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:45] [INFO ] Deduced a trap along path composed of 3 places in 34 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/493 variables, 2/374 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 (/ 1.0 10.0))
(s5 (/ 9.0 10.0))
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 (/ 1.0 10.0))
(s37 (/ 9.0 10.0))
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 1.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 493/493 variables, and 374 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 275/275 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 36/36 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/275 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 36/97 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:48] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:49] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:49] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:49] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:49] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:50] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 16 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 6/103 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:51] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:51] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:51] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:51] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:52] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:53] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 6/109 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:53] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:53] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:53] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:53] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:53] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:54] [INFO ] Deduced a trap composed of 29 places in 151 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:55] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 7/116 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:07:57] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 16 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/275 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (OVERLAPS) 218/493 variables, 275/392 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/493 variables, 217/609 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:08:14] [INFO ] Deduced a trap composed of 20 places in 205 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:08:14] [INFO ] Deduced a trap composed of 22 places in 158 ms of which 15 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 493/493 variables, and 611 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 275/275 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 58/58 constraints, Known Traps Along Path: 0/2 constraints]
After SMT, in 60050ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 60054ms
Starting structural reductions in LTL mode, iteration 1 : 275/300 places, 218/250 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60807 ms. Remains : 275/300 places, 218/250 transitions.
[2025-05-31 10:08:17] [INFO ] Flatten gal took : 18 ms
[2025-05-31 10:08:17] [INFO ] Flatten gal took : 12 ms
[2025-05-31 10:08:17] [INFO ] Input system was already deterministic with 218 transitions.
[2025-05-31 10:08:17] [INFO ] Flatten gal took : 12 ms
[2025-05-31 10:08:17] [INFO ] Flatten gal took : 11 ms
[2025-05-31 10:08:17] [INFO ] Time to serialize gal into /tmp/CTLFireability17362948728007641359.gal : 7 ms
[2025-05-31 10:08:17] [INFO ] Time to serialize properties into /tmp/CTLFireability11196237576872259329.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/CTLFireability17362948728007641359.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11196237576872259329.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-05-31 10:08:47] [INFO ] Flatten gal took : 8 ms
[2025-05-31 10:08:47] [INFO ] Applying decomposition
[2025-05-31 10:08:47] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1510562639136744217.txt' '-o' '/tmp/graph1510562639136744217.bin' '-w' '/tmp/graph1510562639136744217.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1510562639136744217.bin' '-l' '-1' '-v' '-w' '/tmp/graph1510562639136744217.weights' '-q' '0' '-e' '0.001'
[2025-05-31 10:08:47] [INFO ] Decomposing Gal with order
[2025-05-31 10:08:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 10:08:47] [INFO ] Removed a total of 16 redundant transitions.
[2025-05-31 10:08:47] [INFO ] Flatten gal took : 23 ms
[2025-05-31 10:08:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 7 ms.
[2025-05-31 10:08:47] [INFO ] Time to serialize gal into /tmp/CTLFireability3165542678783595192.gal : 5 ms
[2025-05-31 10:08:47] [INFO ] Time to serialize properties into /tmp/CTLFireability3067110435099365947.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/CTLFireability3165542678783595192.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3067110435099365947.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.95415e+19,4.78331,104296,5174,473,230659,2838,650,219488,152,13538,0
Converting to forward existential form...Done !
original formula: AF(((i3.u7.p69==1) * (EX(((i6.u27.p142==0)||(i6.u29.p152==0))) + (EF(((i6.u27.p143==1)&&(i5.u26.p145==1))) * EF(((i4.u14.p101==1)&&(i12.u...172
=> equivalent forward existential formula: [FwdG(Init,!(((i3.u7.p69==1) * (EX(((i6.u27.p142==0)||(i6.u29.p152==0))) + (E(TRUE U ((i6.u27.p143==1)&&(i5.u26....229
Reverse transition relation is NOT exact ! Due to transitions t0, t50, t56, t58, t160, t178, t179, t211, i0.u75.t17, i0.u75.t141, i1.u31.t79, i2.t117, i2.u...789
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 300/300 places, 250/250 transitions.
Graph (complete) has 578 edges and 300 vertex of which 294 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 293 transition count 226
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 39 place count 274 transition count 226
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 39 place count 274 transition count 217
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 57 place count 265 transition count 217
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 70 place count 252 transition count 204
Iterating global reduction 2 with 13 rules applied. Total rules applied 83 place count 252 transition count 204
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 2 with 4 rules applied. Total rules applied 87 place count 252 transition count 200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 88 place count 251 transition count 200
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 88 place count 251 transition count 199
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 90 place count 250 transition count 199
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 96 place count 244 transition count 193
Iterating global reduction 4 with 6 rules applied. Total rules applied 102 place count 244 transition count 193
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 4 with 6 rules applied. Total rules applied 108 place count 244 transition count 187
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 110 place count 243 transition count 186
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 110 place count 243 transition count 183
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 116 place count 240 transition count 183
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 6 with 140 rules applied. Total rules applied 256 place count 170 transition count 113
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 258 place count 170 transition count 113
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 260 place count 168 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 261 place count 167 transition count 111
Applied a total of 261 rules in 79 ms. Remains 167 /300 variables (removed 133) and now considering 111/250 (removed 139) transitions.
// Phase 1: matrix 111 rows 167 cols
[2025-05-31 10:09:17] [INFO ] Computed 58 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 10:09:17] [INFO ] Implicit Places using invariants in 245 ms returned []
[2025-05-31 10:09:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 10:09:18] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 692 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 10:09:18] [INFO ] Redundant transitions in 3 ms returned []
Running 108 sub problems to find dead transitions.
[2025-05-31 10:09:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 108 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/166 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (OVERLAPS) 111/277 variables, 166/224 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 1/278 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 108 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:09:24] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:09:24] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:09:24] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 3/228 constraints. Problems are: Problem set: 0 solved, 108 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:09:26] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 13 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/278 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/278 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 108 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:09:29] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 10 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/278 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/278 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 13 (OVERLAPS) 0/278 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 278/278 variables, and 230 constraints, problems are : Problem set: 0 solved, 108 unsolved in 16104 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 2/166 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 111/277 variables, 166/229 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 108/337 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 1/278 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/278 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 108 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 1)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 1)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 1)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 1)
(s40 1)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 1)
(s46 1)
(s47 0)
(s48 0)
(s49 0)
(s50 1)
(s51 0)
(s52 1)
(s53 0)
(s54 0)
(s55 1)
(s56 0)
(s57 1)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 1)
(s66 0)
(s67 1)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 1)
(s73 0)
(s74 0)
(s75 1)
(s76 1)
(s77 0)
(s78 1)
(s79 0)
(s80 0)
(s81 1)
(s82 0)
(s83 1)
(s84 1)
(s85 0)
(s86 1)
(s87 0)
(s88 1)
(s89 0)
(s90 1)
(s91 0)
(s92 1)
(s93 0)
(s94 1)
(s95 0)
(s96 1)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 278/278 variables, and 338 constraints, problems are : Problem set: 0 solved, 108 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46139ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 46140ms
Starting structural reductions in SI_CTL mode, iteration 1 : 167/300 places, 111/250 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46923 ms. Remains : 167/300 places, 111/250 transitions.
[2025-05-31 10:10:04] [INFO ] Flatten gal took : 8 ms
[2025-05-31 10:10:04] [INFO ] Flatten gal took : 8 ms
[2025-05-31 10:10:04] [INFO ] Input system was already deterministic with 111 transitions.
[2025-05-31 10:10:04] [INFO ] Flatten gal took : 7 ms
[2025-05-31 10:10:04] [INFO ] Flatten gal took : 8 ms
[2025-05-31 10:10:04] [INFO ] Time to serialize gal into /tmp/CTLFireability15353850943631683797.gal : 2 ms
[2025-05-31 10:10:04] [INFO ] Time to serialize properties into /tmp/CTLFireability16094068889481546445.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/CTLFireability15353850943631683797.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16094068889481546445.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-05-31 10:10:34] [INFO ] Flatten gal took : 5 ms
[2025-05-31 10:10:34] [INFO ] Applying decomposition
[2025-05-31 10:10:34] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15802467648007002107.txt' '-o' '/tmp/graph15802467648007002107.bin' '-w' '/tmp/graph15802467648007002107.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15802467648007002107.bin' '-l' '-1' '-v' '-w' '/tmp/graph15802467648007002107.weights' '-q' '0' '-e' '0.001'
[2025-05-31 10:10:34] [INFO ] Decomposing Gal with order
[2025-05-31 10:10:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 10:10:34] [INFO ] Removed a total of 10 redundant transitions.
[2025-05-31 10:10:34] [INFO ] Flatten gal took : 11 ms
[2025-05-31 10:10:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2025-05-31 10:10:34] [INFO ] Time to serialize gal into /tmp/CTLFireability16458053482742970359.gal : 2 ms
[2025-05-31 10:10:34] [INFO ] Time to serialize properties into /tmp/CTLFireability14194182383608914482.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/CTLFireability16458053482742970359.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14194182383608914482.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.80551e+13,0.55619,17488,2043,612,37328,1536,317,29504,145,6043,0
Converting to forward existential form...Done !
original formula: AF(AG(((i4.i1.u45.p293==0)||(i13.u51.p305==0))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((i4.i1.u45.p293==0)||(i13.u51.p305==0)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t70, t92, t95, t97, u14.t35, u15.t74, u52.t2, u52.t99, i0.t10, i0.u2.t16, i0.u2.t20, i0.u...386
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 250/250 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 284 transition count 234
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 284 transition count 234
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 284 transition count 232
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 40 place count 278 transition count 226
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 278 transition count 226
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 50 place count 278 transition count 222
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 277 transition count 221
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 277 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 53 place count 277 transition count 220
Applied a total of 53 rules in 17 ms. Remains 277 /300 variables (removed 23) and now considering 220/250 (removed 30) transitions.
// Phase 1: matrix 220 rows 277 cols
[2025-05-31 10:11:04] [INFO ] Computed 61 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 10:11:04] [INFO ] Implicit Places using invariants in 198 ms returned []
[2025-05-31 10:11:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 10:11:05] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 639 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2025-05-31 10:11:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 1/277 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 220/497 variables, 277/338 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:12] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:12] [INFO ] Deduced a trap composed of 8 places in 143 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:12] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:12] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:13] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:13] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:13] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:13] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:13] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:13] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:13] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:14] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:14] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:14] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:14] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:14] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:14] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:14] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:14] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:15] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 21 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 20/358 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:18] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:18] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:18] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:18] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:18] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:18] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:18] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:18] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:18] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:19] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:19] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:19] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:19] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:20] [INFO ] Deduced a trap composed of 41 places in 159 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:20] [INFO ] Deduced a trap composed of 42 places in 145 ms of which 26 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 15/373 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:21] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:22] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:22] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:22] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:23] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 15 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 5/378 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:25] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:26] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:26] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:26] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:26] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:26] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:26] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:27] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:27] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:27] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:27] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/497 variables, 11/389 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:34] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:34] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:34] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/497 variables, 3/392 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 497/497 variables, and 392 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 54/54 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 1/277 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 54/115 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:38] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:38] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:39] [INFO ] Deduced a trap composed of 20 places in 151 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:39] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:39] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:40] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:40] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:40] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 8/123 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (OVERLAPS) 220/497 variables, 277/400 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 219/619 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:52] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:52] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:53] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:53] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:54] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:54] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:11:54] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 497/497 variables, and 626 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 69/69 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60058ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 60059ms
Starting structural reductions in LTL mode, iteration 1 : 277/300 places, 220/250 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60715 ms. Remains : 277/300 places, 220/250 transitions.
[2025-05-31 10:12:05] [INFO ] Flatten gal took : 8 ms
[2025-05-31 10:12:05] [INFO ] Flatten gal took : 7 ms
[2025-05-31 10:12:05] [INFO ] Input system was already deterministic with 220 transitions.
[2025-05-31 10:12:05] [INFO ] Flatten gal took : 6 ms
[2025-05-31 10:12:05] [INFO ] Flatten gal took : 7 ms
[2025-05-31 10:12:05] [INFO ] Time to serialize gal into /tmp/CTLFireability4244266955225964705.gal : 2 ms
[2025-05-31 10:12:05] [INFO ] Time to serialize properties into /tmp/CTLFireability896801529951633498.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/CTLFireability4244266955225964705.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability896801529951633498.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.
Detected timeout of ITS tools.
[2025-05-31 10:12:35] [INFO ] Flatten gal took : 7 ms
[2025-05-31 10:12:35] [INFO ] Applying decomposition
[2025-05-31 10:12:35] [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/graph7998792728262366163.txt' '-o' '/tmp/graph7998792728262366163.bin' '-w' '/tmp/graph7998792728262366163.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7998792728262366163.bin' '-l' '-1' '-v' '-w' '/tmp/graph7998792728262366163.weights' '-q' '0' '-e' '0.001'
[2025-05-31 10:12:35] [INFO ] Decomposing Gal with order
[2025-05-31 10:12:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 10:12:35] [INFO ] Removed a total of 16 redundant transitions.
[2025-05-31 10:12:35] [INFO ] Flatten gal took : 18 ms
[2025-05-31 10:12:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 7 ms.
[2025-05-31 10:12:35] [INFO ] Time to serialize gal into /tmp/CTLFireability15149315667447681486.gal : 4 ms
[2025-05-31 10:12:35] [INFO ] Time to serialize properties into /tmp/CTLFireability4267241833046434223.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/CTLFireability15149315667447681486.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4267241833046434223.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 : 300/300 places, 250/250 transitions.
Graph (complete) has 578 edges and 300 vertex of which 294 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 293 transition count 229
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 277 transition count 228
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 276 transition count 228
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 35 place count 276 transition count 218
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 55 place count 266 transition count 218
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 66 place count 255 transition count 207
Iterating global reduction 3 with 11 rules applied. Total rules applied 77 place count 255 transition count 207
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 79 place count 255 transition count 205
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 85 place count 249 transition count 199
Iterating global reduction 4 with 6 rules applied. Total rules applied 91 place count 249 transition count 199
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 4 with 6 rules applied. Total rules applied 97 place count 249 transition count 193
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 98 place count 248 transition count 193
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 98 place count 248 transition count 191
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 102 place count 246 transition count 191
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 6 with 134 rules applied. Total rules applied 236 place count 179 transition count 124
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 237 place count 179 transition count 123
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 240 place count 179 transition count 123
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 242 place count 177 transition count 121
Applied a total of 242 rules in 50 ms. Remains 177 /300 variables (removed 123) and now considering 121/250 (removed 129) transitions.
// Phase 1: matrix 121 rows 177 cols
[2025-05-31 10:13:05] [INFO ] Computed 59 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 10:13:06] [INFO ] Implicit Places using invariants in 180 ms returned []
[2025-05-31 10:13:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 10:13:06] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 10:13:06] [INFO ] Redundant transitions in 6 ms returned []
Running 116 sub problems to find dead transitions.
[2025-05-31 10:13:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 11/39 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 2/174 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 116 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 2/176 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (OVERLAPS) 121/297 variables, 176/235 constraints. Problems are: Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:13:11] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:13:12] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:13:12] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/297 variables, 3/238 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/297 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 11 (OVERLAPS) 1/298 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/298 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:13:18] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 20 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/298 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/298 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 15 (OVERLAPS) 0/298 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 240 constraints, problems are : Problem set: 0 solved, 116 unsolved in 17683 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 177/177 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 11/39 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 2/174 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (OVERLAPS) 2/176 variables, 13/63 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/176 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (OVERLAPS) 121/297 variables, 176/239 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/297 variables, 116/355 constraints. Problems are: Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:13:37] [INFO ] Deduced a trap along path composed of 3 places in 35 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/297 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/297 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 116 unsolved
SMT process timed out in 47711ms, After SMT, problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 47713ms
Starting structural reductions in SI_CTL mode, iteration 1 : 177/300 places, 121/250 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48273 ms. Remains : 177/300 places, 121/250 transitions.
[2025-05-31 10:13:54] [INFO ] Flatten gal took : 8 ms
[2025-05-31 10:13:54] [INFO ] Flatten gal took : 7 ms
[2025-05-31 10:13:54] [INFO ] Input system was already deterministic with 121 transitions.
[2025-05-31 10:13:54] [INFO ] Flatten gal took : 7 ms
[2025-05-31 10:13:54] [INFO ] Flatten gal took : 7 ms
[2025-05-31 10:13:54] [INFO ] Time to serialize gal into /tmp/CTLFireability4987390856438576733.gal : 3 ms
[2025-05-31 10:13:54] [INFO ] Time to serialize properties into /tmp/CTLFireability12719385025763127960.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/CTLFireability4987390856438576733.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12719385025763127960.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-05-31 10:14:24] [INFO ] Flatten gal took : 5 ms
[2025-05-31 10:14:24] [INFO ] Applying decomposition
[2025-05-31 10:14:24] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9876412360354587536.txt' '-o' '/tmp/graph9876412360354587536.bin' '-w' '/tmp/graph9876412360354587536.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9876412360354587536.bin' '-l' '-1' '-v' '-w' '/tmp/graph9876412360354587536.weights' '-q' '0' '-e' '0.001'
[2025-05-31 10:14:24] [INFO ] Decomposing Gal with order
[2025-05-31 10:14:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 10:14:24] [INFO ] Removed a total of 14 redundant transitions.
[2025-05-31 10:14:24] [INFO ] Flatten gal took : 11 ms
[2025-05-31 10:14:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2025-05-31 10:14:24] [INFO ] Time to serialize gal into /tmp/CTLFireability16022154313896695646.gal : 2 ms
[2025-05-31 10:14:24] [INFO ] Time to serialize properties into /tmp/CTLFireability11857430058256425136.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/CTLFireability16022154313896695646.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11857430058256425136.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.69553e+14,0.851944,24376,3062,582,56857,1362,397,46296,156,5025,0
Converting to forward existential form...Done !
original formula: A(AF(AG(((u7.p105==1)&&(i5.i0.u5.p94==1)))) U AF(((!(((i11.i1.u27.p193==1) + ((EF(((i0.i0.u4.p74==1)&&(i0.i1.u16.p162==1))) * (i0.i0.u2.p...225
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(((!(((i11.i1.u27.p193==1) + ((E(TRUE U ((i0.i0.u4.p74==1)&&(i0.i1.u16.p162==1))) * (i0.i...676
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t78, t88, t110, t113, t116, u17.t49, u18.t93, u7.t69, u55.t2, u55.t20, i0.i0.t13, i0....421
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 250/250 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 283 transition count 233
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 283 transition count 233
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 283 transition count 230
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 42 place count 278 transition count 225
Iterating global reduction 1 with 5 rules applied. Total rules applied 47 place count 278 transition count 225
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 50 place count 278 transition count 222
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 277 transition count 221
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 277 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 53 place count 277 transition count 220
Applied a total of 53 rules in 19 ms. Remains 277 /300 variables (removed 23) and now considering 220/250 (removed 30) transitions.
// Phase 1: matrix 220 rows 277 cols
[2025-05-31 10:14:54] [INFO ] Computed 61 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 10:14:54] [INFO ] Implicit Places using invariants in 235 ms returned []
[2025-05-31 10:14:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 10:14:55] [INFO ] Implicit Places using invariants and state equation in 606 ms returned []
Implicit Place search using SMT with State Equation took 867 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2025-05-31 10:14:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 1/277 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:03] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:03] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:03] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:03] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:04] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:04] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:06] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:06] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 16 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (OVERLAPS) 220/497 variables, 277/346 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:12] [INFO ] Deduced a trap composed of 7 places in 194 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:13] [INFO ] Deduced a trap composed of 8 places in 244 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:13] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:14] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:14] [INFO ] Deduced a trap composed of 18 places in 134 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:14] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:14] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:14] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:15] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:15] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 10/356 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:18] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:18] [INFO ] Deduced a trap composed of 13 places in 180 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:18] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:19] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:19] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:19] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:19] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:19] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:19] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:20] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:20] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:20] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:20] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:20] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:20] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:20] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:21] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:22] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 12 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/497 variables, 18/374 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 497/497 variables, and 374 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 36/36 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 1/277 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 36/97 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:28] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:28] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:29] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:29] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:29] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:29] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:29] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 7/104 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:31] [INFO ] Deduced a trap composed of 21 places in 161 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:32] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:32] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:33] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:34] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:34] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:34] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:34] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:34] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:34] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 7/114 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (OVERLAPS) 220/497 variables, 277/391 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/497 variables, 219/610 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:47] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:47] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:47] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:48] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:48] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:15:50] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 497/497 variables, and 616 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 59/59 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60064ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 60066ms
Starting structural reductions in LTL mode, iteration 1 : 277/300 places, 220/250 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60954 ms. Remains : 277/300 places, 220/250 transitions.
[2025-05-31 10:15:55] [INFO ] Flatten gal took : 9 ms
[2025-05-31 10:15:55] [INFO ] Flatten gal took : 15 ms
[2025-05-31 10:15:55] [INFO ] Input system was already deterministic with 220 transitions.
[2025-05-31 10:15:55] [INFO ] Flatten gal took : 7 ms
[2025-05-31 10:15:55] [INFO ] Flatten gal took : 8 ms
[2025-05-31 10:15:55] [INFO ] Time to serialize gal into /tmp/CTLFireability7712047115807394596.gal : 2 ms
[2025-05-31 10:15:55] [INFO ] Time to serialize properties into /tmp/CTLFireability407627896683094580.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/CTLFireability7712047115807394596.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability407627896683094580.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.
Detected timeout of ITS tools.
[2025-05-31 10:16:25] [INFO ] Flatten gal took : 6 ms
[2025-05-31 10:16:25] [INFO ] Applying decomposition
[2025-05-31 10:16:25] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6594727114915718098.txt' '-o' '/tmp/graph6594727114915718098.bin' '-w' '/tmp/graph6594727114915718098.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6594727114915718098.bin' '-l' '-1' '-v' '-w' '/tmp/graph6594727114915718098.weights' '-q' '0' '-e' '0.001'
[2025-05-31 10:16:25] [INFO ] Decomposing Gal with order
[2025-05-31 10:16:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 10:16:25] [INFO ] Removed a total of 16 redundant transitions.
[2025-05-31 10:16:25] [INFO ] Flatten gal took : 15 ms
[2025-05-31 10:16:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2025-05-31 10:16:25] [INFO ] Time to serialize gal into /tmp/CTLFireability1406041049549024534.gal : 3 ms
[2025-05-31 10:16:25] [INFO ] Time to serialize properties into /tmp/CTLFireability18200178001369611862.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/CTLFireability1406041049549024534.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18200178001369611862.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,4.4455e+19,2.60192,71820,7268,562,161351,5264,668,179062,178,16101,0
Converting to forward existential form...Done !
original formula: AG(((i3.u5.p55==1) + EX(((EX((i9.u13.p100==0)) + AX((i3.u12.p94==1))) + ((AG((u30.p165==1)) * (i9.u13.p98==1)) * ((i0.u0.p167==1)||((i11....192
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((i3.u5.p55==1))) * !(EX(((EX((i9.u13.p100==0)) + !(EX(!((i3.u12.p94==1))))) + ((!(E(TRUE ...267
Reverse transition relation is NOT exact ! Due to transitions t0, t54, t87, t162, t181, t182, t214, u30.t79, i0.u32.t76, i2.t119, i2.u8.t157, i2.u8.t158, i...807
(forward)formula 0,0,19.0613,479172,1,0,1.20098e+06,10434,3584,1.39674e+06,1326,51324,1705541
FORMULA DES-PT-10b-CTLFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 250/250 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 282 transition count 232
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 282 transition count 232
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 282 transition count 229
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 46 place count 275 transition count 222
Iterating global reduction 1 with 7 rules applied. Total rules applied 53 place count 275 transition count 222
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 58 place count 275 transition count 217
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 274 transition count 216
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 274 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 274 transition count 215
Applied a total of 61 rules in 28 ms. Remains 274 /300 variables (removed 26) and now considering 215/250 (removed 35) transitions.
// Phase 1: matrix 215 rows 274 cols
[2025-05-31 10:16:44] [INFO ] Computed 61 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 10:16:44] [INFO ] Implicit Places using invariants in 282 ms returned []
[2025-05-31 10:16:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 10:16:45] [INFO ] Implicit Places using invariants and state equation in 687 ms returned []
Implicit Place search using SMT with State Equation took 978 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2025-05-31 10:16:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/274 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/489 variables, 274/335 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:16:54] [INFO ] Deduced a trap composed of 29 places in 144 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:16:55] [INFO ] Deduced a trap composed of 7 places in 246 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:16:55] [INFO ] Deduced a trap composed of 8 places in 242 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:16:55] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:16:55] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:16:55] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:16:56] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:16:56] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:16:56] [INFO ] Deduced a trap composed of 23 places in 169 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:16:56] [INFO ] Deduced a trap composed of 25 places in 143 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:16:56] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:16:57] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:16:57] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:16:57] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:16:57] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:16:57] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:16:57] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:16:57] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:16:57] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:16:57] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/489 variables, 20/355 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:01] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:01] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:02] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:02] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:02] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:02] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:02] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:02] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:02] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:03] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:03] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:03] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:03] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:03] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:03] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:03] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:03] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:04] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:04] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:04] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 16 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/489 variables, 20/375 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:05] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:05] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:06] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:06] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:06] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:06] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:07] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:08] [INFO ] Deduced a trap composed of 38 places in 143 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:08] [INFO ] Deduced a trap composed of 40 places in 182 ms of which 28 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/489 variables, 9/384 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:13] [INFO ] Deduced a trap along path composed of 9 places in 82 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:14] [INFO ] Deduced a trap along path composed of 8 places in 40 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:14] [INFO ] Deduced a trap along path composed of 4 places in 50 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:14] [INFO ] Deduced a trap along path composed of 10 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:15] [INFO ] Deduced a trap along path composed of 3 places in 50 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 489/489 variables, and 389 constraints, problems are : Problem set: 0 solved, 214 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 49/49 constraints, Known Traps Along Path: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/274 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 49/110 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:16] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:17] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:17] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:17] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:17] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:18] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:18] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:18] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:18] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:18] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 10/120 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:19] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:20] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:20] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:20] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:21] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 5/125 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:24] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:24] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:24] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:24] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:24] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:24] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 6/131 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (OVERLAPS) 215/489 variables, 274/405 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/489 variables, 214/619 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:33] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:33] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:33] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:35] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:17:40] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 489/489 variables, and 624 constraints, problems are : Problem set: 0 solved, 214 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 75/75 constraints, Known Traps Along Path: 0/5 constraints]
After SMT, in 60053ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 60054ms
Starting structural reductions in LTL mode, iteration 1 : 274/300 places, 215/250 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61062 ms. Remains : 274/300 places, 215/250 transitions.
[2025-05-31 10:17:45] [INFO ] Flatten gal took : 8 ms
[2025-05-31 10:17:45] [INFO ] Flatten gal took : 8 ms
[2025-05-31 10:17:45] [INFO ] Input system was already deterministic with 215 transitions.
[2025-05-31 10:17:45] [INFO ] Flatten gal took : 8 ms
[2025-05-31 10:17:45] [INFO ] Flatten gal took : 7 ms
[2025-05-31 10:17:45] [INFO ] Time to serialize gal into /tmp/CTLFireability6893684531017655467.gal : 2 ms
[2025-05-31 10:17:45] [INFO ] Time to serialize properties into /tmp/CTLFireability2443293735422602691.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/CTLFireability6893684531017655467.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2443293735422602691.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-05-31 10:18:15] [INFO ] Flatten gal took : 6 ms
[2025-05-31 10:18:15] [INFO ] Applying decomposition
[2025-05-31 10:18:15] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17010899426161187317.txt' '-o' '/tmp/graph17010899426161187317.bin' '-w' '/tmp/graph17010899426161187317.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17010899426161187317.bin' '-l' '-1' '-v' '-w' '/tmp/graph17010899426161187317.weights' '-q' '0' '-e' '0.001'
[2025-05-31 10:18:15] [INFO ] Decomposing Gal with order
[2025-05-31 10:18:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 10:18:15] [INFO ] Removed a total of 14 redundant transitions.
[2025-05-31 10:18:15] [INFO ] Flatten gal took : 14 ms
[2025-05-31 10:18:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2025-05-31 10:18:15] [INFO ] Time to serialize gal into /tmp/CTLFireability15932965069180993041.gal : 4 ms
[2025-05-31 10:18:15] [INFO ] Time to serialize properties into /tmp/CTLFireability13846334528098381014.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/CTLFireability15932965069180993041.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13846334528098381014.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.74076e+19,23.4366,518200,14519,507,1.37975e+06,4466,657,877272,157,14786,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 300/300 places, 250/250 transitions.
Graph (complete) has 578 edges and 300 vertex of which 294 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 293 transition count 230
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 278 transition count 229
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 277 transition count 229
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 33 place count 277 transition count 220
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 51 place count 268 transition count 220
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 63 place count 256 transition count 208
Iterating global reduction 3 with 12 rules applied. Total rules applied 75 place count 256 transition count 208
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 3 with 4 rules applied. Total rules applied 79 place count 256 transition count 204
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 80 place count 255 transition count 204
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 86 place count 249 transition count 198
Iterating global reduction 5 with 6 rules applied. Total rules applied 92 place count 249 transition count 198
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 6 rules applied. Total rules applied 98 place count 249 transition count 192
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 100 place count 248 transition count 191
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 3 Pre rules applied. Total rules applied 100 place count 248 transition count 188
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 106 place count 245 transition count 188
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 7 with 138 rules applied. Total rules applied 244 place count 176 transition count 119
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 245 place count 176 transition count 119
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 246 place count 175 transition count 118
Applied a total of 246 rules in 50 ms. Remains 175 /300 variables (removed 125) and now considering 118/250 (removed 132) transitions.
// Phase 1: matrix 118 rows 175 cols
[2025-05-31 10:18:45] [INFO ] Computed 59 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 10:18:46] [INFO ] Implicit Places using invariants in 177 ms returned []
[2025-05-31 10:18:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 10:18:46] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 601 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 10:18:46] [INFO ] Redundant transitions in 5 ms returned []
Running 117 sub problems to find dead transitions.
[2025-05-31 10:18:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/174 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/175 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 117 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (OVERLAPS) 118/293 variables, 175/234 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:18:50] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:18:50] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:18:54] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/293 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (OVERLAPS) 0/293 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 237 constraints, problems are : Problem set: 0 solved, 117 unsolved in 11281 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/174 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (OVERLAPS) 1/175 variables, 34/47 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 118/293 variables, 175/236 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 117/353 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:19:01] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:19:03] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:19:07] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 3/356 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:19:14] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/293 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 293/293 variables, and 358 constraints, problems are : Problem set: 0 solved, 117 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 41308ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 41310ms
Starting structural reductions in SI_CTL mode, iteration 1 : 175/300 places, 118/250 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41980 ms. Remains : 175/300 places, 118/250 transitions.
[2025-05-31 10:19:27] [INFO ] Flatten gal took : 4 ms
[2025-05-31 10:19:27] [INFO ] Flatten gal took : 5 ms
[2025-05-31 10:19:27] [INFO ] Input system was already deterministic with 118 transitions.
[2025-05-31 10:19:27] [INFO ] Flatten gal took : 4 ms
[2025-05-31 10:19:27] [INFO ] Flatten gal took : 8 ms
[2025-05-31 10:19:27] [INFO ] Time to serialize gal into /tmp/CTLFireability7547377038696839293.gal : 2 ms
[2025-05-31 10:19:27] [INFO ] Time to serialize properties into /tmp/CTLFireability11917974853530575700.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/CTLFireability7547377038696839293.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11917974853530575700.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-05-31 10:19:58] [INFO ] Flatten gal took : 5 ms
[2025-05-31 10:19:58] [INFO ] Applying decomposition
[2025-05-31 10:19:58] [INFO ] Flatten gal took : 4 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/graph6644080870269674698.txt' '-o' '/tmp/graph6644080870269674698.bin' '-w' '/tmp/graph6644080870269674698.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6644080870269674698.bin' '-l' '-1' '-v' '-w' '/tmp/graph6644080870269674698.weights' '-q' '0' '-e' '0.001'
[2025-05-31 10:19:58] [INFO ] Decomposing Gal with order
[2025-05-31 10:19:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 10:19:58] [INFO ] Removed a total of 22 redundant transitions.
[2025-05-31 10:19:58] [INFO ] Flatten gal took : 10 ms
[2025-05-31 10:19:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 4 ms.
[2025-05-31 10:19:58] [INFO ] Time to serialize gal into /tmp/CTLFireability11270271206895168533.gal : 2 ms
[2025-05-31 10:19:58] [INFO ] Time to serialize properties into /tmp/CTLFireability17926945446862577653.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/CTLFireability11270271206895168533.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17926945446862577653.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.36841e+13,4.15153,104648,2523,490,282862,1674,393,136008,165,7167,0
Converting to forward existential form...Done !
original formula: AF(AG((((AG((i1.u2.p64==0)) * (i1.u7.p104==0)) * ((i1.u0.p167==0)&&(i2.u8.p113==1))) * ((i7.i0.u37.p246==1) + EG(((u52.p317==0)||(u52.p31...166
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((((!(E(TRUE U !((i1.u2.p64==0)))) * (i1.u7.p104==0)) * ((i1.u0.p167==0)&&(i2.u8.p113==...235
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t75, t77, t99, t102, t105, u16.t37, u52.t56, u52.t107, i0.t12, i0.u3.t18, i0.u3.t22, ...416
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 250/250 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 282 transition count 232
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 282 transition count 232
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 282 transition count 229
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 45 place count 276 transition count 223
Iterating global reduction 1 with 6 rules applied. Total rules applied 51 place count 276 transition count 223
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 56 place count 276 transition count 218
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 275 transition count 217
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 275 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 59 place count 275 transition count 216
Applied a total of 59 rules in 18 ms. Remains 275 /300 variables (removed 25) and now considering 216/250 (removed 34) transitions.
// Phase 1: matrix 216 rows 275 cols
[2025-05-31 10:20:28] [INFO ] Computed 61 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 10:20:28] [INFO ] Implicit Places using invariants in 289 ms returned []
[2025-05-31 10:20:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 10:20:29] [INFO ] Implicit Places using invariants and state equation in 751 ms returned []
Implicit Place search using SMT with State Equation took 1042 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2025-05-31 10:20:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/275 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:20:37] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:20:37] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:20:37] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:20:38] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:20:39] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:20:41] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (OVERLAPS) 216/491 variables, 275/342 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:20:46] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:20:47] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:20:47] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:20:47] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:20:47] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:20:47] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:20:47] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:20:48] [INFO ] Deduced a trap composed of 29 places in 142 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:20:48] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:20:48] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:20:48] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:20:48] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:20:48] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:20:50] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:20:50] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:20:50] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 26 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/491 variables, 16/358 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:20:52] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:20:53] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/491 variables, 2/360 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 491/491 variables, and 360 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 275/275 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/275 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 24/85 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:21:02] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:21:02] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:21:02] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:21:02] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:21:02] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:21:02] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:21:03] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:21:03] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:21:03] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:21:03] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:21:03] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:21:03] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:21:03] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:21:03] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:21:04] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:21:04] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:21:04] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:21:04] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:21:04] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:21:04] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:21:05] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:21:05] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:21:05] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:21:05] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:21:05] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:21:06] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:21:06] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:21:06] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:21:06] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 9/114 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 216/491 variables, 275/389 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/491 variables, 215/604 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:21:18] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:21:18] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:21:19] [INFO ] Deduced a trap composed of 26 places in 151 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:21:20] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:21:23] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:21:23] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:21:23] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:21:23] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:21:28] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:21:29] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:21:29] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 14 ms to minimize.
SMT process timed out in 60066ms, After SMT, problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 60068ms
Starting structural reductions in LTL mode, iteration 1 : 275/300 places, 216/250 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61129 ms. Remains : 275/300 places, 216/250 transitions.
[2025-05-31 10:21:29] [INFO ] Flatten gal took : 9 ms
[2025-05-31 10:21:29] [INFO ] Flatten gal took : 10 ms
[2025-05-31 10:21:29] [INFO ] Input system was already deterministic with 216 transitions.
[2025-05-31 10:21:29] [INFO ] Flatten gal took : 9 ms
[2025-05-31 10:21:29] [INFO ] Flatten gal took : 9 ms
[2025-05-31 10:21:29] [INFO ] Time to serialize gal into /tmp/CTLFireability8346891074282944570.gal : 2 ms
[2025-05-31 10:21:29] [INFO ] Time to serialize properties into /tmp/CTLFireability7022786517646122135.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/CTLFireability8346891074282944570.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7022786517646122135.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-05-31 10:21:59] [INFO ] Flatten gal took : 5 ms
[2025-05-31 10:21:59] [INFO ] Applying decomposition
[2025-05-31 10:21:59] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9336340876740423879.txt' '-o' '/tmp/graph9336340876740423879.bin' '-w' '/tmp/graph9336340876740423879.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9336340876740423879.bin' '-l' '-1' '-v' '-w' '/tmp/graph9336340876740423879.weights' '-q' '0' '-e' '0.001'
[2025-05-31 10:21:59] [INFO ] Decomposing Gal with order
[2025-05-31 10:21:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 10:21:59] [INFO ] Removed a total of 11 redundant transitions.
[2025-05-31 10:21:59] [INFO ] Flatten gal took : 14 ms
[2025-05-31 10:21:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2025-05-31 10:21:59] [INFO ] Time to serialize gal into /tmp/CTLFireability16103600778494528175.gal : 3 ms
[2025-05-31 10:21:59] [INFO ] Time to serialize properties into /tmp/CTLFireability11727482015512005192.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/CTLFireability16103600778494528175.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11727482015512005192.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 : 300/300 places, 250/250 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 283 transition count 233
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 283 transition count 233
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 283 transition count 231
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 43 place count 276 transition count 224
Iterating global reduction 1 with 7 rules applied. Total rules applied 50 place count 276 transition count 224
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 55 place count 276 transition count 219
Applied a total of 55 rules in 13 ms. Remains 276 /300 variables (removed 24) and now considering 219/250 (removed 31) transitions.
// Phase 1: matrix 219 rows 276 cols
[2025-05-31 10:22:29] [INFO ] Computed 61 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 10:22:29] [INFO ] Implicit Places using invariants in 195 ms returned []
[2025-05-31 10:22:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 10:22:30] [INFO ] Implicit Places using invariants and state equation in 676 ms returned []
Implicit Place search using SMT with State Equation took 872 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2025-05-31 10:22:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 1/276 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 218 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 219/495 variables, 276/337 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:22:39] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:22:39] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:22:39] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:22:40] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:22:42] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:22:42] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:22:42] [INFO ] Deduced a trap composed of 38 places in 163 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:22:42] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:22:43] [INFO ] Deduced a trap composed of 40 places in 150 ms of which 23 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/495 variables, 9/346 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:22:44] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:22:45] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:22:46] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:22:46] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:22:46] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:22:46] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:22:46] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/495 variables, 7/353 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:22:49] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:22:49] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:22:49] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:22:49] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:22:50] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:22:50] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:22:50] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:22:50] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:22:50] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:22:50] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:22:51] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:22:51] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:22:51] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:22:51] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:22:51] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:22:51] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:22:51] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:22:51] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:22:52] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:22:52] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 16 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/495 variables, 20/373 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:22:53] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:22:53] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:22:53] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/495 variables, 3/376 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:22:57] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:22:58] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:22:58] [INFO ] Deduced a trap composed of 14 places in 159 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:22:58] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:22:58] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:22:59] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:22:59] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:22:59] [INFO ] Deduced a trap composed of 14 places in 170 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:23:00] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 495/495 variables, and 385 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 48/48 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 1/276 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 48/109 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:23:03] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:23:03] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:23:04] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:23:04] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:23:04] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:23:04] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 6/115 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:23:06] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:23:06] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:23:06] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 3/118 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:23:08] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:23:09] [INFO ] Deduced a trap composed of 25 places in 150 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:23:12] [INFO ] Deduced a trap composed of 29 places in 142 ms of which 14 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 10 (OVERLAPS) 219/495 variables, 276/397 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/495 variables, 218/615 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:23:23] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:23:29] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 12 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 495/495 variables, and 617 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 62/62 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60054ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 60055ms
Starting structural reductions in LTL mode, iteration 1 : 276/300 places, 219/250 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60941 ms. Remains : 276/300 places, 219/250 transitions.
[2025-05-31 10:23:30] [INFO ] Flatten gal took : 8 ms
[2025-05-31 10:23:30] [INFO ] Flatten gal took : 8 ms
[2025-05-31 10:23:30] [INFO ] Input system was already deterministic with 219 transitions.
[2025-05-31 10:23:30] [INFO ] Flatten gal took : 8 ms
[2025-05-31 10:23:30] [INFO ] Flatten gal took : 7 ms
[2025-05-31 10:23:30] [INFO ] Time to serialize gal into /tmp/CTLFireability4519211118581436049.gal : 2 ms
[2025-05-31 10:23:30] [INFO ] Time to serialize properties into /tmp/CTLFireability6378487895695909474.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/CTLFireability4519211118581436049.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6378487895695909474.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-05-31 10:24:00] [INFO ] Flatten gal took : 6 ms
[2025-05-31 10:24:00] [INFO ] Applying decomposition
[2025-05-31 10:24:00] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15748042986536112860.txt' '-o' '/tmp/graph15748042986536112860.bin' '-w' '/tmp/graph15748042986536112860.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15748042986536112860.bin' '-l' '-1' '-v' '-w' '/tmp/graph15748042986536112860.weights' '-q' '0' '-e' '0.001'
[2025-05-31 10:24:00] [INFO ] Decomposing Gal with order
[2025-05-31 10:24:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 10:24:00] [INFO ] Removed a total of 16 redundant transitions.
[2025-05-31 10:24:00] [INFO ] Flatten gal took : 14 ms
[2025-05-31 10:24:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2025-05-31 10:24:00] [INFO ] Time to serialize gal into /tmp/CTLFireability2066442098494968053.gal : 4 ms
[2025-05-31 10:24:00] [INFO ] Time to serialize properties into /tmp/CTLFireability17811854682424352919.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/CTLFireability2066442098494968053.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17811854682424352919.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,2.88707e+19,6.07854,132772,5426,454,319437,3412,753,285872,160,11362,0
Converting to forward existential form...Done !
original formula: AF((EF(((i2.u9.p43==1)&&(i2.u9.p70==1))) * (EG(EF(EX((i4.i0.u22.p133==1)))) + ((i2.u10.p74==1)&&(i5.u33.p162==1)))))
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U ((i2.u9.p43==1)&&(i2.u9.p70==1))) * (EG(E(TRUE U EX((i4.i0.u22.p133==1)))) + ((i2.u10.p74...191
Reverse transition relation is NOT exact ! Due to transitions t0, t54, t58, t162, t180, t181, t213, u34.t79, i1.i0.u13.t113, i1.i0.u15.t110, i1.i1.t123, i1...842
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 300/300 places, 250/250 transitions.
Graph (complete) has 578 edges and 300 vertex of which 294 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 293 transition count 226
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 39 place count 274 transition count 226
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 39 place count 274 transition count 217
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 57 place count 265 transition count 217
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 70 place count 252 transition count 204
Iterating global reduction 2 with 13 rules applied. Total rules applied 83 place count 252 transition count 204
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 2 with 4 rules applied. Total rules applied 87 place count 252 transition count 200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 88 place count 251 transition count 200
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 88 place count 251 transition count 199
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 90 place count 250 transition count 199
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 96 place count 244 transition count 193
Iterating global reduction 4 with 6 rules applied. Total rules applied 102 place count 244 transition count 193
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 4 with 6 rules applied. Total rules applied 108 place count 244 transition count 187
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 110 place count 243 transition count 186
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 110 place count 243 transition count 183
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 116 place count 240 transition count 183
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 6 with 134 rules applied. Total rules applied 250 place count 173 transition count 116
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 252 place count 171 transition count 114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 253 place count 170 transition count 114
Applied a total of 253 rules in 45 ms. Remains 170 /300 variables (removed 130) and now considering 114/250 (removed 136) transitions.
// Phase 1: matrix 114 rows 170 cols
[2025-05-31 10:24:30] [INFO ] Computed 58 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 10:24:30] [INFO ] Implicit Places using invariants in 163 ms returned []
[2025-05-31 10:24:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 10:24:31] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 10:24:31] [INFO ] Redundant transitions in 6 ms returned []
Running 110 sub problems to find dead transitions.
[2025-05-31 10:24:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 18/46 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (OVERLAPS) 1/167 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 2/169 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 114/283 variables, 169/227 constraints. Problems are: Problem set: 0 solved, 110 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:24:38] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 110 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:24:39] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:24:39] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:24:39] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:24:39] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/283 variables, 4/232 constraints. Problems are: Problem set: 0 solved, 110 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:24:40] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:24:41] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/283 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 110 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:24:42] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:24:42] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:24:42] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/283 variables, 3/237 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/283 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 13 (OVERLAPS) 1/284 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/284 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 110 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:24:49] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:24:49] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:24:49] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 10 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/284 variables, 3/241 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/284 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 17 (OVERLAPS) 0/284 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 284/284 variables, and 241 constraints, problems are : Problem set: 0 solved, 110 unsolved in 24442 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 18/46 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 1/167 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 2/169 variables, 7/70 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (OVERLAPS) 114/283 variables, 169/240 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/283 variables, 110/350 constraints. Problems are: Problem set: 0 solved, 110 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:25:08] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/283 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/283 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 110 unsolved
SMT process timed out in 54460ms, After SMT, problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 54460ms
Starting structural reductions in SI_CTL mode, iteration 1 : 170/300 places, 114/250 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 54957 ms. Remains : 170/300 places, 114/250 transitions.
[2025-05-31 10:25:25] [INFO ] Flatten gal took : 6 ms
[2025-05-31 10:25:25] [INFO ] Flatten gal took : 4 ms
[2025-05-31 10:25:25] [INFO ] Input system was already deterministic with 114 transitions.
[2025-05-31 10:25:25] [INFO ] Flatten gal took : 4 ms
[2025-05-31 10:25:25] [INFO ] Flatten gal took : 4 ms
[2025-05-31 10:25:25] [INFO ] Time to serialize gal into /tmp/CTLFireability13137533103784156735.gal : 1 ms
[2025-05-31 10:25:25] [INFO ] Time to serialize properties into /tmp/CTLFireability16435045630322033128.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/CTLFireability13137533103784156735.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16435045630322033128.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-05-31 10:25:55] [INFO ] Flatten gal took : 3 ms
[2025-05-31 10:25:55] [INFO ] Applying decomposition
[2025-05-31 10:25:55] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14856218636222063621.txt' '-o' '/tmp/graph14856218636222063621.bin' '-w' '/tmp/graph14856218636222063621.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14856218636222063621.bin' '-l' '-1' '-v' '-w' '/tmp/graph14856218636222063621.weights' '-q' '0' '-e' '0.001'
[2025-05-31 10:25:55] [INFO ] Decomposing Gal with order
[2025-05-31 10:25:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 10:25:55] [INFO ] Removed a total of 14 redundant transitions.
[2025-05-31 10:25:55] [INFO ] Flatten gal took : 8 ms
[2025-05-31 10:25:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 1 ms.
[2025-05-31 10:25:55] [INFO ] Time to serialize gal into /tmp/CTLFireability7371156959445743414.gal : 2 ms
[2025-05-31 10:25:55] [INFO ] Time to serialize properties into /tmp/CTLFireability11890835563847025619.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/CTLFireability7371156959445743414.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11890835563847025619.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.25721e+13,3.84639,121200,23613,478,363389,1094,364,222527,153,3559,0
Converting to forward existential form...Done !
original formula: EF(EG(((AF((i2.u10.p135==0)) * (i9.u31.p233==1)) * (i9.u39.p263==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((!(EG(!((i2.u10.p135==0)))) * (i9.u31.p233==1)) * (i9.u39.p263==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t74, t87, t95, t99, t102, u14.t35, u51.t2, u51.t104, i0.t10, i0.u2.t16, i0.u2.t20, i0...401
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 250/250 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 283 transition count 233
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 283 transition count 233
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 283 transition count 230
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 41 place count 279 transition count 226
Iterating global reduction 1 with 4 rules applied. Total rules applied 45 place count 279 transition count 226
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 47 place count 279 transition count 224
Applied a total of 47 rules in 17 ms. Remains 279 /300 variables (removed 21) and now considering 224/250 (removed 26) transitions.
// Phase 1: matrix 224 rows 279 cols
[2025-05-31 10:26:25] [INFO ] Computed 61 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 10:26:26] [INFO ] Implicit Places using invariants in 232 ms returned []
[2025-05-31 10:26:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 10:26:26] [INFO ] Implicit Places using invariants and state equation in 649 ms returned []
Implicit Place search using SMT with State Equation took 882 ms to find 0 implicit places.
Running 223 sub problems to find dead transitions.
[2025-05-31 10:26:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/278 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 1/279 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 224/503 variables, 279/340 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:26:36] [INFO ] Deduced a trap composed of 7 places in 233 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:26:37] [INFO ] Deduced a trap composed of 8 places in 190 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:26:37] [INFO ] Deduced a trap composed of 10 places in 163 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:26:37] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:26:37] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:26:37] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:26:37] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:26:38] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:26:38] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:26:38] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:26:38] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:26:38] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:26:39] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:26:39] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:26:39] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:26:39] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:26:39] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:26:39] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:26:39] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:26:40] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 20/360 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:26:44] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:26:44] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:26:44] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:26:44] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:26:44] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:26:44] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:26:45] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:26:45] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:26:45] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:26:45] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:26:45] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:26:45] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:26:45] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:26:46] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:26:46] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:26:47] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:26:47] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:26:47] [INFO ] Deduced a trap composed of 40 places in 164 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:26:48] [INFO ] Deduced a trap composed of 42 places in 167 ms of which 31 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 19/379 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:26:50] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:26:50] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:26:50] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:26:50] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:26:52] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 19 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 5/384 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:26:54] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 7 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 503/503 variables, and 385 constraints, problems are : Problem set: 0 solved, 223 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 279/279 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 45/45 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/278 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 1/279 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 45/106 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:27:00] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:27:00] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:27:01] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:27:01] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:27:01] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 5/111 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:27:02] [INFO ] Deduced a trap composed of 20 places in 155 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:27:03] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:27:03] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (OVERLAPS) 224/503 variables, 279/393 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/503 variables, 223/616 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:27:19] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:27:20] [INFO ] Deduced a trap composed of 20 places in 148 ms of which 23 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 503/503 variables, and 618 constraints, problems are : Problem set: 0 solved, 223 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 279/279 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 55/55 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60054ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 60056ms
Starting structural reductions in LTL mode, iteration 1 : 279/300 places, 224/250 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60957 ms. Remains : 279/300 places, 224/250 transitions.
[2025-05-31 10:27:26] [INFO ] Flatten gal took : 9 ms
[2025-05-31 10:27:26] [INFO ] Flatten gal took : 8 ms
[2025-05-31 10:27:26] [INFO ] Input system was already deterministic with 224 transitions.
[2025-05-31 10:27:26] [INFO ] Flatten gal took : 8 ms
[2025-05-31 10:27:26] [INFO ] Flatten gal took : 9 ms
[2025-05-31 10:27:26] [INFO ] Time to serialize gal into /tmp/CTLFireability2522432702794811543.gal : 2 ms
[2025-05-31 10:27:26] [INFO ] Time to serialize properties into /tmp/CTLFireability2897144258029133954.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/CTLFireability2522432702794811543.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2897144258029133954.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-05-31 10:27:56] [INFO ] Flatten gal took : 6 ms
[2025-05-31 10:27:56] [INFO ] Applying decomposition
[2025-05-31 10:27:56] [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/graph7129051746503829618.txt' '-o' '/tmp/graph7129051746503829618.bin' '-w' '/tmp/graph7129051746503829618.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7129051746503829618.bin' '-l' '-1' '-v' '-w' '/tmp/graph7129051746503829618.weights' '-q' '0' '-e' '0.001'
[2025-05-31 10:27:56] [INFO ] Decomposing Gal with order
[2025-05-31 10:27:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 10:27:57] [INFO ] Removed a total of 19 redundant transitions.
[2025-05-31 10:27:57] [INFO ] Flatten gal took : 18 ms
[2025-05-31 10:27:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 3 ms.
[2025-05-31 10:27:57] [INFO ] Time to serialize gal into /tmp/CTLFireability10525263590519839611.gal : 2 ms
[2025-05-31 10:27:57] [INFO ] Time to serialize properties into /tmp/CTLFireability16866432325307555989.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/CTLFireability10525263590519839611.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16866432325307555989.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.74154e+19,9.24889,189452,6175,440,419400,4440,671,415590,162,14928,0
Converting to forward existential form...Done !
original formula: ((AF(((EX(((i6.u38.p10==0)||(i6.u38.p171==0))) + ((E(((i6.u38.p7==1)&&(i6.u38.p171==1)) U (i8.i0.i1.u48.p195==1)) * AX(((i3.u9.p46==1)&&(...586
=> equivalent forward existential formula: [FwdG(((Init * !((E(((!(EX(!(((i8.i1.i1.u46.p200==1)&&(i8.i1.i0.u54.p226==1))))) + !(EG(!((i6.u37.p169==1))))) +...685
Reverse transition relation is NOT exact ! Due to transitions t0, t54, t165, t185, t186, t218, i0.u14.t113, i0.u14.t115, i0.u16.t110, i1.u35.t79, i2.t126, ...811
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 250/250 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 281 transition count 231
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 281 transition count 231
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 281 transition count 228
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 47 place count 275 transition count 222
Iterating global reduction 1 with 6 rules applied. Total rules applied 53 place count 275 transition count 222
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 58 place count 275 transition count 217
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 274 transition count 216
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 274 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 274 transition count 215
Applied a total of 61 rules in 17 ms. Remains 274 /300 variables (removed 26) and now considering 215/250 (removed 35) transitions.
// Phase 1: matrix 215 rows 274 cols
[2025-05-31 10:28:27] [INFO ] Computed 61 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 10:28:27] [INFO ] Implicit Places using invariants in 227 ms returned []
[2025-05-31 10:28:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 10:28:27] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 681 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2025-05-31 10:28:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/274 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:28:35] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:28:35] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:28:35] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:28:35] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:28:36] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:28:36] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:28:36] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:28:36] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:28:36] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:28:37] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 10/71 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:28:38] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:28:38] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:28:40] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:28:40] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:28:40] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 215/489 variables, 274/350 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:28:45] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:28:46] [INFO ] Deduced a trap composed of 7 places in 242 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:28:46] [INFO ] Deduced a trap composed of 8 places in 260 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:28:47] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:28:47] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:28:47] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:28:47] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:28:47] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:28:48] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:28:48] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:28:48] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:28:48] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:28:48] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:28:48] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:28:48] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:28:48] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:28:48] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:28:49] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:28:50] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:28:50] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/489 variables, 20/370 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:28:55] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:28:55] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:28:56] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:28:56] [INFO ] Deduced a trap composed of 40 places in 109 ms of which 15 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/489 variables, 4/374 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 489/489 variables, and 374 constraints, problems are : Problem set: 0 solved, 214 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/274 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 39/100 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:29:00] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:29:00] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:29:01] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:29:01] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:29:01] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:29:01] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:29:01] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:29:01] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:29:02] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:29:02] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:29:02] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:29:02] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:29:02] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:29:02] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 14/114 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:29:04] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:29:05] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 215/489 variables, 274/390 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/489 variables, 214/604 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:29:17] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:29:18] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:29:18] [INFO ] Deduced a trap composed of 18 places in 149 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:29:18] [INFO ] Deduced a trap composed of 21 places in 143 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:29:19] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 12 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 489/489 variables, and 609 constraints, problems are : Problem set: 0 solved, 214 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60043ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 60044ms
Starting structural reductions in LTL mode, iteration 1 : 274/300 places, 215/250 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60744 ms. Remains : 274/300 places, 215/250 transitions.
[2025-05-31 10:29:27] [INFO ] Flatten gal took : 5 ms
[2025-05-31 10:29:27] [INFO ] Flatten gal took : 5 ms
[2025-05-31 10:29:27] [INFO ] Input system was already deterministic with 215 transitions.
[2025-05-31 10:29:27] [INFO ] Flatten gal took : 9 ms
[2025-05-31 10:29:27] [INFO ] Flatten gal took : 5 ms
[2025-05-31 10:29:27] [INFO ] Time to serialize gal into /tmp/CTLFireability15050635505376880773.gal : 1 ms
[2025-05-31 10:29:27] [INFO ] Time to serialize properties into /tmp/CTLFireability14972986987425978612.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/CTLFireability15050635505376880773.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14972986987425978612.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-05-31 10:29:57] [INFO ] Flatten gal took : 6 ms
[2025-05-31 10:29:57] [INFO ] Applying decomposition
[2025-05-31 10:29:57] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10934112316197195318.txt' '-o' '/tmp/graph10934112316197195318.bin' '-w' '/tmp/graph10934112316197195318.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10934112316197195318.bin' '-l' '-1' '-v' '-w' '/tmp/graph10934112316197195318.weights' '-q' '0' '-e' '0.001'
[2025-05-31 10:29:57] [INFO ] Decomposing Gal with order
[2025-05-31 10:29:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 10:29:57] [INFO ] Removed a total of 10 redundant transitions.
[2025-05-31 10:29:57] [INFO ] Flatten gal took : 12 ms
[2025-05-31 10:29:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2025-05-31 10:29:57] [INFO ] Time to serialize gal into /tmp/CTLFireability43136076867772974.gal : 2 ms
[2025-05-31 10:29:57] [INFO ] Time to serialize properties into /tmp/CTLFireability16976776873497675226.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/CTLFireability43136076867772974.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16976776873497675226.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,2.22275e+19,5.73766,125872,5642,624,277846,5643,642,266327,183,19748,0
Converting to forward existential form...Done !
original formula: ((EG(((i10.u62.p275==0)||(i12.u68.p295==0))) * AX((EF(((i10.u43.p216==1)||(i1.u1.p4==1))) * ((EX((i3.u5.p55==0)) + (i8.u31.p178==1)) + (i...454
=> equivalent forward existential formula: (([(Init * !(EG(((i10.u62.p275==0)||(i12.u68.p295==0)))))] = FALSE * ([(EY(Init) * !(E(TRUE U ((i10.u43.p216==1)...981
Reverse transition relation is NOT exact ! Due to transitions t0, t54, t87, t159, t176, t177, t209, u28.t79, u72.t17, u72.t140, i0.u30.t76, i0.u69.t25, i2....814
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 250/250 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 284 transition count 234
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 284 transition count 234
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 35 place count 284 transition count 231
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 40 place count 279 transition count 226
Iterating global reduction 1 with 5 rules applied. Total rules applied 45 place count 279 transition count 226
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 48 place count 279 transition count 223
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 278 transition count 222
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 278 transition count 222
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 51 place count 278 transition count 221
Applied a total of 51 rules in 22 ms. Remains 278 /300 variables (removed 22) and now considering 221/250 (removed 29) transitions.
// Phase 1: matrix 221 rows 278 cols
[2025-05-31 10:30:28] [INFO ] Computed 61 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 10:30:28] [INFO ] Implicit Places using invariants in 302 ms returned []
[2025-05-31 10:30:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 10:30:28] [INFO ] Implicit Places using invariants and state equation in 584 ms returned []
Implicit Place search using SMT with State Equation took 888 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2025-05-31 10:30:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 1/278 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/278 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:30:37] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:30:37] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:30:37] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:30:37] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:30:38] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:30:38] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:30:38] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:30:38] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:30:38] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:30:38] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:30:38] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:30:38] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:30:38] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:30:39] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:30:39] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:30:39] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:30:39] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:30:39] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:30:39] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 19/80 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:30:40] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:30:42] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:30:43] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (OVERLAPS) 221/499 variables, 278/361 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:30:48] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:30:48] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:30:49] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:30:49] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:30:49] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:30:50] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 6/367 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:30:55] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:30:55] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:30:55] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:30:56] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:30:56] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:30:56] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:30:56] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:30:56] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:30:56] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:30:56] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:30:56] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:30:56] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:30:56] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:30:56] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:30:57] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:30:57] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:30:57] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:30:57] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:30:57] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:30:57] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/499 variables, 20/387 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 10:30:58] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 12 ms to minimize.
SMT process timed out in 30031ms, After SMT, problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 30032ms
Starting structural reductions in LTL mode, iteration 1 : 278/300 places, 221/250 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30945 ms. Remains : 278/300 places, 221/250 transitions.
[2025-05-31 10:30:58] [INFO ] Flatten gal took : 9 ms
[2025-05-31 10:30:58] [INFO ] Flatten gal took : 9 ms
[2025-05-31 10:30:59] [INFO ] Input system was already deterministic with 221 transitions.
[2025-05-31 10:30:59] [INFO ] Flatten gal took : 9 ms
[2025-05-31 10:30:59] [INFO ] Flatten gal took : 9 ms
[2025-05-31 10:30:59] [INFO ] Time to serialize gal into /tmp/CTLFireability3884856403604274718.gal : 1 ms
[2025-05-31 10:30:59] [INFO ] Time to serialize properties into /tmp/CTLFireability11254923248759538209.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/CTLFireability3884856403604274718.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11254923248759538209.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-05-31 10:31:29] [INFO ] Flatten gal took : 6 ms
[2025-05-31 10:31:29] [INFO ] Applying decomposition
[2025-05-31 10:31:29] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11346364217512028677.txt' '-o' '/tmp/graph11346364217512028677.bin' '-w' '/tmp/graph11346364217512028677.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11346364217512028677.bin' '-l' '-1' '-v' '-w' '/tmp/graph11346364217512028677.weights' '-q' '0' '-e' '0.001'
[2025-05-31 10:31:29] [INFO ] Decomposing Gal with order
[2025-05-31 10:31:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 10:31:29] [INFO ] Removed a total of 14 redundant transitions.
[2025-05-31 10:31:29] [INFO ] Flatten gal took : 15 ms
[2025-05-31 10:31:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2025-05-31 10:31:29] [INFO ] Time to serialize gal into /tmp/CTLFireability14950005003086050825.gal : 3 ms
[2025-05-31 10:31:29] [INFO ] Time to serialize properties into /tmp/CTLFireability830808489715238922.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/CTLFireability14950005003086050825.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability830808489715238922.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.20603e+19,6.76983,172080,6692,573,440150,3529,731,351774,182,10249,0
Converting to forward existential form...Done !
original formula: AF((((i3.u0.p0==1) * EX(EF((i5.i0.u18.p122==1)))) * ((EF((((i7.i1.u54.p273==1)&&(i9.i1.u62.p277==1))||((i6.i4.u48.p227==1)&&(i6.i4.u61.p2...395
=> equivalent forward existential formula: [FwdG(Init,!((((i3.u0.p0==1) * EX(E(TRUE U (i5.i0.u18.p122==1)))) * ((E(TRUE U (((i7.i1.u54.p273==1)&&(i9.i1.u62...549
Reverse transition relation is NOT exact ! Due to transitions t0, t10, t51, t53, t55, t88, t163, t182, t183, t215, u31.t77, i0.u29.t80, i1.i0.t124, i1.i0.u...867
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
[2025-05-31 10:31:59] [INFO ] Flatten gal took : 7 ms
[2025-05-31 10:31:59] [INFO ] Flatten gal took : 6 ms
[2025-05-31 10:31:59] [INFO ] Applying decomposition
[2025-05-31 10:31:59] [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/graph14093080800819271137.txt' '-o' '/tmp/graph14093080800819271137.bin' '-w' '/tmp/graph14093080800819271137.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14093080800819271137.bin' '-l' '-1' '-v' '-w' '/tmp/graph14093080800819271137.weights' '-q' '0' '-e' '0.001'
[2025-05-31 10:31:59] [INFO ] Decomposing Gal with order
[2025-05-31 10:31:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 10:31:59] [INFO ] Removed a total of 25 redundant transitions.
[2025-05-31 10:31:59] [INFO ] Flatten gal took : 20 ms
[2025-05-31 10:31:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 5 ms.
[2025-05-31 10:31:59] [INFO ] Time to serialize gal into /tmp/CTLFireability3676850366760568705.gal : 5 ms
[2025-05-31 10:31:59] [INFO ] Time to serialize properties into /tmp/CTLFireability551283897744221261.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3676850366760568705.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability551283897744221261.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 13 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.95421e+20,280.42,2780740,154302,583,7.07667e+06,4521,776,5.96422e+06,176,13674,0
Converting to forward existential form...Done !
original formula: (EX((((i0.u36.p167==0) + AG((i4.i0.u29.p134==0))) + (EG((i2.i1.u78.p306==1)) + EG(AG((i2.i1.u80.p311==0)))))) * EF((i9.i2.u71.p279==1)))
=> equivalent forward existential formula: [(FwdU((Init * EX((((i0.u36.p167==0) + !(E(TRUE U !((i4.i0.u29.p134==0))))) + (EG((i2.i1.u78.p306==1)) + EG(!(E(...230
Reverse transition relation is NOT exact ! Due to transitions t0, t62, i0.u37.t80, i1.t135, i1.i1.t133, i1.i1.u9.t138, i1.i1.u9.t143, i2.i0.u15.t121, i2.i0...952
Detected timeout of ITS tools.
[2025-05-31 11:01:46] [INFO ] Applying decomposition
[2025-05-31 11:01:46] [INFO ] Flatten gal took : 7 ms
[2025-05-31 11:01:46] [INFO ] Decomposing Gal with order
[2025-05-31 11:01:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 11:01:46] [INFO ] Removed a total of 52 redundant transitions.
[2025-05-31 11:01:46] [INFO ] Flatten gal took : 13 ms
[2025-05-31 11:01:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 198 labels/synchronizations in 8 ms.
[2025-05-31 11:01:46] [INFO ] Time to serialize gal into /tmp/CTLFireability10045516889173763987.gal : 4 ms
[2025-05-31 11:01:46] [INFO ] Time to serialize properties into /tmp/CTLFireability1566427695933039194.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/CTLFireability10045516889173763987.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1566427695933039194.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 13 CTL formulae.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-10b"
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 DES-PT-10b, 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 r058-smll-174854063900290"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-10b.tgz
mv DES-PT-10b execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;