About the Execution of ITS-Tools for ResAllocation-PT-R100C002
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 152445.00 | 0.00 | 0.00 | FFTFTFFTTTFFFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r184-tall-174889263700187.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 ResAllocation-PT-R100C002, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-tall-174889263700187
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 904K
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K 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 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 9 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 422K 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 ResAllocation-PT-R100C002-LTLCardinality-00
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-01
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-02
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-03
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-04
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-05
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-06
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-07
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-08
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-09
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-10
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-11
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-12
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-13
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-14
FORMULA_NAME ResAllocation-PT-R100C002-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1748973225790
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResAllocation-PT-R100C002
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-03 17:53:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 17:53:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 17:53:47] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2025-06-03 17:53:47] [INFO ] Transformed 400 places.
[2025-06-03 17:53:47] [INFO ] Transformed 202 transitions.
[2025-06-03 17:53:47] [INFO ] Found NUPN structural information;
[2025-06-03 17:53:47] [INFO ] Parsed PT model containing 400 places and 202 transitions and 1000 arcs in 207 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ResAllocation-PT-R100C002-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 202/202 transitions.
Applied a total of 0 rules in 45 ms. Remains 400 /400 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 400 cols
[2025-06-03 17:53:47] [INFO ] Computed 200 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:53:47] [INFO ] Implicit Places using invariants in 542 ms returned [201, 203, 205, 207, 209, 211, 213, 215, 219, 221, 223, 225, 227, 229, 231, 233, 235, 237, 239, 241, 243, 245, 247, 249, 251, 253, 255, 257, 259, 261, 263, 265, 267, 269, 271, 273, 277, 279, 281, 283, 285, 287, 289, 291, 293, 295, 299, 301, 303, 305, 307, 309, 311, 313, 315, 317, 319, 321, 323, 325, 327, 329, 331, 333, 335, 337, 339, 341, 343, 345, 347, 349, 351, 353, 355, 357, 361, 363, 365, 367, 369, 371, 373, 375, 377, 379, 381, 383, 385, 387, 389, 391, 393, 395, 397, 399]
Discarding 96 places :
Implicit Place search using SMT only with invariants took 574 ms to find 96 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 304/400 places, 202/202 transitions.
Applied a total of 0 rules in 22 ms. Remains 304 /304 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 656 ms. Remains : 304/400 places, 202/202 transitions.
Support contains 18 out of 304 places after structural reductions.
[2025-06-03 17:53:48] [INFO ] Flatten gal took : 42 ms
[2025-06-03 17:53:48] [INFO ] Flatten gal took : 19 ms
[2025-06-03 17:53:48] [INFO ] Input system was already deterministic with 202 transitions.
Support contains 16 out of 304 places (down from 18) after GAL structural reductions.
RANDOM walk for 40000 steps (12 resets) in 1232 ms. (32 steps per ms) remains 3/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 190 ms. (209 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 3/3 properties
// Phase 1: matrix 202 rows 304 cols
[2025-06-03 17:53:48] [INFO ] Computed 104 invariants in 2 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 20/35 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 47/82 variables, 31/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 31/97 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/82 variables, 11/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/82 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 30/112 variables, 18/126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/112 variables, 18/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/112 variables, 6/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/112 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 30/142 variables, 18/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/142 variables, 18/186 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/142 variables, 6/192 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/142 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 30/172 variables, 18/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/172 variables, 18/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/172 variables, 6/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/172 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 30/202 variables, 18/252 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/202 variables, 18/270 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/202 variables, 6/276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/202 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 30/232 variables, 18/294 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/232 variables, 18/312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/232 variables, 6/318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/232 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 30/262 variables, 18/336 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/262 variables, 18/354 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/262 variables, 6/360 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/262 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (OVERLAPS) 23/285 variables, 15/375 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/285 variables, 15/390 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/285 variables, 5/395 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/285 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (OVERLAPS) 21/306 variables, 13/408 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/306 variables, 13/421 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/306 variables, 5/426 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/306 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (OVERLAPS) 20/326 variables, 12/438 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/326 variables, 12/450 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/326 variables, 4/454 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/326 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (OVERLAPS) 20/346 variables, 12/466 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/346 variables, 12/478 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/346 variables, 4/482 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/346 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (OVERLAPS) 21/367 variables, 13/495 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/367 variables, 13/508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/367 variables, 5/513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/367 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (OVERLAPS) 13/380 variables, 9/522 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/380 variables, 9/531 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/380 variables, 3/534 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/380 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (OVERLAPS) 11/391 variables, 7/541 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/391 variables, 7/548 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/391 variables, 3/551 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/391 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 63 (OVERLAPS) 10/401 variables, 6/557 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/401 variables, 6/563 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/401 variables, 2/565 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/401 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 67 (OVERLAPS) 10/411 variables, 6/571 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/411 variables, 6/577 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/411 variables, 2/579 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/411 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 71 (OVERLAPS) 10/421 variables, 6/585 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/421 variables, 6/591 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/421 variables, 2/593 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/421 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 75 (OVERLAPS) 5/426 variables, 3/596 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/426 variables, 3/599 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/426 variables, 1/600 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/426 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 79 (OVERLAPS) 5/431 variables, 3/603 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/431 variables, 3/606 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/431 variables, 1/607 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/431 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 83 (OVERLAPS) 5/436 variables, 3/610 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/436 variables, 3/613 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/436 variables, 1/614 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/436 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 87 (OVERLAPS) 5/441 variables, 3/617 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/441 variables, 3/620 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/441 variables, 1/621 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/441 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 91 (OVERLAPS) 5/446 variables, 3/624 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/446 variables, 3/627 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/446 variables, 1/628 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/446 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 95 (OVERLAPS) 5/451 variables, 3/631 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/451 variables, 3/634 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/451 variables, 1/635 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/451 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 99 (OVERLAPS) 5/456 variables, 3/638 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/456 variables, 3/641 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/456 variables, 1/642 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/456 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 103 (OVERLAPS) 5/461 variables, 3/645 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/461 variables, 3/648 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/461 variables, 1/649 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/461 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 107 (OVERLAPS) 5/466 variables, 3/652 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/466 variables, 3/655 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/466 variables, 1/656 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/466 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 111 (OVERLAPS) 5/471 variables, 3/659 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/471 variables, 3/662 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/471 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/471 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 115 (OVERLAPS) 5/476 variables, 3/666 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/476 variables, 3/669 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/476 variables, 1/670 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/476 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 119 (OVERLAPS) 5/481 variables, 3/673 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/481 variables, 3/676 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/481 variables, 1/677 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/481 variables, 0/677 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 123 (OVERLAPS) 5/486 variables, 3/680 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/486 variables, 3/683 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/486 variables, 1/684 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/486 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 127 (OVERLAPS) 5/491 variables, 3/687 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/491 variables, 3/690 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/491 variables, 1/691 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/491 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 131 (OVERLAPS) 5/496 variables, 3/694 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/496 variables, 3/697 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/496 variables, 1/698 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/496 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 135 (OVERLAPS) 5/501 variables, 3/701 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/501 variables, 3/704 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/501 variables, 1/705 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/501 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 139 (OVERLAPS) 5/506 variables, 3/708 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/506 variables, 3/711 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 141 (INCLUDED_ONLY) 0/506 variables, 1/712 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/506 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 143 (OVERLAPS) 0/506 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 506/506 variables, and 712 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3208 ms.
Refiners :[Domain max(s): 304/304 constraints, Positive P Invariants (semi-flows): 104/104 constraints, State Equation: 304/304 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 20/35 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 47/82 variables, 31/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 31/97 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/82 variables, 11/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/82 variables, 3/111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/82 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 30/112 variables, 18/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/112 variables, 18/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/112 variables, 6/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/112 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 30/142 variables, 18/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/142 variables, 18/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/142 variables, 6/195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/142 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 30/172 variables, 18/213 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/172 variables, 18/231 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/172 variables, 6/237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/172 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 30/202 variables, 18/255 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/202 variables, 18/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/202 variables, 6/279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/202 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 30/232 variables, 18/297 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/232 variables, 18/315 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/232 variables, 6/321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/232 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 30/262 variables, 18/339 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/262 variables, 18/357 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/262 variables, 6/363 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/262 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (OVERLAPS) 23/285 variables, 15/378 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/285 variables, 15/393 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/285 variables, 5/398 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/285 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (OVERLAPS) 21/306 variables, 13/411 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/306 variables, 13/424 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/306 variables, 5/429 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/306 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (OVERLAPS) 20/326 variables, 12/441 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/326 variables, 12/453 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/326 variables, 4/457 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/326 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (OVERLAPS) 20/346 variables, 12/469 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/346 variables, 12/481 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/346 variables, 4/485 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/346 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (OVERLAPS) 21/367 variables, 13/498 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/367 variables, 13/511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/367 variables, 5/516 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/367 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (OVERLAPS) 13/380 variables, 9/525 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/380 variables, 9/534 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/380 variables, 3/537 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/380 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (OVERLAPS) 11/391 variables, 7/544 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/391 variables, 7/551 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/391 variables, 3/554 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/391 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 64 (OVERLAPS) 10/401 variables, 6/560 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/401 variables, 6/566 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/401 variables, 2/568 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/401 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 68 (OVERLAPS) 10/411 variables, 6/574 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/411 variables, 6/580 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/411 variables, 2/582 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/411 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 72 (OVERLAPS) 10/421 variables, 6/588 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/421 variables, 6/594 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/421 variables, 2/596 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/421 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 76 (OVERLAPS) 5/426 variables, 3/599 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/426 variables, 3/602 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/426 variables, 1/603 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/426 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 80 (OVERLAPS) 5/431 variables, 3/606 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/431 variables, 3/609 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/431 variables, 1/610 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/431 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 84 (OVERLAPS) 5/436 variables, 3/613 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/436 variables, 3/616 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/436 variables, 1/617 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/436 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 88 (OVERLAPS) 5/441 variables, 3/620 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/441 variables, 3/623 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/441 variables, 1/624 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/441 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 92 (OVERLAPS) 5/446 variables, 3/627 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/446 variables, 3/630 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/446 variables, 1/631 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/446 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 96 (OVERLAPS) 5/451 variables, 3/634 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/451 variables, 3/637 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/451 variables, 1/638 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/451 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 100 (OVERLAPS) 5/456 variables, 3/641 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/456 variables, 3/644 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/456 variables, 1/645 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/456 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 104 (OVERLAPS) 5/461 variables, 3/648 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/461 variables, 3/651 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/461 variables, 1/652 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 461/506 variables, and 652 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5015 ms.
Refiners :[Domain max(s): 277/304 constraints, Positive P Invariants (semi-flows): 95/104 constraints, State Equation: 277/304 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8254ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 304 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 304/304 places, 202/202 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 302 transition count 200
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 302 transition count 198
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 10 place count 298 transition count 198
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 296 transition count 196
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 296 transition count 194
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 20 place count 292 transition count 194
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 290 transition count 192
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 290 transition count 190
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 30 place count 286 transition count 190
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 34 place count 284 transition count 188
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 284 transition count 186
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 40 place count 280 transition count 186
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 44 place count 278 transition count 184
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 46 place count 278 transition count 182
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 50 place count 274 transition count 182
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 54 place count 272 transition count 180
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 56 place count 272 transition count 178
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 60 place count 268 transition count 178
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 64 place count 266 transition count 176
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 66 place count 266 transition count 174
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 70 place count 262 transition count 174
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 74 place count 260 transition count 172
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 76 place count 260 transition count 170
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 80 place count 256 transition count 170
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 3 places and 0 transitions.
Iterating global reduction 8 with 5 rules applied. Total rules applied 85 place count 253 transition count 168
Free-agglomeration rule applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 87 place count 253 transition count 166
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 91 place count 249 transition count 166
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 95 place count 247 transition count 164
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 97 place count 247 transition count 162
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 101 place count 243 transition count 162
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 10 with 4 rules applied. Total rules applied 105 place count 241 transition count 160
Free-agglomeration rule applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 107 place count 241 transition count 158
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 111 place count 237 transition count 158
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 115 place count 235 transition count 156
Free-agglomeration rule applied 2 times.
Iterating global reduction 11 with 2 rules applied. Total rules applied 117 place count 235 transition count 154
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 121 place count 231 transition count 154
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 12 with 4 rules applied. Total rules applied 125 place count 229 transition count 152
Free-agglomeration rule applied 2 times.
Iterating global reduction 12 with 2 rules applied. Total rules applied 127 place count 229 transition count 150
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 131 place count 225 transition count 150
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 13 with 4 rules applied. Total rules applied 135 place count 223 transition count 148
Free-agglomeration rule applied 2 times.
Iterating global reduction 13 with 2 rules applied. Total rules applied 137 place count 223 transition count 146
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 141 place count 219 transition count 146
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 14 with 4 rules applied. Total rules applied 145 place count 217 transition count 144
Free-agglomeration rule applied 2 times.
Iterating global reduction 14 with 2 rules applied. Total rules applied 147 place count 217 transition count 142
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 151 place count 213 transition count 142
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 4 rules applied. Total rules applied 155 place count 211 transition count 140
Free-agglomeration rule applied 2 times.
Iterating global reduction 15 with 2 rules applied. Total rules applied 157 place count 211 transition count 138
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 161 place count 207 transition count 138
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 165 place count 205 transition count 136
Free-agglomeration rule applied 2 times.
Iterating global reduction 16 with 2 rules applied. Total rules applied 167 place count 205 transition count 134
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 171 place count 201 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 173 place count 200 transition count 133
Free-agglomeration rule applied 2 times.
Iterating global reduction 17 with 2 rules applied. Total rules applied 175 place count 200 transition count 131
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 17 with 3 rules applied. Total rules applied 178 place count 197 transition count 131
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 180 place count 196 transition count 130
Free-agglomeration rule applied 1 times.
Iterating global reduction 18 with 1 rules applied. Total rules applied 181 place count 196 transition count 129
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 183 place count 194 transition count 129
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 19 with 2 rules applied. Total rules applied 185 place count 193 transition count 128
Free-agglomeration rule applied 1 times.
Iterating global reduction 19 with 1 rules applied. Total rules applied 186 place count 193 transition count 127
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 188 place count 191 transition count 127
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 20 with 2 rules applied. Total rules applied 190 place count 190 transition count 126
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 20 with 1 rules applied. Total rules applied 191 place count 190 transition count 125
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 20 with 3 rules applied. Total rules applied 194 place count 187 transition count 125
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 21 with 2 rules applied. Total rules applied 196 place count 186 transition count 124
Free-agglomeration rule applied 1 times.
Iterating global reduction 21 with 1 rules applied. Total rules applied 197 place count 186 transition count 123
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 199 place count 184 transition count 123
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 22 with 2 rules applied. Total rules applied 201 place count 183 transition count 122
Free-agglomeration rule applied 1 times.
Iterating global reduction 22 with 1 rules applied. Total rules applied 202 place count 183 transition count 121
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 204 place count 181 transition count 121
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 206 place count 180 transition count 120
Free-agglomeration rule applied 1 times.
Iterating global reduction 23 with 1 rules applied. Total rules applied 207 place count 180 transition count 119
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 209 place count 178 transition count 119
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 24 with 2 rules applied. Total rules applied 211 place count 177 transition count 118
Free-agglomeration rule applied 1 times.
Iterating global reduction 24 with 1 rules applied. Total rules applied 212 place count 177 transition count 117
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 214 place count 175 transition count 117
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 25 with 2 rules applied. Total rules applied 216 place count 174 transition count 116
Free-agglomeration rule applied 1 times.
Iterating global reduction 25 with 1 rules applied. Total rules applied 217 place count 174 transition count 115
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 25 with 2 rules applied. Total rules applied 219 place count 172 transition count 115
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 26 with 2 rules applied. Total rules applied 221 place count 171 transition count 114
Free-agglomeration rule applied 1 times.
Iterating global reduction 26 with 1 rules applied. Total rules applied 222 place count 171 transition count 113
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 26 with 2 rules applied. Total rules applied 224 place count 169 transition count 113
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 27 with 2 rules applied. Total rules applied 226 place count 168 transition count 112
Free-agglomeration rule applied 1 times.
Iterating global reduction 27 with 1 rules applied. Total rules applied 227 place count 168 transition count 111
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 27 with 2 rules applied. Total rules applied 229 place count 166 transition count 111
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 28 with 2 rules applied. Total rules applied 231 place count 165 transition count 110
Free-agglomeration rule applied 1 times.
Iterating global reduction 28 with 1 rules applied. Total rules applied 232 place count 165 transition count 109
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 28 with 2 rules applied. Total rules applied 234 place count 163 transition count 109
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 29 with 2 rules applied. Total rules applied 236 place count 162 transition count 108
Free-agglomeration rule applied 1 times.
Iterating global reduction 29 with 1 rules applied. Total rules applied 237 place count 162 transition count 107
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 29 with 2 rules applied. Total rules applied 239 place count 160 transition count 107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 30 with 2 rules applied. Total rules applied 241 place count 159 transition count 106
Free-agglomeration rule applied 1 times.
Iterating global reduction 30 with 1 rules applied. Total rules applied 242 place count 159 transition count 105
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 30 with 2 rules applied. Total rules applied 244 place count 157 transition count 105
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 31 with 2 rules applied. Total rules applied 246 place count 156 transition count 104
Free-agglomeration rule applied 1 times.
Iterating global reduction 31 with 1 rules applied. Total rules applied 247 place count 156 transition count 103
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 31 with 2 rules applied. Total rules applied 249 place count 154 transition count 103
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 32 with 2 rules applied. Total rules applied 251 place count 153 transition count 102
Free-agglomeration rule applied 1 times.
Iterating global reduction 32 with 1 rules applied. Total rules applied 252 place count 153 transition count 101
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 32 with 2 rules applied. Total rules applied 254 place count 151 transition count 101
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 33 with 2 rules applied. Total rules applied 256 place count 150 transition count 100
Free-agglomeration rule applied 1 times.
Iterating global reduction 33 with 1 rules applied. Total rules applied 257 place count 150 transition count 99
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 33 with 2 rules applied. Total rules applied 259 place count 148 transition count 99
Free-agglomeration rule applied 1 times.
Iterating global reduction 34 with 1 rules applied. Total rules applied 260 place count 148 transition count 98
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 34 with 1 rules applied. Total rules applied 261 place count 147 transition count 98
Applied a total of 261 rules in 261 ms. Remains 147 /304 variables (removed 157) and now considering 98/202 (removed 104) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 261 ms. Remains : 147/304 places, 98/202 transitions.
RANDOM walk for 40000 steps (67 resets) in 299 ms. (133 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 91 ms. (434 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 88 ms. (449 steps per ms) remains 2/3 properties
// Phase 1: matrix 98 rows 147 cols
[2025-06-03 17:53:57] [INFO ] Computed 51 invariants in 1 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 4/7 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/15 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 18/33 variables, 10/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/33 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/33 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/33 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/35 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/35 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/35 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/35 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 10/45 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/45 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/45 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/45 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 10/55 variables, 6/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/55 variables, 6/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/55 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/55 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 10/65 variables, 6/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/65 variables, 6/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/65 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/65 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 10/75 variables, 6/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/75 variables, 6/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/75 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/75 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 10/85 variables, 6/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/85 variables, 6/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/85 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/85 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 10/95 variables, 6/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/95 variables, 6/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/95 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/95 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (OVERLAPS) 10/105 variables, 6/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/105 variables, 6/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/105 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/105 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (OVERLAPS) 10/115 variables, 6/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/115 variables, 6/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/115 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/115 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (OVERLAPS) 10/125 variables, 6/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/125 variables, 6/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/125 variables, 2/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/125 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (OVERLAPS) 10/135 variables, 6/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/135 variables, 6/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/135 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/135 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (OVERLAPS) 10/145 variables, 6/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/145 variables, 6/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/145 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/145 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (OVERLAPS) 10/155 variables, 6/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/155 variables, 6/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/155 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/155 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (OVERLAPS) 10/165 variables, 6/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/165 variables, 6/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/165 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/165 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 67 (OVERLAPS) 10/175 variables, 6/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/175 variables, 6/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/175 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/175 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 71 (OVERLAPS) 10/185 variables, 6/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/185 variables, 6/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/185 variables, 2/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/185 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 75 (OVERLAPS) 12/197 variables, 8/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/197 variables, 8/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/197 variables, 4/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/197 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 79 (OVERLAPS) 10/207 variables, 6/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/207 variables, 6/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/207 variables, 2/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/207 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 83 (OVERLAPS) 10/217 variables, 6/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/217 variables, 6/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/217 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/217 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 87 (OVERLAPS) 10/227 variables, 6/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/227 variables, 6/315 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/227 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/227 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 91 (OVERLAPS) 10/237 variables, 6/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/237 variables, 6/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/237 variables, 2/331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/237 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 95 (OVERLAPS) 8/245 variables, 6/337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/245 variables, 6/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/245 variables, 2/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/245 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 99 (OVERLAPS) 0/245 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 345 constraints, problems are : Problem set: 0 solved, 2 unsolved in 541 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 4/7 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/15 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 18/33 variables, 10/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/33 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/33 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/33 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/33 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/35 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/35 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/35 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/35 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 10/45 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/45 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/45 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/45 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 10/55 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/55 variables, 6/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/55 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/55 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 10/65 variables, 6/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/65 variables, 6/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/65 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/65 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 10/75 variables, 6/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/75 variables, 6/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/75 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/75 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 10/85 variables, 6/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/85 variables, 6/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/85 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/85 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (OVERLAPS) 10/95 variables, 6/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/95 variables, 6/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/95 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/95 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (OVERLAPS) 10/105 variables, 6/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/105 variables, 6/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/105 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/105 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (OVERLAPS) 10/115 variables, 6/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/115 variables, 6/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/115 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/115 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (OVERLAPS) 10/125 variables, 6/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/125 variables, 6/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/125 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/125 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (OVERLAPS) 10/135 variables, 6/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/135 variables, 6/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/135 variables, 2/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/135 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (OVERLAPS) 10/145 variables, 6/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/145 variables, 6/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/145 variables, 2/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/145 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (OVERLAPS) 10/155 variables, 6/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/155 variables, 6/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/155 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/155 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 64 (OVERLAPS) 10/165 variables, 6/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/165 variables, 6/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/165 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/165 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 68 (OVERLAPS) 10/175 variables, 6/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/175 variables, 6/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/175 variables, 2/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/175 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 72 (OVERLAPS) 10/185 variables, 6/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/185 variables, 6/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/185 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/185 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 76 (OVERLAPS) 12/197 variables, 8/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/197 variables, 8/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/197 variables, 4/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/197 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 80 (OVERLAPS) 10/207 variables, 6/283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/207 variables, 6/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/207 variables, 2/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/207 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 84 (OVERLAPS) 10/217 variables, 6/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/217 variables, 6/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/217 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/217 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 88 (OVERLAPS) 10/227 variables, 6/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/227 variables, 6/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/227 variables, 2/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/227 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 92 (OVERLAPS) 10/237 variables, 6/325 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/237 variables, 6/331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/237 variables, 2/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/237 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 96 (OVERLAPS) 8/245 variables, 6/339 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/245 variables, 6/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/245 variables, 2/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/245 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 100 (OVERLAPS) 0/245 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 347 constraints, problems are : Problem set: 0 solved, 2 unsolved in 905 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1453ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 7798 steps, including 97 resets, run visited all 2 properties in 27 ms. (steps per millisecond=288 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 32 ms.
FORMULA ResAllocation-PT-R100C002-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)||G(p1)))))'
Support contains 2 out of 304 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 304/304 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 304 /304 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 304 cols
[2025-06-03 17:53:59] [INFO ] Computed 104 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:53:59] [INFO ] Implicit Places using invariants in 190 ms returned [209, 239, 251, 283]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 191 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 300/304 places, 202/202 transitions.
Applied a total of 0 rules in 1 ms. Remains 300 /300 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 195 ms. Remains : 300/304 places, 202/202 transitions.
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLCardinality-04
Product exploration explored 100000 steps with 27113 reset in 312 ms.
Product exploration explored 100000 steps with 27185 reset in 275 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 172 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (12 resets) in 328 ms. (121 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 1/1 properties
// Phase 1: matrix 202 rows 300 cols
[2025-06-03 17:54:00] [INFO ] Computed 100 invariants in 1 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/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 4/6 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/14 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 20/34 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/34 variables, 12/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/34 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/34 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 15/49 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/49 variables, 9/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/49 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/49 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 15/64 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/64 variables, 9/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/64 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/64 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 15/79 variables, 9/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/79 variables, 9/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/79 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/79 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 15/94 variables, 9/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/94 variables, 9/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/94 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/94 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 13/107 variables, 9/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/107 variables, 9/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/107 variables, 3/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/107 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 5/112 variables, 3/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/112 variables, 3/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/112 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/112 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 5/117 variables, 3/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/117 variables, 3/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/117 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/117 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 5/122 variables, 3/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/122 variables, 3/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/122 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/122 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 5/127 variables, 3/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/127 variables, 3/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/127 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/127 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 5/132 variables, 3/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/132 variables, 3/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/132 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/132 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 5/137 variables, 3/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/137 variables, 3/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/137 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/137 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 5/142 variables, 3/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/142 variables, 3/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/142 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/142 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 5/147 variables, 3/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/147 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/147 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/147 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 5/152 variables, 3/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/152 variables, 3/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/152 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/152 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (OVERLAPS) 5/157 variables, 3/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/157 variables, 3/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/157 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/157 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (OVERLAPS) 5/162 variables, 3/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/162 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/162 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/162 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (OVERLAPS) 5/167 variables, 3/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/167 variables, 3/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/167 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/167 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (OVERLAPS) 5/172 variables, 3/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/172 variables, 3/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/172 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/172 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (OVERLAPS) 5/177 variables, 3/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/177 variables, 3/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/177 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/177 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (OVERLAPS) 5/182 variables, 3/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/182 variables, 3/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/182 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/182 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (OVERLAPS) 5/187 variables, 3/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/187 variables, 3/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/187 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/187 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (OVERLAPS) 5/192 variables, 3/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/192 variables, 3/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/192 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/192 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (OVERLAPS) 5/197 variables, 3/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/197 variables, 3/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/197 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/197 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (OVERLAPS) 5/202 variables, 3/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/202 variables, 3/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/202 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/202 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (OVERLAPS) 5/207 variables, 3/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/207 variables, 3/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/207 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/207 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (OVERLAPS) 5/212 variables, 3/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/212 variables, 3/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/212 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/212 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (OVERLAPS) 5/217 variables, 3/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/217 variables, 3/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/217 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/217 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (OVERLAPS) 5/222 variables, 3/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/222 variables, 3/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/222 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/222 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (OVERLAPS) 5/227 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/227 variables, 3/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/227 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/227 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 127 (OVERLAPS) 5/232 variables, 3/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/232 variables, 3/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/232 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/232 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 131 (OVERLAPS) 5/237 variables, 3/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/237 variables, 3/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/237 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/237 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 135 (OVERLAPS) 5/242 variables, 3/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/242 variables, 3/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/242 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/242 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 139 (OVERLAPS) 5/247 variables, 3/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/247 variables, 3/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 141 (INCLUDED_ONLY) 0/247 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/247 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 143 (OVERLAPS) 5/252 variables, 3/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 144 (INCLUDED_ONLY) 0/252 variables, 3/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/252 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 146 (INCLUDED_ONLY) 0/252 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 147 (OVERLAPS) 5/257 variables, 3/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/257 variables, 3/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 149 (INCLUDED_ONLY) 0/257 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 150 (INCLUDED_ONLY) 0/257 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 151 (OVERLAPS) 5/262 variables, 3/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 152 (INCLUDED_ONLY) 0/262 variables, 3/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/262 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 154 (INCLUDED_ONLY) 0/262 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 155 (OVERLAPS) 5/267 variables, 3/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 156 (INCLUDED_ONLY) 0/267 variables, 3/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 157 (INCLUDED_ONLY) 0/267 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 158 (INCLUDED_ONLY) 0/267 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 159 (OVERLAPS) 5/272 variables, 3/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 160 (INCLUDED_ONLY) 0/272 variables, 3/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 161 (INCLUDED_ONLY) 0/272 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 162 (INCLUDED_ONLY) 0/272 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 163 (OVERLAPS) 5/277 variables, 3/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 164 (INCLUDED_ONLY) 0/277 variables, 3/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 165 (INCLUDED_ONLY) 0/277 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 166 (INCLUDED_ONLY) 0/277 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 167 (OVERLAPS) 5/282 variables, 3/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 168 (INCLUDED_ONLY) 0/282 variables, 3/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 169 (INCLUDED_ONLY) 0/282 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 170 (INCLUDED_ONLY) 0/282 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 171 (OVERLAPS) 5/287 variables, 3/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 172 (INCLUDED_ONLY) 0/287 variables, 3/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 173 (INCLUDED_ONLY) 0/287 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 174 (INCLUDED_ONLY) 0/287 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 175 (OVERLAPS) 5/292 variables, 3/402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 176 (INCLUDED_ONLY) 0/292 variables, 3/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 177 (INCLUDED_ONLY) 0/292 variables, 1/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 178 (INCLUDED_ONLY) 0/292 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 179 (OVERLAPS) 5/297 variables, 3/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 180 (INCLUDED_ONLY) 0/297 variables, 3/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 181 (INCLUDED_ONLY) 0/297 variables, 1/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 182 (INCLUDED_ONLY) 0/297 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 183 (OVERLAPS) 5/302 variables, 3/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 184 (INCLUDED_ONLY) 0/302 variables, 3/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 185 (INCLUDED_ONLY) 0/302 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 186 (INCLUDED_ONLY) 0/302 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 187 (OVERLAPS) 5/307 variables, 3/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 188 (INCLUDED_ONLY) 0/307 variables, 3/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 189 (INCLUDED_ONLY) 0/307 variables, 1/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 190 (INCLUDED_ONLY) 0/307 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 191 (OVERLAPS) 5/312 variables, 3/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 192 (INCLUDED_ONLY) 0/312 variables, 3/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 193 (INCLUDED_ONLY) 0/312 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 194 (INCLUDED_ONLY) 0/312 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 195 (OVERLAPS) 5/317 variables, 3/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 196 (INCLUDED_ONLY) 0/317 variables, 3/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 197 (INCLUDED_ONLY) 0/317 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 198 (INCLUDED_ONLY) 0/317 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 199 (OVERLAPS) 5/322 variables, 3/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 200 (INCLUDED_ONLY) 0/322 variables, 3/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 201 (INCLUDED_ONLY) 0/322 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 202 (INCLUDED_ONLY) 0/322 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 203 (OVERLAPS) 5/327 variables, 3/451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 204 (INCLUDED_ONLY) 0/327 variables, 3/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 205 (INCLUDED_ONLY) 0/327 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 206 (INCLUDED_ONLY) 0/327 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 207 (OVERLAPS) 5/332 variables, 3/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 208 (INCLUDED_ONLY) 0/332 variables, 3/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 209 (INCLUDED_ONLY) 0/332 variables, 1/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 210 (INCLUDED_ONLY) 0/332 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 211 (OVERLAPS) 5/337 variables, 3/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 212 (INCLUDED_ONLY) 0/337 variables, 3/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 213 (INCLUDED_ONLY) 0/337 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 214 (INCLUDED_ONLY) 0/337 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 215 (OVERLAPS) 5/342 variables, 3/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 216 (INCLUDED_ONLY) 0/342 variables, 3/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 217 (INCLUDED_ONLY) 0/342 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 218 (INCLUDED_ONLY) 0/342 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 219 (OVERLAPS) 5/347 variables, 3/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 220 (INCLUDED_ONLY) 0/347 variables, 3/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 221 (INCLUDED_ONLY) 0/347 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 222 (INCLUDED_ONLY) 0/347 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 223 (OVERLAPS) 5/352 variables, 3/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 224 (INCLUDED_ONLY) 0/352 variables, 3/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 225 (INCLUDED_ONLY) 0/352 variables, 1/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 226 (INCLUDED_ONLY) 0/352 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 227 (OVERLAPS) 5/357 variables, 3/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 228 (INCLUDED_ONLY) 0/357 variables, 3/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 229 (INCLUDED_ONLY) 0/357 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 230 (INCLUDED_ONLY) 0/357 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 231 (OVERLAPS) 5/362 variables, 3/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 232 (INCLUDED_ONLY) 0/362 variables, 3/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 233 (INCLUDED_ONLY) 0/362 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 234 (INCLUDED_ONLY) 0/362 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 235 (OVERLAPS) 5/367 variables, 3/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 236 (INCLUDED_ONLY) 0/367 variables, 3/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 237 (INCLUDED_ONLY) 0/367 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 238 (INCLUDED_ONLY) 0/367 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 239 (OVERLAPS) 5/372 variables, 3/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 240 (INCLUDED_ONLY) 0/372 variables, 3/517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 241 (INCLUDED_ONLY) 0/372 variables, 1/518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 242 (INCLUDED_ONLY) 0/372 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 243 (OVERLAPS) 5/377 variables, 3/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 244 (INCLUDED_ONLY) 0/377 variables, 3/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 245 (INCLUDED_ONLY) 0/377 variables, 1/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 246 (INCLUDED_ONLY) 0/377 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 247 (OVERLAPS) 5/382 variables, 3/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 248 (INCLUDED_ONLY) 0/382 variables, 3/531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 249 (INCLUDED_ONLY) 0/382 variables, 1/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 250 (INCLUDED_ONLY) 0/382 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 251 (OVERLAPS) 5/387 variables, 3/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 252 (INCLUDED_ONLY) 0/387 variables, 3/538 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 253 (INCLUDED_ONLY) 0/387 variables, 1/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 254 (INCLUDED_ONLY) 0/387 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 255 (OVERLAPS) 5/392 variables, 3/542 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 256 (INCLUDED_ONLY) 0/392 variables, 3/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 257 (INCLUDED_ONLY) 0/392 variables, 1/546 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 258 (INCLUDED_ONLY) 0/392 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 259 (OVERLAPS) 5/397 variables, 3/549 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 260 (INCLUDED_ONLY) 0/397 variables, 3/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 261 (INCLUDED_ONLY) 0/397 variables, 1/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 262 (INCLUDED_ONLY) 0/397 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 263 (OVERLAPS) 5/402 variables, 3/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 264 (INCLUDED_ONLY) 0/402 variables, 3/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 265 (INCLUDED_ONLY) 0/402 variables, 1/560 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 266 (INCLUDED_ONLY) 0/402 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 267 (OVERLAPS) 5/407 variables, 3/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 268 (INCLUDED_ONLY) 0/407 variables, 3/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 269 (INCLUDED_ONLY) 0/407 variables, 1/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 270 (INCLUDED_ONLY) 0/407 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 271 (OVERLAPS) 5/412 variables, 3/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 272 (INCLUDED_ONLY) 0/412 variables, 3/573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 273 (INCLUDED_ONLY) 0/412 variables, 1/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 274 (INCLUDED_ONLY) 0/412 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 275 (OVERLAPS) 5/417 variables, 3/577 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 276 (INCLUDED_ONLY) 0/417 variables, 3/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 277 (INCLUDED_ONLY) 0/417 variables, 1/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 278 (INCLUDED_ONLY) 0/417 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 279 (OVERLAPS) 5/422 variables, 3/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 280 (INCLUDED_ONLY) 0/422 variables, 3/587 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 281 (INCLUDED_ONLY) 0/422 variables, 1/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 282 (INCLUDED_ONLY) 0/422 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 283 (OVERLAPS) 5/427 variables, 3/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 284 (INCLUDED_ONLY) 0/427 variables, 3/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 285 (INCLUDED_ONLY) 0/427 variables, 1/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 286 (INCLUDED_ONLY) 0/427 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 287 (OVERLAPS) 5/432 variables, 3/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 288 (INCLUDED_ONLY) 0/432 variables, 3/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 289 (INCLUDED_ONLY) 0/432 variables, 1/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 290 (INCLUDED_ONLY) 0/432 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 291 (OVERLAPS) 5/437 variables, 3/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 292 (INCLUDED_ONLY) 0/437 variables, 3/608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 293 (INCLUDED_ONLY) 0/437 variables, 1/609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 294 (INCLUDED_ONLY) 0/437 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 295 (OVERLAPS) 5/442 variables, 3/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 296 (INCLUDED_ONLY) 0/442 variables, 3/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 297 (INCLUDED_ONLY) 0/442 variables, 1/616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 298 (INCLUDED_ONLY) 0/442 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 299 (OVERLAPS) 5/447 variables, 3/619 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 300 (INCLUDED_ONLY) 0/447 variables, 3/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 301 (INCLUDED_ONLY) 0/447 variables, 1/623 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 302 (INCLUDED_ONLY) 0/447 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 303 (OVERLAPS) 5/452 variables, 3/626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 304 (INCLUDED_ONLY) 0/452 variables, 3/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 305 (INCLUDED_ONLY) 0/452 variables, 1/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 306 (INCLUDED_ONLY) 0/452 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 307 (OVERLAPS) 5/457 variables, 3/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 308 (INCLUDED_ONLY) 0/457 variables, 3/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 309 (INCLUDED_ONLY) 0/457 variables, 1/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 310 (INCLUDED_ONLY) 0/457 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 311 (OVERLAPS) 5/462 variables, 3/640 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 312 (INCLUDED_ONLY) 0/462 variables, 3/643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 313 (INCLUDED_ONLY) 0/462 variables, 1/644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 314 (INCLUDED_ONLY) 0/462 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 315 (OVERLAPS) 5/467 variables, 3/647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 316 (INCLUDED_ONLY) 0/467 variables, 3/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 317 (INCLUDED_ONLY) 0/467 variables, 1/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 318 (INCLUDED_ONLY) 0/467 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 319 (OVERLAPS) 5/472 variables, 3/654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 320 (INCLUDED_ONLY) 0/472 variables, 3/657 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 321 (INCLUDED_ONLY) 0/472 variables, 1/658 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 322 (INCLUDED_ONLY) 0/472 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 323 (OVERLAPS) 5/477 variables, 3/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 324 (INCLUDED_ONLY) 0/477 variables, 3/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 325 (INCLUDED_ONLY) 0/477 variables, 1/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 326 (INCLUDED_ONLY) 0/477 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 327 (OVERLAPS) 5/482 variables, 3/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 328 (INCLUDED_ONLY) 0/482 variables, 3/671 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 329 (INCLUDED_ONLY) 0/482 variables, 1/672 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 330 (INCLUDED_ONLY) 0/482 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 331 (OVERLAPS) 5/487 variables, 3/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 332 (INCLUDED_ONLY) 0/487 variables, 3/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 333 (INCLUDED_ONLY) 0/487 variables, 1/679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 334 (INCLUDED_ONLY) 0/487 variables, 0/679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 335 (OVERLAPS) 5/492 variables, 3/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 336 (INCLUDED_ONLY) 0/492 variables, 3/685 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 337 (INCLUDED_ONLY) 0/492 variables, 1/686 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 338 (INCLUDED_ONLY) 0/492 variables, 0/686 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 339 (OVERLAPS) 5/497 variables, 3/689 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 340 (INCLUDED_ONLY) 0/497 variables, 3/692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 341 (INCLUDED_ONLY) 0/497 variables, 1/693 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 342 (INCLUDED_ONLY) 0/497 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 343 (OVERLAPS) 5/502 variables, 3/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 344 (INCLUDED_ONLY) 0/502 variables, 3/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 345 (INCLUDED_ONLY) 0/502 variables, 1/700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 346 (INCLUDED_ONLY) 0/502 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 347 (OVERLAPS) 0/502 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 502/502 variables, and 700 constraints, problems are : Problem set: 0 solved, 1 unsolved in 659 ms.
Refiners :[Domain max(s): 300/300 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf1 is UNSAT
After SMT solving in domain Int declared 2/502 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 22 ms.
Refiners :[Domain max(s): 2/300 constraints, Positive P Invariants (semi-flows): 0/100 constraints, State Equation: 0/300 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 687ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (OR p0 p1))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 17 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ResAllocation-PT-R100C002-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ResAllocation-PT-R100C002-LTLCardinality-04 finished in 2218 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F(p1)))'
Support contains 3 out of 304 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 304/304 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 304 /304 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 304 cols
[2025-06-03 17:54:01] [INFO ] Computed 104 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:54:01] [INFO ] Implicit Places using invariants in 183 ms returned [209, 239, 251, 283]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 184 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 300/304 places, 202/202 transitions.
Applied a total of 0 rules in 1 ms. Remains 300 /300 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 188 ms. Remains : 300/304 places, 202/202 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLCardinality-06
Stuttering criterion allowed to conclude after 2559 steps with 0 reset in 16 ms.
FORMULA ResAllocation-PT-R100C002-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R100C002-LTLCardinality-06 finished in 331 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 304 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 304/304 places, 202/202 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 302 transition count 200
Applied a total of 4 rules in 14 ms. Remains 302 /304 variables (removed 2) and now considering 200/202 (removed 2) transitions.
// Phase 1: matrix 200 rows 302 cols
[2025-06-03 17:54:01] [INFO ] Computed 104 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:54:01] [INFO ] Implicit Places using invariants in 180 ms returned [207, 237, 249, 281]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 181 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 298/304 places, 200/202 transitions.
Applied a total of 0 rules in 5 ms. Remains 298 /298 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 200 ms. Remains : 298/304 places, 200/202 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLCardinality-11
Stuttering criterion allowed to conclude after 2586 steps with 0 reset in 13 ms.
FORMULA ResAllocation-PT-R100C002-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R100C002-LTLCardinality-11 finished in 270 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p1)&&p0)))'
Support contains 3 out of 304 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 304/304 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 304 /304 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 304 cols
[2025-06-03 17:54:02] [INFO ] Computed 104 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:54:02] [INFO ] Implicit Places using invariants in 187 ms returned [209, 239, 251]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 188 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 301/304 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 301 /301 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 192 ms. Remains : 301/304 places, 202/202 transitions.
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLCardinality-13
Stuttering criterion allowed to conclude after 2554 steps with 0 reset in 17 ms.
FORMULA ResAllocation-PT-R100C002-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R100C002-LTLCardinality-13 finished in 313 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 304 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 304/304 places, 202/202 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 302 transition count 200
Applied a total of 4 rules in 11 ms. Remains 302 /304 variables (removed 2) and now considering 200/202 (removed 2) transitions.
// Phase 1: matrix 200 rows 302 cols
[2025-06-03 17:54:02] [INFO ] Computed 104 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:54:02] [INFO ] Implicit Places using invariants in 173 ms returned [281]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 174 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 301/304 places, 200/202 transitions.
Applied a total of 0 rules in 5 ms. Remains 301 /301 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 190 ms. Remains : 301/304 places, 200/202 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLCardinality-14
Product exploration explored 100000 steps with 52 reset in 374 ms.
Product exploration explored 100000 steps with 53 reset in 498 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 63 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 12896 steps (4 resets) in 56 ms. (226 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 200/200 transitions.
Applied a total of 0 rules in 9 ms. Remains 301 /301 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 301 cols
[2025-06-03 17:54:03] [INFO ] Computed 103 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:54:04] [INFO ] Implicit Places using invariants in 165 ms returned []
[2025-06-03 17:54:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:54:04] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 668 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 17:54:04] [INFO ] Redundant transitions in 7 ms returned []
Running 198 sub problems to find dead transitions.
[2025-06-03 17:54:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 301/301 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 103/404 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:06] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:06] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:06] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:06] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:06] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:06] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:06] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:07] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:07] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:07] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:07] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:07] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:07] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:07] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:07] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:07] [INFO ] Deduced a trap composed of 4 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-03 17:54:07] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:07] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:07] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:08] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 20/424 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:08] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:09] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:09] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:09] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:09] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:09] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:09] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:09] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:09] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:09] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:09] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:09] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:09] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:10] [INFO ] Deduced a trap composed of 4 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-03 17:54:10] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:10] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:10] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:10] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:10] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:10] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 20/444 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:12] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:12] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:12] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:12] [INFO ] Deduced a trap composed of 4 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-03 17:54:12] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:12] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:12] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:12] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:12] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:13] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:13] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:13] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:13] [INFO ] Deduced a trap composed of 4 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-03 17:54:13] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:13] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:13] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:13] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:13] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:13] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:13] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 20/464 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:14] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:14] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:15] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:15] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:15] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:15] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:15] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:15] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:15] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:15] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:15] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:15] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:15] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:15] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:15] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:15] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:15] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:16] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:16] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:16] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 20/484 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:17] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:17] [INFO ] Deduced a trap composed of 4 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-03 17:54:17] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:17] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:17] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:17] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:17] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:17] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:17] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:17] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:18] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:18] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:18] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:18] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:18] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 15/499 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (OVERLAPS) 200/501 variables, 301/800 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (OVERLAPS) 0/501 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 501/501 variables, and 800 constraints, problems are : Problem set: 0 solved, 198 unsolved in 27844 ms.
Refiners :[Domain max(s): 301/301 constraints, Positive P Invariants (semi-flows): 103/103 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 95/95 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 301/301 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 103/404 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 95/499 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 200/501 variables, 301/800 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 198/998 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 501/501 variables, and 998 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30016 ms.
Refiners :[Domain max(s): 301/301 constraints, Positive P Invariants (semi-flows): 103/103 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 95/95 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57919ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 57922ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 58619 ms. Remains : 301/301 places, 200/200 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 15534 steps (5 resets) in 84 ms. (182 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 52 reset in 334 ms.
Product exploration explored 100000 steps with 53 reset in 392 ms.
Built C files in :
/tmp/ltsmin15312073382152513320
[2025-06-03 17:55:03] [INFO ] Computing symmetric may disable matrix : 200 transitions.
[2025-06-03 17:55:03] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 17:55:03] [INFO ] Computing symmetric may enable matrix : 200 transitions.
[2025-06-03 17:55:03] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 17:55:03] [INFO ] Computing Do-Not-Accords matrix : 200 transitions.
[2025-06-03 17:55:03] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 17:55:03] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15312073382152513320
Running compilation step : cd /tmp/ltsmin15312073382152513320;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 536 ms.
Running link step : cd /tmp/ltsmin15312073382152513320;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin15312073382152513320;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1280446375112196544.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 200/200 transitions.
Applied a total of 0 rules in 15 ms. Remains 301 /301 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2025-06-03 17:55:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:55:19] [INFO ] Implicit Places using invariants in 181 ms returned []
[2025-06-03 17:55:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:55:19] [INFO ] Implicit Places using invariants and state equation in 485 ms returned []
Implicit Place search using SMT with State Equation took 669 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 17:55:19] [INFO ] Redundant transitions in 6 ms returned []
Running 198 sub problems to find dead transitions.
[2025-06-03 17:55: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/301 variables, 301/301 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 103/404 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:21] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:21] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:21] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:21] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:21] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:21] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:21] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:21] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:21] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:22] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:22] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:22] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:22] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:22] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:22] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:22] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:22] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:22] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:22] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:22] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 20/424 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:23] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:23] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:23] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:23] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:24] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:24] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:24] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:24] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:24] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:24] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:24] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:24] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:24] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:24] [INFO ] Deduced a trap composed of 4 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-03 17:55:24] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:24] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:24] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:24] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:25] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:25] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 20/444 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:26] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:26] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:27] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:27] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:27] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:27] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:27] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:27] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:27] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:27] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:27] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:27] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:27] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:27] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:27] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:27] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:27] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:27] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:28] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:28] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 20/464 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:29] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:29] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:29] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:29] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:29] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:29] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:29] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:29] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:29] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:29] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:29] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:29] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:29] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:29] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:30] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:30] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:30] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:30] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:30] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:30] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 20/484 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:31] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:31] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:31] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:31] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:31] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:31] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:31] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:31] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:31] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:32] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:32] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:32] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:32] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:32] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:55:32] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 15/499 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (OVERLAPS) 200/501 variables, 301/800 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (OVERLAPS) 0/501 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 501/501 variables, and 800 constraints, problems are : Problem set: 0 solved, 198 unsolved in 27009 ms.
Refiners :[Domain max(s): 301/301 constraints, Positive P Invariants (semi-flows): 103/103 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 95/95 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 301/301 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 103/404 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 95/499 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 200/501 variables, 301/800 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 198/998 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 501/501 variables, and 998 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30017 ms.
Refiners :[Domain max(s): 301/301 constraints, Positive P Invariants (semi-flows): 103/103 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 95/95 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57047ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 57049ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 57743 ms. Remains : 301/301 places, 200/200 transitions.
Built C files in :
/tmp/ltsmin1996825303455835728
[2025-06-03 17:56:16] [INFO ] Computing symmetric may disable matrix : 200 transitions.
[2025-06-03 17:56:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 17:56:16] [INFO ] Computing symmetric may enable matrix : 200 transitions.
[2025-06-03 17:56:16] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 17:56:16] [INFO ] Computing Do-Not-Accords matrix : 200 transitions.
[2025-06-03 17:56:16] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 17:56:16] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1996825303455835728
Running compilation step : cd /tmp/ltsmin1996825303455835728;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 393 ms.
Running link step : cd /tmp/ltsmin1996825303455835728;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin1996825303455835728;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14511240380427269528.hoa' '--buchi-type=spotba'
LTSmin run took 1074 ms.
FORMULA ResAllocation-PT-R100C002-LTLCardinality-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ResAllocation-PT-R100C002-LTLCardinality-14 finished in 135875 ms.
All properties solved by simple procedures.
Total runtime 151216 ms.
BK_STOP 1748973378235
--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="ResAllocation-PT-R100C002"
export BK_EXAMINATION="LTLCardinality"
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 ResAllocation-PT-R100C002, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r184-tall-174889263700187"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R100C002.tgz
mv ResAllocation-PT-R100C002 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;