Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r312-tall-171662339500881.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
Input is ResAllocation-PT-R100C002, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-171662339500881
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 896K
-rw-r--r-- 1 mcc users 9.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 11 23:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Apr 11 23:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 11 23:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 11 23:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 9 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 422K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-2024-00
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-2024-01
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-2024-02
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-2024-03
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-2024-04
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-2024-05
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-2024-06
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-2024-07
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-2024-08
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-2024-09
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-2024-10
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-2024-11
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-2023-12
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-2023-13
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-2023-14
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716719816115

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
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
CTLCardinality PT
Running Version 202405141337
[2024-05-26 10:36:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 10:36:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 10:36:57] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2024-05-26 10:36:57] [INFO ] Transformed 400 places.
[2024-05-26 10:36:57] [INFO ] Transformed 202 transitions.
[2024-05-26 10:36:57] [INFO ] Found NUPN structural information;
[2024-05-26 10:36:57] [INFO ] Parsed PT model containing 400 places and 202 transitions and 1000 arcs in 202 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Initial state reduction rules removed 1 formulas.
FORMULA ResAllocation-PT-R100C002-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 125 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 36 ms. Remains 400 /400 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 400 cols
[2024-05-26 10:36:57] [INFO ] Computed 200 invariants in 22 ms
[2024-05-26 10:36:58] [INFO ] Implicit Places using invariants in 436 ms returned [201, 203, 205, 207, 209, 211, 213, 217, 219, 221, 223, 227, 233, 235, 237, 243, 245, 247, 249, 253, 257, 261, 263, 265, 267, 269, 287, 291, 293, 295, 297, 299, 303, 305, 307, 309, 317, 321, 323, 327, 331, 333, 335, 337, 341, 345, 347, 349, 353, 359, 361, 365, 367, 369, 371, 375, 377, 379, 389, 393, 395]
Discarding 61 places :
Implicit Place search using SMT only with invariants took 466 ms to find 61 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 339/400 places, 202/202 transitions.
Applied a total of 0 rules in 8 ms. Remains 339 /339 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 527 ms. Remains : 339/400 places, 202/202 transitions.
Support contains 125 out of 339 places after structural reductions.
[2024-05-26 10:36:58] [INFO ] Flatten gal took : 45 ms
[2024-05-26 10:36:58] [INFO ] Flatten gal took : 19 ms
[2024-05-26 10:36:58] [INFO ] Input system was already deterministic with 202 transitions.
Reduction of identical properties reduced properties to check from 77 to 75
RANDOM walk for 40000 steps (12 resets) in 2410 ms. (16 steps per ms) remains 20/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
// Phase 1: matrix 202 rows 339 cols
[2024-05-26 10:36:59] [INFO ] Computed 139 invariants in 5 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Problem AtomicPropp26 is UNSAT
At refinement iteration 3 (OVERLAPS) 57/96 variables, 38/79 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 57/136 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 26/122 variables, 14/150 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 26/176 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/176 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 108/230 variables, 122/298 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 0/298 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 152/382 variables, 104/402 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/382 variables, 104/506 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/382 variables, 38/544 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/382 variables, 0/544 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 15 (OVERLAPS) 77/459 variables, 57/601 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/459 variables, 57/658 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/459 variables, 23/681 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/459 variables, 0/681 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 19 (OVERLAPS) 20/479 variables, 16/697 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/479 variables, 16/713 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/479 variables, 6/719 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/479 variables, 0/719 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 23 (OVERLAPS) 5/484 variables, 3/722 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/484 variables, 3/725 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/484 variables, 1/726 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/484 variables, 0/726 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 27 (OVERLAPS) 6/490 variables, 4/730 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/490 variables, 4/734 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/490 variables, 2/736 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/490 variables, 0/736 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 31 (OVERLAPS) 6/496 variables, 4/740 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/496 variables, 4/744 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/496 variables, 2/746 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/496 variables, 0/746 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 35 (OVERLAPS) 6/502 variables, 4/750 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/502 variables, 4/754 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/502 variables, 2/756 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/502 variables, 0/756 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 39 (OVERLAPS) 6/508 variables, 4/760 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/508 variables, 4/764 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/508 variables, 2/766 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/508 variables, 0/766 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 43 (OVERLAPS) 5/513 variables, 3/769 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/513 variables, 3/772 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/513 variables, 1/773 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/513 variables, 0/773 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 47 (OVERLAPS) 6/519 variables, 4/777 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/519 variables, 4/781 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/519 variables, 2/783 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/519 variables, 0/783 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 51 (OVERLAPS) 5/524 variables, 3/786 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/524 variables, 3/789 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/524 variables, 1/790 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/524 variables, 0/790 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 55 (OVERLAPS) 5/529 variables, 3/793 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/529 variables, 3/796 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/529 variables, 1/797 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/529 variables, 0/797 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 59 (OVERLAPS) 6/535 variables, 4/801 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/535 variables, 4/805 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/535 variables, 2/807 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/535 variables, 0/807 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 63 (OVERLAPS) 6/541 variables, 4/811 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/541 variables, 4/815 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/541 variables, 2/817 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/541 variables, 0/817 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 67 (OVERLAPS) 0/541 variables, 0/817 constraints. Problems are: Problem set: 1 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 541/541 variables, and 817 constraints, problems are : Problem set: 1 solved, 19 unsolved in 4145 ms.
Refiners :[Domain max(s): 339/339 constraints, Positive P Invariants (semi-flows): 139/139 constraints, State Equation: 339/339 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 37/37 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 2/39 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/39 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 55/92 variables, 36/75 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 55/130 constraints. Problems are: Problem set: 1 solved, 19 unsolved
[2024-05-26 10:37:03] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 13 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 1/131 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/131 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 26/118 variables, 14/145 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 26/171 constraints. Problems are: Problem set: 1 solved, 19 unsolved
[2024-05-26 10:37:03] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 1/172 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/118 variables, 0/172 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 104/222 variables, 118/290 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 3/293 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/222 variables, 0/293 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 14 (OVERLAPS) 149/371 variables, 101/394 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/371 variables, 101/495 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/371 variables, 37/532 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/371 variables, 16/548 constraints. Problems are: Problem set: 1 solved, 19 unsolved
[2024-05-26 10:37:04] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 2 ms to minimize.
[2024-05-26 10:37:04] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-26 10:37:04] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 2 ms to minimize.
[2024-05-26 10:37:04] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 10:37:04] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-26 10:37:04] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-26 10:37:04] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/371 variables, 7/555 constraints. Problems are: Problem set: 1 solved, 19 unsolved
[2024-05-26 10:37:04] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-26 10:37:04] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 10:37:04] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/371 variables, 3/558 constraints. Problems are: Problem set: 1 solved, 19 unsolved
[2024-05-26 10:37:05] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/371 variables, 1/559 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/371 variables, 0/559 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 22 (OVERLAPS) 80/451 variables, 58/617 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/451 variables, 58/675 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/451 variables, 24/699 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/451 variables, 0/699 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 26 (OVERLAPS) 28/479 variables, 22/721 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/479 variables, 22/743 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/479 variables, 8/751 constraints. Problems are: Problem set: 1 solved, 19 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 479/541 variables, and 751 constraints, problems are : Problem set: 1 solved, 19 unsolved in 5017 ms.
Refiners :[Domain max(s): 299/339 constraints, Positive P Invariants (semi-flows): 121/139 constraints, State Equation: 299/339 constraints, PredecessorRefiner: 19/20 constraints, Known Traps: 13/13 constraints]
After SMT, in 9236ms problems are : Problem set: 1 solved, 19 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 37 out of 339 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 339/339 places, 202/202 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 337 transition count 200
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 337 transition count 199
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 7 place count 335 transition count 199
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 1 with 2 rules applied. Total rules applied 9 place count 334 transition count 198
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 334 transition count 197
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 13 place count 331 transition count 197
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 2 with 2 rules applied. Total rules applied 15 place count 330 transition count 196
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 330 transition count 195
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 19 place count 327 transition count 195
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 3 with 2 rules applied. Total rules applied 21 place count 326 transition count 194
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 22 place count 326 transition count 193
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 24 place count 324 transition count 193
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 4 with 2 rules applied. Total rules applied 26 place count 323 transition count 192
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 27 place count 323 transition count 191
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 29 place count 321 transition count 191
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 5 with 2 rules applied. Total rules applied 31 place count 320 transition count 190
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 32 place count 320 transition count 189
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 35 place count 317 transition count 189
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 6 with 2 rules applied. Total rules applied 37 place count 316 transition count 188
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 38 place count 316 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 40 place count 314 transition count 187
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 7 with 2 rules applied. Total rules applied 42 place count 313 transition count 186
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 43 place count 313 transition count 185
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 46 place count 310 transition count 185
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 8 with 2 rules applied. Total rules applied 48 place count 309 transition count 184
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 49 place count 309 transition count 183
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 52 place count 306 transition count 183
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 9 with 2 rules applied. Total rules applied 54 place count 305 transition count 182
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 55 place count 305 transition count 181
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 58 place count 302 transition count 181
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 10 with 2 rules applied. Total rules applied 60 place count 301 transition count 180
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 61 place count 301 transition count 179
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 64 place count 298 transition count 179
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 11 with 2 rules applied. Total rules applied 66 place count 297 transition count 178
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 67 place count 297 transition count 177
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 69 place count 295 transition count 177
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 12 with 2 rules applied. Total rules applied 71 place count 294 transition count 176
Free-agglomeration rule applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 72 place count 294 transition count 175
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 74 place count 292 transition count 175
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 13 with 2 rules applied. Total rules applied 76 place count 291 transition count 174
Free-agglomeration rule applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 77 place count 291 transition count 173
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 79 place count 289 transition count 173
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 14 with 2 rules applied. Total rules applied 81 place count 288 transition count 172
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 14 with 1 rules applied. Total rules applied 82 place count 288 transition count 171
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 85 place count 285 transition count 171
Free-agglomeration rule applied 1 times.
Iterating global reduction 15 with 1 rules applied. Total rules applied 86 place count 285 transition count 170
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 87 place count 284 transition count 170
Applied a total of 87 rules in 281 ms. Remains 284 /339 variables (removed 55) and now considering 170/202 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 281 ms. Remains : 284/339 places, 170/202 transitions.
RANDOM walk for 40000 steps (20 resets) in 968 ms. (41 steps per ms) remains 14/19 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 134 ms. (296 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 11/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 86 ms. (459 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 11/11 properties
// Phase 1: matrix 170 rows 284 cols
[2024-05-26 10:37:09] [INFO ] Computed 116 invariants in 1 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 26/44 variables, 18/36 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 26/62 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 10/54 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 10/77 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 56/110 variables, 54/131 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/110 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 119/229 variables, 78/209 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/229 variables, 78/287 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/229 variables, 30/317 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/229 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 88/317 variables, 58/375 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/317 variables, 58/433 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/317 variables, 26/459 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/317 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (OVERLAPS) 64/381 variables, 46/505 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/381 variables, 46/551 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/381 variables, 18/569 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/381 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 22 (OVERLAPS) 20/401 variables, 14/583 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/401 variables, 14/597 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/401 variables, 6/603 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/401 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 26 (OVERLAPS) 16/417 variables, 10/613 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/417 variables, 10/623 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/417 variables, 4/627 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/417 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 30 (OVERLAPS) 13/430 variables, 8/635 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/430 variables, 8/643 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/430 variables, 3/646 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/430 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 34 (OVERLAPS) 10/440 variables, 6/652 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/440 variables, 6/658 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/440 variables, 2/660 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/440 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 38 (OVERLAPS) 11/451 variables, 7/667 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/451 variables, 7/674 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/451 variables, 3/677 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/451 variables, 0/677 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 42 (OVERLAPS) 3/454 variables, 3/680 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/454 variables, 3/683 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/454 variables, 1/684 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/454 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 46 (OVERLAPS) 0/454 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 454/454 variables, and 684 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1012 ms.
Refiners :[Domain max(s): 284/284 constraints, Positive P Invariants (semi-flows): 116/116 constraints, State Equation: 284/284 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 26/44 variables, 18/36 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 26/62 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 10/54 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 10/77 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 56/110 variables, 54/131 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/110 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 119/229 variables, 78/209 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/229 variables, 78/287 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/229 variables, 30/317 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/229 variables, 11/328 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-26 10:37:10] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-26 10:37:10] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 10:37:10] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/229 variables, 3/331 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-26 10:37:11] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-26 10:37:11] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/229 variables, 2/333 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-26 10:37:11] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/229 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/229 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (OVERLAPS) 88/317 variables, 58/392 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/317 variables, 58/450 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/317 variables, 26/476 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/317 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 22 (OVERLAPS) 64/381 variables, 46/522 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/381 variables, 46/568 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/381 variables, 18/586 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-26 10:37:11] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-26 10:37:11] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/381 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/381 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 27 (OVERLAPS) 20/401 variables, 14/602 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/401 variables, 14/616 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/401 variables, 6/622 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/401 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 31 (OVERLAPS) 16/417 variables, 10/632 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/417 variables, 10/642 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/417 variables, 4/646 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/417 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 35 (OVERLAPS) 13/430 variables, 8/654 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/430 variables, 8/662 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/430 variables, 3/665 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/430 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 39 (OVERLAPS) 10/440 variables, 6/671 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/440 variables, 6/677 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/440 variables, 2/679 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/440 variables, 0/679 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 43 (OVERLAPS) 11/451 variables, 7/686 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/451 variables, 7/693 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/451 variables, 3/696 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/451 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 47 (OVERLAPS) 3/454 variables, 3/699 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/454 variables, 3/702 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/454 variables, 1/703 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/454 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-26 10:37:14] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
At refinement iteration 51 (OVERLAPS) 0/454 variables, 1/704 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/454 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 53 (OVERLAPS) 0/454 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 454/454 variables, and 704 constraints, problems are : Problem set: 0 solved, 11 unsolved in 4859 ms.
Refiners :[Domain max(s): 284/284 constraints, Positive P Invariants (semi-flows): 116/116 constraints, State Equation: 284/284 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 9/9 constraints]
After SMT, in 5880ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 5 different solutions.
Parikh walk visited 8 properties in 7605 ms.
Support contains 4 out of 284 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 284/284 places, 170/170 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 282 transition count 169
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 281 transition count 168
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 281 transition count 166
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 11 place count 277 transition count 166
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 1 with 2 rules applied. Total rules applied 13 place count 276 transition count 165
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 276 transition count 163
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 18 place count 273 transition count 163
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 272 transition count 162
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 272 transition count 161
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 23 place count 270 transition count 161
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 25 place count 269 transition count 160
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 26 place count 269 transition count 159
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 28 place count 267 transition count 159
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 4 with 2 rules applied. Total rules applied 30 place count 266 transition count 158
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 31 place count 266 transition count 157
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 33 place count 264 transition count 157
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 5 with 2 rules applied. Total rules applied 35 place count 263 transition count 156
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 36 place count 263 transition count 155
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 38 place count 261 transition count 155
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 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 41 place count 259 transition count 154
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 42 place count 259 transition count 153
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 44 place count 257 transition count 153
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 7 with 2 rules applied. Total rules applied 46 place count 256 transition count 152
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 47 place count 256 transition count 151
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 49 place count 254 transition count 151
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 8 with 2 rules applied. Total rules applied 51 place count 253 transition count 150
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 52 place count 253 transition count 149
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 54 place count 251 transition count 149
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 9 with 2 rules applied. Total rules applied 56 place count 250 transition count 148
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 57 place count 250 transition count 147
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 59 place count 248 transition count 147
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 10 with 2 rules applied. Total rules applied 61 place count 247 transition count 146
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 62 place count 247 transition count 145
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 64 place count 245 transition count 145
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 2 places and 0 transitions.
Iterating global reduction 11 with 3 rules applied. Total rules applied 67 place count 243 transition count 144
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 68 place count 243 transition count 143
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 70 place count 241 transition count 143
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 12 with 2 rules applied. Total rules applied 72 place count 240 transition count 142
Free-agglomeration rule applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 73 place count 240 transition count 141
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 75 place count 238 transition count 141
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 2 places and 0 transitions.
Iterating global reduction 13 with 3 rules applied. Total rules applied 78 place count 236 transition count 140
Free-agglomeration rule applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 79 place count 236 transition count 139
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 81 place count 234 transition count 139
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 2 places and 0 transitions.
Iterating global reduction 14 with 3 rules applied. Total rules applied 84 place count 232 transition count 138
Free-agglomeration rule applied 1 times.
Iterating global reduction 14 with 1 rules applied. Total rules applied 85 place count 232 transition count 137
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 87 place count 230 transition count 137
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 15 with 2 rules applied. Total rules applied 89 place count 229 transition count 136
Free-agglomeration rule applied 1 times.
Iterating global reduction 15 with 1 rules applied. Total rules applied 90 place count 229 transition count 135
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 92 place count 227 transition count 135
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 16 with 2 rules applied. Total rules applied 94 place count 226 transition count 134
Free-agglomeration rule applied 1 times.
Iterating global reduction 16 with 1 rules applied. Total rules applied 95 place count 226 transition count 133
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 97 place count 224 transition count 133
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 17 with 2 rules applied. Total rules applied 99 place count 223 transition count 132
Free-agglomeration rule applied 1 times.
Iterating global reduction 17 with 1 rules applied. Total rules applied 100 place count 223 transition count 131
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 102 place count 221 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 2 places and 0 transitions.
Iterating global reduction 18 with 3 rules applied. Total rules applied 105 place count 219 transition count 130
Free-agglomeration rule applied 1 times.
Iterating global reduction 18 with 1 rules applied. Total rules applied 106 place count 219 transition count 129
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 108 place count 217 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 2 places and 0 transitions.
Iterating global reduction 19 with 3 rules applied. Total rules applied 111 place count 215 transition count 128
Free-agglomeration rule applied 1 times.
Iterating global reduction 19 with 1 rules applied. Total rules applied 112 place count 215 transition count 127
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 114 place count 213 transition count 127
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 20 with 2 rules applied. Total rules applied 116 place count 212 transition count 126
Free-agglomeration rule applied 1 times.
Iterating global reduction 20 with 1 rules applied. Total rules applied 117 place count 212 transition count 125
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 119 place count 210 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 121 place count 209 transition count 124
Free-agglomeration rule applied 1 times.
Iterating global reduction 21 with 1 rules applied. Total rules applied 122 place count 209 transition count 123
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 124 place count 207 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 126 place count 206 transition count 122
Free-agglomeration rule applied 1 times.
Iterating global reduction 22 with 1 rules applied. Total rules applied 127 place count 206 transition count 121
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 129 place count 204 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 131 place count 203 transition count 120
Free-agglomeration rule applied 1 times.
Iterating global reduction 23 with 1 rules applied. Total rules applied 132 place count 203 transition count 119
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 134 place count 201 transition count 119
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 2 places and 0 transitions.
Iterating global reduction 24 with 3 rules applied. Total rules applied 137 place count 199 transition count 118
Free-agglomeration rule applied 1 times.
Iterating global reduction 24 with 1 rules applied. Total rules applied 138 place count 199 transition count 117
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 140 place count 197 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 142 place count 196 transition count 116
Free-agglomeration rule applied 1 times.
Iterating global reduction 25 with 1 rules applied. Total rules applied 143 place count 196 transition count 115
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 25 with 2 rules applied. Total rules applied 145 place count 194 transition count 115
Free-agglomeration rule applied 1 times.
Iterating global reduction 26 with 1 rules applied. Total rules applied 146 place count 194 transition count 114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 26 with 1 rules applied. Total rules applied 147 place count 193 transition count 114
Applied a total of 147 rules in 146 ms. Remains 193 /284 variables (removed 91) and now considering 114/170 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 193/284 places, 114/170 transitions.
RANDOM walk for 40000 steps (48 resets) in 198 ms. (201 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 2/2 properties
// Phase 1: matrix 114 rows 193 cols
[2024-05-26 10:37:23] [INFO ] Computed 81 invariants in 1 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) 1/8 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 8/16 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/16 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 22/38 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/38 variables, 12/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/38 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 10:37:23] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/38 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/38 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/40 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/40 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/40 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/40 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 23/63 variables, 15/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/63 variables, 15/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/63 variables, 7/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/63 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 18/81 variables, 12/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/81 variables, 12/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/81 variables, 4/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/81 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 10/91 variables, 6/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/91 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/91 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/91 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 11/102 variables, 7/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/102 variables, 7/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/102 variables, 3/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/102 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 10/112 variables, 6/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/112 variables, 6/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/112 variables, 2/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/112 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (OVERLAPS) 11/123 variables, 7/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/123 variables, 7/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/123 variables, 3/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/123 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (OVERLAPS) 11/134 variables, 7/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/134 variables, 7/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/134 variables, 3/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/134 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (OVERLAPS) 11/145 variables, 7/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/145 variables, 7/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/145 variables, 3/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/145 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (OVERLAPS) 11/156 variables, 7/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/156 variables, 7/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/156 variables, 3/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/156 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (OVERLAPS) 11/167 variables, 7/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/167 variables, 7/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/167 variables, 3/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/167 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (OVERLAPS) 12/179 variables, 8/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/179 variables, 8/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/179 variables, 4/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/179 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (OVERLAPS) 11/190 variables, 7/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/190 variables, 7/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/190 variables, 3/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/190 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 67 (OVERLAPS) 12/202 variables, 8/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/202 variables, 8/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/202 variables, 4/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/202 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 71 (OVERLAPS) 11/213 variables, 7/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/213 variables, 7/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/213 variables, 3/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/213 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 75 (OVERLAPS) 10/223 variables, 6/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/223 variables, 6/336 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/223 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/223 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 79 (OVERLAPS) 12/235 variables, 8/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/235 variables, 8/354 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/235 variables, 4/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/235 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 83 (OVERLAPS) 10/245 variables, 6/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/245 variables, 6/370 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/245 variables, 2/372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/245 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 87 (OVERLAPS) 11/256 variables, 7/379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/256 variables, 7/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/256 variables, 3/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/256 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 91 (OVERLAPS) 11/267 variables, 7/396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/267 variables, 7/403 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/267 variables, 3/406 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/267 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 95 (OVERLAPS) 11/278 variables, 7/413 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/278 variables, 7/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/278 variables, 3/423 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/278 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 99 (OVERLAPS) 10/288 variables, 6/429 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/288 variables, 6/435 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/288 variables, 2/437 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/288 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 103 (OVERLAPS) 11/299 variables, 7/444 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/299 variables, 7/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/299 variables, 3/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/299 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 107 (OVERLAPS) 8/307 variables, 6/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/307 variables, 6/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/307 variables, 2/468 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/307 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 111 (OVERLAPS) 0/307 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 307/307 variables, and 468 constraints, problems are : Problem set: 0 solved, 2 unsolved in 581 ms.
Refiners :[Domain max(s): 193/193 constraints, Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
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) 1/8 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 8/16 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/16 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 22/38 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/38 variables, 12/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/38 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/38 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/38 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/38 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/40 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/40 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/40 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/40 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 23/63 variables, 15/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/63 variables, 15/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/63 variables, 7/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/63 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 18/81 variables, 12/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/81 variables, 12/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/81 variables, 4/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/81 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 10/91 variables, 6/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/91 variables, 6/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/91 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/91 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 11/102 variables, 7/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/102 variables, 7/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/102 variables, 3/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/102 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (OVERLAPS) 10/112 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/112 variables, 6/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/112 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/112 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (OVERLAPS) 11/123 variables, 7/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/123 variables, 7/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/123 variables, 3/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/123 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (OVERLAPS) 11/134 variables, 7/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/134 variables, 7/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/134 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/134 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (OVERLAPS) 11/145 variables, 7/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/145 variables, 7/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/145 variables, 3/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/145 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (OVERLAPS) 11/156 variables, 7/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/156 variables, 7/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/156 variables, 3/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/156 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (OVERLAPS) 11/167 variables, 7/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/167 variables, 7/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/167 variables, 3/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/167 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (OVERLAPS) 12/179 variables, 8/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/179 variables, 8/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/179 variables, 4/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/179 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 64 (OVERLAPS) 11/190 variables, 7/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/190 variables, 7/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/190 variables, 3/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/190 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 68 (OVERLAPS) 12/202 variables, 8/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/202 variables, 8/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/202 variables, 4/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/202 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 72 (OVERLAPS) 11/213 variables, 7/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/213 variables, 7/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/213 variables, 3/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/213 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 76 (OVERLAPS) 10/223 variables, 6/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/223 variables, 6/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/223 variables, 2/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/223 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 80 (OVERLAPS) 12/235 variables, 8/348 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/235 variables, 8/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/235 variables, 4/360 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/235 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 84 (OVERLAPS) 10/245 variables, 6/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/245 variables, 6/372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/245 variables, 2/374 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/245 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 88 (OVERLAPS) 11/256 variables, 7/381 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/256 variables, 7/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/256 variables, 3/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/256 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 92 (OVERLAPS) 11/267 variables, 7/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/267 variables, 7/405 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/267 variables, 3/408 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/267 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 96 (OVERLAPS) 11/278 variables, 7/415 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/278 variables, 7/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/278 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/278 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 100 (OVERLAPS) 10/288 variables, 6/431 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/288 variables, 6/437 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/288 variables, 2/439 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/288 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 104 (OVERLAPS) 11/299 variables, 7/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/299 variables, 7/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/299 variables, 3/456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/299 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 108 (OVERLAPS) 8/307 variables, 6/462 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/307 variables, 6/468 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/307 variables, 2/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/307 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 112 (OVERLAPS) 0/307 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 307/307 variables, and 470 constraints, problems are : Problem set: 0 solved, 2 unsolved in 480 ms.
Refiners :[Domain max(s): 193/193 constraints, Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1069ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 45 ms.
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 114/114 transitions.
Applied a total of 0 rules in 2 ms. Remains 193 /193 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 193/193 places, 114/114 transitions.
RANDOM walk for 40000 steps (48 resets) in 150 ms. (264 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1534051 steps, run timeout after 3001 ms. (steps per millisecond=511 ) properties seen :0 out of 1
Probabilistic random walk after 1534051 steps, saw 355908 distinct states, run finished after 3004 ms. (steps per millisecond=510 ) properties seen :0
[2024-05-26 10:37:27] [INFO ] Invariant cache hit.
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) 2/4 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/5 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/9 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/9 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/19 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/19 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/19 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/21 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/21 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/21 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/21 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 12/33 variables, 8/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/33 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/33 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/33 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 10/43 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/43 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/43 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/43 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 10/53 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/53 variables, 6/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/53 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/53 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 11/64 variables, 7/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/64 variables, 7/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/64 variables, 3/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/64 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 11/75 variables, 7/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/75 variables, 7/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/75 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/75 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 10/85 variables, 6/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/85 variables, 6/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/85 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/85 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 12/97 variables, 8/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/97 variables, 8/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/97 variables, 4/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/97 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 11/108 variables, 7/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/108 variables, 7/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/108 variables, 3/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/108 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 11/119 variables, 7/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/119 variables, 7/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/119 variables, 3/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/119 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 11/130 variables, 7/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/130 variables, 7/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/130 variables, 3/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/130 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 12/142 variables, 8/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/142 variables, 8/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/142 variables, 4/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/142 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 11/153 variables, 7/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/153 variables, 7/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/153 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/153 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 12/165 variables, 8/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/165 variables, 8/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/165 variables, 4/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/165 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (OVERLAPS) 11/176 variables, 7/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/176 variables, 7/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/176 variables, 3/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/176 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (OVERLAPS) 10/186 variables, 6/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/186 variables, 6/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/186 variables, 2/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/186 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (OVERLAPS) 11/197 variables, 7/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/197 variables, 7/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/197 variables, 3/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/197 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (OVERLAPS) 10/207 variables, 6/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/207 variables, 6/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/207 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/207 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (OVERLAPS) 11/218 variables, 7/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/218 variables, 7/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/218 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/218 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (OVERLAPS) 10/228 variables, 6/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/228 variables, 6/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/228 variables, 2/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/228 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (OVERLAPS) 11/239 variables, 7/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/239 variables, 7/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/239 variables, 3/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/239 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (OVERLAPS) 10/249 variables, 6/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/249 variables, 6/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/249 variables, 2/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/249 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (OVERLAPS) 11/260 variables, 7/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/260 variables, 7/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/260 variables, 3/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/260 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (OVERLAPS) 11/271 variables, 7/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/271 variables, 7/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/271 variables, 3/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/271 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (OVERLAPS) 10/281 variables, 6/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/281 variables, 6/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/281 variables, 2/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/281 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (OVERLAPS) 11/292 variables, 7/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/292 variables, 7/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/292 variables, 3/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/292 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (OVERLAPS) 11/303 variables, 7/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/303 variables, 7/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/303 variables, 3/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/303 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (OVERLAPS) 4/307 variables, 4/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/307 variables, 4/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/307 variables, 2/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/307 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (OVERLAPS) 0/307 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 307/307 variables, and 467 constraints, problems are : Problem set: 0 solved, 1 unsolved in 339 ms.
Refiners :[Domain max(s): 193/193 constraints, Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
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) 2/4 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/5 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/9 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/9 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/19 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/19 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/19 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/19 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/21 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/21 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/21 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/21 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/33 variables, 8/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/33 variables, 8/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/33 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/33 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 10/43 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/43 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/43 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/43 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 10/53 variables, 6/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/53 variables, 6/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/53 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/53 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 11/64 variables, 7/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/64 variables, 7/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/64 variables, 3/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/64 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 11/75 variables, 7/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/75 variables, 7/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/75 variables, 3/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/75 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 10/85 variables, 6/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/85 variables, 6/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/85 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/85 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 12/97 variables, 8/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/97 variables, 8/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/97 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/97 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 11/108 variables, 7/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/108 variables, 7/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/108 variables, 3/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/108 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 11/119 variables, 7/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/119 variables, 7/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/119 variables, 3/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/119 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 11/130 variables, 7/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/130 variables, 7/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/130 variables, 3/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/130 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (OVERLAPS) 12/142 variables, 8/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/142 variables, 8/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/142 variables, 4/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/142 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 11/153 variables, 7/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/153 variables, 7/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/153 variables, 3/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/153 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (OVERLAPS) 12/165 variables, 8/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/165 variables, 8/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/165 variables, 4/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/165 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (OVERLAPS) 11/176 variables, 7/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/176 variables, 7/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/176 variables, 3/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/176 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (OVERLAPS) 10/186 variables, 6/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/186 variables, 6/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/186 variables, 2/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/186 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (OVERLAPS) 11/197 variables, 7/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/197 variables, 7/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/197 variables, 3/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/197 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (OVERLAPS) 10/207 variables, 6/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/207 variables, 6/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/207 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/207 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (OVERLAPS) 11/218 variables, 7/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/218 variables, 7/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/218 variables, 3/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/218 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (OVERLAPS) 10/228 variables, 6/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/228 variables, 6/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/228 variables, 2/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/228 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (OVERLAPS) 11/239 variables, 7/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/239 variables, 7/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/239 variables, 3/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/239 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (OVERLAPS) 10/249 variables, 6/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/249 variables, 6/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/249 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/249 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (OVERLAPS) 11/260 variables, 7/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/260 variables, 7/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/260 variables, 3/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/260 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (OVERLAPS) 11/271 variables, 7/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/271 variables, 7/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/271 variables, 3/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/271 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (OVERLAPS) 10/281 variables, 6/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/281 variables, 6/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/281 variables, 2/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/281 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (OVERLAPS) 11/292 variables, 7/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/292 variables, 7/438 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/292 variables, 3/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/292 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (OVERLAPS) 11/303 variables, 7/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/303 variables, 7/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/303 variables, 3/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/303 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (OVERLAPS) 4/307 variables, 4/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/307 variables, 4/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/307 variables, 2/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/307 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 126 (OVERLAPS) 0/307 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 307/307 variables, and 468 constraints, problems are : Problem set: 0 solved, 1 unsolved in 298 ms.
Refiners :[Domain max(s): 193/193 constraints, Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 645ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 27 ms.
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 114/114 transitions.
Applied a total of 0 rules in 2 ms. Remains 193 /193 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 193/193 places, 114/114 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 114/114 transitions.
Applied a total of 0 rules in 2 ms. Remains 193 /193 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2024-05-26 10:37:28] [INFO ] Invariant cache hit.
[2024-05-26 10:37:28] [INFO ] Implicit Places using invariants in 112 ms returned [117, 124, 126, 128, 130, 132, 134, 136, 138, 141, 148, 154, 156, 158, 161, 165, 168, 174, 177, 182, 185, 187, 191]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 114 ms to find 23 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 170/193 places, 114/114 transitions.
Applied a total of 0 rules in 1 ms. Remains 170 /170 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 118 ms. Remains : 170/193 places, 114/114 transitions.
RANDOM walk for 40000 steps (48 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1693583 steps, run timeout after 3001 ms. (steps per millisecond=564 ) properties seen :0 out of 1
Probabilistic random walk after 1693583 steps, saw 388184 distinct states, run finished after 3001 ms. (steps per millisecond=564 ) properties seen :0
// Phase 1: matrix 114 rows 170 cols
[2024-05-26 10:37:31] [INFO ] Computed 58 invariants in 3 ms
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) 2/4 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/5 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/9 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/9 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/19 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/19 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/19 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/21 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/21 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/21 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/21 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 10/31 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/31 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/31 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/31 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 10/41 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/41 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/41 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/41 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 10/51 variables, 6/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/51 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/51 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/51 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 10/61 variables, 6/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/61 variables, 6/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/61 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/61 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 10/71 variables, 6/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/71 variables, 6/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/71 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/71 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 10/81 variables, 6/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/81 variables, 6/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/81 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/81 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 10/91 variables, 6/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/91 variables, 6/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/91 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/91 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 10/101 variables, 6/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/101 variables, 6/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/101 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/101 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 10/111 variables, 6/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/111 variables, 6/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/111 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/111 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 10/121 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/121 variables, 6/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/121 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/121 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 10/131 variables, 6/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/131 variables, 6/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/131 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/131 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 10/141 variables, 6/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/141 variables, 6/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/141 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/141 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 10/151 variables, 6/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/151 variables, 6/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/151 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/151 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (OVERLAPS) 10/161 variables, 6/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/161 variables, 6/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/161 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/161 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (OVERLAPS) 10/171 variables, 6/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/171 variables, 6/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/171 variables, 2/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/171 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (OVERLAPS) 10/181 variables, 6/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/181 variables, 6/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/181 variables, 2/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/181 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (OVERLAPS) 10/191 variables, 6/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/191 variables, 6/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/191 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/191 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (OVERLAPS) 10/201 variables, 6/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/201 variables, 6/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/201 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/201 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (OVERLAPS) 10/211 variables, 6/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/211 variables, 6/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/211 variables, 2/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/211 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (OVERLAPS) 10/221 variables, 6/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/221 variables, 6/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/221 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/221 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (OVERLAPS) 10/231 variables, 6/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/231 variables, 6/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/231 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/231 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (OVERLAPS) 10/241 variables, 6/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/241 variables, 6/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/241 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/241 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (OVERLAPS) 10/251 variables, 6/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/251 variables, 6/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/251 variables, 2/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/251 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (OVERLAPS) 10/261 variables, 6/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/261 variables, 6/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/261 variables, 2/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/261 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (OVERLAPS) 10/271 variables, 6/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/271 variables, 6/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/271 variables, 2/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/271 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (OVERLAPS) 10/281 variables, 6/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/281 variables, 6/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/281 variables, 2/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/281 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (OVERLAPS) 3/284 variables, 3/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/284 variables, 3/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/284 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/284 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (OVERLAPS) 0/284 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 284/284 variables, and 398 constraints, problems are : Problem set: 0 solved, 1 unsolved in 323 ms.
Refiners :[Domain max(s): 170/170 constraints, Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
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) 2/4 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/5 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/9 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/9 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/19 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/19 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/19 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/19 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/21 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/21 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/21 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/21 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 10/31 variables, 6/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/31 variables, 6/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/31 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/31 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 10/41 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/41 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/41 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/41 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 10/51 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/51 variables, 6/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/51 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/51 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 10/61 variables, 6/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/61 variables, 6/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/61 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/61 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 10/71 variables, 6/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/71 variables, 6/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/71 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/71 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 10/81 variables, 6/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/81 variables, 6/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/81 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/81 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 10/91 variables, 6/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/91 variables, 6/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/91 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/91 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 10/101 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/101 variables, 6/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/101 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/101 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 10/111 variables, 6/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/111 variables, 6/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/111 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/111 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 10/121 variables, 6/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/121 variables, 6/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/121 variables, 2/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/121 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (OVERLAPS) 10/131 variables, 6/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/131 variables, 6/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/131 variables, 2/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/131 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 10/141 variables, 6/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/141 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/141 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/141 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (OVERLAPS) 10/151 variables, 6/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/151 variables, 6/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/151 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/151 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (OVERLAPS) 10/161 variables, 6/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/161 variables, 6/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/161 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/161 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (OVERLAPS) 10/171 variables, 6/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/171 variables, 6/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/171 variables, 2/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/171 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (OVERLAPS) 10/181 variables, 6/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/181 variables, 6/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/181 variables, 2/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/181 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (OVERLAPS) 10/191 variables, 6/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/191 variables, 6/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/191 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/191 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (OVERLAPS) 10/201 variables, 6/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/201 variables, 6/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/201 variables, 2/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/201 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (OVERLAPS) 10/211 variables, 6/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/211 variables, 6/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/211 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/211 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (OVERLAPS) 10/221 variables, 6/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/221 variables, 6/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/221 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/221 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (OVERLAPS) 10/231 variables, 6/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/231 variables, 6/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/231 variables, 2/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/231 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (OVERLAPS) 10/241 variables, 6/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/241 variables, 6/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/241 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/241 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (OVERLAPS) 10/251 variables, 6/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/251 variables, 6/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/251 variables, 2/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/251 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (OVERLAPS) 10/261 variables, 6/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/261 variables, 6/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/261 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/261 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (OVERLAPS) 10/271 variables, 6/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/271 variables, 6/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/271 variables, 2/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/271 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (OVERLAPS) 10/281 variables, 6/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/281 variables, 6/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/281 variables, 2/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/281 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (OVERLAPS) 3/284 variables, 3/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/284 variables, 3/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/284 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/284 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 126 (OVERLAPS) 0/284 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 284/284 variables, and 399 constraints, problems are : Problem set: 0 solved, 1 unsolved in 356 ms.
Refiners :[Domain max(s): 170/170 constraints, Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 688ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 26 ms.
Support contains 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 114/114 transitions.
Applied a total of 0 rules in 2 ms. Remains 170 /170 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 170/170 places, 114/114 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 114/114 transitions.
Applied a total of 0 rules in 2 ms. Remains 170 /170 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2024-05-26 10:37:32] [INFO ] Invariant cache hit.
[2024-05-26 10:37:32] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-26 10:37:32] [INFO ] Invariant cache hit.
[2024-05-26 10:37:32] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
[2024-05-26 10:37:32] [INFO ] Redundant transitions in 3 ms returned []
Running 112 sub problems to find dead transitions.
[2024-05-26 10:37:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 170/170 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 58/228 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-26 10:37:32] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 10 ms to minimize.
[2024-05-26 10:37:32] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-26 10:37:33] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-05-26 10:37:33] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-26 10:37:33] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-26 10:37:33] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-26 10:37:33] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-26 10:37:33] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-26 10:37:33] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-26 10:37:33] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
[2024-05-26 10:37:33] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 4 ms to minimize.
[2024-05-26 10:37:33] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-26 10:37:33] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-26 10:37:33] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-26 10:37:33] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-26 10:37:33] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-26 10:37:33] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-26 10:37:33] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-26 10:37:33] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-26 10:37:34] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 20/248 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-26 10:37:34] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-05-26 10:37:34] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-26 10:37:34] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-26 10:37:34] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-26 10:37:34] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-26 10:37:34] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-26 10:37:34] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-26 10:37:34] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
[2024-05-26 10:37:34] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-26 10:37:34] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-26 10:37:34] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-26 10:37:34] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-26 10:37:34] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-26 10:37:34] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-26 10:37:34] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-26 10:37:34] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-26 10:37:34] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-26 10:37:35] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-26 10:37:35] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-26 10:37:35] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 20/268 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-26 10:37:35] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-26 10:37:35] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-26 10:37:35] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-26 10:37:35] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-26 10:37:35] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-26 10:37:35] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-26 10:37:36] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-26 10:37:36] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-26 10:37:36] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-26 10:37:36] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-26 10:37:36] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-26 10:37:36] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-26 10:37:36] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-26 10:37:36] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-26 10:37:36] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-26 10:37:36] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 16/284 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 114/284 variables, 170/454 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/284 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 0/284 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 284/284 variables, and 454 constraints, problems are : Problem set: 0 solved, 112 unsolved in 6226 ms.
Refiners :[Domain max(s): 170/170 constraints, Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 56/56 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 170/170 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 58/228 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 56/284 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 114/284 variables, 170/454 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 112/566 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (OVERLAPS) 0/284 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 284/284 variables, and 566 constraints, problems are : Problem set: 0 solved, 112 unsolved in 19465 ms.
Refiners :[Domain max(s): 170/170 constraints, Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 56/56 constraints]
After SMT, in 25713ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 25715ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25987 ms. Remains : 170/170 places, 114/114 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 169 transition count 114
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 169 transition count 112
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 167 transition count 112
Applied a total of 5 rules in 8 ms. Remains 167 /170 variables (removed 3) and now considering 112/114 (removed 2) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 112 rows 167 cols
[2024-05-26 10:37:58] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 10:37:58] [INFO ] [Real]Absence check using 57 positive place invariants in 9 ms returned sat
[2024-05-26 10:37:58] [INFO ] After 52ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-26 10:37:58] [INFO ] After 80ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-05-26 10:37:58] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 167 ms.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2024-05-26 10:37:58] [INFO ] Flatten gal took : 28 ms
[2024-05-26 10:37:58] [INFO ] Flatten gal took : 17 ms
[2024-05-26 10:37:58] [INFO ] Input system was already deterministic with 202 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 339/339 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 339 /339 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 339 cols
[2024-05-26 10:37:58] [INFO ] Computed 139 invariants in 1 ms
[2024-05-26 10:37:58] [INFO ] Implicit Places using invariants in 314 ms returned [208, 214, 217, 219, 224, 226, 232, 235, 238, 245, 247, 251, 253, 255, 257, 259, 269, 275, 277, 282, 289, 295, 298, 303, 306, 308, 312, 318, 323, 327, 332, 338]
Discarding 32 places :
Implicit Place search using SMT only with invariants took 319 ms to find 32 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 307/339 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 307 /307 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 323 ms. Remains : 307/339 places, 202/202 transitions.
[2024-05-26 10:37:58] [INFO ] Flatten gal took : 24 ms
[2024-05-26 10:37:58] [INFO ] Flatten gal took : 14 ms
[2024-05-26 10:37:58] [INFO ] Input system was already deterministic with 202 transitions.
[2024-05-26 10:37:58] [INFO ] Flatten gal took : 10 ms
[2024-05-26 10:37:58] [INFO ] Flatten gal took : 11 ms
[2024-05-26 10:37:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality5173250869397526272.gal : 7 ms
[2024-05-26 10:37:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality12755811969611742973.ctl : 16 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5173250869397526272.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12755811969611742973.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.46502e+31,0.49846,22348,2,817,5,89719,6,0,1433,108928,0


Converting to forward existential form...Done !
original formula: (EF(EX(((r_1_93==0)&&(r_1_62==1)))) * ((A((p_0_60==1) U EG(((p_0_82==1)||(r_0_7==1)))) + AG((AX(((r_1_57==0)||(p_1_51==0))) + EX(EX((r_1_...347
=> equivalent forward existential formula: ([(Init * !(E(TRUE U EX(((r_1_93==0)&&(r_1_62==1))))))] = FALSE * (([FwdG((Init * !((!((E(!(EG(((p_0_82==1)||(r_...1258
Reverse transition relation is NOT exact ! Due to transitions t100, t101, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/t...173
Detected timeout of ITS tools.
[2024-05-26 10:38:29] [INFO ] Flatten gal took : 11 ms
[2024-05-26 10:38:29] [INFO ] Applying decomposition
[2024-05-26 10:38:29] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1098953842041475470.txt' '-o' '/tmp/graph1098953842041475470.bin' '-w' '/tmp/graph1098953842041475470.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1098953842041475470.bin' '-l' '-1' '-v' '-w' '/tmp/graph1098953842041475470.weights' '-q' '0' '-e' '0.001'
[2024-05-26 10:38:29] [INFO ] Decomposing Gal with order
[2024-05-26 10:38:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 10:38:29] [INFO ] Flatten gal took : 46 ms
[2024-05-26 10:38:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-26 10:38:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality1787017758019569929.gal : 7 ms
[2024-05-26 10:38:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality17055704585349920197.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1787017758019569929.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17055704585349920197.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.46502e+31,0.315612,16680,139,11,34712,49,317,35503,21,74,0


Converting to forward existential form...Done !
original formula: (EF(EX(((i13.i0.i1.u105.r_1_93==0)&&(i8.i1.i0.u103.r_1_62==1)))) * ((A((i8.i0.i1.u60.p_0_60==1) U EG(((i11.u82.p_0_82==1)||(i1.i0.i1.u7.r...555
=> equivalent forward existential formula: ([(Init * !(E(TRUE U EX(((i13.i0.i1.u105.r_1_93==0)&&(i8.i1.i0.u103.r_1_62==1))))))] = FALSE * (([FwdG((Init * !...1830
Reverse transition relation is NOT exact ! Due to transitions i0.u0.t101, i13.i1.i1.u99.t100, Intersection with reachable at each step enabled. (destroyed...193
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 339/339 places, 202/202 transitions.
Applied a total of 0 rules in 6 ms. Remains 339 /339 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2024-05-26 10:38:59] [INFO ] Invariant cache hit.
[2024-05-26 10:38:59] [INFO ] Implicit Places using invariants in 199 ms returned [208, 214, 217, 219, 224, 226, 232, 235, 238, 245, 247, 249, 251, 253, 255, 257, 259, 269, 275, 277, 279, 282, 286, 298, 303, 306, 312, 323, 325, 327, 329, 332, 336, 338]
Discarding 34 places :
Implicit Place search using SMT only with invariants took 200 ms to find 34 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 305/339 places, 202/202 transitions.
Applied a total of 0 rules in 1 ms. Remains 305 /305 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 207 ms. Remains : 305/339 places, 202/202 transitions.
[2024-05-26 10:38:59] [INFO ] Flatten gal took : 14 ms
[2024-05-26 10:38:59] [INFO ] Flatten gal took : 9 ms
[2024-05-26 10:38:59] [INFO ] Input system was already deterministic with 202 transitions.
[2024-05-26 10:38:59] [INFO ] Flatten gal took : 9 ms
[2024-05-26 10:38:59] [INFO ] Flatten gal took : 9 ms
[2024-05-26 10:38:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality14978801716381999586.gal : 2 ms
[2024-05-26 10:38:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality28344199931379775.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14978801716381999586.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality28344199931379775.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.46502e+31,0.583911,22484,2,811,5,88587,6,0,1425,107794,0


Converting to forward existential form...Done !
original formula: AG((AX(EF(!(E((p_1_87==1) U ((r_1_44==0)||(r_1_86==1)))))) * EF((AF(((r_1_69==0)||(r_1_78==1))) * AX((((r_0_31==0)||(r_0_10==0))||(r_1_64...165
=> equivalent forward existential formula: ([(EY(FwdU(Init,TRUE)) * !(E(TRUE U !(E((p_1_87==1) U ((r_1_44==0)||(r_1_86==1)))))))] = FALSE * [(FwdU(Init,TRU...276
Reverse transition relation is NOT exact ! Due to transitions t100, t101, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/t...173
Detected timeout of ITS tools.
[2024-05-26 10:39:29] [INFO ] Flatten gal took : 11 ms
[2024-05-26 10:39:29] [INFO ] Applying decomposition
[2024-05-26 10:39:29] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13906075502099348394.txt' '-o' '/tmp/graph13906075502099348394.bin' '-w' '/tmp/graph13906075502099348394.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13906075502099348394.bin' '-l' '-1' '-v' '-w' '/tmp/graph13906075502099348394.weights' '-q' '0' '-e' '0.001'
[2024-05-26 10:39:29] [INFO ] Decomposing Gal with order
[2024-05-26 10:39:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 10:39:29] [INFO ] Flatten gal took : 13 ms
[2024-05-26 10:39:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-26 10:39:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality7035707538550973593.gal : 5 ms
[2024-05-26 10:39:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality8722871452481541152.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7035707538550973593.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8722871452481541152.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.46502e+31,0.374701,18804,168,11,40266,55,321,42674,21,78,0


Converting to forward existential form...Done !
original formula: AG((AX(EF(!(E((i11.u87.p_1_87==1) U ((i6.i0.i1.u100.r_1_44==0)||(i11.u104.r_1_86==1)))))) * EF((AF(((i9.i0.i0.u102.r_1_69==0)||(i10.u103....253
=> equivalent forward existential formula: ([(EY(FwdU(Init,TRUE)) * !(E(TRUE U !(E((i11.u87.p_1_87==1) U ((i6.i0.i1.u100.r_1_44==0)||(i11.u104.r_1_86==1)))...364
Reverse transition relation is NOT exact ! Due to transitions i0.u0.t101, i13.u99.t100, Intersection with reachable at each step enabled. (destroyed/rever...187
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 339/339 places, 202/202 transitions.
Applied a total of 0 rules in 8 ms. Remains 339 /339 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2024-05-26 10:39:59] [INFO ] Invariant cache hit.
[2024-05-26 10:39:59] [INFO ] Implicit Places using invariants in 215 ms returned [214, 217, 219, 224, 226, 232, 235, 238, 245, 247, 249, 251, 253, 255, 257, 259, 262, 269, 275, 277, 279, 282, 286, 289, 295, 298, 303, 306, 308, 312, 318, 323, 325, 327, 329, 332, 336, 338]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 215 ms to find 38 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 301/339 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 225 ms. Remains : 301/339 places, 202/202 transitions.
[2024-05-26 10:39:59] [INFO ] Flatten gal took : 8 ms
[2024-05-26 10:39:59] [INFO ] Flatten gal took : 7 ms
[2024-05-26 10:39:59] [INFO ] Input system was already deterministic with 202 transitions.
[2024-05-26 10:39:59] [INFO ] Flatten gal took : 7 ms
[2024-05-26 10:40:00] [INFO ] Flatten gal took : 7 ms
[2024-05-26 10:40:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality12711573086063176847.gal : 2 ms
[2024-05-26 10:40:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality16564494363073326962.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12711573086063176847.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16564494363073326962.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.46502e+31,0.563451,21692,2,799,5,86395,6,0,1409,105110,0


Converting to forward existential form...Done !
original formula: EG(AF(!(A(((((r_0_48==0)||(r_0_95==1))||((p_0_1==0)||(r_0_9==1))) * AX((r_1_7==1))) U EX(TRUE)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(!(!((E(!(EX(TRUE)) U (!(((((r_0_48==0)||(r_0_95==1))||((p_0_1==0)||(r_0_9==1))) * !(EX(!((r_1_...216
Reverse transition relation is NOT exact ! Due to transitions t100, t101, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/t...173
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-26 10:40:30] [INFO ] Flatten gal took : 10 ms
[2024-05-26 10:40:30] [INFO ] Applying decomposition
[2024-05-26 10:40:30] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4003821654860387012.txt' '-o' '/tmp/graph4003821654860387012.bin' '-w' '/tmp/graph4003821654860387012.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4003821654860387012.bin' '-l' '-1' '-v' '-w' '/tmp/graph4003821654860387012.weights' '-q' '0' '-e' '0.001'
[2024-05-26 10:40:30] [INFO ] Decomposing Gal with order
[2024-05-26 10:40:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 10:40:30] [INFO ] Flatten gal took : 13 ms
[2024-05-26 10:40:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-26 10:40:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality7448395934205781223.gal : 3 ms
[2024-05-26 10:40:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality11256188430438872979.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7448395934205781223.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11256188430438872979.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.46502e+31,0.319608,16596,115,11,34802,49,291,31972,21,72,0


Converting to forward existential form...Done !
original formula: EG(AF(!(A(((((i6.u48.r_0_48==0)||(i13.u95.r_0_95==1))||((i0.i0.i0.u1.p_0_1==0)||(i1.u9.r_0_9==1))) * AX((i0.i1.i1.u100.r_1_7==1))) U EX(T...163
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(!(!((E(!(EX(TRUE)) U (!(((((i6.u48.r_0_48==0)||(i13.u95.r_0_95==1))||((i0.i0.i0.u1.p_0_1==0)||...263
Reverse transition relation is NOT exact ! Due to transitions i0.i0.i0.u0.t101, i13.u99.t100, Intersection with reachable at each step enabled. (destroyed...193
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 339/339 places, 202/202 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 338 transition count 201
Applied a total of 2 rules in 19 ms. Remains 338 /339 variables (removed 1) and now considering 201/202 (removed 1) transitions.
// Phase 1: matrix 201 rows 338 cols
[2024-05-26 10:41:00] [INFO ] Computed 139 invariants in 1 ms
[2024-05-26 10:41:00] [INFO ] Implicit Places using invariants in 217 ms returned [207, 213, 216, 218, 223, 225, 231, 234, 237, 244, 246, 248, 250, 252, 254, 256, 258, 261, 268, 274, 276, 278, 281, 285, 288, 294, 297, 302, 305, 307, 311, 317, 322, 324, 326, 328, 331, 335, 337]
Discarding 39 places :
Implicit Place search using SMT only with invariants took 230 ms to find 39 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 299/339 places, 201/202 transitions.
Applied a total of 0 rules in 7 ms. Remains 299 /299 variables (removed 0) and now considering 201/201 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 256 ms. Remains : 299/339 places, 201/202 transitions.
[2024-05-26 10:41:00] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:41:00] [INFO ] Flatten gal took : 7 ms
[2024-05-26 10:41:00] [INFO ] Input system was already deterministic with 201 transitions.
[2024-05-26 10:41:00] [INFO ] Flatten gal took : 7 ms
[2024-05-26 10:41:00] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:41:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality8210433541598778336.gal : 1 ms
[2024-05-26 10:41:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality16610814190746928804.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8210433541598778336.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16610814190746928804.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.40164e+31,0.44756,21424,2,791,5,84661,6,0,1400,102974,0


Converting to forward existential form...Done !
original formula: AF((AG((p_1_83!=1)) + (AF(EG(((r_0_17==0)||(r_0_84==1)))) * AF(((r_0_99==1)||(p_1_77==1))))))
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !((p_1_83!=1)))) + (!(EG(!(EG(((r_0_17==0)||(r_0_84==1)))))) * !(EG(!(((r_0_99==1)||(p_...180
Reverse transition relation is NOT exact ! Due to transitions t100, t200, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/t...173
Detected timeout of ITS tools.
[2024-05-26 10:41:30] [INFO ] Flatten gal took : 12 ms
[2024-05-26 10:41:30] [INFO ] Applying decomposition
[2024-05-26 10:41:30] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1129015243059111361.txt' '-o' '/tmp/graph1129015243059111361.bin' '-w' '/tmp/graph1129015243059111361.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1129015243059111361.bin' '-l' '-1' '-v' '-w' '/tmp/graph1129015243059111361.weights' '-q' '0' '-e' '0.001'
[2024-05-26 10:41:30] [INFO ] Decomposing Gal with order
[2024-05-26 10:41:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 10:41:30] [INFO ] Flatten gal took : 12 ms
[2024-05-26 10:41:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-26 10:41:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality7395087655142869906.gal : 3 ms
[2024-05-26 10:41:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality4689770365557424786.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7395087655142869906.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4689770365557424786.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.40164e+31,0.345868,17604,114,13,36980,52,277,38038,20,72,0


Converting to forward existential form...Done !
original formula: AF((AG((i11.u82.p_1_83!=1)) + (AF(EG(((i1.u16.r_0_17==0)||(i11.u83.r_0_84==1)))) * AF(((i13.u98.r_0_99==1)||(i10.u76.p_1_77==1))))))
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !((i11.u82.p_1_83!=1)))) + (!(EG(!(EG(((i1.u16.r_0_17==0)||(i11.u83.r_0_84==1)))))) * !...219
Reverse transition relation is NOT exact ! Due to transitions i13.u98.t100, i14.t200, Intersection with reachable at each step enabled. (destroyed/reverse...185
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 339/339 places, 202/202 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 337 transition count 200
Applied a total of 4 rules in 13 ms. Remains 337 /339 variables (removed 2) and now considering 200/202 (removed 2) transitions.
// Phase 1: matrix 200 rows 337 cols
[2024-05-26 10:42:00] [INFO ] Computed 139 invariants in 1 ms
[2024-05-26 10:42:00] [INFO ] Implicit Places using invariants in 225 ms returned [206, 212, 215, 217, 222, 224, 230, 233, 236, 243, 245, 247, 249, 251, 253, 255, 257, 260, 267, 273, 275, 277, 280, 284, 287, 293, 296, 301, 304, 306, 310, 316, 321, 323, 325, 327, 330, 334, 336]
Discarding 39 places :
Implicit Place search using SMT only with invariants took 226 ms to find 39 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 298/339 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_CTL mode , in 2 iterations and 244 ms. Remains : 298/339 places, 200/202 transitions.
[2024-05-26 10:42:00] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:42:00] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:42:00] [INFO ] Input system was already deterministic with 200 transitions.
[2024-05-26 10:42:00] [INFO ] Flatten gal took : 7 ms
[2024-05-26 10:42:00] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:42:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality9546769263802898348.gal : 1 ms
[2024-05-26 10:42:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality8237235004255483580.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9546769263802898348.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8237235004255483580.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.33825e+31,0.434767,21136,2,786,5,84259,6,0,1395,102579,0


Converting to forward existential form...Done !
original formula: EF(AG((((p_1_32==0)&&(r_0_21==1))&&((p_0_97==0)&&(r_0_29==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((((p_1_32==0)&&(r_0_21==1))&&((p_0_97==0)&&(r_0_29==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t198, t199, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/t...173
(forward)formula 0,0,0.997945,32716,1,0,413,230412,422,203,9231,102579,410
FORMULA ResAllocation-PT-R100C002-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 339/339 places, 202/202 transitions.
Applied a total of 0 rules in 7 ms. Remains 339 /339 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 339 cols
[2024-05-26 10:42:01] [INFO ] Computed 139 invariants in 2 ms
[2024-05-26 10:42:02] [INFO ] Implicit Places using invariants in 203 ms returned [208, 214, 217, 219, 224, 226, 232, 235, 238, 245, 247, 249, 251, 253, 255, 259, 262, 269, 275, 277, 279, 282, 286, 289, 295, 298, 303, 308, 312, 318, 323, 325, 327, 329, 336, 338]
Discarding 36 places :
Implicit Place search using SMT only with invariants took 203 ms to find 36 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 303/339 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 303 /303 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 212 ms. Remains : 303/339 places, 202/202 transitions.
[2024-05-26 10:42:02] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:42:02] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:42:02] [INFO ] Input system was already deterministic with 202 transitions.
[2024-05-26 10:42:02] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:42:02] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:42:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality5025755568119187435.gal : 1 ms
[2024-05-26 10:42:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality6787315446723601282.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5025755568119187435.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6787315446723601282.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.46502e+31,0.57133,22212,2,805,5,87856,6,0,1417,106764,0


Converting to forward existential form...Done !
original formula: (EG((p_0_57==0)) * A(((r_1_77==0)||(r_0_70==1)) U (!(EX((((r_0_64==0)||(r_1_95==1)) * AX(((p_1_27==0)||(p_0_75==1)))))) * AF((r_1_41==0))...158
=> equivalent forward existential formula: [(((Init * EG((p_0_57==0))) * !(EG(!((!(EX((((r_0_64==0)||(r_1_95==1)) * !(EX(!(((p_1_27==0)||(p_0_75==1))))))))...447
Reverse transition relation is NOT exact ! Due to transitions t100, t101, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/t...173
Detected timeout of ITS tools.
[2024-05-26 10:42:32] [INFO ] Flatten gal took : 12 ms
[2024-05-26 10:42:32] [INFO ] Applying decomposition
[2024-05-26 10:42:32] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13369051560835425132.txt' '-o' '/tmp/graph13369051560835425132.bin' '-w' '/tmp/graph13369051560835425132.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13369051560835425132.bin' '-l' '-1' '-v' '-w' '/tmp/graph13369051560835425132.weights' '-q' '0' '-e' '0.001'
[2024-05-26 10:42:32] [INFO ] Decomposing Gal with order
[2024-05-26 10:42:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 10:42:32] [INFO ] Flatten gal took : 14 ms
[2024-05-26 10:42:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-26 10:42:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality4941397549357598288.gal : 3 ms
[2024-05-26 10:42:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality15307237915592188103.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4941397549357598288.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15307237915592188103.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.46502e+31,0.305709,16228,120,11,33899,53,278,31858,21,74,0


Converting to forward existential form...Done !
original formula: (EG((i7.u57.p_0_57==0)) * A(((i11.u101.r_1_77==0)||(i9.u70.r_0_70==1)) U (!(EX((((i8.u64.r_0_64==0)||(i14.u102.r_1_95==1)) * AX(((i4.i0.i...232
=> equivalent forward existential formula: [(((Init * EG((i7.u57.p_0_57==0))) * !(EG(!((!(EX((((i8.u64.r_0_64==0)||(i14.u102.r_1_95==1)) * !(EX(!(((i4.i0.i...623
Reverse transition relation is NOT exact ! Due to transitions i0.u0.t101, i14.u99.t100, Intersection with reachable at each step enabled. (destroyed/rever...187
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 339/339 places, 202/202 transitions.
Applied a total of 0 rules in 6 ms. Remains 339 /339 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2024-05-26 10:43:02] [INFO ] Invariant cache hit.
[2024-05-26 10:43:02] [INFO ] Implicit Places using invariants in 189 ms returned [208, 214, 217, 219, 224, 226, 232, 235, 238, 247, 249, 251, 253, 257, 259, 262, 269, 275, 277, 279, 282, 286, 289, 295, 298, 303, 306, 308, 312, 318, 323, 325, 327, 329, 332, 336, 338]
Discarding 37 places :
Implicit Place search using SMT only with invariants took 191 ms to find 37 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 302/339 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 302 /302 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 200 ms. Remains : 302/339 places, 202/202 transitions.
[2024-05-26 10:43:02] [INFO ] Flatten gal took : 5 ms
[2024-05-26 10:43:02] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:43:02] [INFO ] Input system was already deterministic with 202 transitions.
[2024-05-26 10:43:02] [INFO ] Flatten gal took : 5 ms
[2024-05-26 10:43:02] [INFO ] Flatten gal took : 5 ms
[2024-05-26 10:43:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality1244865530465283099.gal : 1 ms
[2024-05-26 10:43:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality3634576539021194204.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1244865530465283099.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3634576539021194204.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.46502e+31,0.481666,21948,2,802,5,86844,6,0,1413,105657,0


Converting to forward existential form...Done !
original formula: AG((EF(((((p_1_40==0)||(r_1_35==1))||((r_1_40==1)||(p_1_69==0)))||(p_0_1==1))) + EX(((r_0_12==0)&&(p_1_16==1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EX(((r_0_12==0)&&(p_1_16==1))))) * !(E(TRUE U ((((p_1_40==0)||(r_1_35==1))||((r_1_40==1)|...194
Reverse transition relation is NOT exact ! Due to transitions t100, t101, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/t...173
(forward)formula 0,0,1.13273,35456,1,0,428,247099,426,213,9550,105657,422
FORMULA ResAllocation-PT-R100C002-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 339/339 places, 202/202 transitions.
Applied a total of 0 rules in 5 ms. Remains 339 /339 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2024-05-26 10:43:03] [INFO ] Invariant cache hit.
[2024-05-26 10:43:04] [INFO ] Implicit Places using invariants in 208 ms returned [208, 214, 217, 219, 224, 226, 232, 235, 238, 245, 247, 249, 251, 253, 255, 257, 259, 262, 269, 277, 279, 282, 286, 289, 295, 303, 306, 308, 312, 318, 323, 325, 327, 329, 332, 336, 338]
Discarding 37 places :
Implicit Place search using SMT only with invariants took 208 ms to find 37 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 302/339 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 302 /302 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 216 ms. Remains : 302/339 places, 202/202 transitions.
[2024-05-26 10:43:04] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:43:04] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:43:04] [INFO ] Input system was already deterministic with 202 transitions.
[2024-05-26 10:43:04] [INFO ] Flatten gal took : 8 ms
[2024-05-26 10:43:04] [INFO ] Flatten gal took : 7 ms
[2024-05-26 10:43:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality11346510896058799772.gal : 2 ms
[2024-05-26 10:43:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality12254494633967713714.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11346510896058799772.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12254494633967713714.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.46502e+31,0.501805,22204,2,802,5,87241,6,0,1413,106065,0


Converting to forward existential form...Done !
original formula: E((AF((EG(!(((p_1_83==0)||(r_0_55==1)))) + (p_1_60==1))) * EG((r_0_72!=1))) U (AG(((((A(((r_1_55==0)||(r_1_71==1)) U (p_0_58==1)) * ((p_1...257
=> equivalent forward existential formula: [((FwdU(Init,(!(EG(!((EG(!(((p_1_83==0)||(r_0_55==1)))) + (p_1_60==1))))) * EG((r_0_72!=1)))) * ((p_0_40==0)||(r...372
Reverse transition relation is NOT exact ! Due to transitions t100, t101, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/t...173
Detected timeout of ITS tools.
[2024-05-26 10:43:34] [INFO ] Flatten gal took : 10 ms
[2024-05-26 10:43:34] [INFO ] Applying decomposition
[2024-05-26 10:43:34] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8538430693560562332.txt' '-o' '/tmp/graph8538430693560562332.bin' '-w' '/tmp/graph8538430693560562332.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8538430693560562332.bin' '-l' '-1' '-v' '-w' '/tmp/graph8538430693560562332.weights' '-q' '0' '-e' '0.001'
[2024-05-26 10:43:34] [INFO ] Decomposing Gal with order
[2024-05-26 10:43:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 10:43:34] [INFO ] Flatten gal took : 10 ms
[2024-05-26 10:43:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-26 10:43:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality18337128501336397070.gal : 3 ms
[2024-05-26 10:43:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality7031850668722518741.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality18337128501336397070.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7031850668722518741.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.46502e+31,0.39741,18248,120,11,38519,50,301,40056,21,72,0


Converting to forward existential form...Done !
original formula: E((AF((EG(!(((i11.i0.i1.u83.p_1_83==0)||(i7.u55.r_0_55==1)))) + (i8.u60.p_1_60==1))) * EG((i10.i0.i0.u72.r_0_72!=1))) U (AG(((((A(((i7.u1...407
=> equivalent forward existential formula: [((FwdU(Init,(!(EG(!((EG(!(((i11.i0.i1.u83.p_1_83==0)||(i7.u55.r_0_55==1)))) + (i8.u60.p_1_60==1))))) * EG((i10....536
Reverse transition relation is NOT exact ! Due to transitions i0.u0.t101, i13.u99.t100, Intersection with reachable at each step enabled. (destroyed/rever...187
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 339/339 places, 202/202 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 337 transition count 200
Applied a total of 4 rules in 7 ms. Remains 337 /339 variables (removed 2) and now considering 200/202 (removed 2) transitions.
// Phase 1: matrix 200 rows 337 cols
[2024-05-26 10:44:04] [INFO ] Computed 139 invariants in 1 ms
[2024-05-26 10:44:04] [INFO ] Implicit Places using invariants in 213 ms returned [206, 215, 217, 222, 224, 230, 233, 236, 243, 245, 247, 249, 251, 253, 255, 257, 260, 267, 273, 275, 277, 280, 284, 287, 293, 296, 301, 304, 306, 310, 316, 321, 323, 325, 327, 330, 334, 336]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 228 ms to find 38 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 299/339 places, 200/202 transitions.
Applied a total of 0 rules in 4 ms. Remains 299 /299 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 239 ms. Remains : 299/339 places, 200/202 transitions.
[2024-05-26 10:44:04] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:44:04] [INFO ] Flatten gal took : 5 ms
[2024-05-26 10:44:04] [INFO ] Input system was already deterministic with 200 transitions.
[2024-05-26 10:44:04] [INFO ] Flatten gal took : 5 ms
[2024-05-26 10:44:04] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:44:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality12469228677720892902.gal : 9 ms
[2024-05-26 10:44:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality10952443497810863093.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12469228677720892902.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10952443497810863093.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.33825e+31,0.462078,21132,2,789,5,84342,6,0,1399,102670,0


Converting to forward existential form...Done !
original formula: AF(AG((r_1_12==1)))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((r_1_12==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t198, t199, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/t...173
Detected timeout of ITS tools.
[2024-05-26 10:44:34] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:44:34] [INFO ] Applying decomposition
[2024-05-26 10:44:34] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1089213731671326643.txt' '-o' '/tmp/graph1089213731671326643.bin' '-w' '/tmp/graph1089213731671326643.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1089213731671326643.bin' '-l' '-1' '-v' '-w' '/tmp/graph1089213731671326643.weights' '-q' '0' '-e' '0.001'
[2024-05-26 10:44:34] [INFO ] Decomposing Gal with order
[2024-05-26 10:44:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 10:44:34] [INFO ] Flatten gal took : 10 ms
[2024-05-26 10:44:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-26 10:44:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality9935025630858332525.gal : 3 ms
[2024-05-26 10:44:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality17179166269485568045.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9935025630858332525.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17179166269485568045.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.33825e+31,0.255351,14092,116,11,29127,55,274,23956,18,71,0


Converting to forward existential form...Done !
original formula: AF(AG((i2.u99.r_1_12==1)))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((i2.u99.r_1_12==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions i0.t199, i15.i1.i2.t198, Intersection with reachable at each step enabled. (destroyed/revers...186
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 339/339 places, 202/202 transitions.
Applied a total of 0 rules in 7 ms. Remains 339 /339 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 339 cols
[2024-05-26 10:45:04] [INFO ] Computed 139 invariants in 2 ms
[2024-05-26 10:45:04] [INFO ] Implicit Places using invariants in 191 ms returned [208, 214, 217, 219, 224, 232, 235, 238, 245, 247, 249, 251, 253, 255, 257, 259, 262, 269, 275, 279, 282, 286, 289, 295, 298, 303, 306, 308, 312, 318, 323, 325, 327, 329, 332, 336, 338]
Discarding 37 places :
Implicit Place search using SMT only with invariants took 191 ms to find 37 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 302/339 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 302 /302 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 200 ms. Remains : 302/339 places, 202/202 transitions.
[2024-05-26 10:45:04] [INFO ] Flatten gal took : 5 ms
[2024-05-26 10:45:04] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:45:04] [INFO ] Input system was already deterministic with 202 transitions.
[2024-05-26 10:45:04] [INFO ] Flatten gal took : 5 ms
[2024-05-26 10:45:04] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:45:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality11639621750539322499.gal : 4 ms
[2024-05-26 10:45:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality4535445883456860240.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11639621750539322499.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4535445883456860240.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.46502e+31,0.497185,21920,2,802,5,86871,6,0,1413,105665,0


Converting to forward existential form...Done !
original formula: AG((EX(AF((r_0_81==0))) + ((E((r_1_20==1) U ((r_0_27==0)||(p_1_86==1))) * EG((r_1_56==0))) * (EG((p_1_58==1)) + (E((r_0_58==0) U (p_1_86=...208
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(((E((r_1_20==1) U ((r_0_27==0)||(p_1_86==1))) * EG((r_1_56==0))) * (EG((p_1_58==1)) + (E(...271
Reverse transition relation is NOT exact ! Due to transitions t100, t101, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/t...173
Detected timeout of ITS tools.
[2024-05-26 10:45:34] [INFO ] Flatten gal took : 12 ms
[2024-05-26 10:45:34] [INFO ] Applying decomposition
[2024-05-26 10:45:34] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12986352334873799091.txt' '-o' '/tmp/graph12986352334873799091.bin' '-w' '/tmp/graph12986352334873799091.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12986352334873799091.bin' '-l' '-1' '-v' '-w' '/tmp/graph12986352334873799091.weights' '-q' '0' '-e' '0.001'
[2024-05-26 10:45:34] [INFO ] Decomposing Gal with order
[2024-05-26 10:45:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 10:45:34] [INFO ] Flatten gal took : 9 ms
[2024-05-26 10:45:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-26 10:45:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality17924828781782707490.gal : 16 ms
[2024-05-26 10:45:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality14085332527647836901.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17924828781782707490.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14085332527647836901.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.46502e+31,0.319984,16272,120,11,34432,54,288,31521,21,75,0


Converting to forward existential form...Done !
original formula: AG((EX(AF((i12.u81.r_0_81==0))) + ((E((i3.u100.r_1_20==1) U ((i4.u27.r_0_27==0)||(i13.i0.i0.u86.p_1_86==1))) * EG((i7.u101.r_1_56==0))) *...303
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(((E((i3.u100.r_1_20==1) U ((i4.u27.r_0_27==0)||(i13.i0.i0.u86.p_1_86==1))) * EG((i7.u101....366
Reverse transition relation is NOT exact ! Due to transitions i0.u0.t101, i14.u99.t100, Intersection with reachable at each step enabled. (destroyed/rever...187
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 339/339 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 337 transition count 200
Applied a total of 4 rules in 13 ms. Remains 337 /339 variables (removed 2) and now considering 200/202 (removed 2) transitions.
// Phase 1: matrix 200 rows 337 cols
[2024-05-26 10:46:05] [INFO ] Computed 139 invariants in 2 ms
[2024-05-26 10:46:05] [INFO ] Implicit Places using invariants in 206 ms returned [206, 212, 215, 217, 222, 224, 230, 233, 236, 243, 245, 247, 249, 253, 255, 257, 260, 267, 273, 275, 277, 280, 284, 287, 293, 296, 301, 304, 306, 310, 316, 323, 325, 327, 330, 334, 336]
Discarding 37 places :
Implicit Place search using SMT only with invariants took 206 ms to find 37 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 300/339 places, 200/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 300 /300 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 222 ms. Remains : 300/339 places, 200/202 transitions.
[2024-05-26 10:46:05] [INFO ] Flatten gal took : 5 ms
[2024-05-26 10:46:05] [INFO ] Flatten gal took : 12 ms
[2024-05-26 10:46:05] [INFO ] Input system was already deterministic with 200 transitions.
[2024-05-26 10:46:05] [INFO ] Flatten gal took : 5 ms
[2024-05-26 10:46:05] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:46:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality17387035127658013656.gal : 1 ms
[2024-05-26 10:46:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality1412051476167171747.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17387035127658013656.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1412051476167171747.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.33825e+31,0.434804,21392,2,792,5,85071,6,0,1403,103601,0


Converting to forward existential form...Done !
original formula: EG((EG(((E(((p_1_8==0)||(r_0_67==1)) U ((r_0_88==0)||(p_0_55==1))) * (((r_1_90==0)||(p_1_8==1))||(r_1_39==1))) * (((p_1_93==0)||(r_0_77==...224
=> equivalent forward existential formula: [FwdG(Init,(EG(((E(((p_1_8==0)||(r_0_67==1)) U ((r_0_88==0)||(p_0_55==1))) * (((r_1_90==0)||(p_1_8==1))||(r_1_39...279
Reverse transition relation is NOT exact ! Due to transitions t198, t199, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/t...173
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-26 10:46:35] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:46:35] [INFO ] Applying decomposition
[2024-05-26 10:46:35] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16518831124317759361.txt' '-o' '/tmp/graph16518831124317759361.bin' '-w' '/tmp/graph16518831124317759361.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16518831124317759361.bin' '-l' '-1' '-v' '-w' '/tmp/graph16518831124317759361.weights' '-q' '0' '-e' '0.001'
[2024-05-26 10:46:35] [INFO ] Decomposing Gal with order
[2024-05-26 10:46:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 10:46:35] [INFO ] Flatten gal took : 9 ms
[2024-05-26 10:46:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-26 10:46:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality5027547365807215814.gal : 7 ms
[2024-05-26 10:46:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality10422908684900923317.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5027547365807215814.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10422908684900923317.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.33825e+31,0.330496,17580,149,13,37122,57,281,36225,18,74,0


Converting to forward existential form...Done !
original formula: EG((EG(((E(((i0.u7.p_1_8==0)||(i9.u66.r_0_67==1)) U ((i13.i0.i1.u87.r_0_88==0)||(i7.u54.p_0_55==1))) * (((i13.i1.i0.u101.r_1_90==0)||(i0....352
=> equivalent forward existential formula: [FwdG(Init,(EG(((E(((i0.u7.p_1_8==0)||(i9.u66.r_0_67==1)) U ((i13.i0.i1.u87.r_0_88==0)||(i7.u54.p_0_55==1))) * (...407
Reverse transition relation is NOT exact ! Due to transitions i14.t198, i15.t199, Intersection with reachable at each step enabled. (destroyed/reverse/int...181
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 339/339 places, 202/202 transitions.
Applied a total of 0 rules in 1 ms. Remains 339 /339 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 339 cols
[2024-05-26 10:47:05] [INFO ] Computed 139 invariants in 3 ms
[2024-05-26 10:47:05] [INFO ] Implicit Places using invariants in 191 ms returned [208, 214, 219, 224, 226, 238, 245, 247, 249, 253, 255, 257, 259, 262, 269, 275, 277, 279, 282, 286, 289, 295, 298, 306, 308, 312, 318, 323, 325, 327, 329, 332, 336, 338]
Discarding 34 places :
Implicit Place search using SMT only with invariants took 193 ms to find 34 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 305/339 places, 202/202 transitions.
Applied a total of 0 rules in 1 ms. Remains 305 /305 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 196 ms. Remains : 305/339 places, 202/202 transitions.
[2024-05-26 10:47:05] [INFO ] Flatten gal took : 5 ms
[2024-05-26 10:47:05] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:47:05] [INFO ] Input system was already deterministic with 202 transitions.
[2024-05-26 10:47:05] [INFO ] Flatten gal took : 5 ms
[2024-05-26 10:47:05] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:47:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality8802351548861636912.gal : 5 ms
[2024-05-26 10:47:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality15616578917299180669.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8802351548861636912.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15616578917299180669.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.46502e+31,0.505468,22212,2,811,5,87517,6,0,1425,106498,0


Converting to forward existential form...Done !
original formula: E(((EF((p_0_17==1)) * EX(TRUE)) * ((p_0_12==1) * (!(EG(((p_0_83==0)||(r_1_27==1)))) + (((r_1_25==0)&&((r_1_14==0)||(p_1_48==1)))&&((!((r_...245
=> equivalent forward existential formula: [(FwdU(Init,((E(TRUE U (p_0_17==1)) * EX(TRUE)) * ((p_0_12==1) * (!(EG(((p_0_83==0)||(r_1_27==1)))) + (((r_1_25=...303
Reverse transition relation is NOT exact ! Due to transitions t100, t101, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/t...173
Detected timeout of ITS tools.
[2024-05-26 10:47:35] [INFO ] Flatten gal took : 10 ms
[2024-05-26 10:47:35] [INFO ] Applying decomposition
[2024-05-26 10:47:35] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9445515554073500393.txt' '-o' '/tmp/graph9445515554073500393.bin' '-w' '/tmp/graph9445515554073500393.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9445515554073500393.bin' '-l' '-1' '-v' '-w' '/tmp/graph9445515554073500393.weights' '-q' '0' '-e' '0.001'
[2024-05-26 10:47:35] [INFO ] Decomposing Gal with order
[2024-05-26 10:47:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 10:47:35] [INFO ] Flatten gal took : 9 ms
[2024-05-26 10:47:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-26 10:47:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality9481492954706963296.gal : 3 ms
[2024-05-26 10:47:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality18420223737911047489.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9481492954706963296.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18420223737911047489.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.46502e+31,0.342718,18356,140,11,37857,56,293,41470,21,81,0


Converting to forward existential form...Done !
original formula: E(((EF((i2.u17.p_0_17==1)) * EX(TRUE)) * ((i2.u12.p_0_12==1) * (!(EG(((i11.u83.p_0_83==0)||(i3.u102.r_1_27==1)))) + (((i3.u101.r_1_25==0)...361
=> equivalent forward existential formula: [(FwdU(Init,((E(TRUE U (i2.u17.p_0_17==1)) * EX(TRUE)) * ((i2.u12.p_0_12==1) * (!(EG(((i11.u83.p_0_83==0)||(i3.u...419
Reverse transition relation is NOT exact ! Due to transitions i0.u0.t101, i12.u99.t100, Intersection with reachable at each step enabled. (destroyed/rever...187
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 339/339 places, 202/202 transitions.
Applied a total of 0 rules in 7 ms. Remains 339 /339 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2024-05-26 10:48:05] [INFO ] Invariant cache hit.
[2024-05-26 10:48:06] [INFO ] Implicit Places using invariants in 194 ms returned [214, 217, 224, 226, 232, 235, 247, 249, 251, 253, 255, 257, 259, 262, 275, 277, 279, 289, 295, 298, 303, 306, 308, 312, 318, 323, 325, 327, 329, 332, 336, 338]
Discarding 32 places :
Implicit Place search using SMT only with invariants took 195 ms to find 32 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 307/339 places, 202/202 transitions.
Applied a total of 0 rules in 1 ms. Remains 307 /307 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 204 ms. Remains : 307/339 places, 202/202 transitions.
[2024-05-26 10:48:06] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:48:06] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:48:06] [INFO ] Input system was already deterministic with 202 transitions.
[2024-05-26 10:48:06] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:48:06] [INFO ] Flatten gal took : 5 ms
[2024-05-26 10:48:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality10975416647793540810.gal : 2 ms
[2024-05-26 10:48:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality4933017734821163042.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10975416647793540810.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4933017734821163042.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.46502e+31,0.492036,22208,2,817,5,88069,6,0,1433,107128,0


Converting to forward existential form...Done !
original formula: ((EG(AF((r_1_7==0))) * EX((AF(((r_1_59==0)&&(r_1_62==1))) * !(A(((r_1_15==0)||(r_0_65==1)) U (r_0_32==0)))))) * (EF((((p_1_73==0)&&(p_1_3...265
=> equivalent forward existential formula: (([(Init * !(EG(!(EG(!((r_1_7==0)))))))] = FALSE * [(Init * !(EX((!(EG(!(((r_1_59==0)&&(r_1_62==1))))) * !(!((E(...457
Reverse transition relation is NOT exact ! Due to transitions t100, t101, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/t...173
Detected timeout of ITS tools.
[2024-05-26 10:48:36] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:48:36] [INFO ] Applying decomposition
[2024-05-26 10:48:36] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18103388313665948775.txt' '-o' '/tmp/graph18103388313665948775.bin' '-w' '/tmp/graph18103388313665948775.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18103388313665948775.bin' '-l' '-1' '-v' '-w' '/tmp/graph18103388313665948775.weights' '-q' '0' '-e' '0.001'
[2024-05-26 10:48:36] [INFO ] Decomposing Gal with order
[2024-05-26 10:48:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 10:48:36] [INFO ] Flatten gal took : 10 ms
[2024-05-26 10:48:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-26 10:48:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality7846175898353001251.gal : 2 ms
[2024-05-26 10:48:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality8213979579477023336.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7846175898353001251.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8213979579477023336.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.46502e+31,0.381912,19568,185,11,41364,61,314,46260,21,85,0


Converting to forward existential form...Done !
original formula: ((EG(AF((i1.u100.r_1_7==0))) * EX((AF(((i8.u105.r_1_59==0)&&(i9.i0.i0.u106.r_1_62==1))) * !(A(((i2.u101.r_1_15==0)||(i9.i0.i1.u65.r_0_65=...410
=> equivalent forward existential formula: (([(Init * !(EG(!(EG(!((i1.u100.r_1_7==0)))))))] = FALSE * [(Init * !(EX((!(EG(!(((i8.u105.r_1_59==0)&&(i9.i0.i0...628
Reverse transition relation is NOT exact ! Due to transitions i0.u0.t101, i13.u99.t100, Intersection with reachable at each step enabled. (destroyed/rever...187
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 339/339 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 339 /339 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2024-05-26 10:49:06] [INFO ] Invariant cache hit.
[2024-05-26 10:49:06] [INFO ] Implicit Places using invariants in 179 ms returned [208, 214, 217, 219, 224, 226, 232, 235, 238, 245, 249, 251, 253, 255, 257, 259, 262, 269, 275, 277, 279, 282, 286, 289, 295, 298, 303, 306, 308, 318, 323, 325, 329, 336, 338]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 179 ms to find 35 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 304/339 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.
Finished structural reductions in LTL mode , in 2 iterations and 184 ms. Remains : 304/339 places, 202/202 transitions.
[2024-05-26 10:49:06] [INFO ] Flatten gal took : 5 ms
[2024-05-26 10:49:06] [INFO ] Flatten gal took : 5 ms
[2024-05-26 10:49:06] [INFO ] Input system was already deterministic with 202 transitions.
[2024-05-26 10:49:06] [INFO ] Flatten gal took : 5 ms
[2024-05-26 10:49:06] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:49:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality18299002638589681672.gal : 2 ms
[2024-05-26 10:49:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality18408623290062508403.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality18299002638589681672.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18408623290062508403.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.46502e+31,0.491706,22448,2,808,5,88499,6,0,1421,107495,0


Converting to forward existential form...Done !
original formula: A((!(E(!((((p_1_31!=1)&&(r_1_81==1))&&(r_0_25==1))) U EX(A((r_0_87==1) U ((r_1_92==0)||(r_0_59==1)))))) * (p_0_76==1)) U A(E(((r_0_25==0)...265
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!(!(E(TRUE U !(!(((p_1_98==0)||(p_0_99==1))))))) U (!(E(((r_0_25==0) + (!(EX(!((r_1_95==1)...1084
Reverse transition relation is NOT exact ! Due to transitions t100, t101, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/t...173
Detected timeout of ITS tools.
[2024-05-26 10:49:36] [INFO ] Flatten gal took : 5 ms
[2024-05-26 10:49:36] [INFO ] Applying decomposition
[2024-05-26 10:49:36] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9522208105843635408.txt' '-o' '/tmp/graph9522208105843635408.bin' '-w' '/tmp/graph9522208105843635408.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9522208105843635408.bin' '-l' '-1' '-v' '-w' '/tmp/graph9522208105843635408.weights' '-q' '0' '-e' '0.001'
[2024-05-26 10:49:36] [INFO ] Decomposing Gal with order
[2024-05-26 10:49:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 10:49:36] [INFO ] Flatten gal took : 9 ms
[2024-05-26 10:49:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-26 10:49:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality14294019638260022534.gal : 3 ms
[2024-05-26 10:49:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality14467946355730881006.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14294019638260022534.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14467946355730881006.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.46502e+31,0.315371,16860,159,11,35574,57,322,35828,21,81,0


Converting to forward existential form...Done !
original formula: A((!(E(!((((i4.u31.p_1_31!=1)&&(i12.u101.r_1_81==1))&&(i3.i1.i0.u25.r_0_25==1))) U EX(A((i13.u87.r_0_87==1) U ((i14.i0.i0.u102.r_1_92==0)...428
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!(!(E(TRUE U !(!(((i14.i1.i1.u98.p_1_98==0)||(i14.i1.i1.u99.p_0_99==1))))))) U (!(E(((i3.i...1651
Reverse transition relation is NOT exact ! Due to transitions i0.u0.t101, i14.i1.i1.u99.t100, Intersection with reachable at each step enabled. (destroyed...193
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 339/339 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 339 /339 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2024-05-26 10:50:06] [INFO ] Invariant cache hit.
[2024-05-26 10:50:06] [INFO ] Implicit Places using invariants in 181 ms returned [208, 214, 217, 219, 226, 232, 235, 238, 245, 247, 249, 251, 253, 255, 257, 262, 269, 277, 279, 282, 286, 289, 295, 298, 303, 306, 308, 312, 318, 323, 325, 327, 329, 332, 336]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 182 ms to find 35 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 304/339 places, 202/202 transitions.
Applied a total of 0 rules in 1 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 186 ms. Remains : 304/339 places, 202/202 transitions.
[2024-05-26 10:50:06] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:50:06] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:50:06] [INFO ] Input system was already deterministic with 202 transitions.
[2024-05-26 10:50:06] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:50:06] [INFO ] Flatten gal took : 5 ms
[2024-05-26 10:50:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality17995434087936469212.gal : 3 ms
[2024-05-26 10:50:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality8491214678603009074.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17995434087936469212.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8491214678603009074.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.46502e+31,0.488737,22172,2,807,5,87856,6,0,1421,106585,0


Converting to forward existential form...Done !
original formula: ((AX((AG(((r_1_42!=0)&&(r_1_19!=1))) * (p_1_65==1))) + AG(AX(!(E(((r_1_99==0)||(p_0_85==1)) U (r_0_12==1)))))) + EF((((r_1_55==0)||(p_0_8...209
=> equivalent forward existential formula: [(FwdU(EY(FwdU(((Init * !(E(TRUE U (((r_1_55==0)||(p_0_84==1)) * !((E(!(((p_1_76==0)||(r_0_15==1))) U (!((p_0_9=...369
Reverse transition relation is NOT exact ! Due to transitions t100, t101, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/t...173
Detected timeout of ITS tools.
[2024-05-26 10:50:36] [INFO ] Flatten gal took : 11 ms
[2024-05-26 10:50:36] [INFO ] Applying decomposition
[2024-05-26 10:50:36] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1906847253148410382.txt' '-o' '/tmp/graph1906847253148410382.bin' '-w' '/tmp/graph1906847253148410382.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1906847253148410382.bin' '-l' '-1' '-v' '-w' '/tmp/graph1906847253148410382.weights' '-q' '0' '-e' '0.001'
[2024-05-26 10:50:36] [INFO ] Decomposing Gal with order
[2024-05-26 10:50:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 10:50:37] [INFO ] Flatten gal took : 9 ms
[2024-05-26 10:50:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-26 10:50:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality14510614781389318568.gal : 2 ms
[2024-05-26 10:50:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality7166797083564077373.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14510614781389318568.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7166797083564077373.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.46502e+31,0.314057,16496,127,11,34130,52,306,32655,20,73,0


Converting to forward existential form...Done !
original formula: ((AX((AG(((i5.u101.r_1_42!=0)&&(i2.u100.r_1_19!=1))) * (i9.i0.i0.u65.p_1_65==1))) + AG(AX(!(E(((i13.i1.i1.u103.r_1_99==0)||(i12.i0.i0.u85...335
=> equivalent forward existential formula: [(FwdU(EY(FwdU(((Init * !(E(TRUE U (((i7.u102.r_1_55==0)||(i12.i0.i0.u84.p_0_84==1)) * !((E(!(((i10.u76.p_1_76==...537
Reverse transition relation is NOT exact ! Due to transitions i0.i0.i0.u0.t101, i13.i1.i1.u99.t100, Intersection with reachable at each step enabled. (des...199
Detected timeout of ITS tools.
[2024-05-26 10:51:07] [INFO ] Flatten gal took : 6 ms
[2024-05-26 10:51:07] [INFO ] Flatten gal took : 7 ms
[2024-05-26 10:51:07] [INFO ] Applying decomposition
[2024-05-26 10:51:07] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3812937008217808704.txt' '-o' '/tmp/graph3812937008217808704.bin' '-w' '/tmp/graph3812937008217808704.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3812937008217808704.bin' '-l' '-1' '-v' '-w' '/tmp/graph3812937008217808704.weights' '-q' '0' '-e' '0.001'
[2024-05-26 10:51:07] [INFO ] Decomposing Gal with order
[2024-05-26 10:51:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 10:51:07] [INFO ] Flatten gal took : 11 ms
[2024-05-26 10:51:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2024-05-26 10:51:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality4509878477234618967.gal : 3 ms
[2024-05-26 10:51:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality13667055103624704871.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4509878477234618967.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13667055103624704871.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 13 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.46502e+31,0.479785,23920,673,11,51095,93,369,63648,20,128,0


Converting to forward existential form...Done !
original formula: (EF(EX(((i14.u135.r_1_93==0)&&(i10.i0.i1.u123.r_1_62==1)))) * ((A((i10.i0.i0.u60.p_0_60==1) U EG(((i13.u82.p_0_82==1)||(i1.u7.r_0_7==1)))...500
=> equivalent forward existential formula: ([(Init * !(E(TRUE U EX(((i14.u135.r_1_93==0)&&(i10.i0.i1.u123.r_1_62==1))))))] = FALSE * (([FwdG((Init * !((!((...1676
Reverse transition relation is NOT exact ! Due to transitions i0.u0.t101, i15.u99.t100, Intersection with reachable at each step enabled. (destroyed/rever...187
ITS-tools command line returned an error code 139
[2024-05-26 11:01:46] [INFO ] Applying decomposition
[2024-05-26 11:01:46] [INFO ] Flatten gal took : 9 ms
[2024-05-26 11:01:46] [INFO ] Decomposing Gal with order
[2024-05-26 11:01:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 11:01:46] [INFO ] Flatten gal took : 10 ms
[2024-05-26 11:01:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-26 11:01:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality3537916769352360759.gal : 2 ms
[2024-05-26 11:01:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality18179495670704630210.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3537916769352360759.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18179495670704630210.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 13 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.46502e+31,1.10075,57264,743,13,128507,370,694,150786,20,265,0


Converting to forward existential form...Done !
original formula: (EF(EX(((u194.r_1_93==0)&&(u163.r_1_62==1)))) * ((A((u40.p_0_60==1) U EG(((u18.p_0_82==1)||(u93.r_0_7==1)))) + AG((AX(((u158.r_1_57==0)||...427
=> equivalent forward existential formula: ([(Init * !(E(TRUE U EX(((u194.r_1_93==0)&&(u163.r_1_62==1))))))] = FALSE * (([FwdG((Init * !((!((E(!(EG(((u18.p...1480
Reverse transition relation is NOT exact ! Due to transitions u1.t100, u100.t101, Intersection with reachable at each step enabled. (destroyed/reverse/int...181
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-26 11:26:29] [INFO ] Flatten gal took : 9 ms
[2024-05-26 11:26:29] [INFO ] Input system was already deterministic with 202 transitions.
[2024-05-26 11:26:29] [INFO ] Transformed 339 places.
[2024-05-26 11:26:29] [INFO ] Transformed 202 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-26 11:26:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality11333309116069187548.gal : 1 ms
[2024-05-26 11:26:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality12711046098366884213.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11333309116069187548.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12711046098366884213.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...330
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 13 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.46502e+31,0.569175,27036,2,1240,5,107152,6,0,1561,135241,0


Converting to forward existential form...Done !
original formula: (EF(EX(((r_1_93==0)&&(r_1_62==1)))) * ((A((p_0_60==1) U EG(((p_0_82==1)||(r_0_7==1)))) + AG((AX(((r_1_57==0)||(p_1_51==0))) + EX(EX((r_1_...347
=> equivalent forward existential formula: ([(Init * !(E(TRUE U EX(((r_1_93==0)&&(r_1_62==1))))))] = FALSE * (([FwdG((Init * !((!((E(!(EG(((p_0_82==1)||(r_...1258
Reverse transition relation is NOT exact ! Due to transitions t100, t101, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/t...173
ITS-tools command line returned an error code 137
Total runtime 3485904 ms.

BK_STOP 1716723303237

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ResAllocation-PT-R100C002"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is ResAllocation-PT-R100C002, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r312-tall-171662339500881"
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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;