About the Execution of ITS-Tools for MedleyA-PT-19
| 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??T????F???T?T | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524200241.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is MedleyA-PT-19, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524200241
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 184K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME MedleyA-PT-19-CTLCardinality-2024-12
FORMULA_NAME MedleyA-PT-19-CTLCardinality-2024-13
FORMULA_NAME MedleyA-PT-19-CTLCardinality-2024-14
FORMULA_NAME MedleyA-PT-19-CTLCardinality-2024-15
FORMULA_NAME MedleyA-PT-19-CTLCardinality-2025-00
FORMULA_NAME MedleyA-PT-19-CTLCardinality-2025-01
FORMULA_NAME MedleyA-PT-19-CTLCardinality-2025-02
FORMULA_NAME MedleyA-PT-19-CTLCardinality-2025-03
FORMULA_NAME MedleyA-PT-19-CTLCardinality-2025-04
FORMULA_NAME MedleyA-PT-19-CTLCardinality-2025-05
FORMULA_NAME MedleyA-PT-19-CTLCardinality-2025-06
FORMULA_NAME MedleyA-PT-19-CTLCardinality-2025-07
FORMULA_NAME MedleyA-PT-19-CTLCardinality-2025-08
FORMULA_NAME MedleyA-PT-19-CTLCardinality-2025-09
FORMULA_NAME MedleyA-PT-19-CTLCardinality-2025-10
FORMULA_NAME MedleyA-PT-19-CTLCardinality-2025-11
=== Now, execution of the tool begins
BK_START 1748880139696
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-19
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-02 16:02:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 16:02:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 16:02:22] [INFO ] Load time of PNML (sax parser for PT used): 231 ms
[2025-06-02 16:02:22] [INFO ] Transformed 272 places.
[2025-06-02 16:02:22] [INFO ] Transformed 586 transitions.
[2025-06-02 16:02:22] [INFO ] Found NUPN structural information;
[2025-06-02 16:02:22] [INFO ] Parsed PT model containing 272 places and 586 transitions and 2889 arcs in 407 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 25 ms.
Deduced a syphon composed of 3 places in 8 ms
Reduce places removed 3 places and 3 transitions.
FORMULA MedleyA-PT-19-CTLCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 107 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 583/583 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 268 transition count 583
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 41 place count 228 transition count 538
Iterating global reduction 1 with 40 rules applied. Total rules applied 81 place count 228 transition count 538
Applied a total of 81 rules in 100 ms. Remains 228 /269 variables (removed 41) and now considering 538/583 (removed 45) transitions.
// Phase 1: matrix 538 rows 228 cols
[2025-06-02 16:02:22] [INFO ] Computed 23 invariants in 33 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:02:23] [INFO ] Implicit Places using invariants in 816 ms returned []
[2025-06-02 16:02:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:02:23] [INFO ] Implicit Places using invariants and state equation in 509 ms returned []
Implicit Place search using SMT with State Equation took 1382 ms to find 0 implicit places.
Running 537 sub problems to find dead transitions.
[2025-06-02 16:02:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/226 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 537 unsolved
Problem TDEAD229 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD512 is UNSAT
At refinement iteration 2 (OVERLAPS) 2/228 variables, 7/23 constraints. Problems are: Problem set: 120 solved, 417 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:02:34] [INFO ] Deduced a trap composed of 34 places in 269 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:02:34] [INFO ] Deduced a trap composed of 30 places in 163 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:02:35] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:02:35] [INFO ] Deduced a trap composed of 40 places in 303 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:02:35] [INFO ] Deduced a trap composed of 41 places in 326 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:02:36] [INFO ] Deduced a trap composed of 27 places in 275 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:02:36] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:02:36] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:02:37] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:02:37] [INFO ] Deduced a trap composed of 21 places in 160 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:02:37] [INFO ] Deduced a trap composed of 43 places in 157 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:02:37] [INFO ] Deduced a trap composed of 34 places in 217 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:02:38] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:02:38] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:02:38] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:02:38] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:02:38] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:02:39] [INFO ] Deduced a trap composed of 21 places in 156 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:02:39] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:02:39] [INFO ] Deduced a trap composed of 28 places in 149 ms of which 21 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 20/43 constraints. Problems are: Problem set: 120 solved, 417 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:02:43] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:02:43] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:02:44] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:02:44] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 4/47 constraints. Problems are: Problem set: 120 solved, 417 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:02:46] [INFO ] Deduced a trap composed of 24 places in 236 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:02:46] [INFO ] Deduced a trap composed of 27 places in 208 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:02:46] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:02:46] [INFO ] Deduced a trap composed of 51 places in 140 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:02:47] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:02:47] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 6/53 constraints. Problems are: Problem set: 120 solved, 417 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:02:50] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:02:50] [INFO ] Deduced a trap composed of 45 places in 126 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:02:51] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 3/56 constraints. Problems are: Problem set: 120 solved, 417 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 228/766 variables, and 56 constraints, problems are : Problem set: 120 solved, 417 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 0/228 constraints, PredecessorRefiner: 537/537 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 120 solved, 417 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 16/16 constraints. Problems are: Problem set: 120 solved, 417 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/226 variables, 0/16 constraints. Problems are: Problem set: 120 solved, 417 unsolved
At refinement iteration 2 (OVERLAPS) 2/228 variables, 7/23 constraints. Problems are: Problem set: 120 solved, 417 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 33/56 constraints. Problems are: Problem set: 120 solved, 417 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:02:58] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 1/57 constraints. Problems are: Problem set: 120 solved, 417 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 0/57 constraints. Problems are: Problem set: 120 solved, 417 unsolved
At refinement iteration 6 (OVERLAPS) 538/766 variables, 228/285 constraints. Problems are: Problem set: 120 solved, 417 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/766 variables, 417/702 constraints. Problems are: Problem set: 120 solved, 417 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:03:22] [INFO ] Deduced a trap composed of 18 places in 287 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:03:22] [INFO ] Deduced a trap composed of 20 places in 206 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:03:22] [INFO ] Deduced a trap composed of 23 places in 290 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:03:23] [INFO ] Deduced a trap composed of 28 places in 171 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:03:23] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:03:24] [INFO ] Deduced a trap composed of 42 places in 203 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:03:24] [INFO ] Deduced a trap composed of 44 places in 203 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:03:25] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 766/766 variables, and 710 constraints, problems are : Problem set: 120 solved, 417 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 417/537 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61285ms problems are : Problem set: 120 solved, 417 unsolved
Search for dead transitions found 120 dead transitions in 61315ms
Found 120 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 120 transitions
Dead transitions reduction (with SMT) removed 120 transitions
Starting structural reductions in LTL mode, iteration 1 : 228/269 places, 418/583 transitions.
Applied a total of 0 rules in 7 ms. Remains 228 /228 variables (removed 0) and now considering 418/418 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62849 ms. Remains : 228/269 places, 418/583 transitions.
Support contains 107 out of 228 places after structural reductions.
[2025-06-02 16:03:25] [INFO ] Flatten gal took : 94 ms
[2025-06-02 16:03:25] [INFO ] Flatten gal took : 49 ms
[2025-06-02 16:03:25] [INFO ] Input system was already deterministic with 418 transitions.
Support contains 102 out of 228 places (down from 107) after GAL structural reductions.
RANDOM walk for 40000 steps (13 resets) in 2848 ms. (14 steps per ms) remains 43/75 properties
BEST_FIRST walk for 4002 steps (11 resets) in 28 ms. (138 steps per ms) remains 42/43 properties
BEST_FIRST walk for 4003 steps (10 resets) in 18 ms. (210 steps per ms) remains 40/42 properties
BEST_FIRST walk for 4002 steps (9 resets) in 44 ms. (88 steps per ms) remains 38/40 properties
BEST_FIRST walk for 4003 steps (10 resets) in 44 ms. (88 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (12 resets) in 58 ms. (67 steps per ms) remains 37/38 properties
BEST_FIRST walk for 4001 steps (10 resets) in 21 ms. (181 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (12 resets) in 34 ms. (114 steps per ms) remains 36/37 properties
BEST_FIRST walk for 4004 steps (12 resets) in 16 ms. (235 steps per ms) remains 35/36 properties
BEST_FIRST walk for 4004 steps (13 resets) in 21 ms. (182 steps per ms) remains 30/35 properties
BEST_FIRST walk for 4002 steps (12 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (13 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (11 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (14 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (11 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (11 resets) in 23 ms. (166 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (12 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (11 resets) in 13 ms. (285 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (12 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (13 resets) in 15 ms. (250 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4003 steps (11 resets) in 21 ms. (181 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (11 resets) in 15 ms. (250 steps per ms) remains 26/29 properties
BEST_FIRST walk for 4000 steps (10 resets) in 21 ms. (181 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (12 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (12 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (11 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (10 resets) in 10 ms. (363 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (11 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (13 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (13 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (12 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
// Phase 1: matrix 418 rows 228 cols
[2025-06-02 16:03:26] [INFO ] Computed 23 invariants in 6 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/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 87/123 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 2/125 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 84/209 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 3/212 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (OVERLAPS) 407/619 variables, 212/233 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/619 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (OVERLAPS) 16/635 variables, 9/242 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/635 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 13 (OVERLAPS) 1/636 variables, 2/244 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/636 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/636 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 16 (OVERLAPS) 9/645 variables, 5/250 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/645 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 18 (OVERLAPS) 1/646 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/646 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 20 (OVERLAPS) 0/646 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 251 constraints, problems are : Problem set: 0 solved, 26 unsolved in 3233 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 87/123 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 26 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:03:30] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 2/125 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (OVERLAPS) 84/209 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 26 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:03:31] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:03:31] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:03:31] [INFO ] Deduced a trap composed of 29 places in 164 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:03:31] [INFO ] Deduced a trap composed of 31 places in 164 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:03:31] [INFO ] Deduced a trap composed of 31 places in 209 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:03:32] [INFO ] Deduced a trap composed of 27 places in 194 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:03:32] [INFO ] Deduced a trap composed of 48 places in 204 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:03:32] [INFO ] Deduced a trap composed of 48 places in 171 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:03:32] [INFO ] Deduced a trap composed of 30 places in 194 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:03:32] [INFO ] Deduced a trap composed of 22 places in 166 ms of which 21 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 26 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:03:33] [INFO ] Deduced a trap composed of 17 places in 160 ms of which 15 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (OVERLAPS) 3/212 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 26 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:03:34] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:03:34] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/212 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 26 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:03:34] [INFO ] Deduced a trap composed of 31 places in 219 ms of which 22 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/212 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/212 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 14 (OVERLAPS) 407/619 variables, 212/248 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/619 variables, 20/268 constraints. Problems are: Problem set: 0 solved, 26 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 619/646 variables, and 268 constraints, problems are : Problem set: 0 solved, 26 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 14/16 constraints, State Equation: 212/228 constraints, PredecessorRefiner: 20/26 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8263ms problems are : Problem set: 0 solved, 26 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 36 out of 228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 418/418 transitions.
Graph (complete) has 753 edges and 228 vertex of which 225 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 225 transition count 384
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 67 place count 194 transition count 381
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 71 place count 193 transition count 378
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 74 place count 190 transition count 378
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 74 place count 190 transition count 374
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 82 place count 186 transition count 374
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 100 place count 168 transition count 349
Iterating global reduction 4 with 18 rules applied. Total rules applied 118 place count 168 transition count 349
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 196 place count 129 transition count 310
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 198 place count 129 transition count 308
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 214 place count 121 transition count 345
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 215 place count 121 transition count 344
Drop transitions (Redundant composition of simpler transitions.) removed 51 transitions
Redundant transition composition rules discarded 51 transitions
Iterating global reduction 6 with 51 rules applied. Total rules applied 266 place count 121 transition count 293
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 268 place count 120 transition count 301
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 276 place count 120 transition count 293
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 280 place count 120 transition count 289
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 284 place count 116 transition count 289
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 7 with 9 rules applied. Total rules applied 293 place count 116 transition count 281
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 303 place count 107 transition count 280
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 306 place count 107 transition count 280
Applied a total of 306 rules in 186 ms. Remains 107 /228 variables (removed 121) and now considering 280/418 (removed 138) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 186 ms. Remains : 107/228 places, 280/418 transitions.
RANDOM walk for 40000 steps (4563 resets) in 517 ms. (77 steps per ms) remains 6/26 properties
BEST_FIRST walk for 40003 steps (630 resets) in 110 ms. (360 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (609 resets) in 68 ms. (579 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (581 resets) in 87 ms. (454 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (612 resets) in 82 ms. (481 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (595 resets) in 84 ms. (470 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (617 resets) in 99 ms. (400 steps per ms) remains 5/6 properties
// Phase 1: matrix 280 rows 107 cols
[2025-06-02 16:03:35] [INFO ] Computed 23 invariants in 4 ms
[2025-06-02 16:03:35] [INFO ] State equation strengthened by 121 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 13/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 31/51 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 47/98 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 8/106 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 280/386 variables, 106/129 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/386 variables, 121/250 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/386 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 1/387 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/387 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/387 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 251 constraints, problems are : Problem set: 0 solved, 5 unsolved in 379 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 107/107 constraints, ReadFeed: 121/121 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 13/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 31/51 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 47/98 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 8/106 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 280/386 variables, 106/129 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/386 variables, 121/250 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/386 variables, 5/255 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/386 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 1/387 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/387 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/387 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 256 constraints, problems are : Problem set: 0 solved, 5 unsolved in 983 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 107/107 constraints, ReadFeed: 121/121 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1383ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 254 ms.
Support contains 7 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 280/280 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 107 transition count 277
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 104 transition count 277
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 9 place count 101 transition count 271
Iterating global reduction 2 with 3 rules applied. Total rules applied 12 place count 101 transition count 271
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 33 rules applied. Total rules applied 45 place count 83 transition count 256
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 49 place count 81 transition count 275
Drop transitions (Redundant composition of simpler transitions.) removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 2 with 34 rules applied. Total rules applied 83 place count 81 transition count 241
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 86 place count 81 transition count 238
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 89 place count 78 transition count 238
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 90 place count 78 transition count 237
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 94 place count 78 transition count 236
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 99 place count 74 transition count 235
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 101 place count 74 transition count 233
Applied a total of 101 rules in 67 ms. Remains 74 /107 variables (removed 33) and now considering 233/280 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 74/107 places, 233/280 transitions.
RANDOM walk for 34296 steps (4236 resets) in 2079 ms. (16 steps per ms) remains 0/5 properties
[2025-06-02 16:03:38] [INFO ] Flatten gal took : 37 ms
[2025-06-02 16:03:38] [INFO ] Flatten gal took : 38 ms
[2025-06-02 16:03:38] [INFO ] Input system was already deterministic with 418 transitions.
Computed a total of 25 stabilizing places and 28 stable transitions
Graph (complete) has 753 edges and 228 vertex of which 224 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.7 ms
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 418/418 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 227 transition count 418
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 40 place count 188 transition count 372
Iterating global reduction 1 with 39 rules applied. Total rules applied 79 place count 188 transition count 372
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 82 place count 185 transition count 366
Iterating global reduction 1 with 3 rules applied. Total rules applied 85 place count 185 transition count 366
Applied a total of 85 rules in 13 ms. Remains 185 /228 variables (removed 43) and now considering 366/418 (removed 52) transitions.
// Phase 1: matrix 366 rows 185 cols
[2025-06-02 16:03:38] [INFO ] Computed 22 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:03:38] [INFO ] Implicit Places using invariants in 120 ms returned []
[2025-06-02 16:03:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:03:38] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2025-06-02 16:03:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:03:46] [INFO ] Deduced a trap composed of 25 places in 163 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:03:46] [INFO ] Deduced a trap composed of 25 places in 151 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:03:46] [INFO ] Deduced a trap composed of 35 places in 157 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:03:46] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:03:47] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:03:47] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:03:47] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:03:48] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:03:48] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:03:48] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 366/551 variables, 185/217 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:03:59] [INFO ] Deduced a trap composed of 13 places in 272 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:03:59] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:04:00] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:04:00] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 4/221 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 551/551 variables, and 221 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 14/36 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 366/551 variables, 185/221 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 365/586 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:04:24] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:04:24] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:04:26] [INFO ] Deduced a trap composed of 21 places in 230 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:04:28] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:04:28] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:04:29] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 6/592 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 592 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60524ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 60527ms
Starting structural reductions in LTL mode, iteration 1 : 185/228 places, 366/418 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60952 ms. Remains : 185/228 places, 366/418 transitions.
[2025-06-02 16:04:39] [INFO ] Flatten gal took : 34 ms
[2025-06-02 16:04:39] [INFO ] Flatten gal took : 31 ms
[2025-06-02 16:04:39] [INFO ] Input system was already deterministic with 366 transitions.
[2025-06-02 16:04:39] [INFO ] Flatten gal took : 25 ms
[2025-06-02 16:04:39] [INFO ] Flatten gal took : 25 ms
[2025-06-02 16:04:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality7669704500660776469.gal : 25 ms
[2025-06-02 16:04:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality10020313088523254915.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7669704500660776469.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10020313088523254915.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 16:05:09] [INFO ] Flatten gal took : 17 ms
[2025-06-02 16:05:09] [INFO ] Applying decomposition
[2025-06-02 16:05:09] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7730288953236663392.txt' '-o' '/tmp/graph7730288953236663392.bin' '-w' '/tmp/graph7730288953236663392.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7730288953236663392.bin' '-l' '-1' '-v' '-w' '/tmp/graph7730288953236663392.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:05:09] [INFO ] Decomposing Gal with order
[2025-06-02 16:05:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:05:09] [INFO ] Removed a total of 675 redundant transitions.
[2025-06-02 16:05:10] [INFO ] Flatten gal took : 147 ms
[2025-06-02 16:05:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 29 ms.
[2025-06-02 16:05:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality7382056222188067457.gal : 12 ms
[2025-06-02 16:05:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality9748041008529292303.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/CTLCardinality7382056222188067457.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9748041008529292303.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.65439e+11,0.490891,16564,780,53,27801,638,545,50355,64,2770,0
Converting to forward existential form...Done !
original formula: EG(E(AG((EX(((i2.u3.p5==0)||(i2.u16.p75==1))) + E((i5.u29.p133==1) U (i0.i2.u39.p190==0)))) U EF((i4.u19.p92!=1))))
=> equivalent forward existential formula: [FwdG(Init,E(!(E(TRUE U !((EX(((i2.u3.p5==0)||(i2.u16.p75==1))) + E((i5.u29.p133==1) U (i0.i2.u39.p190==0)))))) ...194
Reverse transition relation is NOT exact ! Due to transitions t29, t55, t92, t125, i1.i1.u55.t18, i1.i1.u55.t19, i1.i2.u54.t20, i1.i2.u54.t235, i2.t136, i2...936
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,1,1.52135,45748,1,0,93850,1098,3787,176833,322,4432,170597
FORMULA MedleyA-PT-19-CTLCardinality-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 418/418 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 227 transition count 418
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 37 place count 191 transition count 376
Iterating global reduction 1 with 36 rules applied. Total rules applied 73 place count 191 transition count 376
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 76 place count 188 transition count 370
Iterating global reduction 1 with 3 rules applied. Total rules applied 79 place count 188 transition count 370
Applied a total of 79 rules in 11 ms. Remains 188 /228 variables (removed 40) and now considering 370/418 (removed 48) transitions.
// Phase 1: matrix 370 rows 188 cols
[2025-06-02 16:05:11] [INFO ] Computed 22 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:05:11] [INFO ] Implicit Places using invariants in 126 ms returned []
[2025-06-02 16:05:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:05:12] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 546 ms to find 0 implicit places.
Running 369 sub problems to find dead transitions.
[2025-06-02 16:05:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:05:20] [INFO ] Deduced a trap composed of 26 places in 181 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:05:21] [INFO ] Deduced a trap composed of 26 places in 143 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:05:21] [INFO ] Deduced a trap composed of 36 places in 169 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:05:21] [INFO ] Deduced a trap composed of 36 places in 149 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:05:21] [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-06-02 16:05:22] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:05:22] [INFO ] Deduced a trap composed of 36 places in 243 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:05:22] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:05:22] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:05:23] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:05:23] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:05:23] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:05:23] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 15 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 13/35 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:05:28] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 6 (OVERLAPS) 370/558 variables, 188/224 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:05:40] [INFO ] Deduced a trap composed of 14 places in 208 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:05:41] [INFO ] Deduced a trap composed of 14 places in 227 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:05:41] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:05:42] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 11 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 558/558 variables, and 228 constraints, problems are : Problem set: 0 solved, 369 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 369 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 18/40 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 5 (OVERLAPS) 370/558 variables, 188/228 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 369/597 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:05:57] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:05:57] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:05:57] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:05:58] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:05:59] [INFO ] Deduced a trap composed of 23 places in 259 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:06:01] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:06:02] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:06:02] [INFO ] Deduced a trap composed of 34 places in 128 ms of which 14 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/558 variables, 8/605 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 558/558 variables, and 605 constraints, problems are : Problem set: 0 solved, 369 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60360ms problems are : Problem set: 0 solved, 369 unsolved
Search for dead transitions found 0 dead transitions in 60364ms
Starting structural reductions in LTL mode, iteration 1 : 188/228 places, 370/418 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60924 ms. Remains : 188/228 places, 370/418 transitions.
[2025-06-02 16:06:12] [INFO ] Flatten gal took : 18 ms
[2025-06-02 16:06:12] [INFO ] Flatten gal took : 20 ms
[2025-06-02 16:06:12] [INFO ] Input system was already deterministic with 370 transitions.
[2025-06-02 16:06:12] [INFO ] Flatten gal took : 16 ms
[2025-06-02 16:06:12] [INFO ] Flatten gal took : 16 ms
[2025-06-02 16:06:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality9753407047690870066.gal : 5 ms
[2025-06-02 16:06:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality17353369228649345964.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/CTLCardinality9753407047690870066.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17353369228649345964.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 16:06:42] [INFO ] Flatten gal took : 15 ms
[2025-06-02 16:06:42] [INFO ] Applying decomposition
[2025-06-02 16:06:42] [INFO ] Flatten gal took : 14 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/graph14797829438594547633.txt' '-o' '/tmp/graph14797829438594547633.bin' '-w' '/tmp/graph14797829438594547633.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14797829438594547633.bin' '-l' '-1' '-v' '-w' '/tmp/graph14797829438594547633.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:06:42] [INFO ] Decomposing Gal with order
[2025-06-02 16:06:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:06:43] [INFO ] Removed a total of 585 redundant transitions.
[2025-06-02 16:06:43] [INFO ] Flatten gal took : 44 ms
[2025-06-02 16:06:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 17 ms.
[2025-06-02 16:06:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality13172675336072524293.gal : 6 ms
[2025-06-02 16:06:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality9952495428022268326.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/CTLCardinality13172675336072524293.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9952495428022268326.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,8.14169e+11,2.8825,70544,2574,864,119118,16888,609,284871,173,128560,0
Converting to forward existential form...Done !
original formula: A(AX(E(!(A(((i6.u41.p223==0)||(i3.u30.p129==1)) U (i0.u8.p38==1))) U (EG((i9.i2.u56.p260==0)) * A((i1.i1.u16.p65==1) U ((i4.i0.u24.p106==...321
=> equivalent forward existential formula: [((Init * !(EG(!(((!(((i4.i0.u34.p144==0)||(i1.i1.u7.p46==1))) * !(EG(!(((i6.u39.p163==0)||(i1.i0.u4.p22==1)))))...860
Reverse transition relation is NOT exact ! Due to transitions t9, t29, t95, t142, i0.t153, i0.t151, i0.u8.t159, i0.u8.t160, i0.u11.t154, i0.u11.t158, i0.u1...1241
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 a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 418/418 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 227 transition count 418
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 40 place count 188 transition count 372
Iterating global reduction 1 with 39 rules applied. Total rules applied 79 place count 188 transition count 372
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 82 place count 185 transition count 366
Iterating global reduction 1 with 3 rules applied. Total rules applied 85 place count 185 transition count 366
Applied a total of 85 rules in 12 ms. Remains 185 /228 variables (removed 43) and now considering 366/418 (removed 52) transitions.
// Phase 1: matrix 366 rows 185 cols
[2025-06-02 16:07:13] [INFO ] Computed 22 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:07:13] [INFO ] Implicit Places using invariants in 129 ms returned []
[2025-06-02 16:07:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:07:13] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 515 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2025-06-02 16:07:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:07:21] [INFO ] Deduced a trap composed of 25 places in 184 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:07:21] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:07:21] [INFO ] Deduced a trap composed of 35 places in 143 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:07:21] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:07:22] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:07:22] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:07:23] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:07:23] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:07:23] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:07:23] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 366/551 variables, 185/217 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:07:32] [INFO ] Deduced a trap composed of 13 places in 289 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:07:32] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:07:33] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:07:33] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:07:33] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:07:34] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 6/223 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 551/551 variables, and 223 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 366/551 variables, 185/223 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 365/588 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:08:03] [INFO ] Deduced a trap composed of 24 places in 189 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:08:03] [INFO ] Deduced a trap composed of 34 places in 159 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:08:05] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:08:07] [INFO ] Deduced a trap composed of 34 places in 141 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 592 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60252ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 60253ms
Starting structural reductions in LTL mode, iteration 1 : 185/228 places, 366/418 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60782 ms. Remains : 185/228 places, 366/418 transitions.
[2025-06-02 16:08:13] [INFO ] Flatten gal took : 22 ms
[2025-06-02 16:08:13] [INFO ] Flatten gal took : 23 ms
[2025-06-02 16:08:14] [INFO ] Input system was already deterministic with 366 transitions.
[2025-06-02 16:08:14] [INFO ] Flatten gal took : 21 ms
[2025-06-02 16:08:14] [INFO ] Flatten gal took : 24 ms
[2025-06-02 16:08:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality4920619750924727034.gal : 6 ms
[2025-06-02 16:08:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality6525190652616243042.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/CTLCardinality4920619750924727034.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6525190652616243042.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 16:08:44] [INFO ] Flatten gal took : 16 ms
[2025-06-02 16:08:44] [INFO ] Applying decomposition
[2025-06-02 16:08:44] [INFO ] Flatten gal took : 14 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/graph14887042972129288787.txt' '-o' '/tmp/graph14887042972129288787.bin' '-w' '/tmp/graph14887042972129288787.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14887042972129288787.bin' '-l' '-1' '-v' '-w' '/tmp/graph14887042972129288787.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:08:44] [INFO ] Decomposing Gal with order
[2025-06-02 16:08:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:08:44] [INFO ] Removed a total of 617 redundant transitions.
[2025-06-02 16:08:44] [INFO ] Flatten gal took : 34 ms
[2025-06-02 16:08:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 12 ms.
[2025-06-02 16:08:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality17800631929177649595.gal : 5 ms
[2025-06-02 16:08:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality12246460909919158821.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/CTLCardinality17800631929177649595.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12246460909919158821.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.65439e+11,1.59006,38456,1992,120,67778,1323,512,133876,105,5398,0
Converting to forward existential form...Done !
original formula: EG(AF(AX((i0.u2.p14==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(!(EX(!((i0.u2.p14==1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t37, t42, t44, t77, t124, i0.u2.t163, i1.t150, i1.t148, i1.t139, i1.u6.t158, i1.u6.t159, i1.u...879
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 418/418 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 193 transition count 376
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 193 transition count 376
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 191 transition count 372
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 191 transition count 372
Applied a total of 74 rules in 10 ms. Remains 191 /228 variables (removed 37) and now considering 372/418 (removed 46) transitions.
// Phase 1: matrix 372 rows 191 cols
[2025-06-02 16:09:14] [INFO ] Computed 23 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:09:14] [INFO ] Implicit Places using invariants in 125 ms returned []
[2025-06-02 16:09:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:09:14] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
Running 371 sub problems to find dead transitions.
[2025-06-02 16:09:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (OVERLAPS) 2/191 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:09:23] [INFO ] Deduced a trap composed of 19 places in 194 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:09:23] [INFO ] Deduced a trap composed of 15 places in 255 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:09:23] [INFO ] Deduced a trap composed of 22 places in 190 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:09:24] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:09:24] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:09:24] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:09:24] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:09:25] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:09:25] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:09:25] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:09:25] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 11/34 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 5 (OVERLAPS) 372/563 variables, 191/225 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:09:35] [INFO ] Deduced a trap composed of 14 places in 279 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:09:35] [INFO ] Deduced a trap composed of 15 places in 221 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:09:35] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:09:36] [INFO ] Deduced a trap composed of 14 places in 128 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:09:36] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:09:37] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 6/231 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 563/563 variables, and 231 constraints, problems are : Problem set: 0 solved, 371 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 371 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (OVERLAPS) 2/191 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 5 (OVERLAPS) 372/563 variables, 191/231 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 371/602 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:10:00] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:10:01] [INFO ] Deduced a trap composed of 19 places in 233 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:10:02] [INFO ] Deduced a trap composed of 29 places in 266 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:10:02] [INFO ] Deduced a trap composed of 40 places in 283 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:10:03] [INFO ] Deduced a trap composed of 36 places in 201 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:10:04] [INFO ] Deduced a trap composed of 42 places in 167 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:10:05] [INFO ] Deduced a trap composed of 40 places in 194 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:10:07] [INFO ] Deduced a trap composed of 45 places in 215 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:10:07] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:10:10] [INFO ] Deduced a trap composed of 20 places in 148 ms of which 18 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 563/563 variables, and 612 constraints, problems are : Problem set: 0 solved, 371 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60258ms problems are : Problem set: 0 solved, 371 unsolved
Search for dead transitions found 0 dead transitions in 60260ms
Starting structural reductions in LTL mode, iteration 1 : 191/228 places, 372/418 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60682 ms. Remains : 191/228 places, 372/418 transitions.
[2025-06-02 16:10:15] [INFO ] Flatten gal took : 18 ms
[2025-06-02 16:10:15] [INFO ] Flatten gal took : 22 ms
[2025-06-02 16:10:15] [INFO ] Input system was already deterministic with 372 transitions.
[2025-06-02 16:10:15] [INFO ] Flatten gal took : 17 ms
[2025-06-02 16:10:15] [INFO ] Flatten gal took : 17 ms
[2025-06-02 16:10:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality12048004096547800997.gal : 4 ms
[2025-06-02 16:10:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality11585730896387272401.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/CTLCardinality12048004096547800997.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11585730896387272401.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 16:10:45] [INFO ] Flatten gal took : 12 ms
[2025-06-02 16:10:45] [INFO ] Applying decomposition
[2025-06-02 16:10:45] [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/graph8780918664649217609.txt' '-o' '/tmp/graph8780918664649217609.bin' '-w' '/tmp/graph8780918664649217609.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8780918664649217609.bin' '-l' '-1' '-v' '-w' '/tmp/graph8780918664649217609.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:10:45] [INFO ] Decomposing Gal with order
[2025-06-02 16:10:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:10:45] [INFO ] Removed a total of 554 redundant transitions.
[2025-06-02 16:10:45] [INFO ] Flatten gal took : 34 ms
[2025-06-02 16:10:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 8 ms.
[2025-06-02 16:10:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality16859202901066987365.gal : 4 ms
[2025-06-02 16:10:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality4424755522613400883.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/CTLCardinality16859202901066987365.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4424755522613400883.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,7.15392e+11,0.999936,30896,1858,168,51910,3830,532,114618,125,12779,0
Converting to forward existential form...Done !
original formula: (AF(((i0.i1.u1.p4==1) + ((A(((i9.i1.u20.p83==0)||(i9.i1.u53.p241==0)) U ((i9.i0.u33.p137==0)||(i9.i0.u34.p153==1))) * (((i8.u51.p229==0)|...378
=> equivalent forward existential formula: [FwdG((Init * !(EG((E(TRUE U ((i5.u29.p132==0)&&(i6.u36.p170==1))) + !(E(((i9.i1.u32.p140==0)||(i9.i1.u53.p243==...545
Reverse transition relation is NOT exact ! Due to transitions t9, t30, t131, i2.t144, i2.t142, i2.t139, i2.t138, i2.t130, i2.u3.t168, i2.u14.t132, i2.u14.t...1028
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 418/418 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 227 transition count 418
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 41 place count 187 transition count 371
Iterating global reduction 1 with 40 rules applied. Total rules applied 81 place count 187 transition count 371
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 84 place count 184 transition count 365
Iterating global reduction 1 with 3 rules applied. Total rules applied 87 place count 184 transition count 365
Applied a total of 87 rules in 9 ms. Remains 184 /228 variables (removed 44) and now considering 365/418 (removed 53) transitions.
// Phase 1: matrix 365 rows 184 cols
[2025-06-02 16:11:15] [INFO ] Computed 22 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:11:15] [INFO ] Implicit Places using invariants in 135 ms returned []
[2025-06-02 16:11:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:11:16] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
Running 364 sub problems to find dead transitions.
[2025-06-02 16:11:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/184 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:24] [INFO ] Deduced a trap composed of 25 places in 178 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:24] [INFO ] Deduced a trap composed of 25 places in 137 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:24] [INFO ] Deduced a trap composed of 35 places in 150 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:25] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:25] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:25] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:26] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:26] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:26] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:26] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (OVERLAPS) 365/549 variables, 184/216 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:37] [INFO ] Deduced a trap composed of 13 places in 234 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:37] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:38] [INFO ] Deduced a trap composed of 14 places in 189 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:38] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:38] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:39] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 13 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 6/222 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 549/549 variables, and 222 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 364 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/184 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (OVERLAPS) 365/549 variables, 184/222 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 364/586 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:09] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:09] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 16 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 549/549 variables, and 588 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60389ms problems are : Problem set: 0 solved, 364 unsolved
Search for dead transitions found 0 dead transitions in 60392ms
Starting structural reductions in LTL mode, iteration 1 : 184/228 places, 365/418 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60914 ms. Remains : 184/228 places, 365/418 transitions.
[2025-06-02 16:12:16] [INFO ] Flatten gal took : 16 ms
[2025-06-02 16:12:16] [INFO ] Flatten gal took : 16 ms
[2025-06-02 16:12:16] [INFO ] Input system was already deterministic with 365 transitions.
[2025-06-02 16:12:16] [INFO ] Flatten gal took : 16 ms
[2025-06-02 16:12:16] [INFO ] Flatten gal took : 17 ms
[2025-06-02 16:12:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality13192902804820236956.gal : 5 ms
[2025-06-02 16:12:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality6271183963790869641.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/CTLCardinality13192902804820236956.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6271183963790869641.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 16:12:46] [INFO ] Flatten gal took : 9 ms
[2025-06-02 16:12:46] [INFO ] Applying decomposition
[2025-06-02 16:12:46] [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/graph5668351167902779807.txt' '-o' '/tmp/graph5668351167902779807.bin' '-w' '/tmp/graph5668351167902779807.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5668351167902779807.bin' '-l' '-1' '-v' '-w' '/tmp/graph5668351167902779807.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:12:46] [INFO ] Decomposing Gal with order
[2025-06-02 16:12:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:12:46] [INFO ] Removed a total of 672 redundant transitions.
[2025-06-02 16:12:46] [INFO ] Flatten gal took : 40 ms
[2025-06-02 16:12:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 26 ms.
[2025-06-02 16:12:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality1101345389665407146.gal : 3 ms
[2025-06-02 16:12:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality3295859819706007892.ctl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1101345389665407146.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3295859819706007892.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.64709e+11,1.62857,45680,1885,55,90160,1330,586,189757,72,6219,0
Converting to forward existential form...Done !
original formula: AF(EG(AX(FALSE)))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(EX(!(FALSE))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t44, t77, t124, i0.t135, i0.t131, i0.t123, i0.u3.t161, i0.u14.t125, i0.u14.t130, i0.u17.t127,...914
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 418/418 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 227 transition count 418
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 35 place count 193 transition count 378
Iterating global reduction 1 with 34 rules applied. Total rules applied 69 place count 193 transition count 378
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 71 place count 191 transition count 374
Iterating global reduction 1 with 2 rules applied. Total rules applied 73 place count 191 transition count 374
Applied a total of 73 rules in 7 ms. Remains 191 /228 variables (removed 37) and now considering 374/418 (removed 44) transitions.
// Phase 1: matrix 374 rows 191 cols
[2025-06-02 16:13:16] [INFO ] Computed 22 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:13:17] [INFO ] Implicit Places using invariants in 128 ms returned []
[2025-06-02 16:13:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:13:17] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
Running 373 sub problems to find dead transitions.
[2025-06-02 16:13: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/190 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 2 (OVERLAPS) 1/191 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 373 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:26] [INFO ] Deduced a trap composed of 25 places in 180 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:26] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:26] [INFO ] Deduced a trap composed of 35 places in 160 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:26] [INFO ] Deduced a trap composed of 35 places in 128 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:27] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:27] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:27] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:27] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:28] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:28] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 5 (OVERLAPS) 374/565 variables, 191/223 constraints. Problems are: Problem set: 0 solved, 373 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:39] [INFO ] Deduced a trap composed of 13 places in 226 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:39] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:40] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:40] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 4/227 constraints. Problems are: Problem set: 0 solved, 373 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 565/565 variables, and 227 constraints, problems are : Problem set: 0 solved, 373 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 373/373 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 373 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 2 (OVERLAPS) 1/191 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 14/36 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 5 (OVERLAPS) 374/565 variables, 191/227 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 373/600 constraints. Problems are: Problem set: 0 solved, 373 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:02] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:03] [INFO ] Deduced a trap composed of 43 places in 155 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:05] [INFO ] Deduced a trap composed of 21 places in 278 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:07] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:09] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 5/605 constraints. Problems are: Problem set: 0 solved, 373 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 565/565 variables, and 605 constraints, problems are : Problem set: 0 solved, 373 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 373/373 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60411ms problems are : Problem set: 0 solved, 373 unsolved
Search for dead transitions found 0 dead transitions in 60413ms
Starting structural reductions in LTL mode, iteration 1 : 191/228 places, 374/418 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60857 ms. Remains : 191/228 places, 374/418 transitions.
[2025-06-02 16:14:17] [INFO ] Flatten gal took : 17 ms
[2025-06-02 16:14:17] [INFO ] Flatten gal took : 17 ms
[2025-06-02 16:14:17] [INFO ] Input system was already deterministic with 374 transitions.
[2025-06-02 16:14:17] [INFO ] Flatten gal took : 17 ms
[2025-06-02 16:14:17] [INFO ] Flatten gal took : 17 ms
[2025-06-02 16:14:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality18202018321994475957.gal : 6 ms
[2025-06-02 16:14:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality13423016558613992715.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/CTLCardinality18202018321994475957.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13423016558613992715.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 16:14:47] [INFO ] Flatten gal took : 10 ms
[2025-06-02 16:14:47] [INFO ] Applying decomposition
[2025-06-02 16:14:48] [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/graph7032099363772081440.txt' '-o' '/tmp/graph7032099363772081440.bin' '-w' '/tmp/graph7032099363772081440.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7032099363772081440.bin' '-l' '-1' '-v' '-w' '/tmp/graph7032099363772081440.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:14:48] [INFO ] Decomposing Gal with order
[2025-06-02 16:14:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:14:48] [INFO ] Removed a total of 553 redundant transitions.
[2025-06-02 16:14:48] [INFO ] Flatten gal took : 30 ms
[2025-06-02 16:14:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 84 labels/synchronizations in 10 ms.
[2025-06-02 16:14:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality305309289302460336.gal : 3 ms
[2025-06-02 16:14:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality12192315873013833661.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/CTLCardinality305309289302460336.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12192315873013833661.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,8.79106e+11,1.26149,34104,2194,232,62089,2818,567,118458,126,13745,0
Converting to forward existential form...Done !
original formula: ((AX(AG(AX((i3.u50.p209==1)))) + EX(((EG(((i0.i1.u39.p160==1) + AX(((i6.u37.p149==0)||(i2.u12.p50==1))))) + ((!(E(((i3.u15.p65==0)||(i3.u...332
=> equivalent forward existential formula: [(FwdU((Init * !((!(EX(!(!(E(TRUE U !(!(EX(!((i3.u50.p209==1)))))))))) + EX(((EG(((i0.i1.u39.p160==1) + !(EX(!((...480
Reverse transition relation is NOT exact ! Due to transitions t9, t29, t131, i0.i4.t19, i0.i4.u57.t18, i1.i1.u56.t20, i1.i1.u56.t243, i2.t158, i2.t156, i2....1043
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 418/418 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 227 transition count 418
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 35 place count 193 transition count 379
Iterating global reduction 1 with 34 rules applied. Total rules applied 69 place count 193 transition count 379
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 72 place count 190 transition count 373
Iterating global reduction 1 with 3 rules applied. Total rules applied 75 place count 190 transition count 373
Applied a total of 75 rules in 8 ms. Remains 190 /228 variables (removed 38) and now considering 373/418 (removed 45) transitions.
// Phase 1: matrix 373 rows 190 cols
[2025-06-02 16:15:18] [INFO ] Computed 22 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:15:18] [INFO ] Implicit Places using invariants in 119 ms returned []
[2025-06-02 16:15:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:15:18] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
Running 372 sub problems to find dead transitions.
[2025-06-02 16:15: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/189 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/190 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:27] [INFO ] Deduced a trap composed of 25 places in 180 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:27] [INFO ] Deduced a trap composed of 25 places in 154 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:27] [INFO ] Deduced a trap composed of 36 places in 148 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:27] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:28] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:28] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:29] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:29] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:34] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:35] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 6 (OVERLAPS) 373/563 variables, 190/222 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:48] [INFO ] Deduced a trap composed of 13 places in 238 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:48] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 13 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 563/563 variables, and 224 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 372 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/190 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (OVERLAPS) 373/563 variables, 190/224 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 372/596 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:04] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:04] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:04] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:04] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:07] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:08] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:09] [INFO ] Deduced a trap composed of 29 places in 234 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:11] [INFO ] Deduced a trap composed of 25 places in 232 ms of which 28 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 563/563 variables, and 604 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60279ms problems are : Problem set: 0 solved, 372 unsolved
Search for dead transitions found 0 dead transitions in 60282ms
Starting structural reductions in LTL mode, iteration 1 : 190/228 places, 373/418 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60737 ms. Remains : 190/228 places, 373/418 transitions.
[2025-06-02 16:16:18] [INFO ] Flatten gal took : 15 ms
[2025-06-02 16:16:18] [INFO ] Flatten gal took : 16 ms
[2025-06-02 16:16:18] [INFO ] Input system was already deterministic with 373 transitions.
[2025-06-02 16:16:18] [INFO ] Flatten gal took : 16 ms
[2025-06-02 16:16:19] [INFO ] Flatten gal took : 16 ms
[2025-06-02 16:16:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality12468812172470207257.gal : 4 ms
[2025-06-02 16:16:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality9930944203455069537.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/CTLCardinality12468812172470207257.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9930944203455069537.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 16:16:49] [INFO ] Flatten gal took : 11 ms
[2025-06-02 16:16:49] [INFO ] Applying decomposition
[2025-06-02 16:16:49] [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/graph5368940732341748581.txt' '-o' '/tmp/graph5368940732341748581.bin' '-w' '/tmp/graph5368940732341748581.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5368940732341748581.bin' '-l' '-1' '-v' '-w' '/tmp/graph5368940732341748581.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:16:49] [INFO ] Decomposing Gal with order
[2025-06-02 16:16:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:16:49] [INFO ] Removed a total of 564 redundant transitions.
[2025-06-02 16:16:49] [INFO ] Flatten gal took : 39 ms
[2025-06-02 16:16:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 88 labels/synchronizations in 8 ms.
[2025-06-02 16:16:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality4033669155133463493.gal : 3 ms
[2025-06-02 16:16:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality13325273593898712013.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/CTLCardinality4033669155133463493.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13325273593898712013.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,9.5934e+11,2.19023,59644,2132,328,90864,6723,645,325664,135,43314,0
Converting to forward existential form...Done !
original formula: (AG(((i5.u30.p125==0)||(i8.u54.p225==1))) + EG(EX((((i3.i1.u3.p18==1)&&((i9.u36.p149==1)||((i4.u25.p109==0)&&(i2.u11.p47==1)))) * !(A((i9...192
=> equivalent forward existential formula: [(FwdU((Init * !(EG(EX((((i3.i1.u3.p18==1)&&((i9.u36.p149==1)||((i4.u25.p109==0)&&(i2.u11.p47==1)))) * !(!((E(!(...310
Reverse transition relation is NOT exact ! Due to transitions t9, t29, t79, t146, i0.i3.u57.t18, i0.i3.u57.t19, i2.t157, i2.t155, i2.u7.t163, i2.u7.t164, i...1180
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 418/418 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 227 transition count 418
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 37 place count 191 transition count 376
Iterating global reduction 1 with 36 rules applied. Total rules applied 73 place count 191 transition count 376
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 75 place count 189 transition count 372
Iterating global reduction 1 with 2 rules applied. Total rules applied 77 place count 189 transition count 372
Applied a total of 77 rules in 7 ms. Remains 189 /228 variables (removed 39) and now considering 372/418 (removed 46) transitions.
// Phase 1: matrix 372 rows 189 cols
[2025-06-02 16:17:19] [INFO ] Computed 22 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:17:19] [INFO ] Implicit Places using invariants in 150 ms returned []
[2025-06-02 16:17:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:17:19] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
Running 371 sub problems to find dead transitions.
[2025-06-02 16:17:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:28] [INFO ] Deduced a trap composed of 25 places in 137 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:28] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:28] [INFO ] Deduced a trap composed of 35 places in 153 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:28] [INFO ] Deduced a trap composed of 35 places in 118 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:29] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:29] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:29] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:29] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:29] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:30] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:30] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 5 (OVERLAPS) 372/561 variables, 189/222 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:40] [INFO ] Deduced a trap composed of 13 places in 258 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:40] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:40] [INFO ] Deduced a trap composed of 14 places in 177 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:41] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:41] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:17:41] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 6/228 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 561/561 variables, and 228 constraints, problems are : Problem set: 0 solved, 371 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 371 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 17/39 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 5 (OVERLAPS) 372/561 variables, 189/228 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 371/599 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:04] [INFO ] Deduced a trap composed of 21 places in 280 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:05] [INFO ] Deduced a trap composed of 31 places in 283 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:05] [INFO ] Deduced a trap composed of 39 places in 255 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:05] [INFO ] Deduced a trap composed of 32 places in 291 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:05] [INFO ] Deduced a trap composed of 24 places in 219 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:06] [INFO ] Deduced a trap composed of 26 places in 145 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:08] [INFO ] Deduced a trap composed of 18 places in 223 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:08] [INFO ] Deduced a trap composed of 28 places in 195 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:09] [INFO ] Deduced a trap composed of 41 places in 107 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:12] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:18:12] [INFO ] Deduced a trap composed of 34 places in 123 ms of which 21 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/561 variables, 11/610 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 561/561 variables, and 610 constraints, problems are : Problem set: 0 solved, 371 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60347ms problems are : Problem set: 0 solved, 371 unsolved
Search for dead transitions found 0 dead transitions in 60349ms
Starting structural reductions in LTL mode, iteration 1 : 189/228 places, 372/418 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60912 ms. Remains : 189/228 places, 372/418 transitions.
[2025-06-02 16:18:20] [INFO ] Flatten gal took : 13 ms
[2025-06-02 16:18:20] [INFO ] Flatten gal took : 12 ms
[2025-06-02 16:18:20] [INFO ] Input system was already deterministic with 372 transitions.
[2025-06-02 16:18:20] [INFO ] Flatten gal took : 12 ms
[2025-06-02 16:18:20] [INFO ] Flatten gal took : 12 ms
[2025-06-02 16:18:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality15568877124619146848.gal : 2 ms
[2025-06-02 16:18:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality15297584634910480274.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/CTLCardinality15568877124619146848.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15297584634910480274.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 16:18:50] [INFO ] Flatten gal took : 10 ms
[2025-06-02 16:18:50] [INFO ] Applying decomposition
[2025-06-02 16:18:50] [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/graph2331918346316463593.txt' '-o' '/tmp/graph2331918346316463593.bin' '-w' '/tmp/graph2331918346316463593.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2331918346316463593.bin' '-l' '-1' '-v' '-w' '/tmp/graph2331918346316463593.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:18:50] [INFO ] Decomposing Gal with order
[2025-06-02 16:18:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:18:50] [INFO ] Removed a total of 634 redundant transitions.
[2025-06-02 16:18:50] [INFO ] Flatten gal took : 27 ms
[2025-06-02 16:18:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 5 ms.
[2025-06-02 16:18:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality9135409706869281567.gal : 3 ms
[2025-06-02 16:18:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality4190829846145504632.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/CTLCardinality9135409706869281567.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4190829846145504632.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,7.94682e+11,1.78276,47044,1866,159,83239,1512,627,224018,116,5849,0
Converting to forward existential form...Done !
original formula: (EF((EG(((i3.u55.p243==0)&&(i1.u7.p37==1))) * AG((i2.u18.p79==0)))) * !(A((((i2.u3.p5==0)||(i1.u9.p43==1)) * AG(((((i2.u15.p60==0)||(i6.u...267
=> equivalent forward existential formula: ([((FwdU((Init * E(TRUE U (EG(((i3.u55.p243==0)&&(i1.u7.p37==1))) * !(E(TRUE U !((i2.u18.p79==0))))))),!(E(TRUE ...545
Reverse transition relation is NOT exact ! Due to transitions t45, t78, t149, i1.t157, i1.t155, i1.t146, i1.u6.t124, i1.u6.t165, i1.u6.t166, i1.u7.t163, i1...1071
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 418/418 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 227 transition count 418
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 41 place count 187 transition count 371
Iterating global reduction 1 with 40 rules applied. Total rules applied 81 place count 187 transition count 371
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 84 place count 184 transition count 365
Iterating global reduction 1 with 3 rules applied. Total rules applied 87 place count 184 transition count 365
Applied a total of 87 rules in 7 ms. Remains 184 /228 variables (removed 44) and now considering 365/418 (removed 53) transitions.
// Phase 1: matrix 365 rows 184 cols
[2025-06-02 16:19:20] [INFO ] Computed 22 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:19:20] [INFO ] Implicit Places using invariants in 116 ms returned []
[2025-06-02 16:19:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:19:20] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
Running 364 sub problems to find dead transitions.
[2025-06-02 16:19:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/184 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:29] [INFO ] Deduced a trap composed of 25 places in 193 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:29] [INFO ] Deduced a trap composed of 25 places in 152 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:29] [INFO ] Deduced a trap composed of 35 places in 157 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:29] [INFO ] Deduced a trap composed of 35 places in 124 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:30] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:30] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:30] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:31] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:31] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:31] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (OVERLAPS) 365/549 variables, 184/216 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:42] [INFO ] Deduced a trap composed of 13 places in 233 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:42] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:43] [INFO ] Deduced a trap composed of 14 places in 188 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:43] [INFO ] Deduced a trap composed of 14 places in 175 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:43] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:19:44] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 6/222 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 549/549 variables, and 222 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 364 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/184 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (OVERLAPS) 365/549 variables, 184/222 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 364/586 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:13] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:13] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 16 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/549 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 549/549 variables, and 588 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60351ms problems are : Problem set: 0 solved, 364 unsolved
Search for dead transitions found 0 dead transitions in 60354ms
Starting structural reductions in LTL mode, iteration 1 : 184/228 places, 365/418 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60823 ms. Remains : 184/228 places, 365/418 transitions.
[2025-06-02 16:20:21] [INFO ] Flatten gal took : 9 ms
[2025-06-02 16:20:21] [INFO ] Flatten gal took : 10 ms
[2025-06-02 16:20:21] [INFO ] Input system was already deterministic with 365 transitions.
[2025-06-02 16:20:21] [INFO ] Flatten gal took : 16 ms
[2025-06-02 16:20:21] [INFO ] Flatten gal took : 17 ms
[2025-06-02 16:20:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality17516632193086675141.gal : 4 ms
[2025-06-02 16:20:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality7148698950282261998.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/CTLCardinality17516632193086675141.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7148698950282261998.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 16:20:51] [INFO ] Flatten gal took : 10 ms
[2025-06-02 16:20:51] [INFO ] Applying decomposition
[2025-06-02 16:20:51] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9626079028697367972.txt' '-o' '/tmp/graph9626079028697367972.bin' '-w' '/tmp/graph9626079028697367972.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9626079028697367972.bin' '-l' '-1' '-v' '-w' '/tmp/graph9626079028697367972.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:20:51] [INFO ] Decomposing Gal with order
[2025-06-02 16:20:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:20:51] [INFO ] Removed a total of 618 redundant transitions.
[2025-06-02 16:20:51] [INFO ] Flatten gal took : 27 ms
[2025-06-02 16:20:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 6 ms.
[2025-06-02 16:20:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality14816208945417998172.gal : 3 ms
[2025-06-02 16:20:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality6325193889488834980.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/CTLCardinality14816208945417998172.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6325193889488834980.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.64709e+11,1.30436,35868,1564,123,62067,2031,549,165923,102,6435,0
Converting to forward existential form...Done !
original formula: AF(EX(((i9.u46.p203==0)||(i5.u29.p129==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(((i9.u46.p203==0)||(i5.u29.p129==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t44, t85, t90, t92, t124, i0.i2.u56.t18, i0.i2.u56.t19, i2.t150, i2.t148, i2.t139, i2.u7.t156...903
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
(forward)formula 0,1,2.51357,58396,1,0,106243,2330,2903,311432,524,9692,208994
FORMULA MedleyA-PT-19-CTLCardinality-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 418/418 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 227 transition count 418
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 36 place count 192 transition count 376
Iterating global reduction 1 with 35 rules applied. Total rules applied 71 place count 192 transition count 376
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 73 place count 190 transition count 372
Iterating global reduction 1 with 2 rules applied. Total rules applied 75 place count 190 transition count 372
Applied a total of 75 rules in 6 ms. Remains 190 /228 variables (removed 38) and now considering 372/418 (removed 46) transitions.
// Phase 1: matrix 372 rows 190 cols
[2025-06-02 16:20:54] [INFO ] Computed 22 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:54] [INFO ] Implicit Places using invariants in 117 ms returned []
[2025-06-02 16:20:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:54] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
Running 371 sub problems to find dead transitions.
[2025-06-02 16:20:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (OVERLAPS) 1/190 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:21:03] [INFO ] Deduced a trap composed of 25 places in 152 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:21:03] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:21:03] [INFO ] Deduced a trap composed of 36 places in 158 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:21:03] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:21:04] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:21:04] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:21:04] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:21:05] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:21:05] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:21:05] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:21:05] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 5 (OVERLAPS) 372/562 variables, 190/223 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:21:16] [INFO ] Deduced a trap composed of 13 places in 261 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:21:16] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:21:17] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:21:17] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:21:18] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 5/228 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 562/562 variables, and 228 constraints, problems are : Problem set: 0 solved, 371 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 371 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (OVERLAPS) 1/190 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 5 (OVERLAPS) 372/562 variables, 190/228 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 371/599 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:21:40] [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-06-02 16:21:42] [INFO ] Deduced a trap composed of 22 places in 262 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:21:44] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:21:44] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:21:45] [INFO ] Deduced a trap composed of 25 places in 173 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:21:46] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 562/562 variables, and 605 constraints, problems are : Problem set: 0 solved, 371 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60377ms problems are : Problem set: 0 solved, 371 unsolved
Search for dead transitions found 0 dead transitions in 60380ms
Starting structural reductions in LTL mode, iteration 1 : 190/228 places, 372/418 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60871 ms. Remains : 190/228 places, 372/418 transitions.
[2025-06-02 16:21:55] [INFO ] Flatten gal took : 12 ms
[2025-06-02 16:21:55] [INFO ] Flatten gal took : 13 ms
[2025-06-02 16:21:55] [INFO ] Input system was already deterministic with 372 transitions.
[2025-06-02 16:21:55] [INFO ] Flatten gal took : 13 ms
[2025-06-02 16:21:55] [INFO ] Flatten gal took : 13 ms
[2025-06-02 16:21:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality9225780348297363309.gal : 3 ms
[2025-06-02 16:21:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality16682404507322787977.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/CTLCardinality9225780348297363309.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16682404507322787977.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 16:22:25] [INFO ] Flatten gal took : 11 ms
[2025-06-02 16:22:25] [INFO ] Applying decomposition
[2025-06-02 16:22:25] [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/graph13522435754151248480.txt' '-o' '/tmp/graph13522435754151248480.bin' '-w' '/tmp/graph13522435754151248480.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13522435754151248480.bin' '-l' '-1' '-v' '-w' '/tmp/graph13522435754151248480.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:22:25] [INFO ] Decomposing Gal with order
[2025-06-02 16:22:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:22:25] [INFO ] Removed a total of 694 redundant transitions.
[2025-06-02 16:22:25] [INFO ] Flatten gal took : 42 ms
[2025-06-02 16:22:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 6 ms.
[2025-06-02 16:22:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality948499910377392414.gal : 3 ms
[2025-06-02 16:22:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality5355864747045018807.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/CTLCardinality948499910377392414.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5355864747045018807.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.0032e+12,1.45021,43988,2363,55,91194,619,637,160755,76,2429,0
Converting to forward existential form...Done !
original formula: AX((AF((AG((i8.u52.p218==1)) + EG((i1.i0.u55.p243==0)))) * (EG(((i6.u22.p100==0)||(i8.u51.p220==1))) + AX((((i1.i0.u3.p18==0)&&(i4.i2.u59...216
=> equivalent forward existential formula: ([FwdG(EY(Init),!((!(E(TRUE U !((i8.u52.p218==1)))) + EG((i1.i0.u55.p243==0)))))] = FALSE * [(FwdU((EY((EY(Init)...312
Reverse transition relation is NOT exact ! Due to transitions t9, t81, t145, i0.u49.t56, i1.t143, i1.t138, i1.i0.t22, i1.i0.u3.t169, i1.i0.u4.t167, i1.i0.u...1092
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 418/418 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 227 transition count 418
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 33 place count 195 transition count 382
Iterating global reduction 1 with 32 rules applied. Total rules applied 65 place count 195 transition count 382
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 68 place count 192 transition count 376
Iterating global reduction 1 with 3 rules applied. Total rules applied 71 place count 192 transition count 376
Applied a total of 71 rules in 7 ms. Remains 192 /228 variables (removed 36) and now considering 376/418 (removed 42) transitions.
// Phase 1: matrix 376 rows 192 cols
[2025-06-02 16:22:55] [INFO ] Computed 22 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:22:55] [INFO ] Implicit Places using invariants in 102 ms returned []
[2025-06-02 16:22:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:22:55] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
Running 375 sub problems to find dead transitions.
[2025-06-02 16:22: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/191 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (OVERLAPS) 1/192 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:23:04] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:23:04] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:23:04] [INFO ] Deduced a trap composed of 35 places in 157 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:23:05] [INFO ] Deduced a trap composed of 35 places in 131 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:23:05] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:23:06] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:23:06] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:23:06] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:23:06] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 9/31 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 5 (OVERLAPS) 376/568 variables, 192/223 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:23:17] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:23:17] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:23:18] [INFO ] Deduced a trap composed of 15 places in 196 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:23:18] [INFO ] Deduced a trap composed of 16 places in 162 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:23:19] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:23:19] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/568 variables, 6/229 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 568/568 variables, and 229 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 375 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (OVERLAPS) 1/192 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 15/37 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 5 (OVERLAPS) 376/568 variables, 192/229 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/568 variables, 375/604 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:23:41] [INFO ] Deduced a trap composed of 35 places in 228 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:23:41] [INFO ] Deduced a trap composed of 41 places in 294 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:23:42] [INFO ] Deduced a trap composed of 42 places in 257 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:23:42] [INFO ] Deduced a trap composed of 33 places in 255 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:23:42] [INFO ] Deduced a trap composed of 43 places in 224 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:23:42] [INFO ] Deduced a trap composed of 25 places in 196 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:23:43] [INFO ] Deduced a trap composed of 18 places in 271 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:23:45] [INFO ] Deduced a trap composed of 19 places in 217 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:23:45] [INFO ] Deduced a trap composed of 35 places in 155 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:23:47] [INFO ] Deduced a trap composed of 26 places in 134 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:23:50] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/568 variables, and 615 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60284ms problems are : Problem set: 0 solved, 375 unsolved
Search for dead transitions found 0 dead transitions in 60286ms
Starting structural reductions in LTL mode, iteration 1 : 192/228 places, 376/418 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60655 ms. Remains : 192/228 places, 376/418 transitions.
[2025-06-02 16:23:56] [INFO ] Flatten gal took : 13 ms
[2025-06-02 16:23:56] [INFO ] Flatten gal took : 12 ms
[2025-06-02 16:23:56] [INFO ] Input system was already deterministic with 376 transitions.
[2025-06-02 16:23:56] [INFO ] Flatten gal took : 12 ms
[2025-06-02 16:23:56] [INFO ] Flatten gal took : 13 ms
[2025-06-02 16:23:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality12204542223169842408.gal : 3 ms
[2025-06-02 16:23:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality735728556353917412.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/CTLCardinality12204542223169842408.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality735728556353917412.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 16:24:26] [INFO ] Flatten gal took : 10 ms
[2025-06-02 16:24:26] [INFO ] Applying decomposition
[2025-06-02 16:24:26] [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/graph1560788710532075978.txt' '-o' '/tmp/graph1560788710532075978.bin' '-w' '/tmp/graph1560788710532075978.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1560788710532075978.bin' '-l' '-1' '-v' '-w' '/tmp/graph1560788710532075978.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:24:26] [INFO ] Decomposing Gal with order
[2025-06-02 16:24:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:24:26] [INFO ] Removed a total of 582 redundant transitions.
[2025-06-02 16:24:26] [INFO ] Flatten gal took : 32 ms
[2025-06-02 16:24:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 74 labels/synchronizations in 5 ms.
[2025-06-02 16:24:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality2109396111118282397.gal : 3 ms
[2025-06-02 16:24:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality10059870664782828121.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/CTLCardinality2109396111118282397.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10059870664782828121.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.10706e+12,15.3671,293876,3668,512,487317,44505,623,1.16778e+06,154,341888,0
Converting to forward existential form...Done !
original formula: (EF((i6.u32.p145==1)) + (!(A(((i10.u51.p232==0)||(i6.u21.p83==1)) U AX(((i6.u33.p153!=1) * EG((i3.u18.p68==0)))))) * EF((((((i3.u18.p69==...344
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * (i6.u32.p145==1))] != FALSE + ([((FwdU((Init * !(!((E(!(!(EX(!(((i6.u33.p153!=1) * EG((i3.u...964
(forward)formula 0,1,15.4273,293876,1,0,487317,44505,627,1.16778e+06,157,341888,1212
FORMULA MedleyA-PT-19-CTLCardinality-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 418/418 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 227 transition count 418
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 40 place count 188 transition count 373
Iterating global reduction 1 with 39 rules applied. Total rules applied 79 place count 188 transition count 373
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 82 place count 185 transition count 367
Iterating global reduction 1 with 3 rules applied. Total rules applied 85 place count 185 transition count 367
Applied a total of 85 rules in 7 ms. Remains 185 /228 variables (removed 43) and now considering 367/418 (removed 51) transitions.
// Phase 1: matrix 367 rows 185 cols
[2025-06-02 16:24:41] [INFO ] Computed 22 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:24:41] [INFO ] Implicit Places using invariants in 145 ms returned []
[2025-06-02 16:24:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:24:42] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
Running 366 sub problems to find dead transitions.
[2025-06-02 16:24:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:24:50] [INFO ] Deduced a trap composed of 25 places in 168 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:24:51] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:24:51] [INFO ] Deduced a trap composed of 35 places in 146 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:24:51] [INFO ] Deduced a trap composed of 35 places in 119 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:24:51] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:24:51] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:24:52] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:24:52] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:24:53] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:24:53] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (OVERLAPS) 367/552 variables, 185/217 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:25:03] [INFO ] Deduced a trap composed of 13 places in 276 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:25:03] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:25:04] [INFO ] Deduced a trap composed of 14 places in 175 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:25:04] [INFO ] Deduced a trap composed of 14 places in 162 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:25:04] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:25:05] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 13 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 6/223 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 552/552 variables, and 223 constraints, problems are : Problem set: 0 solved, 366 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (OVERLAPS) 367/552 variables, 185/223 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 366/589 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:25:28] [INFO ] Deduced a trap composed of 29 places in 173 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:25:29] [INFO ] Deduced a trap composed of 24 places in 182 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/552 variables, 2/591 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 552/552 variables, and 591 constraints, problems are : Problem set: 0 solved, 366 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60380ms problems are : Problem set: 0 solved, 366 unsolved
Search for dead transitions found 0 dead transitions in 60382ms
Starting structural reductions in LTL mode, iteration 1 : 185/228 places, 367/418 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60977 ms. Remains : 185/228 places, 367/418 transitions.
[2025-06-02 16:25:42] [INFO ] Flatten gal took : 10 ms
[2025-06-02 16:25:42] [INFO ] Flatten gal took : 10 ms
[2025-06-02 16:25:42] [INFO ] Input system was already deterministic with 367 transitions.
[2025-06-02 16:25:42] [INFO ] Flatten gal took : 9 ms
[2025-06-02 16:25:42] [INFO ] Flatten gal took : 10 ms
[2025-06-02 16:25:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality5210807069462065302.gal : 3 ms
[2025-06-02 16:25:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality1103464181809294700.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/CTLCardinality5210807069462065302.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1103464181809294700.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 16:26:12] [INFO ] Flatten gal took : 9 ms
[2025-06-02 16:26:12] [INFO ] Applying decomposition
[2025-06-02 16:26:12] [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/graph16382670900190942235.txt' '-o' '/tmp/graph16382670900190942235.bin' '-w' '/tmp/graph16382670900190942235.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16382670900190942235.bin' '-l' '-1' '-v' '-w' '/tmp/graph16382670900190942235.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:26:12] [INFO ] Decomposing Gal with order
[2025-06-02 16:26:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:26:12] [INFO ] Removed a total of 623 redundant transitions.
[2025-06-02 16:26:12] [INFO ] Flatten gal took : 21 ms
[2025-06-02 16:26:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 5 ms.
[2025-06-02 16:26:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality6519637911955741145.gal : 2 ms
[2025-06-02 16:26:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality7467945475784782998.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/CTLCardinality6519637911955741145.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7467945475784782998.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,6.08538e+11,0.570907,19088,1294,143,32207,1934,549,58942,116,6039,0
Converting to forward existential form...Done !
original formula: A(AX(EX((i6.u22.p95==1))) U AF((i6.u33.p139==1)))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!((i6.u33.p139==1)))))))) * !(E(!(!(EG(!((i6.u33.p139==1))))) U (!(!(EX(!(EX((i6.u22.p95==...208
Reverse transition relation is NOT exact ! Due to transitions t29, t77, t141, i1.t152, i1.t150, i1.u8.t158, i1.u8.t159, i1.u14.t148, i2.t139, i2.t134, i2.i...974
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 228/228 places, 418/418 transitions.
Graph (complete) has 753 edges and 228 vertex of which 224 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 224 transition count 380
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 41 rules applied. Total rules applied 77 place count 189 transition count 374
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 82 place count 186 transition count 372
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 84 place count 184 transition count 372
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 84 place count 184 transition count 364
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 100 place count 176 transition count 364
Discarding 29 places :
Symmetric choice reduction at 4 with 29 rule applications. Total rules 129 place count 147 transition count 327
Iterating global reduction 4 with 29 rules applied. Total rules applied 158 place count 147 transition count 327
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 158 place count 147 transition count 325
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 162 place count 145 transition count 325
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 55 rules applied. Total rules applied 217 place count 116 transition count 299
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 218 place count 115 transition count 297
Iterating global reduction 4 with 1 rules applied. Total rules applied 219 place count 115 transition count 297
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 222 place count 115 transition count 294
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 228 place count 112 transition count 291
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 229 place count 112 transition count 291
Applied a total of 229 rules in 91 ms. Remains 112 /228 variables (removed 116) and now considering 291/418 (removed 127) transitions.
[2025-06-02 16:26:43] [INFO ] Flow matrix only has 290 transitions (discarded 1 similar events)
// Phase 1: matrix 290 rows 112 cols
[2025-06-02 16:26:43] [INFO ] Computed 19 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:26:43] [INFO ] Implicit Places using invariants in 100 ms returned []
[2025-06-02 16:26:43] [INFO ] Flow matrix only has 290 transitions (discarded 1 similar events)
[2025-06-02 16:26:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:26:43] [INFO ] State equation strengthened by 128 read => feed constraints.
[2025-06-02 16:26:43] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:26:43] [INFO ] Redundant transitions in 83 ms returned []
Running 289 sub problems to find dead transitions.
[2025-06-02 16:26:43] [INFO ] Flow matrix only has 290 transitions (discarded 1 similar events)
[2025-06-02 16:26:43] [INFO ] Invariant cache hit.
[2025-06-02 16:26:43] [INFO ] State equation strengthened by 128 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (OVERLAPS) 1/112 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:26:48] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:26:48] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:26:48] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:26:48] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:26:49] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:26:49] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:26:49] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 7/26 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (OVERLAPS) 289/401 variables, 112/138 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 127/265 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:26:59] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (OVERLAPS) 1/402 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 402/402 variables, and 267 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 112/112 constraints, ReadFeed: 128/128 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (OVERLAPS) 1/112 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 8/27 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (OVERLAPS) 289/401 variables, 112/139 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 127/266 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 289/555 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (OVERLAPS) 1/402 variables, 1/556 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 402/402 variables, and 556 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 112/112 constraints, ReadFeed: 128/128 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60209ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 60210ms
Starting structural reductions in SI_CTL mode, iteration 1 : 112/228 places, 291/418 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60795 ms. Remains : 112/228 places, 291/418 transitions.
[2025-06-02 16:27:43] [INFO ] Flatten gal took : 13 ms
[2025-06-02 16:27:43] [INFO ] Flatten gal took : 13 ms
[2025-06-02 16:27:43] [INFO ] Input system was already deterministic with 291 transitions.
[2025-06-02 16:27:43] [INFO ] Flatten gal took : 16 ms
[2025-06-02 16:27:43] [INFO ] Flatten gal took : 12 ms
[2025-06-02 16:27:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality3662335844456090557.gal : 2 ms
[2025-06-02 16:27:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality12251269555614048089.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/CTLCardinality3662335844456090557.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12251269555614048089.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.07429e+09,10.0513,212072,2,21174,5,817520,6,0,732,726679,0
Converting to forward existential form...Done !
original formula: EF((EG(((p206==0)&&(p0==1))) + (((p55==1) * (!(E(((p260==0)||(p258==1)) U (p235==1))) + A(A((p59==0) U ((p77==0)||(p139==1))) U AG((p132=...199
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),((p206==0)&&(p0==1)))] != FALSE + ([FwdG((FwdU(Init,TRUE) * ((p55==1) * (!(E(((p260==0)||...757
Hit Full ! (commute/partial/dont) 277/14/14
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t5, t7, t8, t9, t11, t13, t14, t17, t18, t19, t20, t22, t25, t26, t27, t28, t29, t31,...580
Detected timeout of ITS tools.
[2025-06-02 16:28:13] [INFO ] Flatten gal took : 12 ms
[2025-06-02 16:28:13] [INFO ] Applying decomposition
[2025-06-02 16:28:13] [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/graph17631835810952432121.txt' '-o' '/tmp/graph17631835810952432121.bin' '-w' '/tmp/graph17631835810952432121.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17631835810952432121.bin' '-l' '-1' '-v' '-w' '/tmp/graph17631835810952432121.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:28:14] [INFO ] Decomposing Gal with order
[2025-06-02 16:28:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:28:14] [INFO ] Removed a total of 588 redundant transitions.
[2025-06-02 16:28:14] [INFO ] Flatten gal took : 19 ms
[2025-06-02 16:28:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 4 ms.
[2025-06-02 16:28:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality1654099327983755686.gal : 2 ms
[2025-06-02 16:28:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality11763169983224601951.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/CTLCardinality1654099327983755686.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11763169983224601951.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.07429e+09,0.391403,12928,636,111,14927,674,446,35559,128,1753,0
Converting to forward existential form...Done !
original formula: EF((EG(((i3.u19.p206==0)&&(i5.u31.p0==1))) + (((i1.u4.p55==1) * (!(E(((i0.u26.p260==0)||(i0.u26.p258==1)) U (i4.u22.p235==1))) + A(A((i0....280
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),((i3.u19.p206==0)&&(i5.u31.p0==1)))] != FALSE + ([FwdG((FwdU(Init,TRUE) * ((i1.u4.p55==1)...971
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 5
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Reverse transition relation is NOT exact ! Due to transitions t88, t111, t113, t123, t125, t143, t145, t147, t149, t174, t175, t185, t186, t195, t276, i0.t...749
(forward)formula 0,1,29.6753,438556,1,0,619815,13598,3240,1.68717e+06,742,66130,751286
FORMULA MedleyA-PT-19-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 418/418 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 227 transition count 418
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 36 place count 192 transition count 376
Iterating global reduction 1 with 35 rules applied. Total rules applied 71 place count 192 transition count 376
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 191 transition count 374
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 191 transition count 374
Applied a total of 73 rules in 11 ms. Remains 191 /228 variables (removed 37) and now considering 374/418 (removed 44) transitions.
// Phase 1: matrix 374 rows 191 cols
[2025-06-02 16:28:43] [INFO ] Computed 22 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:28:44] [INFO ] Implicit Places using invariants in 176 ms returned []
[2025-06-02 16:28:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:28:44] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 616 ms to find 0 implicit places.
Running 373 sub problems to find dead transitions.
[2025-06-02 16:28:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 2 (OVERLAPS) 1/191 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 373 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:28:53] [INFO ] Deduced a trap composed of 25 places in 181 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:28:53] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:28:53] [INFO ] Deduced a trap composed of 36 places in 158 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:28:53] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:28:54] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:28:54] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:28:54] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:28:54] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:28:55] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:28:55] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:28:55] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 5 (OVERLAPS) 374/565 variables, 191/224 constraints. Problems are: Problem set: 0 solved, 373 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:29:06] [INFO ] Deduced a trap composed of 13 places in 236 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:29:06] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:29:07] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:29:07] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:29:08] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 5/229 constraints. Problems are: Problem set: 0 solved, 373 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 565/565 variables, and 229 constraints, problems are : Problem set: 0 solved, 373 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 373/373 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 373 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 2 (OVERLAPS) 1/191 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 5 (OVERLAPS) 374/565 variables, 191/229 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 373/602 constraints. Problems are: Problem set: 0 solved, 373 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:29:32] [INFO ] Deduced a trap composed of 22 places in 284 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:29:33] [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-06-02 16:29:33] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:29:33] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:29:35] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:29:36] [INFO ] Deduced a trap composed of 35 places in 120 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:29:37] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:29:37] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 8/610 constraints. Problems are: Problem set: 0 solved, 373 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 565/565 variables, and 610 constraints, problems are : Problem set: 0 solved, 373 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 373/373 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60343ms problems are : Problem set: 0 solved, 373 unsolved
Search for dead transitions found 0 dead transitions in 60344ms
Starting structural reductions in LTL mode, iteration 1 : 191/228 places, 374/418 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60977 ms. Remains : 191/228 places, 374/418 transitions.
[2025-06-02 16:29:44] [INFO ] Flatten gal took : 11 ms
[2025-06-02 16:29:44] [INFO ] Flatten gal took : 11 ms
[2025-06-02 16:29:44] [INFO ] Input system was already deterministic with 374 transitions.
[2025-06-02 16:29:44] [INFO ] Flatten gal took : 11 ms
[2025-06-02 16:29:44] [INFO ] Flatten gal took : 11 ms
[2025-06-02 16:29:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality521590405432739141.gal : 3 ms
[2025-06-02 16:29:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality5920674596219678871.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/CTLCardinality521590405432739141.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5920674596219678871.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-06-02 16:30:14] [INFO ] Flatten gal took : 13 ms
[2025-06-02 16:30:14] [INFO ] Applying decomposition
[2025-06-02 16:30:14] [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/graph7021892962815343049.txt' '-o' '/tmp/graph7021892962815343049.bin' '-w' '/tmp/graph7021892962815343049.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7021892962815343049.bin' '-l' '-1' '-v' '-w' '/tmp/graph7021892962815343049.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:30:15] [INFO ] Decomposing Gal with order
[2025-06-02 16:30:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:30:15] [INFO ] Removed a total of 602 redundant transitions.
[2025-06-02 16:30:15] [INFO ] Flatten gal took : 25 ms
[2025-06-02 16:30:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 4 ms.
[2025-06-02 16:30:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality6133162338209282066.gal : 2 ms
[2025-06-02 16:30:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality18435480394319800155.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/CTLCardinality6133162338209282066.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18435480394319800155.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.68724e+11,0.502847,16940,1380,192,26471,1694,538,50616,112,7074,0
Converting to forward existential form...Done !
original formula: AG(AX(((AG((E((i4.u20.p98==0) U ((i1.u9.p35==0)||(i2.u58.p259==1))) + ((i9.u49.p236==1)&&((i1.u7.p39==0)||(i6.u25.p118==1))))) * AF((((i2...299
=> equivalent forward existential formula: (([((FwdU(EY(FwdU(Init,TRUE)),TRUE) * !(((i9.u49.p236==1)&&((i1.u7.p39==0)||(i6.u25.p118==1))))) * !(E((i4.u20.p...515
Reverse transition relation is NOT exact ! Due to transitions t133, i1.t159, i1.t157, i1.t148, i1.u6.t165, i1.u6.t166, i1.u9.t167, i1.u9.t168, i1.u13.t155,...1001
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 228/228 places, 418/418 transitions.
Graph (complete) has 753 edges and 228 vertex of which 224 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 223 transition count 378
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 42 rules applied. Total rules applied 79 place count 187 transition count 372
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 84 place count 184 transition count 370
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 86 place count 182 transition count 370
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 86 place count 182 transition count 362
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 102 place count 174 transition count 362
Discarding 30 places :
Symmetric choice reduction at 4 with 30 rule applications. Total rules 132 place count 144 transition count 322
Iterating global reduction 4 with 30 rules applied. Total rules applied 162 place count 144 transition count 322
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 162 place count 144 transition count 319
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 168 place count 141 transition count 319
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 220 place count 114 transition count 294
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 222 place count 112 transition count 290
Iterating global reduction 4 with 2 rules applied. Total rules applied 224 place count 112 transition count 290
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 227 place count 112 transition count 287
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 231 place count 110 transition count 285
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 233 place count 108 transition count 283
Applied a total of 233 rules in 50 ms. Remains 108 /228 variables (removed 120) and now considering 283/418 (removed 135) transitions.
[2025-06-02 16:30:45] [INFO ] Flow matrix only has 282 transitions (discarded 1 similar events)
// Phase 1: matrix 282 rows 108 cols
[2025-06-02 16:30:45] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:30:45] [INFO ] Implicit Places using invariants in 113 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 116 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 107/228 places, 283/418 transitions.
Applied a total of 0 rules in 5 ms. Remains 107 /107 variables (removed 0) and now considering 283/283 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 171 ms. Remains : 107/228 places, 283/418 transitions.
[2025-06-02 16:30:45] [INFO ] Flatten gal took : 7 ms
[2025-06-02 16:30:45] [INFO ] Flatten gal took : 8 ms
[2025-06-02 16:30:45] [INFO ] Input system was already deterministic with 283 transitions.
[2025-06-02 16:30:45] [INFO ] Flatten gal took : 13 ms
[2025-06-02 16:30:45] [INFO ] Flatten gal took : 13 ms
[2025-06-02 16:30:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality4319374068215317712.gal : 3 ms
[2025-06-02 16:30:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality13250205437578733501.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/CTLCardinality4319374068215317712.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13250205437578733501.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.27131e+09,12.3901,262024,2,12300,5,973260,6,0,704,847699,0
Converting to forward existential form...Done !
original formula: (EF((((p86==0)||(p14==1))&&(p255==1))) * E(((p84==0)||(p263==1)) U AF((EF((((p66==0)||(p154==1))&&(p220==1))) * ((p114==0)||(p210==1)))))...156
=> equivalent forward existential formula: [(FwdU((Init * E(TRUE U (((p86==0)||(p14==1))&&(p255==1)))),((p84==0)||(p263==1))) * !(EG(!((E(TRUE U (((p66==0)...220
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t5, t7, t8, t14, t22, t23, t24, t25, t30, t31, t32, t34, t35, t38, t39, t43, t45, t46...327
Detected timeout of ITS tools.
[2025-06-02 16:31:15] [INFO ] Flatten gal took : 8 ms
[2025-06-02 16:31:15] [INFO ] Applying decomposition
[2025-06-02 16:31:15] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9843797578632893484.txt' '-o' '/tmp/graph9843797578632893484.bin' '-w' '/tmp/graph9843797578632893484.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9843797578632893484.bin' '-l' '-1' '-v' '-w' '/tmp/graph9843797578632893484.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:31:15] [INFO ] Decomposing Gal with order
[2025-06-02 16:31:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:31:15] [INFO ] Removed a total of 615 redundant transitions.
[2025-06-02 16:31:15] [INFO ] Flatten gal took : 14 ms
[2025-06-02 16:31:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 3 ms.
[2025-06-02 16:31:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality11682616838909544607.gal : 1 ms
[2025-06-02 16:31:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality8836289555615075971.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/CTLCardinality11682616838909544607.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8836289555615075971.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.27131e+09,0.131894,8192,331,67,9098,326,375,15367,100,1110,0
Converting to forward existential form...Done !
original formula: (EF((((i2.u9.p86==0)||(i1.u0.p14==1))&&(i5.i1.u24.p255==1))) * E(((i2.u9.p84==0)||(i5.i1.u27.p263==1)) U AF((EF((((i1.u8.p66==0)||(i2.u15...231
=> equivalent forward existential formula: [(FwdU((Init * E(TRUE U (((i2.u9.p86==0)||(i1.u0.p14==1))&&(i5.i1.u24.p255==1)))),((i2.u9.p84==0)||(i5.i1.u27.p2...295
Reverse transition relation is NOT exact ! Due to transitions t89, i0.t74, i0.t1, i0.u2.t73, i0.u6.t71, i1.t58, i1.u7.t57, i1.u21.t23, i2.t35, i2.t32, i2.u...517
Detected timeout of ITS tools.
[2025-06-02 16:31:45] [INFO ] Flatten gal took : 19 ms
[2025-06-02 16:31:45] [INFO ] Flatten gal took : 12 ms
[2025-06-02 16:31:45] [INFO ] Applying decomposition
[2025-06-02 16:31:45] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4031824427531310735.txt' '-o' '/tmp/graph4031824427531310735.bin' '-w' '/tmp/graph4031824427531310735.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4031824427531310735.bin' '-l' '-1' '-v' '-w' '/tmp/graph4031824427531310735.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:31:45] [INFO ] Decomposing Gal with order
[2025-06-02 16:31:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:31:45] [INFO ] Removed a total of 509 redundant transitions.
[2025-06-02 16:31:45] [INFO ] Flatten gal took : 22 ms
[2025-06-02 16:31:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 120 labels/synchronizations in 4 ms.
[2025-06-02 16:31:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality16009657949009258051.gal : 2 ms
[2025-06-02 16:31:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality17151481662758145781.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/CTLCardinality16009657949009258051.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17151481662758145781.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 11 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.52012e+12,29.6463,553452,14101,2695,613591,39200,704,3.77979e+06,220,592978,0
Converting to forward existential form...Done !
original formula: A(AX(E(!(A(((i9.u41.p223==0)||(i6.u29.p129==1)) U (i2.u6.p38==1))) U (EG((i3.u3.p260==0)) * A((i3.u15.p65==1) U ((i10.i1.u23.p106==0)||(i...301
=> equivalent forward existential formula: [((Init * !(EG(!(((!(((i4.u34.p144==0)||(i2.u9.p46==1))) * !(EG(!(((i9.u40.p163==0)||(i3.u3.p22==1)))))) * ((i3....814
Reverse transition relation is NOT exact ! Due to transitions t9, t23, i0.u2.t214, i2.t197, i2.t195, i2.t189, i2.t186, i2.u6.t203, i2.u6.t204, i2.u9.t159, ...1757
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Detected timeout of ITS tools.
[2025-06-02 17:01:33] [INFO ] Applying decomposition
[2025-06-02 17:01:33] [INFO ] Flatten gal took : 12 ms
[2025-06-02 17:01:33] [INFO ] Decomposing Gal with order
[2025-06-02 17:01:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 17:01:33] [INFO ] Removed a total of 599 redundant transitions.
[2025-06-02 17:01:33] [INFO ] Flatten gal took : 26 ms
[2025-06-02 17:01:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 112 labels/synchronizations in 4 ms.
[2025-06-02 17:01:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality16585238887366754161.gal : 2 ms
[2025-06-02 17:01:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality3204435847815207730.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/CTLCardinality16585238887366754161.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3204435847815207730.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 11 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.52012e+12,10.1475,290916,3104,1033,511333,14453,534,2.12258e+06,246,157059,0
Converting to forward existential form...Done !
original formula: A(AX(E(!(A(((i0.i1.i1.u29.p223==0)||(i0.i0.i1.i1.i0.u17.p129==1)) U (i0.i0.i0.i1.i0.u53.p38==1))) U (EG((i1.i1.i0.u34.p260==0)) * A((i0.i...398
=> equivalent forward existential formula: [((Init * !(EG(!(((!(((i0.i0.i1.i1.u20.p144==0)||(i0.i0.i0.i1.i0.u53.p46==1))) * !(EG(!(((i0.i1.u22.p163==0)||(i...1037
Reverse transition relation is NOT exact ! Due to transitions i0.i0.i0.u4.t208, i0.i0.i0.u4.t209, i0.i0.i0.u4.t210, i0.i0.i0.u4.t211, i0.i0.i0.u4.t212, i0....3121
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-19"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is MedleyA-PT-19, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r128-smll-174876524200241"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-19.tgz
mv MedleyA-PT-19 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;