Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r184-tall-174889263700185.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is ResAllocation-PT-R100C002, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-tall-174889263700185
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 904K
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 9 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 422K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME ResAllocation-PT-R100C002-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
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-2025-00
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-2025-01
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-2025-02
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-2025-03
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-2025-04
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-2025-05
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-2025-06
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-2025-07
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-2025-08
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-2025-09
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-2025-10
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1748970578159

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 202505121319
[2025-06-03 17:09:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 17:09:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 17:09:39] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2025-06-03 17:09:39] [INFO ] Transformed 400 places.
[2025-06-03 17:09:39] [INFO ] Transformed 202 transitions.
[2025-06-03 17:09:39] [INFO ] Found NUPN structural information;
[2025-06-03 17:09:39] [INFO ] Parsed PT model containing 400 places and 202 transitions and 1000 arcs in 199 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Initial state reduction rules removed 1 formulas.
FORMULA ResAllocation-PT-R100C002-CTLCardinality-2025-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 99 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 46 ms. Remains 400 /400 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 400 cols
[2025-06-03 17:09:39] [INFO ] Computed 200 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:09:40] [INFO ] Implicit Places using invariants in 469 ms returned [203, 205, 209, 211, 213, 217, 219, 221, 223, 225, 227, 229, 233, 235, 237, 241, 245, 249, 251, 253, 255, 257, 261, 263, 265, 267, 275, 277, 279, 283, 287, 289, 291, 293, 297, 299, 303, 305, 307, 309, 313, 315, 317, 321, 323, 327, 329, 331, 333, 335, 337, 339, 341, 345, 347, 355, 357, 359, 361, 365, 369, 375, 377, 379, 381, 383, 387, 389, 393, 395, 397]
Discarding 71 places :
Implicit Place search using SMT only with invariants took 502 ms to find 71 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 329/400 places, 202/202 transitions.
Applied a total of 0 rules in 10 ms. Remains 329 /329 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 577 ms. Remains : 329/400 places, 202/202 transitions.
Support contains 99 out of 329 places after structural reductions.
[2025-06-03 17:09:40] [INFO ] Flatten gal took : 43 ms
[2025-06-03 17:09:40] [INFO ] Flatten gal took : 25 ms
[2025-06-03 17:09:40] [INFO ] Input system was already deterministic with 202 transitions.
Support contains 96 out of 329 places (down from 99) after GAL structural reductions.
RANDOM walk for 40000 steps (12 resets) in 1844 ms. (21 steps per ms) remains 18/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 18/18 properties
// Phase 1: matrix 202 rows 329 cols
[2025-06-03 17:09:41] [INFO ] Computed 129 invariants in 3 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 52/88 variables, 32/71 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 52/123 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 20/108 variables, 11/134 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 98/206 variables, 108/262 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:41] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (OVERLAPS) 140/346 variables, 94/357 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/346 variables, 94/451 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/346 variables, 34/485 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/346 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 16 (OVERLAPS) 81/427 variables, 57/542 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/427 variables, 57/599 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/427 variables, 21/620 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/427 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 20 (OVERLAPS) 33/460 variables, 25/645 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/460 variables, 25/670 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/460 variables, 11/681 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/460 variables, 0/681 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 24 (OVERLAPS) 15/475 variables, 9/690 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/475 variables, 9/699 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/475 variables, 3/702 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/475 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 28 (OVERLAPS) 15/490 variables, 9/711 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/490 variables, 9/720 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/490 variables, 3/723 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/490 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 32 (OVERLAPS) 17/507 variables, 11/734 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/507 variables, 11/745 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/507 variables, 5/750 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/507 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 36 (OVERLAPS) 8/515 variables, 6/756 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/515 variables, 6/762 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/515 variables, 2/764 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/515 variables, 0/764 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 40 (OVERLAPS) 5/520 variables, 3/767 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/520 variables, 3/770 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/520 variables, 1/771 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/520 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 44 (OVERLAPS) 5/525 variables, 3/774 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/525 variables, 3/777 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/525 variables, 1/778 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/525 variables, 0/778 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 48 (OVERLAPS) 6/531 variables, 4/782 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/531 variables, 4/786 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/531 variables, 2/788 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/531 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 52 (OVERLAPS) 0/531 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 531/531 variables, and 788 constraints, problems are : Problem set: 0 solved, 18 unsolved in 4638 ms.
Refiners :[Domain max(s): 329/329 constraints, Positive P Invariants (semi-flows): 129/129 constraints, State Equation: 329/329 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 52/88 variables, 32/71 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 52/123 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 20/108 variables, 11/135 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 20/155 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:46] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/108 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/108 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (OVERLAPS) 98/206 variables, 108/264 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/206 variables, 3/267 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/206 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (OVERLAPS) 140/346 variables, 94/361 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/346 variables, 94/455 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/346 variables, 34/489 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/346 variables, 15/504 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:46] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:46] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:46] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:46] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:46] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/346 variables, 5/509 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:46] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:47] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:47] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:47] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:47] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/346 variables, 5/514 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:47] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:47] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/346 variables, 2/516 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:47] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/346 variables, 1/517 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/346 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 23 (OVERLAPS) 81/427 variables, 57/574 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/427 variables, 57/631 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/427 variables, 21/652 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:48] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/427 variables, 1/653 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/427 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 28 (OVERLAPS) 33/460 variables, 25/678 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/460 variables, 25/703 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/460 variables, 11/714 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/460 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 32 (OVERLAPS) 15/475 variables, 9/723 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/475 variables, 9/732 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/475 variables, 3/735 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 475/531 variables, and 735 constraints, problems are : Problem set: 0 solved, 18 unsolved in 5025 ms.
Refiners :[Domain max(s): 293/329 constraints, Positive P Invariants (semi-flows): 115/129 constraints, State Equation: 293/329 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9716ms problems are : Problem set: 0 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 36 out of 329 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 329/329 places, 202/202 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 328 transition count 201
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 328 transition count 200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 327 transition count 200
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 327 transition count 199
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 324 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 2 with 2 rules applied. Total rules applied 10 place count 323 transition count 198
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 323 transition count 197
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 13 place count 321 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 3 with 2 rules applied. Total rules applied 15 place count 320 transition count 196
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 16 place count 320 transition count 195
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 18 place count 318 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 4 with 2 rules applied. Total rules applied 20 place count 317 transition count 194
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 21 place count 317 transition count 193
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 23 place count 315 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 5 with 2 rules applied. Total rules applied 25 place count 314 transition count 192
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 26 place count 314 transition count 191
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 29 place count 311 transition count 191
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 6 with 2 rules applied. Total rules applied 31 place count 310 transition count 190
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 32 place count 310 transition count 189
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 34 place count 308 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 7 with 2 rules applied. Total rules applied 36 place count 307 transition count 188
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 37 place count 307 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 39 place count 305 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 8 with 2 rules applied. Total rules applied 41 place count 304 transition count 186
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 42 place count 304 transition count 185
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 45 place count 301 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 9 with 2 rules applied. Total rules applied 47 place count 300 transition count 184
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 48 place count 300 transition count 183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 50 place count 298 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 10 with 2 rules applied. Total rules applied 52 place count 297 transition count 182
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 53 place count 297 transition count 181
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 55 place count 295 transition count 181
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 56 place count 295 transition count 180
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 57 place count 294 transition count 180
Applied a total of 57 rules in 206 ms. Remains 294 /329 variables (removed 35) and now considering 180/202 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 206 ms. Remains : 294/329 places, 180/202 transitions.
RANDOM walk for 40000 steps (18 resets) in 776 ms. (51 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
Interrupted probabilistic random walk after 392056 steps, run timeout after 3001 ms. (steps per millisecond=130 ) properties seen :9 out of 18
Probabilistic random walk after 392056 steps, saw 115223 distinct states, run finished after 3005 ms. (steps per millisecond=130 ) properties seen :9
// Phase 1: matrix 180 rows 294 cols
[2025-06-03 17:09:54] [INFO ] Computed 116 invariants in 2 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 31/50 variables, 18/38 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 31/69 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 8/58 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 8/82 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/58 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 62/120 variables, 58/140 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 127/247 variables, 83/223 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/247 variables, 83/306 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 31/337 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/247 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 2/249 variables, 2/339 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/249 variables, 2/341 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/249 variables, 2/343 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/249 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 88/337 variables, 58/401 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/337 variables, 58/459 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/337 variables, 22/481 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/337 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (OVERLAPS) 49/386 variables, 35/516 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/386 variables, 35/551 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/386 variables, 15/566 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/386 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 27 (OVERLAPS) 31/417 variables, 19/585 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/417 variables, 19/604 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/417 variables, 7/611 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/417 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 31 (OVERLAPS) 29/446 variables, 19/630 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/446 variables, 19/649 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/446 variables, 7/656 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:55] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:55] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/446 variables, 2/658 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/446 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 36 (OVERLAPS) 21/467 variables, 13/671 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/467 variables, 13/684 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/467 variables, 5/689 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/467 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 40 (OVERLAPS) 7/474 variables, 7/696 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/474 variables, 7/703 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/474 variables, 3/706 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/474 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 44 (OVERLAPS) 0/474 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 474/474 variables, and 706 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1365 ms.
Refiners :[Domain max(s): 294/294 constraints, Positive P Invariants (semi-flows): 116/116 constraints, State Equation: 294/294 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 31/50 variables, 18/38 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 31/69 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 8/58 variables, 5/75 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/58 variables, 8/83 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/58 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 62/120 variables, 58/141 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/120 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/120 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 127/247 variables, 83/225 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/247 variables, 83/308 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/247 variables, 31/339 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/247 variables, 8/347 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/247 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:56] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/247 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/247 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/247 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (OVERLAPS) 2/249 variables, 2/352 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/249 variables, 2/354 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/249 variables, 2/356 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/249 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (OVERLAPS) 88/337 variables, 58/414 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/337 variables, 58/472 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/337 variables, 22/494 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:56] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:56] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/337 variables, 2/496 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:09:56] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/337 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/337 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 31 (OVERLAPS) 49/386 variables, 35/532 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/386 variables, 35/567 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/386 variables, 15/582 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/386 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 35 (OVERLAPS) 31/417 variables, 19/601 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/417 variables, 19/620 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/417 variables, 7/627 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/417 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 39 (OVERLAPS) 29/446 variables, 19/646 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/446 variables, 19/665 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/446 variables, 7/672 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/446 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 43 (OVERLAPS) 21/467 variables, 13/685 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/467 variables, 13/698 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/467 variables, 5/703 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/467 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 47 (OVERLAPS) 7/474 variables, 7/710 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/474 variables, 7/717 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/474 variables, 3/720 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/474 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 51 (OVERLAPS) 0/474 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 474/474 variables, and 720 constraints, problems are : Problem set: 0 solved, 9 unsolved in 4762 ms.
Refiners :[Domain max(s): 294/294 constraints, Positive P Invariants (semi-flows): 116/116 constraints, State Equation: 294/294 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6149ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 5 properties in 10976 ms.
Support contains 10 out of 294 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 294/294 places, 180/180 transitions.
Applied a total of 0 rules in 14 ms. Remains 294 /294 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 294/294 places, 180/180 transitions.
RANDOM walk for 40000 steps (18 resets) in 301 ms. (132 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 242 ms. (164 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 150 ms. (264 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 596766 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :0 out of 4
Probabilistic random walk after 596766 steps, saw 165975 distinct states, run finished after 3001 ms. (steps per millisecond=198 ) properties seen :0
[2025-06-03 17:10:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 15/25 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:15] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 8/33 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/33 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 34/67 variables, 33/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/67 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 81/148 variables, 49/131 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/148 variables, 49/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/148 variables, 17/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:15] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/148 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/148 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 2/150 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/150 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/150 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/150 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 73/223 variables, 45/249 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/223 variables, 45/294 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/223 variables, 17/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/223 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 73/296 variables, 47/358 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/296 variables, 47/405 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/296 variables, 19/424 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/296 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 58/354 variables, 38/462 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/354 variables, 38/500 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/354 variables, 16/516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/354 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (OVERLAPS) 49/403 variables, 31/547 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/403 variables, 31/578 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/403 variables, 11/589 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/403 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (OVERLAPS) 41/444 variables, 25/614 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/444 variables, 25/639 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/444 variables, 9/648 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/444 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (OVERLAPS) 26/470 variables, 20/668 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/470 variables, 20/688 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/470 variables, 8/696 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/470 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (OVERLAPS) 4/474 variables, 4/700 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/474 variables, 4/704 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/474 variables, 2/706 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/474 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (OVERLAPS) 0/474 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 474/474 variables, and 706 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1100 ms.
Refiners :[Domain max(s): 294/294 constraints, Positive P Invariants (semi-flows): 116/116 constraints, State Equation: 294/294 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 15/25 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 8/33 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/33 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 34/67 variables, 33/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/67 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 81/148 variables, 49/131 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/148 variables, 49/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/148 variables, 17/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/148 variables, 4/201 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/148 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/148 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 2/150 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/150 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/150 variables, 2/208 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/150 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 73/223 variables, 45/253 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/223 variables, 45/298 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/223 variables, 17/315 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/223 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 73/296 variables, 47/362 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/296 variables, 47/409 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/296 variables, 19/428 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/296 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 58/354 variables, 38/466 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/354 variables, 38/504 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/354 variables, 16/520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/354 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (OVERLAPS) 49/403 variables, 31/551 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/403 variables, 31/582 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/403 variables, 11/593 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/403 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (OVERLAPS) 41/444 variables, 25/618 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/444 variables, 25/643 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/444 variables, 9/652 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/444 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (OVERLAPS) 26/470 variables, 20/672 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/470 variables, 20/692 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/470 variables, 8/700 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/470 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (OVERLAPS) 4/474 variables, 4/704 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/474 variables, 4/708 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/474 variables, 2/710 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:17] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
At refinement iteration 48 (INCLUDED_ONLY) 0/474 variables, 1/711 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:17] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:17] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
At refinement iteration 49 (INCLUDED_ONLY) 0/474 variables, 2/713 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/474 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:18] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 2 ms to minimize.
At refinement iteration 51 (OVERLAPS) 0/474 variables, 1/714 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/474 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (OVERLAPS) 0/474 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 474/474 variables, and 714 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2847 ms.
Refiners :[Domain max(s): 294/294 constraints, Positive P Invariants (semi-flows): 116/116 constraints, State Equation: 294/294 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3981ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 1 properties in 2262 ms.
Support contains 8 out of 294 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 294/294 places, 180/180 transitions.
Applied a total of 0 rules in 6 ms. Remains 294 /294 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 294/294 places, 180/180 transitions.
RANDOM walk for 40000 steps (17 resets) in 252 ms. (158 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 119 ms. (333 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 716973 steps, run timeout after 3001 ms. (steps per millisecond=238 ) properties seen :0 out of 3
Probabilistic random walk after 716973 steps, saw 190050 distinct states, run finished after 3002 ms. (steps per millisecond=238 ) properties seen :0
[2025-06-03 17:10:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 11/19 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:24] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 8/27 variables, 5/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/27 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 26/53 variables, 27/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/53 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 59/112 variables, 35/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/112 variables, 35/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/112 variables, 11/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:24] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:24] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/112 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/112 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 2/114 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/114 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/114 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/114 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 52/166 variables, 32/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/166 variables, 32/221 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/166 variables, 12/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/166 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 52/218 variables, 34/267 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/218 variables, 34/301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/218 variables, 14/315 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/218 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 36/254 variables, 24/339 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/254 variables, 24/363 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/254 variables, 10/373 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/254 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 31/285 variables, 19/392 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/285 variables, 19/411 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/285 variables, 7/418 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/285 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (OVERLAPS) 31/316 variables, 19/437 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/316 variables, 19/456 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/316 variables, 7/463 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/316 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (OVERLAPS) 30/346 variables, 20/483 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/346 variables, 20/503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/346 variables, 8/511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/346 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (OVERLAPS) 21/367 variables, 13/524 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/367 variables, 13/537 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/367 variables, 5/542 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/367 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (OVERLAPS) 20/387 variables, 12/554 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/387 variables, 12/566 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/387 variables, 4/570 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/387 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (OVERLAPS) 21/408 variables, 13/583 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/408 variables, 13/596 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/408 variables, 5/601 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/408 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (OVERLAPS) 21/429 variables, 13/614 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/429 variables, 13/627 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/429 variables, 5/632 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/429 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (OVERLAPS) 23/452 variables, 15/647 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/452 variables, 15/662 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/452 variables, 7/669 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/452 variables, 0/669 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 64 (OVERLAPS) 19/471 variables, 13/682 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/471 variables, 13/695 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/471 variables, 5/700 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/471 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 68 (OVERLAPS) 3/474 variables, 3/703 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/474 variables, 3/706 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/474 variables, 1/707 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/474 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 72 (OVERLAPS) 0/474 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 474/474 variables, and 707 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1310 ms.
Refiners :[Domain max(s): 294/294 constraints, Positive P Invariants (semi-flows): 116/116 constraints, State Equation: 294/294 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 11/19 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 8/27 variables, 5/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/27 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 26/53 variables, 27/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/53 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 59/112 variables, 35/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/112 variables, 35/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/112 variables, 11/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/112 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/112 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/112 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/114 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/114 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/114 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/114 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 52/166 variables, 32/192 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/166 variables, 32/224 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/166 variables, 12/236 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/166 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 52/218 variables, 34/270 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/218 variables, 34/304 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/218 variables, 14/318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/218 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 36/254 variables, 24/342 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/254 variables, 24/366 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/254 variables, 10/376 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/254 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (OVERLAPS) 31/285 variables, 19/395 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/285 variables, 19/414 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/285 variables, 7/421 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/285 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (OVERLAPS) 31/316 variables, 19/440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/316 variables, 19/459 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/316 variables, 7/466 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/316 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (OVERLAPS) 30/346 variables, 20/486 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/346 variables, 20/506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/346 variables, 8/514 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/346 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (OVERLAPS) 21/367 variables, 13/527 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/367 variables, 13/540 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/367 variables, 5/545 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/367 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (OVERLAPS) 20/387 variables, 12/557 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/387 variables, 12/569 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/387 variables, 4/573 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/387 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (OVERLAPS) 21/408 variables, 13/586 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/408 variables, 13/599 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/408 variables, 5/604 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/408 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (OVERLAPS) 21/429 variables, 13/617 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/429 variables, 13/630 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/429 variables, 5/635 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/429 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (OVERLAPS) 23/452 variables, 15/650 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/452 variables, 15/665 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/452 variables, 7/672 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/452 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 65 (OVERLAPS) 19/471 variables, 13/685 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/471 variables, 13/698 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/471 variables, 5/703 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/471 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 69 (OVERLAPS) 3/474 variables, 3/706 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/474 variables, 3/709 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/474 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/474 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:28] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:28] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 2 ms to minimize.
At refinement iteration 73 (OVERLAPS) 0/474 variables, 2/712 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/474 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:29] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 75 (OVERLAPS) 0/474 variables, 1/713 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/474 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 77 (OVERLAPS) 0/474 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 474/474 variables, and 713 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4773 ms.
Refiners :[Domain max(s): 294/294 constraints, Positive P Invariants (semi-flows): 116/116 constraints, State Equation: 294/294 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6096ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 923 ms.
Support contains 8 out of 294 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 294/294 places, 180/180 transitions.
Applied a total of 0 rules in 10 ms. Remains 294 /294 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 294/294 places, 180/180 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 294/294 places, 180/180 transitions.
Applied a total of 0 rules in 4 ms. Remains 294 /294 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2025-06-03 17:10:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:10:31] [INFO ] Implicit Places using invariants in 169 ms returned [189, 198, 203, 206, 209, 216, 222, 224, 226, 231, 234, 244, 250, 255, 259, 269, 275, 277, 283, 286, 289, 291]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 170 ms to find 22 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 272/294 places, 180/180 transitions.
Applied a total of 0 rules in 4 ms. Remains 272 /272 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 179 ms. Remains : 272/294 places, 180/180 transitions.
RANDOM walk for 40000 steps (19 resets) in 245 ms. (162 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 92 ms. (430 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 86 ms. (459 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 701593 steps, run timeout after 3001 ms. (steps per millisecond=233 ) properties seen :0 out of 3
Probabilistic random walk after 701593 steps, saw 186967 distinct states, run finished after 3001 ms. (steps per millisecond=233 ) properties seen :0
// Phase 1: matrix 180 rows 272 cols
[2025-06-03 17:10:34] [INFO ] Computed 94 invariants in 4 ms
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 11/19 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:34] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 7/26 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/26 variables, 7/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/26 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 26/52 variables, 26/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/52 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 58/110 variables, 34/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/110 variables, 34/133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/110 variables, 10/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:35] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/110 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/110 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 2/112 variables, 2/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/112 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/112 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/112 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 50/162 variables, 30/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/162 variables, 30/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/162 variables, 10/220 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/162 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 48/210 variables, 30/250 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/210 variables, 30/280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/210 variables, 10/290 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/210 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 33/243 variables, 21/311 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/243 variables, 21/332 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/243 variables, 7/339 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/243 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 30/273 variables, 18/357 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/273 variables, 18/375 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/273 variables, 6/381 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/273 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (OVERLAPS) 30/303 variables, 18/399 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/303 variables, 18/417 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/303 variables, 6/423 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/303 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (OVERLAPS) 28/331 variables, 18/441 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/331 variables, 18/459 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/331 variables, 6/465 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/331 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (OVERLAPS) 20/351 variables, 12/477 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/351 variables, 12/489 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/351 variables, 4/493 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/351 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (OVERLAPS) 20/371 variables, 12/505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/371 variables, 12/517 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/371 variables, 4/521 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/371 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (OVERLAPS) 20/391 variables, 12/533 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/391 variables, 12/545 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/391 variables, 4/549 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/391 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (OVERLAPS) 20/411 variables, 12/561 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/411 variables, 12/573 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/411 variables, 4/577 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/411 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (OVERLAPS) 20/431 variables, 12/589 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/431 variables, 12/601 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/431 variables, 4/605 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/431 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 64 (OVERLAPS) 18/449 variables, 12/617 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/449 variables, 12/629 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/449 variables, 4/633 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/449 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 68 (OVERLAPS) 3/452 variables, 3/636 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/452 variables, 3/639 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/452 variables, 1/640 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/452 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 72 (OVERLAPS) 0/452 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 452/452 variables, and 640 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1176 ms.
Refiners :[Domain max(s): 272/272 constraints, Positive P Invariants (semi-flows): 94/94 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 11/19 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 7/26 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/26 variables, 7/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/26 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 26/52 variables, 26/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/52 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 58/110 variables, 34/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/110 variables, 34/133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/110 variables, 10/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/110 variables, 3/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/110 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/110 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/112 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/112 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/112 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/112 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 50/162 variables, 30/183 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/162 variables, 30/213 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/162 variables, 10/223 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/162 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 48/210 variables, 30/253 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/210 variables, 30/283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/210 variables, 10/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/210 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 33/243 variables, 21/314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/243 variables, 21/335 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/243 variables, 7/342 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/243 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (OVERLAPS) 30/273 variables, 18/360 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/273 variables, 18/378 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/273 variables, 6/384 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/273 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (OVERLAPS) 30/303 variables, 18/402 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/303 variables, 18/420 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/303 variables, 6/426 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/303 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (OVERLAPS) 28/331 variables, 18/444 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/331 variables, 18/462 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/331 variables, 6/468 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/331 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (OVERLAPS) 20/351 variables, 12/480 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/351 variables, 12/492 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/351 variables, 4/496 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/351 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (OVERLAPS) 20/371 variables, 12/508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/371 variables, 12/520 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/371 variables, 4/524 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/371 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (OVERLAPS) 20/391 variables, 12/536 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/391 variables, 12/548 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/391 variables, 4/552 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/391 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (OVERLAPS) 20/411 variables, 12/564 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/411 variables, 12/576 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/411 variables, 4/580 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/411 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (OVERLAPS) 20/431 variables, 12/592 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/431 variables, 12/604 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/431 variables, 4/608 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/431 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 65 (OVERLAPS) 18/449 variables, 12/620 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/449 variables, 12/632 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/449 variables, 4/636 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/449 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 69 (OVERLAPS) 3/452 variables, 3/639 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/452 variables, 3/642 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/452 variables, 1/643 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/452 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 73 (OVERLAPS) 0/452 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 452/452 variables, and 643 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2361 ms.
Refiners :[Domain max(s): 272/272 constraints, Positive P Invariants (semi-flows): 94/94 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3549ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 926 ms.
Support contains 8 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 180/180 transitions.
Applied a total of 0 rules in 5 ms. Remains 272 /272 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 272/272 places, 180/180 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 180/180 transitions.
Applied a total of 0 rules in 4 ms. Remains 272 /272 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2025-06-03 17:10:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:10:39] [INFO ] Implicit Places using invariants in 160 ms returned []
[2025-06-03 17:10:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:10:39] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 17:10:39] [INFO ] Redundant transitions in 9 ms returned []
Running 178 sub problems to find dead transitions.
[2025-06-03 17:10:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 272/272 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 94/366 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:40] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:41] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:41] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:41] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:41] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:41] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:41] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:41] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:42] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:42] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:42] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:42] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:42] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:42] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:42] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:42] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:42] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:42] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:42] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:42] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 20/386 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:43] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:43] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:43] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:43] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:43] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:44] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:44] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:44] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:44] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:44] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:44] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:44] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:44] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:44] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:44] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:44] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:44] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:44] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:44] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:45] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 20/406 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:46] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:46] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:46] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:46] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:46] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:46] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:47] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:47] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:47] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:47] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:47] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:47] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:47] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:47] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:47] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:47] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:47] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:47] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:47] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:47] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 20/426 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:48] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:48] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:49] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:49] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:49] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:49] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:49] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:49] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:49] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:49] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:49] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:49] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:49] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:49] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:49] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:49] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:49] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:50] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:50] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:50] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 20/446 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:51] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:51] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:51] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:51] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:51] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:51] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:51] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:51] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:10:51] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 9/455 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (OVERLAPS) 180/452 variables, 272/727 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/452 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 10 (OVERLAPS) 0/452 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 452/452 variables, and 727 constraints, problems are : Problem set: 0 solved, 178 unsolved in 23241 ms.
Refiners :[Domain max(s): 272/272 constraints, Positive P Invariants (semi-flows): 94/94 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 89/89 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 272/272 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 94/366 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 89/455 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 180/452 variables, 272/727 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/452 variables, 178/905 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 452/452 variables, and 905 constraints, problems are : Problem set: 0 solved, 178 unsolved in 30026 ms.
Refiners :[Domain max(s): 272/272 constraints, Positive P Invariants (semi-flows): 94/94 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 89/89 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53291ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 53292ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53877 ms. Remains : 272/272 places, 180/180 transitions.
[2025-06-03 17:11:33] [INFO ] Flatten gal took : 19 ms
[2025-06-03 17:11:33] [INFO ] Flatten gal took : 16 ms
[2025-06-03 17:11:33] [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 : 329/329 places, 202/202 transitions.
Applied a total of 0 rules in 1 ms. Remains 329 /329 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 329 cols
[2025-06-03 17:11:33] [INFO ] Computed 129 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:11:33] [INFO ] Implicit Places using invariants in 215 ms returned [201, 205, 210, 219, 224, 227, 230, 237, 243, 245, 247, 252, 255, 261, 265, 271, 276, 280, 290, 294, 296, 298, 304, 307, 310, 312, 319, 323, 328]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 217 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 300/329 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 300 /300 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 235 ms. Remains : 300/329 places, 202/202 transitions.
[2025-06-03 17:11:33] [INFO ] Flatten gal took : 12 ms
[2025-06-03 17:11:33] [INFO ] Flatten gal took : 12 ms
[2025-06-03 17:11:33] [INFO ] Input system was already deterministic with 202 transitions.
[2025-06-03 17:11:33] [INFO ] Flatten gal took : 11 ms
[2025-06-03 17:11:33] [INFO ] Flatten gal took : 10 ms
[2025-06-03 17:11:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality12765822024395457722.gal : 6 ms
[2025-06-03 17:11:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality12189835323367100594.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12765822024395457722.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12189835323367100594.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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.476329,22080,2,796,5,86347,6,0,1405,105051,0


Converting to forward existential form...Done !
original formula: (EF(EX(((p_0_25==0)&&(p_1_61==1)))) + AG(((p_0_89==1)&&(p_1_11==1))))
=> equivalent forward existential formula: [(FwdU((Init * !(E(TRUE U EX(((p_0_25==0)&&(p_1_61==1)))))),TRUE) * !(((p_0_89==1)&&(p_1_11==1))))] = FALSE
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,1,1.37536,46844,1,0,582,302311,427,289,9495,173843,617
FORMULA ResAllocation-PT-R100C002-CTLCardinality-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 329/329 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 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 326 transition count 200
Applied a total of 5 rules in 17 ms. Remains 326 /329 variables (removed 3) and now considering 200/202 (removed 2) transitions.
// Phase 1: matrix 200 rows 326 cols
[2025-06-03 17:11:35] [INFO ] Computed 128 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:11:35] [INFO ] Implicit Places using invariants in 188 ms returned [202, 207, 216, 221, 224, 227, 234, 240, 242, 244, 249, 252, 258, 262, 268, 273, 277, 287, 291, 293, 295, 301, 304, 307, 309, 316, 320, 325]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 189 ms to find 28 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 298/329 places, 200/202 transitions.
Applied a total of 0 rules in 6 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 213 ms. Remains : 298/329 places, 200/202 transitions.
[2025-06-03 17:11:35] [INFO ] Flatten gal took : 10 ms
[2025-06-03 17:11:35] [INFO ] Flatten gal took : 10 ms
[2025-06-03 17:11:35] [INFO ] Input system was already deterministic with 200 transitions.
[2025-06-03 17:11:35] [INFO ] Flatten gal took : 10 ms
[2025-06-03 17:11:35] [INFO ] Flatten gal took : 11 ms
[2025-06-03 17:11:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality13877782823661332291.gal : 2 ms
[2025-06-03 17:11:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality3944870823070987887.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13877782823661332291.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3944870823070987887.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EG(AG(AF((r_0_59==1))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(!(EG(!((r_0_59==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.
[2025-06-03 17:12:05] [INFO ] Flatten gal took : 13 ms
[2025-06-03 17:12:05] [INFO ] Applying decomposition
[2025-06-03 17:12:05] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5666232815545702386.txt' '-o' '/tmp/graph5666232815545702386.bin' '-w' '/tmp/graph5666232815545702386.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5666232815545702386.bin' '-l' '-1' '-v' '-w' '/tmp/graph5666232815545702386.weights' '-q' '0' '-e' '0.001'
[2025-06-03 17:12:05] [INFO ] Decomposing Gal with order
[2025-06-03 17:12:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 17:12:05] [INFO ] Flatten gal took : 68 ms
[2025-06-03 17:12:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2025-06-03 17:12:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality15510422764928494938.gal : 5 ms
[2025-06-03 17:12:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality11737020597289416477.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15510422764928494938.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11737020597289416477.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.33825e+31,0.277357,15740,111,12,31991,52,288,29130,18,69,0


Converting to forward existential form...Done !
original formula: EG(AG(AF((i8.i1.i1.u58.r_0_59==1))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(!(EG(!((i8.i1.i1.u58.r_0_59==1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions i0.t199, i14.i1.i1.t198, Intersection with reachable at each step enabled. (destroyed/revers...186
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 329/329 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 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 326 transition count 200
Applied a total of 5 rules in 10 ms. Remains 326 /329 variables (removed 3) and now considering 200/202 (removed 2) transitions.
[2025-06-03 17:12:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:12:36] [INFO ] Implicit Places using invariants in 286 ms returned [202, 207, 216, 221, 227, 234, 240, 242, 244, 249, 252, 258, 262, 268, 273, 277, 287, 291, 295, 301, 304, 307, 309, 316, 320, 325]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 293 ms to find 26 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 300/329 places, 200/202 transitions.
Applied a total of 0 rules in 5 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 308 ms. Remains : 300/329 places, 200/202 transitions.
[2025-06-03 17:12:36] [INFO ] Flatten gal took : 12 ms
[2025-06-03 17:12:36] [INFO ] Flatten gal took : 26 ms
[2025-06-03 17:12:36] [INFO ] Input system was already deterministic with 200 transitions.
[2025-06-03 17:12:36] [INFO ] Flatten gal took : 13 ms
[2025-06-03 17:12:36] [INFO ] Flatten gal took : 9 ms
[2025-06-03 17:12:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality13331860189886687731.gal : 2 ms
[2025-06-03 17:12:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality27454120641451165.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13331860189886687731.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality27454120641451165.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EG(EF((((p_0_97==0)&&(r_1_75==1))||((p_1_93==0)&&(r_1_21==1)))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (((p_0_97==0)&&(r_1_75==1))||((p_1_93==0)&&(r_1_21==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.
[2025-06-03 17:13:06] [INFO ] Flatten gal took : 14 ms
[2025-06-03 17:13:06] [INFO ] Applying decomposition
[2025-06-03 17:13:06] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9327903763997909512.txt' '-o' '/tmp/graph9327903763997909512.bin' '-w' '/tmp/graph9327903763997909512.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9327903763997909512.bin' '-l' '-1' '-v' '-w' '/tmp/graph9327903763997909512.weights' '-q' '0' '-e' '0.001'
[2025-06-03 17:13:06] [INFO ] Decomposing Gal with order
[2025-06-03 17:13:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 17:13:06] [INFO ] Flatten gal took : 14 ms
[2025-06-03 17:13:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-03 17:13:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality10170361739826400954.gal : 4 ms
[2025-06-03 17:13:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality13229500588061511816.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10170361739826400954.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13229500588061511816.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.33825e+31,0.286795,15764,121,12,32443,58,300,27545,18,73,0


Converting to forward existential form...Done !
original formula: EG(EF((((i16.u96.p_0_97==0)&&(i13.i0.i0.u100.r_1_75==1))||((i15.u92.p_1_93==0)&&(i3.u99.r_1_21==1)))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (((i16.u96.p_0_97==0)&&(i13.i0.i0.u100.r_1_75==1))||((i15.u92.p_1_93==0)&&(i3.u99.r_1_21==1)...169
Reverse transition relation is NOT exact ! Due to transitions i0.t199, i16.t198, Intersection with reachable at each step enabled. (destroyed/reverse/inte...180
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 329/329 places, 202/202 transitions.
Applied a total of 0 rules in 1 ms. Remains 329 /329 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 329 cols
[2025-06-03 17:13:36] [INFO ] Computed 129 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:13:36] [INFO ] Implicit Places using invariants in 273 ms returned [201, 205, 210, 219, 224, 227, 230, 237, 243, 245, 247, 252, 255, 261, 265, 271, 276, 280, 290, 294, 296, 298, 304, 307, 310, 312, 319, 323, 328]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 286 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 300/329 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 300 /300 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 291 ms. Remains : 300/329 places, 202/202 transitions.
[2025-06-03 17:13:36] [INFO ] Flatten gal took : 7 ms
[2025-06-03 17:13:36] [INFO ] Flatten gal took : 9 ms
[2025-06-03 17:13:36] [INFO ] Input system was already deterministic with 202 transitions.
[2025-06-03 17:13:36] [INFO ] Flatten gal took : 24 ms
[2025-06-03 17:13:36] [INFO ] Flatten gal took : 11 ms
[2025-06-03 17:13:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality931620429332072902.gal : 2 ms
[2025-06-03 17:13:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality17705912329155989844.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality931620429332072902.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17705912329155989844.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EX(EG(EX(AG(((r_0_50==0)||(r_0_41==1))))))
=> equivalent forward existential formula: [FwdG(EY(Init),EX(!(E(TRUE U !(((r_0_50==0)||(r_0_41==1)))))))] != FALSE
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.0548,36428,1,0,425,248353,432,211,9692,105051,424
FORMULA ResAllocation-PT-R100C002-CTLCardinality-2025-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 : 329/329 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 329 /329 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2025-06-03 17:13:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:13:38] [INFO ] Implicit Places using invariants in 192 ms returned [201, 205, 210, 219, 224, 227, 230, 237, 243, 245, 247, 252, 255, 261, 265, 271, 276, 280, 290, 294, 296, 298, 304, 307, 310, 312, 319, 323, 328]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 212 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 300/329 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 300 /300 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 217 ms. Remains : 300/329 places, 202/202 transitions.
[2025-06-03 17:13:38] [INFO ] Flatten gal took : 28 ms
[2025-06-03 17:13:38] [INFO ] Flatten gal took : 7 ms
[2025-06-03 17:13:38] [INFO ] Input system was already deterministic with 202 transitions.
[2025-06-03 17:13:38] [INFO ] Flatten gal took : 20 ms
[2025-06-03 17:13:38] [INFO ] Flatten gal took : 11 ms
[2025-06-03 17:13:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality6014807495933939098.gal : 1 ms
[2025-06-03 17:13:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality5565387355851246807.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6014807495933939098.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5565387355851246807.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AF((AG(EX(((p_1_80==0)||(p_1_64==1)))) + ((EF((p_0_77==1)) * AF(((p_1_28==0)||(p_1_21==1)))) * ((p_1_90==0)||(p_1_56==1)))))
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !(EX(((p_1_80==0)||(p_1_64==1)))))) + ((E(TRUE U (p_0_77==1)) * !(EG(!(((p_1_28==0)||(p...211
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.
[2025-06-03 17:14:08] [INFO ] Flatten gal took : 6 ms
[2025-06-03 17:14:08] [INFO ] Applying decomposition
[2025-06-03 17:14:08] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15646537171312602500.txt' '-o' '/tmp/graph15646537171312602500.bin' '-w' '/tmp/graph15646537171312602500.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15646537171312602500.bin' '-l' '-1' '-v' '-w' '/tmp/graph15646537171312602500.weights' '-q' '0' '-e' '0.001'
[2025-06-03 17:14:08] [INFO ] Decomposing Gal with order
[2025-06-03 17:14:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 17:14:08] [INFO ] Flatten gal took : 23 ms
[2025-06-03 17:14:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2025-06-03 17:14:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality672880720780448567.gal : 5 ms
[2025-06-03 17:14:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality1773477969667412327.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality672880720780448567.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1773477969667412327.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.46502e+31,0.342164,17280,103,11,35068,48,287,36327,21,70,0


Converting to forward existential form...Done !
original formula: AF((AG(EX(((i11.i0.i1.u80.p_1_80==0)||(i9.u64.p_1_64==1)))) + ((EF((i11.i0.i0.u77.p_0_77==1)) * AF(((i3.i0.i1.u28.p_1_28==0)||(i2.i1.i0.u...218
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !(EX(((i11.i0.i1.u80.p_1_80==0)||(i9.u64.p_1_64==1)))))) + ((E(TRUE U (i11.i0.i0.u77.p_...287
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 : 329/329 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 329 /329 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2025-06-03 17:14:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:14:38] [INFO ] Implicit Places using invariants in 194 ms returned [201, 205, 210, 219, 224, 227, 230, 237, 243, 245, 247, 252, 255, 261, 265, 271, 276, 280, 290, 294, 296, 298, 304, 307, 310, 312, 319, 323, 328]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 212 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 300/329 places, 202/202 transitions.
Applied a total of 0 rules in 1 ms. Remains 300 /300 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 215 ms. Remains : 300/329 places, 202/202 transitions.
[2025-06-03 17:14:38] [INFO ] Flatten gal took : 22 ms
[2025-06-03 17:14:38] [INFO ] Flatten gal took : 22 ms
[2025-06-03 17:14:38] [INFO ] Input system was already deterministic with 202 transitions.
[2025-06-03 17:14:38] [INFO ] Flatten gal took : 6 ms
[2025-06-03 17:14:38] [INFO ] Flatten gal took : 7 ms
[2025-06-03 17:14:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality9904221124429408203.gal : 18 ms
[2025-06-03 17:14:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality13727069553844198663.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9904221124429408203.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13727069553844198663.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: !(A(EX(((p_1_77==1)&&(r_0_26!=1))) U EG(EF((p_0_11==1)))))
=> equivalent forward existential formula: ([((FwdU(Init,!(EG(E(TRUE U (p_0_11==1))))) * !(EX(((p_1_77==1)&&(r_0_26!=1))))) * !(EG(E(TRUE U (p_0_11==1)))))...219
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.
[2025-06-03 17:15:08] [INFO ] Flatten gal took : 6 ms
[2025-06-03 17:15:08] [INFO ] Applying decomposition
[2025-06-03 17:15:08] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4316248886554306134.txt' '-o' '/tmp/graph4316248886554306134.bin' '-w' '/tmp/graph4316248886554306134.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4316248886554306134.bin' '-l' '-1' '-v' '-w' '/tmp/graph4316248886554306134.weights' '-q' '0' '-e' '0.001'
[2025-06-03 17:15:08] [INFO ] Decomposing Gal with order
[2025-06-03 17:15:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 17:15:09] [INFO ] Flatten gal took : 11 ms
[2025-06-03 17:15:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-03 17:15:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality3448277858775492823.gal : 3 ms
[2025-06-03 17:15:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality3760319604575451869.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3448277858775492823.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3760319604575451869.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.46502e+31,0.306629,17440,102,11,36715,50,277,34486,21,71,0


Converting to forward existential form...Done !
original formula: !(A(EX(((i11.i1.i0.u77.p_1_77==1)&&(i4.i0.i0.u26.r_0_26!=1))) U EG(EF((i1.i1.i1.u11.p_0_11==1)))))
=> equivalent forward existential formula: ([((FwdU(Init,!(EG(E(TRUE U (i1.i1.i1.u11.p_0_11==1))))) * !(EX(((i11.i1.i0.u77.p_1_77==1)&&(i4.i0.i0.u26.r_0_26...285
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 : 329/329 places, 202/202 transitions.
Applied a total of 0 rules in 4 ms. Remains 329 /329 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2025-06-03 17:15:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:15:39] [INFO ] Implicit Places using invariants in 189 ms returned [205, 219, 224, 227, 230, 237, 245, 247, 255, 265, 271, 276, 280, 296, 304, 307, 312, 319, 323, 328]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 192 ms to find 20 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 309/329 places, 202/202 transitions.
Applied a total of 0 rules in 1 ms. Remains 309 /309 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 197 ms. Remains : 309/329 places, 202/202 transitions.
[2025-06-03 17:15:39] [INFO ] Flatten gal took : 6 ms
[2025-06-03 17:15:39] [INFO ] Flatten gal took : 6 ms
[2025-06-03 17:15:39] [INFO ] Input system was already deterministic with 202 transitions.
[2025-06-03 17:15:39] [INFO ] Flatten gal took : 6 ms
[2025-06-03 17:15:39] [INFO ] Flatten gal took : 7 ms
[2025-06-03 17:15:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality11396815844123721025.gal : 2 ms
[2025-06-03 17:15:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality12206292384036120394.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11396815844123721025.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12206292384036120394.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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.568421,22840,2,822,5,89366,6,0,1441,108551,0


Converting to forward existential form...Done !
original formula: (AF(((EX(((r_0_19==0)||(p_1_64==1))) + (EF((r_1_40==0)) * (((p_0_19==0)||(r_1_47==1))||((r_1_74==0)||(r_1_0==1))))) * EF((((r_0_48==0)||(...384
=> equivalent forward existential formula: ([FwdG(Init,!(((EX(((r_0_19==0)||(p_1_64==1))) + (E(TRUE U (r_1_40==0)) * (((p_0_19==0)||(r_1_47==1))||((r_1_74=...507
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.
[2025-06-03 17:16:09] [INFO ] Flatten gal took : 6 ms
[2025-06-03 17:16:09] [INFO ] Applying decomposition
[2025-06-03 17:16:09] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2672661373850988793.txt' '-o' '/tmp/graph2672661373850988793.bin' '-w' '/tmp/graph2672661373850988793.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2672661373850988793.bin' '-l' '-1' '-v' '-w' '/tmp/graph2672661373850988793.weights' '-q' '0' '-e' '0.001'
[2025-06-03 17:16:09] [INFO ] Decomposing Gal with order
[2025-06-03 17:16:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 17:16:09] [INFO ] Flatten gal took : 11 ms
[2025-06-03 17:16:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-03 17:16:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality4905218242884079414.gal : 3 ms
[2025-06-03 17:16:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality8433623348875172938.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4905218242884079414.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8433623348875172938.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.46502e+31,0.378372,20144,189,11,42096,61,338,46748,20,82,0


Converting to forward existential form...Done !
original formula: (AF(((EX(((i3.u19.r_0_19==0)||(i8.i1.i0.u64.p_1_64==1))) + (EF((i5.i1.i0.u103.r_1_40==0)) * (((i3.u19.p_0_19==0)||(i6.u104.r_1_47==1))||(...590
=> equivalent forward existential formula: ([FwdG(Init,!(((EX(((i3.u19.r_0_19==0)||(i8.i1.i0.u64.p_1_64==1))) + (E(TRUE U (i5.i1.i0.u103.r_1_40==0)) * (((i...713
Reverse transition relation is NOT exact ! Due to transitions i0.t101, i13.u99.t100, Intersection with reachable at each step enabled. (destroyed/reverse/...184
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 329/329 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 329 /329 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2025-06-03 17:16:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:16:39] [INFO ] Implicit Places using invariants in 202 ms returned [201, 210, 219, 224, 227, 230, 237, 243, 245, 247, 252, 255, 261, 265, 271, 276, 280, 290, 294, 296, 298, 304, 307, 310, 319, 323, 328]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 225 ms to find 27 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 302/329 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 230 ms. Remains : 302/329 places, 202/202 transitions.
[2025-06-03 17:16:39] [INFO ] Flatten gal took : 8 ms
[2025-06-03 17:16:39] [INFO ] Flatten gal took : 7 ms
[2025-06-03 17:16:39] [INFO ] Input system was already deterministic with 202 transitions.
[2025-06-03 17:16:39] [INFO ] Flatten gal took : 6 ms
[2025-06-03 17:16:39] [INFO ] Flatten gal took : 7 ms
[2025-06-03 17:16:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality16930092804305212090.gal : 2 ms
[2025-06-03 17:16:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality7447635116687037519.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16930092804305212090.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7447635116687037519.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (E((((!((p_1_6==0)||(p_0_30==1)))||(p_1_0==0))||(p_1_61==1)) U ((!(EF((((p_0_50==0)||(p_0_76==1))||(p_1_34==1)))) + (p_0_12==0)) + (r_1_3...219
=> equivalent forward existential formula: ([(FwdU((Init * E((((!((p_1_6==0)||(p_0_30==1)))||(p_1_0==0))||(p_1_61==1)) U ((!(E(TRUE U (((p_0_50==0)||(p_0_7...465
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,1,1.79557,52508,1,0,433,329977,434,216,9953,207747,431
FORMULA ResAllocation-PT-R100C002-CTLCardinality-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 329/329 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 329 /329 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2025-06-03 17:16:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:16:41] [INFO ] Implicit Places using invariants in 196 ms returned [201, 205, 210, 219, 224, 227, 230, 237, 243, 245, 247, 252, 255, 261, 265, 271, 276, 280, 290, 294, 296, 298, 304, 307, 310, 312, 319, 323, 328]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 197 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 300/329 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 300 /300 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 201 ms. Remains : 300/329 places, 202/202 transitions.
[2025-06-03 17:16:41] [INFO ] Flatten gal took : 6 ms
[2025-06-03 17:16:41] [INFO ] Flatten gal took : 6 ms
[2025-06-03 17:16:41] [INFO ] Input system was already deterministic with 202 transitions.
[2025-06-03 17:16:41] [INFO ] Flatten gal took : 6 ms
[2025-06-03 17:16:41] [INFO ] Flatten gal took : 6 ms
[2025-06-03 17:16:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality1155939935857081315.gal : 1 ms
[2025-06-03 17:16:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality5862841046983954545.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1155939935857081315.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5862841046983954545.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EX(AX(EG(EX(TRUE))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(EG(EX(TRUE))))))] != FALSE
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
Detected timeout of ITS tools.
[2025-06-03 17:17:11] [INFO ] Flatten gal took : 6 ms
[2025-06-03 17:17:11] [INFO ] Applying decomposition
[2025-06-03 17:17:11] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10313742089862498604.txt' '-o' '/tmp/graph10313742089862498604.bin' '-w' '/tmp/graph10313742089862498604.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10313742089862498604.bin' '-l' '-1' '-v' '-w' '/tmp/graph10313742089862498604.weights' '-q' '0' '-e' '0.001'
[2025-06-03 17:17:11] [INFO ] Decomposing Gal with order
[2025-06-03 17:17:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 17:17:11] [INFO ] Flatten gal took : 11 ms
[2025-06-03 17:17:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-03 17:17:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality8995176541770405625.gal : 3 ms
[2025-06-03 17:17:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality5870208935208664057.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8995176541770405625.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5870208935208664057.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.46502e+31,0.303591,15664,92,11,32160,50,271,27517,21,71,0


Converting to forward existential form...Done !
original formula: EX(AX(EG(EX(TRUE))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(EG(EX(TRUE))))))] != FALSE
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 : 329/329 places, 202/202 transitions.
Applied a total of 0 rules in 4 ms. Remains 329 /329 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2025-06-03 17:17:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:17:42] [INFO ] Implicit Places using invariants in 204 ms returned [201, 205, 210, 219, 224, 227, 230, 237, 243, 245, 247, 252, 255, 261, 265, 271, 276, 280, 290, 294, 296, 298, 304, 307, 310, 312, 319, 323, 328]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 207 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 300/329 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 300 /300 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 213 ms. Remains : 300/329 places, 202/202 transitions.
[2025-06-03 17:17:42] [INFO ] Flatten gal took : 12 ms
[2025-06-03 17:17:42] [INFO ] Flatten gal took : 6 ms
[2025-06-03 17:17:42] [INFO ] Input system was already deterministic with 202 transitions.
[2025-06-03 17:17:42] [INFO ] Flatten gal took : 6 ms
[2025-06-03 17:17:42] [INFO ] Flatten gal took : 6 ms
[2025-06-03 17:17:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality5522218962685804052.gal : 1 ms
[2025-06-03 17:17:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality3648358955634971353.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5522218962685804052.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3648358955634971353.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (AG((((p_1_52==0)||(r_0_18==1)) + AX(((p_1_41==0)||(r_0_44==1))))) + !(A((p_0_84!=1) U AX(((p_0_68==0)||(p_1_78==1))))))
=> equivalent forward existential formula: [(EY((FwdU((Init * !(!(!((E(!(!(EX(!(((p_0_68==0)||(p_1_78==1)))))) U (!((p_0_84!=1)) * !(!(EX(!(((p_0_68==0)||(...305
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
Detected timeout of ITS tools.
[2025-06-03 17:18:12] [INFO ] Flatten gal took : 10 ms
[2025-06-03 17:18:12] [INFO ] Applying decomposition
[2025-06-03 17:18:12] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4140244199464984431.txt' '-o' '/tmp/graph4140244199464984431.bin' '-w' '/tmp/graph4140244199464984431.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4140244199464984431.bin' '-l' '-1' '-v' '-w' '/tmp/graph4140244199464984431.weights' '-q' '0' '-e' '0.001'
[2025-06-03 17:18:12] [INFO ] Decomposing Gal with order
[2025-06-03 17:18:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 17:18:12] [INFO ] Flatten gal took : 12 ms
[2025-06-03 17:18:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-03 17:18:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality12850914469577767439.gal : 3 ms
[2025-06-03 17:18:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality12594054209763297196.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12850914469577767439.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12594054209763297196.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.46502e+31,0.356436,17172,98,11,35450,48,283,33961,21,70,0


Converting to forward existential form...Done !
original formula: (AG((((i7.i0.i0.u52.p_1_52==0)||(i2.i1.i0.u18.r_0_18==1)) + AX(((i5.i1.i0.u41.p_1_41==0)||(i5.i1.i1.u44.r_0_44==1))))) + !(A((i11.i1.i1.u...225
=> equivalent forward existential formula: [(EY((FwdU((Init * !(!(!((E(!(!(EX(!(((i9.u68.p_0_68==0)||(i11.i0.i0.u78.p_1_78==1)))))) U (!((i11.i1.i1.u84.p_0...434
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 : 329/329 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 329 /329 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2025-06-03 17:18:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:18:42] [INFO ] Implicit Places using invariants in 214 ms returned [201, 205, 210, 219, 224, 227, 237, 243, 245, 247, 252, 255, 261, 265, 271, 276, 280, 290, 294, 296, 298, 304, 310, 312, 319, 323, 328]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 215 ms to find 27 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 302/329 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 219 ms. Remains : 302/329 places, 202/202 transitions.
[2025-06-03 17:18:42] [INFO ] Flatten gal took : 5 ms
[2025-06-03 17:18:42] [INFO ] Flatten gal took : 5 ms
[2025-06-03 17:18:42] [INFO ] Input system was already deterministic with 202 transitions.
[2025-06-03 17:18:42] [INFO ] Flatten gal took : 6 ms
[2025-06-03 17:18:42] [INFO ] Flatten gal took : 6 ms
[2025-06-03 17:18:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality12117872495202430100.gal : 1 ms
[2025-06-03 17:18:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality1532914110636648142.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12117872495202430100.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1532914110636648142.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AG(((EF(AX((p_1_88==0))) + AX((((p_1_19==0)&&(p_1_5==0))&&((r_1_23==0)&&(p_1_6==1))))) + ((EG((r_1_83!=1)) * EF((p_1_80==0))) + (EX(((r_0...192
=> equivalent forward existential formula: [(EY(((FwdU(Init,TRUE) * !(((EG((r_1_83!=1)) * E(TRUE U (p_1_80==0))) + (EX(((r_0_50==0)||(r_0_21==1))) * EX(TRU...270
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,1,1.07404,37544,1,0,427,255144,428,211,9553,109144,422
FORMULA ResAllocation-PT-R100C002-CTLCardinality-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 329/329 places, 202/202 transitions.
Applied a total of 0 rules in 5 ms. Remains 329 /329 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2025-06-03 17:18:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:18:44] [INFO ] Implicit Places using invariants in 188 ms returned [201, 205, 224, 227, 230, 243, 247, 252, 255, 261, 271, 290, 294, 296, 298, 304, 307, 310, 312, 319, 323, 328]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 189 ms to find 22 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 307/329 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 196 ms. Remains : 307/329 places, 202/202 transitions.
[2025-06-03 17:18:44] [INFO ] Flatten gal took : 6 ms
[2025-06-03 17:18:44] [INFO ] Flatten gal took : 6 ms
[2025-06-03 17:18:44] [INFO ] Input system was already deterministic with 202 transitions.
[2025-06-03 17:18:44] [INFO ] Flatten gal took : 11 ms
[2025-06-03 17:18:44] [INFO ] Flatten gal took : 6 ms
[2025-06-03 17:18:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality11849174922179068380.gal : 2 ms
[2025-06-03 17:18:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality14853410360631355042.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11849174922179068380.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14853410360631355042.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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.473568,22612,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.
[2025-06-03 17:19:14] [INFO ] Flatten gal took : 6 ms
[2025-06-03 17:19:14] [INFO ] Applying decomposition
[2025-06-03 17:19:14] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14577347577233044663.txt' '-o' '/tmp/graph14577347577233044663.bin' '-w' '/tmp/graph14577347577233044663.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14577347577233044663.bin' '-l' '-1' '-v' '-w' '/tmp/graph14577347577233044663.weights' '-q' '0' '-e' '0.001'
[2025-06-03 17:19:14] [INFO ] Decomposing Gal with order
[2025-06-03 17:19:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 17:19:14] [INFO ] Flatten gal took : 11 ms
[2025-06-03 17:19:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-03 17:19:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality14666685226555713133.gal : 3 ms
[2025-06-03 17:19:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality6658191890403952789.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14666685226555713133.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6658191890403952789.ctl'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: ((EG(AF((i0.u100.r_1_7==0))) * EX((AF(((i7.u105.r_1_59==0)&&(i8.u106.r_1_62==1))) * !(A(((i1.i1.i0.u101.r_1_15==0)||(i8.u65.r_0_65==1)) U...427
=> equivalent forward existential formula: (([(Init * !(EG(!(EG(!((i0.u100.r_1_7==0)))))))] = FALSE * [(Init * !(EX((!(EG(!(((i7.u105.r_1_59==0)&&(i8.u106....645
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 : 329/329 places, 202/202 transitions.
Applied a total of 0 rules in 5 ms. Remains 329 /329 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2025-06-03 17:19:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:19:44] [INFO ] Implicit Places using invariants in 217 ms returned [201, 205, 210, 219, 224, 227, 230, 237, 243, 245, 252, 255, 261, 265, 271, 276, 280, 290, 294, 296, 298, 307, 310, 312, 328]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 218 ms to find 25 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 304/329 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 226 ms. Remains : 304/329 places, 202/202 transitions.
[2025-06-03 17:19:44] [INFO ] Flatten gal took : 6 ms
[2025-06-03 17:19:44] [INFO ] Flatten gal took : 6 ms
[2025-06-03 17:19:44] [INFO ] Input system was already deterministic with 202 transitions.
[2025-06-03 17:19:44] [INFO ] Flatten gal took : 5 ms
[2025-06-03 17:19:44] [INFO ] Flatten gal took : 6 ms
[2025-06-03 17:19:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality12432850219765677898.gal : 1 ms
[2025-06-03 17:19:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality4061367791444821874.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12432850219765677898.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4061367791444821874.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.46502e+31,0.592572,22644,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.
[2025-06-03 17:20:14] [INFO ] Flatten gal took : 6 ms
[2025-06-03 17:20:14] [INFO ] Applying decomposition
[2025-06-03 17:20:14] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13958789011102298659.txt' '-o' '/tmp/graph13958789011102298659.bin' '-w' '/tmp/graph13958789011102298659.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13958789011102298659.bin' '-l' '-1' '-v' '-w' '/tmp/graph13958789011102298659.weights' '-q' '0' '-e' '0.001'
[2025-06-03 17:20:14] [INFO ] Decomposing Gal with order
[2025-06-03 17:20:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 17:20:14] [INFO ] Flatten gal took : 18 ms
[2025-06-03 17:20:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-03 17:20:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality17419966469185942445.gal : 2 ms
[2025-06-03 17:20:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality9236046886154338700.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17419966469185942445.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9236046886154338700.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.46502e+31,0.329062,17764,138,11,36428,55,310,36215,21,79,0


Converting to forward existential form...Done !
original formula: A((!(E(!((((i4.i0.i1.u31.p_1_31!=1)&&(i11.u101.r_1_81==1))&&(i3.i1.i1.u25.r_0_25==1))) U EX(A((i12.i0.i0.u87.r_0_87==1) U ((i12.i1.i1.u10...428
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!(!(E(TRUE U !(!(((i13.u98.p_1_98==0)||(i13.u99.p_0_99==1))))))) U (!(E(((i3.i1.i1.u25.r_0...1555
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 : 329/329 places, 202/202 transitions.
Applied a total of 0 rules in 4 ms. Remains 329 /329 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2025-06-03 17:20:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:20:44] [INFO ] Implicit Places using invariants in 183 ms returned [201, 205, 210, 219, 227, 230, 237, 243, 245, 247, 252, 261, 265, 276, 280, 290, 294, 296, 298, 304, 307, 310, 312, 319, 323]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 184 ms to find 25 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 304/329 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 190 ms. Remains : 304/329 places, 202/202 transitions.
[2025-06-03 17:20:44] [INFO ] Flatten gal took : 6 ms
[2025-06-03 17:20:44] [INFO ] Flatten gal took : 5 ms
[2025-06-03 17:20:44] [INFO ] Input system was already deterministic with 202 transitions.
[2025-06-03 17:20:44] [INFO ] Flatten gal took : 6 ms
[2025-06-03 17:20:44] [INFO ] Flatten gal took : 5 ms
[2025-06-03 17:20:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality3843532370609477719.gal : 1 ms
[2025-06-03 17:20:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality15759013064570495761.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3843532370609477719.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15759013064570495761.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.46502e+31,0.458324,22588,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.
[2025-06-03 17:21:14] [INFO ] Flatten gal took : 6 ms
[2025-06-03 17:21:14] [INFO ] Applying decomposition
[2025-06-03 17:21:14] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2018208204068887972.txt' '-o' '/tmp/graph2018208204068887972.bin' '-w' '/tmp/graph2018208204068887972.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2018208204068887972.bin' '-l' '-1' '-v' '-w' '/tmp/graph2018208204068887972.weights' '-q' '0' '-e' '0.001'
[2025-06-03 17:21:15] [INFO ] Decomposing Gal with order
[2025-06-03 17:21:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 17:21:15] [INFO ] Flatten gal took : 14 ms
[2025-06-03 17:21:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-03 17:21:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality8783417308336713331.gal : 3 ms
[2025-06-03 17:21:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality15174814368254672414.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8783417308336713331.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15174814368254672414.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.46502e+31,0.356105,16936,129,11,34201,50,309,34246,20,71,0


Converting to forward existential form...Done !
original formula: ((AX((AG(((i5.u101.r_1_42!=0)&&(i2.i1.i0.u100.r_1_19!=1))) * (i9.i0.i1.u65.p_1_65==1))) + AG(AX(!(E(((i13.i1.i1.u103.r_1_99==0)||(i11.i1....347
=> equivalent forward existential formula: [(FwdU(EY(FwdU(((Init * !(E(TRUE U (((i7.u102.r_1_55==0)||(i11.i1.i0.u84.p_0_84==1)) * !((E(!(((i10.i1.i0.u76.p_...561
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.
[2025-06-03 17:21:45] [INFO ] Flatten gal took : 7 ms
[2025-06-03 17:21:45] [INFO ] Flatten gal took : 7 ms
[2025-06-03 17:21:45] [INFO ] Applying decomposition
[2025-06-03 17:21:45] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6315294778555017730.txt' '-o' '/tmp/graph6315294778555017730.bin' '-w' '/tmp/graph6315294778555017730.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6315294778555017730.bin' '-l' '-1' '-v' '-w' '/tmp/graph6315294778555017730.weights' '-q' '0' '-e' '0.001'
[2025-06-03 17:21:45] [INFO ] Decomposing Gal with order
[2025-06-03 17:21:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 17:21:45] [INFO ] Flatten gal took : 11 ms
[2025-06-03 17:21:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-03 17:21:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality9306445346965682472.gal : 2 ms
[2025-06-03 17:21:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality16599224890798434535.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9306445346965682472.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16599224890798434535.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 10 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.597575,25172,439,13,52982,82,378,71088,19,112,0


Converting to forward existential form...Done !
original formula: EG(AG(AF((i8.i0.i0.u59.r_0_59==1))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(!(EG(!((i8.i0.i0.u59.r_0_59==1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions i13.u99.t100, i14.t101, Intersection with reachable at each step enabled. (destroyed/reverse...185
ITS-tools command line returned an error code 139
[2025-06-03 17:27:37] [INFO ] Applying decomposition
[2025-06-03 17:27:37] [INFO ] Flatten gal took : 7 ms
[2025-06-03 17:27:37] [INFO ] Decomposing Gal with order
[2025-06-03 17:27:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 17:27:37] [INFO ] Flatten gal took : 9 ms
[2025-06-03 17:27:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-03 17:27:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality18431513029834865912.gal : 3 ms
[2025-06-03 17:27:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality3680577097500461852.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality18431513029834865912.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3680577097500461852.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 10 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.899614,41144,564,13,89851,333,675,96059,19,233,0


Converting to forward existential form...Done !
original formula: EG(AG(AF((u41.r_0_59==1))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(!(EG(!((u41.r_0_59==1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t101, u1.t100, Intersection with reachable at each step enabled. (destroyed/reverse/intersec...176
ITS-tools command line returned an error code 139
[2025-06-03 17:29:31] [INFO ] Flatten gal took : 6 ms
[2025-06-03 17:29:31] [INFO ] Input system was already deterministic with 202 transitions.
[2025-06-03 17:29:31] [INFO ] Transformed 329 places.
[2025-06-03 17:29:31] [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
[2025-06-03 17:29:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality17105644728835520168.gal : 1 ms
[2025-06-03 17:29:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality7109813242097986759.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17105644728835520168.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7109813242097986759.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.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...329
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 10 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.558767,26204,2,1167,5,103798,6,0,1521,129055,0


Converting to forward existential form...Done !
original formula: EG(AG(AF((r_0_59==1))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(!(EG(!((r_0_59==1))))))))] != FALSE
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.
Total runtime 2634068 ms.

BK_STOP 1748973213411

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="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-5832"
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 r184-tall-174889263700185"
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.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 ;