Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r072-tall-174860067600500.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 DoubleExponent-PT-020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r072-tall-174860067600500
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 752K
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K 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.2K 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 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 340K 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 DoubleExponent-PT-020-LTLFireability-00
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-01
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-02
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-03
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-04
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-05
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-06
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-07
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-08
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-09
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-10
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-11
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-12
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-13
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-14
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748741559995

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-020
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-01 01:32:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 01:32:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 01:32:41] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2025-06-01 01:32:41] [INFO ] Transformed 1064 places.
[2025-06-01 01:32:41] [INFO ] Transformed 998 transitions.
[2025-06-01 01:32:41] [INFO ] Parsed PT model containing 1064 places and 998 transitions and 2814 arcs in 189 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA DoubleExponent-PT-020-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 61 out of 1064 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1064/1064 places, 998/998 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1060 transition count 998
Applied a total of 4 rules in 122 ms. Remains 1060 /1064 variables (removed 4) and now considering 998/998 (removed 0) transitions.
// Phase 1: matrix 998 rows 1060 cols
[2025-06-01 01:32:41] [INFO ] Invariants computation overflowed in 146 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:32:42] [INFO ] Implicit Places using invariants in 718 ms returned []
// Phase 1: matrix 998 rows 1060 cols
[2025-06-01 01:32:42] [INFO ] Invariants computation overflowed in 78 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:32:58] [INFO ] Implicit Places using invariants and state equation in 16084 ms returned [28, 30]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 16848 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1058/1064 places, 998/998 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1057 transition count 997
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1057 transition count 997
Applied a total of 2 rules in 168 ms. Remains 1057 /1058 variables (removed 1) and now considering 997/998 (removed 1) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2025-06-01 01:32:58] [INFO ] Invariants computation overflowed in 132 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:32:59] [INFO ] Implicit Places using invariants in 448 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2025-06-01 01:32:59] [INFO ] Invariants computation overflowed in 113 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:33:12] [INFO ] Implicit Places using invariants and state equation in 13433 ms returned []
Implicit Place search using SMT with State Equation took 13887 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1057/1064 places, 997/998 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31039 ms. Remains : 1057/1064 places, 997/998 transitions.
Support contains 61 out of 1057 places after structural reductions.
[2025-06-01 01:33:12] [INFO ] Flatten gal took : 94 ms
[2025-06-01 01:33:13] [INFO ] Flatten gal took : 56 ms
[2025-06-01 01:33:13] [INFO ] Input system was already deterministic with 997 transitions.
Reduction of identical properties reduced properties to check from 43 to 42
RANDOM walk for 40000 steps (1331 resets) in 1925 ms. (20 steps per ms) remains 37/42 properties
BEST_FIRST walk for 4000 steps (114 resets) in 110 ms. (36 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (116 resets) in 136 ms. (29 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (115 resets) in 75 ms. (52 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (109 resets) in 36 ms. (108 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (116 resets) in 26 ms. (148 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (113 resets) in 28 ms. (137 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (115 resets) in 28 ms. (137 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (111 resets) in 23 ms. (166 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (114 resets) in 21 ms. (181 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (117 resets) in 30 ms. (129 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (116 resets) in 34 ms. (114 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (112 resets) in 115 ms. (34 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (111 resets) in 24 ms. (160 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (107 resets) in 28 ms. (137 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (114 resets) in 34 ms. (114 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (112 resets) in 31 ms. (125 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (109 resets) in 28 ms. (137 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (105 resets) in 63 ms. (62 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (106 resets) in 42 ms. (93 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (111 resets) in 33 ms. (117 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (113 resets) in 63 ms. (62 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (115 resets) in 29 ms. (133 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (116 resets) in 28 ms. (138 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (113 resets) in 33 ms. (117 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (109 resets) in 35 ms. (111 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (113 resets) in 43 ms. (90 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (114 resets) in 29 ms. (133 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (109 resets) in 45 ms. (86 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (111 resets) in 42 ms. (93 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (113 resets) in 26 ms. (148 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (118 resets) in 58 ms. (67 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (103 resets) in 27 ms. (142 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (110 resets) in 39 ms. (100 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (106 resets) in 27 ms. (142 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (112 resets) in 52 ms. (75 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (105 resets) in 18 ms. (210 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (113 resets) in 48 ms. (81 steps per ms) remains 37/37 properties
// Phase 1: matrix 997 rows 1057 cols
[2025-06-01 01:33:14] [INFO ] Invariants computation overflowed in 102 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 132/188 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (OVERLAPS) 436/624 variables, 185/241 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/624 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 631/1255 variables, 322/563 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1255 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (OVERLAPS) 494/1749 variables, 296/859 constraints. Problems are: Problem set: 0 solved, 37 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:33:18] [INFO ] Deduced a trap along path composed of 17 places in 41 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1749 variables, 1/860 constraints. Problems are: Problem set: 0 solved, 37 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/1749 variables, 0/860 constraints. Problems are: Problem set: 0 solved, 37 unsolved
SMT process timed out in 5179ms, After SMT, problems are : Problem set: 0 solved, 37 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 56 out of 1057 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 196 transitions
Trivial Post-agglo rules discarded 196 transitions
Performed 196 trivial Post agglomeration. Transition count delta: 196
Iterating post reduction 0 with 196 rules applied. Total rules applied 197 place count 1056 transition count 800
Reduce places removed 196 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 1 with 214 rules applied. Total rules applied 411 place count 860 transition count 782
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 429 place count 842 transition count 782
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 429 place count 842 transition count 746
Deduced a syphon composed of 36 places in 10 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 501 place count 806 transition count 746
Performed 165 Post agglomeration using F-continuation condition.Transition count delta: 165
Deduced a syphon composed of 165 places in 10 ms
Reduce places removed 165 places and 0 transitions.
Iterating global reduction 3 with 330 rules applied. Total rules applied 831 place count 641 transition count 581
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 29 places in 8 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 889 place count 612 transition count 581
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 890 place count 612 transition count 580
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 891 place count 611 transition count 580
Free-agglomeration rule (complex) applied 72 times.
Iterating global reduction 4 with 72 rules applied. Total rules applied 963 place count 611 transition count 508
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 4 with 72 rules applied. Total rules applied 1035 place count 539 transition count 508
Partial Free-agglomeration rule applied 80 times.
Drop transitions (Partial Free agglomeration) removed 80 transitions
Iterating global reduction 5 with 80 rules applied. Total rules applied 1115 place count 539 transition count 508
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1116 place count 538 transition count 507
Applied a total of 1116 rules in 327 ms. Remains 538 /1057 variables (removed 519) and now considering 507/997 (removed 490) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 327 ms. Remains : 538/1057 places, 507/997 transitions.
RANDOM walk for 40000 steps (4499 resets) in 642 ms. (62 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (305 resets) in 33 ms. (117 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (307 resets) in 25 ms. (153 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (315 resets) in 30 ms. (129 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (304 resets) in 34 ms. (114 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (318 resets) in 32 ms. (121 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (298 resets) in 28 ms. (138 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (316 resets) in 27 ms. (142 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (304 resets) in 30 ms. (129 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (309 resets) in 46 ms. (85 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (307 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (313 resets) in 18 ms. (210 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (309 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (317 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (318 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (305 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (314 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (312 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (319 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (303 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (323 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (290 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (303 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (324 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (299 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (299 resets) in 14 ms. (266 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (300 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (325 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (300 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (299 resets) in 14 ms. (266 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (307 resets) in 13 ms. (285 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (311 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (317 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (311 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (304 resets) in 37 ms. (105 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (319 resets) in 21 ms. (181 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (329 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (327 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
Interrupted probabilistic random walk after 149790 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :5 out of 37
Probabilistic random walk after 149790 steps, saw 75657 distinct states, run finished after 3006 ms. (steps per millisecond=49 ) properties seen :5
// Phase 1: matrix 507 rows 538 cols
[2025-06-01 01:33:23] [INFO ] Invariants computation overflowed in 74 ms
[2025-06-01 01:33:23] [INFO ] State equation strengthened by 68 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 145/195 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 471/666 variables, 219/271 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/666 variables, 29/300 constraints. Problems are: Problem set: 0 solved, 32 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/666 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 357/1023 variables, 248/548 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1023 variables, 36/584 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1023 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Problem AtomicPropp39 is UNSAT
At refinement iteration 10 (OVERLAPS) 22/1045 variables, 21/605 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1045 variables, 1/606 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1045 variables, 0/606 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 13 (OVERLAPS) 0/1045 variables, 0/606 constraints. Problems are: Problem set: 1 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1045/1045 variables, and 606 constraints, problems are : Problem set: 1 solved, 31 unsolved in 13039 ms.
Refiners :[State Equation: 538/538 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 31 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 135/182 variables, 47/47 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 2/49 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/49 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 4 (OVERLAPS) 442/624 variables, 205/254 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/624 variables, 26/280 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/624 variables, 31/311 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/624 variables, 0/311 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 8 (OVERLAPS) 374/998 variables, 247/558 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/998 variables, 38/596 constraints. Problems are: Problem set: 1 solved, 31 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:33:42] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/998 variables, 1/597 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/998 variables, 0/597 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 12 (OVERLAPS) 45/1043 variables, 37/634 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1043 variables, 2/636 constraints. Problems are: Problem set: 1 solved, 31 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:33:50] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:33:50] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:33:50] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:33:51] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:33:51] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:33:51] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:33:51] [INFO ] Deduced a trap composed of 52 places in 69 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1043 variables, 7/643 constraints. Problems are: Problem set: 1 solved, 31 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:33:53] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1043 variables, 1/644 constraints. Problems are: Problem set: 1 solved, 31 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:33:54] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:33:54] [INFO ] Deduced a trap composed of 66 places in 58 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1043 variables, 2/646 constraints. Problems are: Problem set: 1 solved, 31 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:33:56] [INFO ] Deduced a trap along path composed of 4 places in 45 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:33:57] [INFO ] Deduced a trap along path composed of 4 places in 50 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:33:57] [INFO ] Deduced a trap along path composed of 2 places in 57 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:33:57] [INFO ] Deduced a trap along path composed of 4 places in 76 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:33:58] [INFO ] Deduced a trap along path composed of 4 places in 51 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:33:58] [INFO ] Deduced a trap along path composed of 9 places in 49 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:33:58] [INFO ] Deduced a trap along path composed of 6 places in 47 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:33:59] [INFO ] Deduced a trap along path composed of 6 places in 45 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:33:59] [INFO ] Deduced a trap along path composed of 4 places in 45 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:33:59] [INFO ] Deduced a trap along path composed of 10 places in 48 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:34:00] [INFO ] Deduced a trap along path composed of 10 places in 44 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:34:00] [INFO ] Deduced a trap along path composed of 8 places in 39 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:34:01] [INFO ] Deduced a trap along path composed of 5 places in 29 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:34:01] [INFO ] Deduced a trap along path composed of 4 places in 43 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1043 variables, 14/660 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1043 variables, 0/660 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 19 (OVERLAPS) 2/1045 variables, 2/662 constraints. Problems are: Problem set: 1 solved, 31 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:34:11] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:34:11] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:34:12] [INFO ] Deduced a trap composed of 68 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:34:12] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 4 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1045 variables, 4/666 constraints. Problems are: Problem set: 1 solved, 31 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:34:19] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:34:20] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:34:20] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:34:20] [INFO ] Deduced a trap composed of 43 places in 113 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:34:20] [INFO ] Deduced a trap composed of 48 places in 108 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:34:20] [INFO ] Deduced a trap composed of 36 places in 121 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:34:21] [INFO ] Deduced a trap composed of 68 places in 91 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1045/1045 variables, and 673 constraints, problems are : Problem set: 1 solved, 31 unsolved in 45030 ms.
Refiners :[State Equation: 538/538 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 31/32 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 15/15 constraints]
After SMT, in 58181ms problems are : Problem set: 1 solved, 31 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 47 out of 538 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 538/538 places, 507/507 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 538 transition count 506
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 537 transition count 506
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 537 transition count 504
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 535 transition count 504
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 533 transition count 502
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 7 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 530 transition count 502
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 530 transition count 501
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 529 transition count 501
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 529 transition count 501
Applied a total of 19 rules in 124 ms. Remains 529 /538 variables (removed 9) and now considering 501/507 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 529/538 places, 501/507 transitions.
RANDOM walk for 40000 steps (5482 resets) in 541 ms. (73 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (348 resets) in 23 ms. (166 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (351 resets) in 31 ms. (125 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (358 resets) in 18 ms. (210 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (352 resets) in 16 ms. (235 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (343 resets) in 19 ms. (200 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (360 resets) in 19 ms. (200 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (356 resets) in 18 ms. (210 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (349 resets) in 26 ms. (148 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (350 resets) in 28 ms. (137 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (357 resets) in 22 ms. (174 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (346 resets) in 24 ms. (160 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (377 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (346 resets) in 19 ms. (200 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (365 resets) in 27 ms. (143 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (360 resets) in 28 ms. (138 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (367 resets) in 24 ms. (160 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (371 resets) in 22 ms. (174 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (353 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (343 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (349 resets) in 31 ms. (125 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (353 resets) in 27 ms. (142 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (338 resets) in 16 ms. (235 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (351 resets) in 15 ms. (250 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (360 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (355 resets) in 15 ms. (250 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (348 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (356 resets) in 13 ms. (285 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (348 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (359 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (347 resets) in 19 ms. (200 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (362 resets) in 13 ms. (285 steps per ms) remains 31/31 properties
Interrupted probabilistic random walk after 171213 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :0 out of 31
Probabilistic random walk after 171213 steps, saw 86256 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :0
// Phase 1: matrix 501 rows 529 cols
[2025-06-01 01:34:25] [INFO ] Invariants computation overflowed in 58 ms
[2025-06-01 01:34:25] [INFO ] State equation strengthened by 74 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 136/183 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (OVERLAPS) 444/627 variables, 206/255 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/627 variables, 26/281 constraints. Problems are: Problem set: 0 solved, 31 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/627 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 368/995 variables, 245/526 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/995 variables, 43/569 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/995 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 10 (OVERLAPS) 35/1030 variables, 31/600 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1030 variables, 3/603 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1030 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 13 (OVERLAPS) 0/1030 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1030/1030 variables, and 603 constraints, problems are : Problem set: 0 solved, 31 unsolved in 13788 ms.
Refiners :[State Equation: 529/529 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 136/183 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (OVERLAPS) 444/627 variables, 206/255 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/627 variables, 26/281 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/627 variables, 31/312 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/627 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (OVERLAPS) 368/995 variables, 245/557 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/995 variables, 43/600 constraints. Problems are: Problem set: 0 solved, 31 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:34:47] [INFO ] Deduced a trap along path composed of 6 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/995 variables, 1/601 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/995 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 12 (OVERLAPS) 35/1030 variables, 31/632 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1030 variables, 3/635 constraints. Problems are: Problem set: 0 solved, 31 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:34:58] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:34:58] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:34:59] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:34:59] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:34:59] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:34:59] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:35:01] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:35:02] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:35:03] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:35:03] [INFO ] Deduced a trap composed of 43 places in 123 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:35:04] [INFO ] Deduced a trap composed of 46 places in 123 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:35:05] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:35:05] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:35:06] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:35:06] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:35:07] [INFO ] Deduced a trap composed of 66 places in 94 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:35:07] [INFO ] Deduced a trap composed of 59 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:35:07] [INFO ] Deduced a trap composed of 58 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:35:07] [INFO ] Deduced a trap composed of 60 places in 93 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:35:07] [INFO ] Deduced a trap composed of 50 places in 93 ms of which 5 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1030 variables, 20/655 constraints. Problems are: Problem set: 0 solved, 31 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:35:15] [INFO ] Deduced a trap composed of 34 places in 119 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:35:15] [INFO ] Deduced a trap composed of 70 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:35:15] [INFO ] Deduced a trap composed of 67 places in 84 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:35:16] [INFO ] Deduced a trap composed of 68 places in 81 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:35:16] [INFO ] Deduced a trap composed of 69 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:35:16] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:35:16] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:35:16] [INFO ] Deduced a trap composed of 62 places in 82 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:35:16] [INFO ] Deduced a trap composed of 66 places in 92 ms of which 7 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1030 variables, 9/664 constraints. Problems are: Problem set: 0 solved, 31 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:35:27] [INFO ] Deduced a trap along path composed of 2 places in 86 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:35:27] [INFO ] Deduced a trap along path composed of 8 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:35:27] [INFO ] Deduced a trap along path composed of 9 places in 46 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:35:28] [INFO ] Deduced a trap along path composed of 8 places in 49 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:35:28] [INFO ] Deduced a trap along path composed of 6 places in 49 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:35:29] [INFO ] Deduced a trap along path composed of 10 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:35:29] [INFO ] Deduced a trap along path composed of 7 places in 54 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:35:29] [INFO ] Deduced a trap along path composed of 19 places in 66 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:35:29] [INFO ] Deduced a trap along path composed of 44 places in 59 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:35:31] [INFO ] Deduced a trap along path composed of 10 places in 46 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1030 variables, 10/674 constraints. Problems are: Problem set: 0 solved, 31 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:35:36] [INFO ] Deduced a trap along path composed of 7 places in 73 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:35:36] [INFO ] Deduced a trap along path composed of 10 places in 82 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:35:37] [INFO ] Deduced a trap along path composed of 9 places in 65 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:35:38] [INFO ] Deduced a trap along path composed of 11 places in 46 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:35:38] [INFO ] Deduced a trap along path composed of 18 places in 71 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:35:38] [INFO ] Deduced a trap along path composed of 10 places in 67 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:35:38] [INFO ] Deduced a trap along path composed of 13 places in 64 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:35:40] [INFO ] Deduced a trap along path composed of 4 places in 41 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:35:40] [INFO ] Deduced a trap along path composed of 11 places in 40 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:35:40] [INFO ] Deduced a trap along path composed of 5 places in 34 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1030 variables, 10/684 constraints. Problems are: Problem set: 0 solved, 31 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:35:44] [INFO ] Deduced a trap along path composed of 12 places in 52 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:35:47] [INFO ] Deduced a trap along path composed of 6 places in 79 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1030 variables, 2/686 constraints. Problems are: Problem set: 0 solved, 31 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:35:53] [INFO ] Deduced a trap along path composed of 8 places in 50 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1030/1030 variables, and 687 constraints, problems are : Problem set: 0 solved, 31 unsolved in 75016 ms.
Refiners :[State Equation: 529/529 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 24/24 constraints]
After SMT, in 88881ms problems are : Problem set: 0 solved, 31 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 47 out of 529 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 529/529 places, 501/501 transitions.
Applied a total of 0 rules in 33 ms. Remains 529 /529 variables (removed 0) and now considering 501/501 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 529/529 places, 501/501 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 529/529 places, 501/501 transitions.
Applied a total of 0 rules in 22 ms. Remains 529 /529 variables (removed 0) and now considering 501/501 (removed 0) transitions.
// Phase 1: matrix 501 rows 529 cols
[2025-06-01 01:35:54] [INFO ] Invariants computation overflowed in 74 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:35:55] [INFO ] Implicit Places using invariants in 680 ms returned []
// Phase 1: matrix 501 rows 529 cols
[2025-06-01 01:35:55] [INFO ] Invariants computation overflowed in 53 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:35:55] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-01 01:36:06] [INFO ] Implicit Places using invariants and state equation in 11546 ms returned [48, 82, 105, 112, 132, 138, 159, 164, 165, 188, 228, 236, 322, 327, 348, 353, 375, 381, 402, 410, 434, 438, 443, 465, 471, 493, 498, 502]
[2025-06-01 01:36:06] [INFO ] Actually due to overlaps returned [327, 82, 236, 164, 322, 228]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 12232 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 523/529 places, 501/501 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 523 transition count 499
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 521 transition count 499
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 521 transition count 499
Applied a total of 6 rules in 50 ms. Remains 521 /523 variables (removed 2) and now considering 499/501 (removed 2) transitions.
// Phase 1: matrix 499 rows 521 cols
[2025-06-01 01:36:06] [INFO ] Invariants computation overflowed in 63 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:36:06] [INFO ] Implicit Places using invariants in 309 ms returned []
// Phase 1: matrix 499 rows 521 cols
[2025-06-01 01:36:07] [INFO ] Invariants computation overflowed in 81 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:36:07] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-01 01:36:28] [INFO ] Implicit Places using invariants and state equation in 21818 ms returned [48, 104, 111, 131, 137, 158, 163, 186, 340, 345, 367, 373, 394, 402, 426, 430, 435, 457, 463, 485, 490, 494]
[2025-06-01 01:36:28] [INFO ] Actually due to overlaps returned [345, 111, 340, 430, 494, 104]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 22136 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 515/529 places, 499/501 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 515 transition count 496
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 512 transition count 496
Applied a total of 6 rules in 56 ms. Remains 512 /515 variables (removed 3) and now considering 496/499 (removed 3) transitions.
// Phase 1: matrix 496 rows 512 cols
[2025-06-01 01:36:28] [INFO ] Invariants computation overflowed in 36 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:36:29] [INFO ] Implicit Places using invariants in 484 ms returned []
// Phase 1: matrix 496 rows 512 cols
[2025-06-01 01:36:29] [INFO ] Invariants computation overflowed in 29 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:36:29] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-01 01:36:39] [INFO ] Implicit Places using invariants and state equation in 10487 ms returned [48, 128, 134, 155, 160, 183, 361, 367, 388, 396, 420, 428, 450, 456, 478, 483]
[2025-06-01 01:36:39] [INFO ] Actually due to overlaps returned [367, 134, 128, 361, 48]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 10992 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 507/529 places, 496/501 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 507 transition count 495
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 506 transition count 495
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 506 transition count 495
Applied a total of 3 rules in 42 ms. Remains 506 /507 variables (removed 1) and now considering 495/496 (removed 1) transitions.
// Phase 1: matrix 495 rows 506 cols
[2025-06-01 01:36:39] [INFO ] Invariants computation overflowed in 35 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:36:40] [INFO ] Implicit Places using invariants in 255 ms returned []
// Phase 1: matrix 495 rows 506 cols
[2025-06-01 01:36:40] [INFO ] Invariants computation overflowed in 35 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:36:40] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-01 01:36:50] [INFO ] Implicit Places using invariants and state equation in 10791 ms returned [151, 156, 179, 382, 390, 414, 422, 444, 450, 472, 477]
[2025-06-01 01:36:50] [INFO ] Actually due to overlaps returned [390, 156, 151, 382]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 11069 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 502/529 places, 495/501 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 502 transition count 493
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 500 transition count 493
Applied a total of 4 rules in 20 ms. Remains 500 /502 variables (removed 2) and now considering 493/495 (removed 2) transitions.
// Phase 1: matrix 493 rows 500 cols
[2025-06-01 01:36:50] [INFO ] Invariants computation overflowed in 31 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:36:51] [INFO ] Implicit Places using invariants in 340 ms returned []
// Phase 1: matrix 493 rows 500 cols
[2025-06-01 01:36:51] [INFO ] Invariants computation overflowed in 31 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:36:51] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-01 01:37:00] [INFO ] Implicit Places using invariants and state equation in 9140 ms returned [176, 408, 416, 438, 444, 466, 471]
[2025-06-01 01:37:00] [INFO ] Actually due to overlaps returned [416, 176, 408]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 9502 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 497/529 places, 493/501 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 497 transition count 492
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 496 transition count 492
Applied a total of 2 rules in 23 ms. Remains 496 /497 variables (removed 1) and now considering 492/493 (removed 1) transitions.
// Phase 1: matrix 492 rows 496 cols
[2025-06-01 01:37:00] [INFO ] Invariants computation overflowed in 47 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:37:00] [INFO ] Implicit Places using invariants in 403 ms returned []
// Phase 1: matrix 492 rows 496 cols
[2025-06-01 01:37:00] [INFO ] Invariants computation overflowed in 36 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:37:01] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-01 01:37:11] [INFO ] Implicit Places using invariants and state equation in 10708 ms returned [434, 440, 462, 467]
[2025-06-01 01:37:11] [INFO ] Actually due to overlaps returned [440, 434]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 11142 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 494/529 places, 492/501 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 494 transition count 491
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 493 transition count 491
Applied a total of 2 rules in 27 ms. Remains 493 /494 variables (removed 1) and now considering 491/492 (removed 1) transitions.
// Phase 1: matrix 491 rows 493 cols
[2025-06-01 01:37:11] [INFO ] Computed 73 invariants in 73 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:37:12] [INFO ] Implicit Places using invariants in 446 ms returned []
[2025-06-01 01:37:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:37:12] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-01 01:37:21] [INFO ] Implicit Places using invariants and state equation in 9121 ms returned [459, 464]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9571 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 491/529 places, 491/501 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 491 transition count 490
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 490 transition count 490
Applied a total of 2 rules in 25 ms. Remains 490 /491 variables (removed 1) and now considering 490/491 (removed 1) transitions.
// Phase 1: matrix 490 rows 490 cols
[2025-06-01 01:37:21] [INFO ] Computed 71 invariants in 99 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:37:21] [INFO ] Implicit Places using invariants in 332 ms returned []
[2025-06-01 01:37:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:37:21] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-01 01:37:29] [INFO ] Implicit Places using invariants and state equation in 8093 ms returned []
Implicit Place search using SMT with State Equation took 8452 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 490/529 places, 490/501 transitions.
Finished structural reductions in REACHABILITY mode , in 8 iterations and 95368 ms. Remains : 490/529 places, 490/501 transitions.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.13 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(G(p0)) U ((F(p1) U p2)||F(!p3))))))'
Support contains 6 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 32 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2025-06-01 01:37:30] [INFO ] Invariants computation overflowed in 104 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:37:30] [INFO ] Implicit Places using invariants in 441 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2025-06-01 01:37:30] [INFO ] Invariants computation overflowed in 120 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:37:43] [INFO ] Implicit Places using invariants and state equation in 13219 ms returned []
Implicit Place search using SMT with State Equation took 13686 ms to find 0 implicit places.
Running 996 sub problems to find dead transitions.
// Phase 1: matrix 997 rows 1057 cols
[2025-06-01 01:37:43] [INFO ] Invariants computation overflowed in 126 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1056 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 996 unsolved
SMT process timed out in 30317ms, After SMT, problems are : Problem set: 0 solved, 996 unsolved
Search for dead transitions found 0 dead transitions in 30342ms
Finished structural reductions in LTL mode , in 1 iterations and 44071 ms. Remains : 1057/1057 places, 997/997 transitions.
Stuttering acceptance computed with spot in 363 ms :[(AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p1) p3 (NOT p0)), (AND (NOT p2) p3)]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-00
Product exploration explored 100000 steps with 3289 reset in 327 ms.
Product exploration explored 100000 steps with 3321 reset in 193 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND (NOT p2) (NOT p1) p3))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) p3 (NOT p0))))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) p3 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p3)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 83 ms. Reduced automaton from 4 states, 8 edges and 4 AP (stutter sensitive) to 3 states, 7 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p2) p3), (AND p3 (NOT p1) (NOT p0)), (AND (NOT p2) p3)]
RANDOM walk for 40000 steps (1348 resets) in 280 ms. (142 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (1127 resets) in 142 ms. (279 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (1148 resets) in 130 ms. (305 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (1154 resets) in 189 ms. (210 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (1146 resets) in 156 ms. (254 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (1145 resets) in 142 ms. (279 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (1138 resets) in 176 ms. (225 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (1094 resets) in 177 ms. (224 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (1124 resets) in 132 ms. (300 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 175828 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :4 out of 8
Probabilistic random walk after 175828 steps, saw 87940 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :4
// Phase 1: matrix 997 rows 1057 cols
[2025-06-01 01:38:18] [INFO ] Invariants computation overflowed in 107 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 69/94 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 144/238 variables, 59/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 227/465 variables, 110/205 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/465 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 303/768 variables, 145/350 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 260/1028 variables, 156/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:19] [INFO ] Deduced a trap along path composed of 17 places in 45 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1028 variables, 1/507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1028 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 146/1174 variables, 83/590 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:19] [INFO ] Deduced a trap composed of 59 places in 141 ms of which 35 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1174 variables, 1/591 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:20] [INFO ] Deduced a trap along path composed of 16 places in 42 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1174 variables, 1/592 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1174 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 80/1254 variables, 50/642 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:20] [INFO ] Deduced a trap composed of 41 places in 152 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:20] [INFO ] Deduced a trap composed of 61 places in 139 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:20] [INFO ] Deduced a trap composed of 67 places in 139 ms of which 20 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1254 variables, 3/645 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1254 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (OVERLAPS) 50/1304 variables, 25/670 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1304 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 53/1357 variables, 28/698 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1357 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 50/1407 variables, 25/723 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1407 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 53/1460 variables, 28/751 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1460 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 50/1510 variables, 25/776 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1510 variables, 0/776 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (OVERLAPS) 53/1563 variables, 28/804 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1563 variables, 0/804 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (OVERLAPS) 50/1613 variables, 25/829 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1613 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (OVERLAPS) 53/1666 variables, 28/857 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1666 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (OVERLAPS) 50/1716 variables, 25/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1716 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (OVERLAPS) 53/1769 variables, 28/910 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1769 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (OVERLAPS) 50/1819 variables, 25/935 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1819 variables, 0/935 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (OVERLAPS) 53/1872 variables, 28/963 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1872 variables, 0/963 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (OVERLAPS) 51/1923 variables, 25/988 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1923 variables, 0/988 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (OVERLAPS) 55/1978 variables, 30/1018 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1978 variables, 0/1018 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (OVERLAPS) 35/2013 variables, 21/1039 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/2013 variables, 0/1039 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (OVERLAPS) 21/2034 variables, 11/1050 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/2034 variables, 0/1050 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (OVERLAPS) 11/2045 variables, 8/1058 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/2045 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (OVERLAPS) 4/2049 variables, 2/1060 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/2049 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (OVERLAPS) 4/2053 variables, 2/1062 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/2053 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 59 (OVERLAPS) 1/2054 variables, 1/1063 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2054/2054 variables, and 1063 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5026 ms.
Refiners :[State Equation: 1057/1057 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 69/94 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 144/238 variables, 59/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 227/465 variables, 110/209 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/465 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 303/768 variables, 145/354 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/768 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 260/1028 variables, 156/510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1028 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1028 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 146/1174 variables, 83/594 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1174 variables, 4/598 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1174 variables, 1/599 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:24] [INFO ] Deduced a trap along path composed of 17 places in 48 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:24] [INFO ] Deduced a trap along path composed of 16 places in 47 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:25] [INFO ] Deduced a trap along path composed of 14 places in 54 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:25] [INFO ] Deduced a trap along path composed of 10 places in 59 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:25] [INFO ] Deduced a trap along path composed of 17 places in 48 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:25] [INFO ] Deduced a trap along path composed of 8 places in 56 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:25] [INFO ] Deduced a trap along path composed of 6 places in 57 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:25] [INFO ] Deduced a trap along path composed of 16 places in 46 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:25] [INFO ] Deduced a trap along path composed of 24 places in 42 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:26] [INFO ] Deduced a trap along path composed of 16 places in 48 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1174 variables, 10/609 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:26] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 11 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1174 variables, 1/610 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1174 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 80/1254 variables, 50/660 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:27] [INFO ] Deduced a trap composed of 73 places in 129 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:27] [INFO ] Deduced a trap composed of 77 places in 116 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:27] [INFO ] Deduced a trap composed of 89 places in 119 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:27] [INFO ] Deduced a trap composed of 103 places in 107 ms of which 17 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1254 variables, 4/664 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:28] [INFO ] Deduced a trap composed of 65 places in 120 ms of which 18 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1254 variables, 1/665 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:28] [INFO ] Deduced a trap composed of 85 places in 120 ms of which 20 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1254 variables, 1/666 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1254/2054 variables, and 666 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5014 ms.
Refiners :[State Equation: 639/1057 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 12/12 constraints]
After SMT, in 10165ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 1057 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 233 transitions
Trivial Post-agglo rules discarded 233 transitions
Performed 233 trivial Post agglomeration. Transition count delta: 233
Iterating post reduction 0 with 234 rules applied. Total rules applied 235 place count 1055 transition count 762
Reduce places removed 233 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 236 rules applied. Total rules applied 471 place count 822 transition count 759
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 474 place count 819 transition count 759
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 474 place count 819 transition count 719
Deduced a syphon composed of 40 places in 7 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 554 place count 779 transition count 719
Performed 183 Post agglomeration using F-continuation condition.Transition count delta: 183
Deduced a syphon composed of 183 places in 3 ms
Reduce places removed 183 places and 0 transitions.
Iterating global reduction 3 with 366 rules applied. Total rules applied 920 place count 596 transition count 536
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 36 places in 3 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 992 place count 560 transition count 536
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 3 with 77 rules applied. Total rules applied 1069 place count 560 transition count 459
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 3 with 77 rules applied. Total rules applied 1146 place count 483 transition count 459
Partial Free-agglomeration rule applied 83 times.
Drop transitions (Partial Free agglomeration) removed 83 transitions
Iterating global reduction 4 with 83 rules applied. Total rules applied 1229 place count 483 transition count 459
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1230 place count 482 transition count 458
Applied a total of 1230 rules in 107 ms. Remains 482 /1057 variables (removed 575) and now considering 458/997 (removed 539) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 482/1057 places, 458/997 transitions.
RANDOM walk for 40000 steps (4549 resets) in 117 ms. (338 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3075 resets) in 123 ms. (322 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3126 resets) in 115 ms. (344 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3150 resets) in 124 ms. (320 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3070 resets) in 83 ms. (476 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 249550 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :0 out of 4
Probabilistic random walk after 249550 steps, saw 124829 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
// Phase 1: matrix 458 rows 482 cols
[2025-06-01 01:38:32] [INFO ] Computed 99 invariants in 66 ms
[2025-06-01 01:38:32] [INFO ] State equation strengthened by 78 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 155/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf3 is UNSAT
At refinement iteration 3 (OVERLAPS) 306/467 variables, 92/93 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:32] [INFO ] Deduced a trap composed of 8 places in 252 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:32] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:33] [INFO ] Deduced a trap composed of 10 places in 205 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:33] [INFO ] Deduced a trap composed of 11 places in 232 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:33] [INFO ] Deduced a trap composed of 12 places in 203 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:33] [INFO ] Deduced a trap composed of 14 places in 205 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:34] [INFO ] Deduced a trap composed of 14 places in 207 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:34] [INFO ] Deduced a trap composed of 17 places in 214 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:34] [INFO ] Deduced a trap composed of 19 places in 216 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:34] [INFO ] Deduced a trap composed of 23 places in 217 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:35] [INFO ] Deduced a trap composed of 25 places in 205 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:35] [INFO ] Deduced a trap composed of 26 places in 198 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:35] [INFO ] Deduced a trap composed of 30 places in 222 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:35] [INFO ] Deduced a trap composed of 94 places in 272 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:35] [INFO ] Deduced a trap composed of 23 places in 217 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:36] [INFO ] Deduced a trap composed of 27 places in 222 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:36] [INFO ] Deduced a trap composed of 17 places in 232 ms of which 24 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/467 variables, 17/110 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:36] [INFO ] Deduced a trap composed of 31 places in 149 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:36] [INFO ] Deduced a trap composed of 34 places in 142 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:37] [INFO ] Deduced a trap composed of 36 places in 144 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:37] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:37] [INFO ] Deduced a trap composed of 31 places in 219 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:37] [INFO ] Deduced a trap composed of 20 places in 209 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:37] [INFO ] Deduced a trap composed of 16 places in 202 ms of which 19 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/467 variables, 7/117 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:38] [INFO ] Deduced a trap composed of 18 places in 162 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:38] [INFO ] Deduced a trap composed of 32 places in 157 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:38] [INFO ] Deduced a trap composed of 96 places in 274 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:38] [INFO ] Deduced a trap composed of 95 places in 270 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:39] [INFO ] Deduced a trap composed of 96 places in 281 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:39] [INFO ] Deduced a trap composed of 96 places in 274 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:39] [INFO ] Deduced a trap composed of 95 places in 287 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:40] [INFO ] Deduced a trap composed of 96 places in 281 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:40] [INFO ] Deduced a trap composed of 95 places in 277 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:40] [INFO ] Deduced a trap composed of 97 places in 287 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:41] [INFO ] Deduced a trap composed of 97 places in 288 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:41] [INFO ] Deduced a trap composed of 95 places in 303 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:41] [INFO ] Deduced a trap composed of 96 places in 294 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:41] [INFO ] Deduced a trap composed of 96 places in 284 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:42] [INFO ] Deduced a trap composed of 95 places in 264 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:42] [INFO ] Deduced a trap composed of 96 places in 280 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:42] [INFO ] Deduced a trap composed of 96 places in 247 ms of which 64 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 17/134 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:43] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:43] [INFO ] Deduced a trap composed of 40 places in 121 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:43] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:43] [INFO ] Deduced a trap composed of 43 places in 124 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:43] [INFO ] Deduced a trap composed of 44 places in 126 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:43] [INFO ] Deduced a trap composed of 74 places in 131 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:43] [INFO ] Deduced a trap composed of 43 places in 128 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:44] [INFO ] Deduced a trap composed of 96 places in 275 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:44] [INFO ] Deduced a trap composed of 94 places in 272 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:44] [INFO ] Deduced a trap composed of 95 places in 270 ms of which 79 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/467 variables, 10/144 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/467 variables, 0/144 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 10/477 variables, 4/148 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:45] [INFO ] Deduced a trap composed of 20 places in 144 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:45] [INFO ] Deduced a trap composed of 22 places in 162 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:45] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 11 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/477 variables, 3/151 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:45] [INFO ] Deduced a trap composed of 21 places in 152 ms of which 12 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 1/152 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/477 variables, 0/152 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 458/935 variables, 477/629 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/935 variables, 78/707 constraints. Problems are: Problem set: 1 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/935 variables, 0/707 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 5/940 variables, 5/712 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/940 variables, 2/714 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/940 variables, 0/714 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/940 variables, 0/714 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 940/940 variables, and 714 constraints, problems are : Problem set: 1 solved, 3 unsolved in 15217 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 96/96 constraints, State Equation: 482/482 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 55/55 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 155/159 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 306/465 variables, 91/92 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/465 variables, 51/143 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 0/143 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 12/477 variables, 5/148 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/477 variables, 4/152 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:47] [INFO ] Deduced a trap composed of 8 places in 176 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:48] [INFO ] Deduced a trap composed of 15 places in 216 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:48] [INFO ] Deduced a trap composed of 28 places in 208 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:48] [INFO ] Deduced a trap composed of 29 places in 224 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:48] [INFO ] Deduced a trap composed of 80 places in 267 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:49] [INFO ] Deduced a trap composed of 87 places in 274 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:49] [INFO ] Deduced a trap composed of 89 places in 281 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:49] [INFO ] Deduced a trap composed of 90 places in 277 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:50] [INFO ] Deduced a trap composed of 92 places in 286 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:50] [INFO ] Deduced a trap composed of 83 places in 264 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:50] [INFO ] Deduced a trap composed of 90 places in 375 ms of which 171 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:51] [INFO ] Deduced a trap composed of 91 places in 403 ms of which 203 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:51] [INFO ] Deduced a trap composed of 93 places in 302 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:51] [INFO ] Deduced a trap composed of 94 places in 298 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:52] [INFO ] Deduced a trap composed of 83 places in 267 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:52] [INFO ] Deduced a trap composed of 93 places in 285 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:52] [INFO ] Deduced a trap composed of 94 places in 266 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:52] [INFO ] Deduced a trap composed of 90 places in 280 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:53] [INFO ] Deduced a trap composed of 93 places in 277 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:53] [INFO ] Deduced a trap composed of 93 places in 272 ms of which 73 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/477 variables, 20/172 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:53] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:53] [INFO ] Deduced a trap composed of 45 places in 116 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:54] [INFO ] Deduced a trap composed of 46 places in 116 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:54] [INFO ] Deduced a trap composed of 47 places in 122 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:54] [INFO ] Deduced a trap composed of 48 places in 128 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:54] [INFO ] Deduced a trap composed of 73 places in 114 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:54] [INFO ] Deduced a trap composed of 83 places in 253 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:55] [INFO ] Deduced a trap composed of 93 places in 265 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:55] [INFO ] Deduced a trap composed of 95 places in 285 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:55] [INFO ] Deduced a trap composed of 96 places in 280 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:55] [INFO ] Deduced a trap composed of 93 places in 292 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:56] [INFO ] Deduced a trap composed of 93 places in 280 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:56] [INFO ] Deduced a trap composed of 94 places in 295 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:56] [INFO ] Deduced a trap composed of 91 places in 317 ms of which 113 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:57] [INFO ] Deduced a trap composed of 93 places in 304 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:57] [INFO ] Deduced a trap composed of 93 places in 263 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:57] [INFO ] Deduced a trap composed of 94 places in 343 ms of which 148 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:58] [INFO ] Deduced a trap composed of 93 places in 269 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:58] [INFO ] Deduced a trap composed of 94 places in 279 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:58] [INFO ] Deduced a trap composed of 81 places in 279 ms of which 77 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/477 variables, 20/192 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:59] [INFO ] Deduced a trap composed of 90 places in 264 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:59] [INFO ] Deduced a trap composed of 96 places in 260 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:38:59] [INFO ] Deduced a trap composed of 85 places in 298 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:39:00] [INFO ] Deduced a trap composed of 91 places in 285 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:39:00] [INFO ] Deduced a trap composed of 94 places in 257 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:39:00] [INFO ] Deduced a trap composed of 94 places in 272 ms of which 87 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/477 variables, 6/198 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:39:00] [INFO ] Deduced a trap composed of 40 places in 121 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:39:01] [INFO ] Deduced a trap composed of 82 places in 265 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:39:01] [INFO ] Deduced a trap composed of 86 places in 266 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:39:01] [INFO ] Deduced a trap composed of 92 places in 299 ms of which 100 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 4/202 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/477 variables, 0/202 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 458/935 variables, 477/679 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/935 variables, 78/757 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/935 variables, 3/760 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:39:03] [INFO ] Deduced a trap composed of 26 places in 163 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:39:04] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:39:04] [INFO ] Deduced a trap composed of 96 places in 192 ms of which 29 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/935 variables, 3/763 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/935 variables, 0/763 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 5/940 variables, 5/768 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/940 variables, 2/770 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/940 variables, 0/770 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/940 variables, 0/770 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 940/940 variables, and 770 constraints, problems are : Problem set: 1 solved, 3 unsolved in 19000 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 96/96 constraints, State Equation: 482/482 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 108/108 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34299ms problems are : Problem set: 1 solved, 3 unsolved
Parikh walk visited 0 properties in 39873 ms.
Support contains 4 out of 482 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 482/482 places, 458/458 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 482 transition count 457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 481 transition count 457
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 4 place count 480 transition count 457
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 480 transition count 457
Applied a total of 5 rules in 38 ms. Remains 480 /482 variables (removed 2) and now considering 457/458 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 480/482 places, 457/458 transitions.
RANDOM walk for 40000 steps (5519 resets) in 100 ms. (396 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (3551 resets) in 72 ms. (547 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (3584 resets) in 75 ms. (526 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (3514 resets) in 70 ms. (563 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 309232 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :0 out of 3
Probabilistic random walk after 309232 steps, saw 154714 distinct states, run finished after 3001 ms. (steps per millisecond=103 ) properties seen :0
// Phase 1: matrix 457 rows 480 cols
[2025-06-01 01:39:49] [INFO ] Invariants computation overflowed in 41 ms
[2025-06-01 01:39:49] [INFO ] State equation strengthened by 81 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 13/17 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 170/187 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 530/717 variables, 263/305 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/717 variables, 53/358 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/717 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 220/937 variables, 176/534 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/937 variables, 27/561 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/937 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/937 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 937/937 variables, and 561 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1746 ms.
Refiners :[State Equation: 480/480 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 13/17 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 170/187 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 530/717 variables, 263/308 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/717 variables, 53/361 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:39:51] [INFO ] Deduced a trap along path composed of 12 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-01 01:39:51] [INFO ] Deduced a trap along path composed of 19 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:39:51] [INFO ] Deduced a trap along path composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/717 variables, 3/364 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/717 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 220/937 variables, 176/540 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/937 variables, 27/567 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:39:52] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:39:53] [INFO ] Deduced a trap composed of 14 places in 155 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:39:53] [INFO ] Deduced a trap composed of 13 places in 177 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:39:53] [INFO ] Deduced a trap composed of 28 places in 156 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:39:53] [INFO ] Deduced a trap composed of 21 places in 162 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:39:53] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 13 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/937 variables, 6/573 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:39:54] [INFO ] Deduced a trap composed of 32 places in 128 ms of which 8 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/937 variables, 1/574 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:39:54] [INFO ] Deduced a trap composed of 74 places in 126 ms of which 12 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/937 variables, 1/575 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:39:55] [INFO ] Deduced a trap along path composed of 9 places in 42 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:39:55] [INFO ] Deduced a trap along path composed of 4 places in 41 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:39:55] [INFO ] Deduced a trap along path composed of 8 places in 46 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:39:55] [INFO ] Deduced a trap along path composed of 4 places in 47 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:39:55] [INFO ] Deduced a trap along path composed of 6 places in 44 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/937 variables, 5/580 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/937 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/937 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 937/937 variables, and 580 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5041 ms.
Refiners :[State Equation: 480/480 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 6838ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 30000 ms.
Support contains 4 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 457/457 transitions.
Applied a total of 0 rules in 10 ms. Remains 480 /480 variables (removed 0) and now considering 457/457 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 480/480 places, 457/457 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 457/457 transitions.
Applied a total of 0 rules in 9 ms. Remains 480 /480 variables (removed 0) and now considering 457/457 (removed 0) transitions.
// Phase 1: matrix 457 rows 480 cols
[2025-06-01 01:40:26] [INFO ] Invariants computation overflowed in 36 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:40:26] [INFO ] Implicit Places using invariants in 355 ms returned []
// Phase 1: matrix 457 rows 480 cols
[2025-06-01 01:40:26] [INFO ] Invariants computation overflowed in 39 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:40:27] [INFO ] State equation strengthened by 81 read => feed constraints.
[2025-06-01 01:40:47] [INFO ] Implicit Places using invariants and state equation in 20352 ms returned [42, 48, 70, 75, 96, 101, 121, 127, 148, 153, 154, 175, 203, 209, 217, 231, 237, 260, 266, 288, 293, 313, 318, 339, 344, 365, 371, 392, 394, 398, 418, 424, 446, 451, 455, 472, 478]
[2025-06-01 01:40:47] [INFO ] Actually due to overlaps returned [209, 217, 153, 203]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 20716 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 476/480 places, 457/457 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 476 transition count 455
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 474 transition count 455
Applied a total of 4 rules in 21 ms. Remains 474 /476 variables (removed 2) and now considering 455/457 (removed 2) transitions.
// Phase 1: matrix 455 rows 474 cols
[2025-06-01 01:40:47] [INFO ] Computed 95 invariants in 52 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:40:51] [INFO ] Implicit Places using invariants in 4427 ms returned [42, 48, 70, 75, 96, 101, 121, 127, 148, 153, 174, 225, 231, 254, 260, 282, 287, 307, 312, 333, 338, 359, 365, 386, 388, 392, 412, 418, 440, 445, 449, 466, 472]
[2025-06-01 01:40:51] [INFO ] Actually due to overlaps returned [231, 449, 388, 225]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 4429 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 470/480 places, 455/457 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 470 transition count 453
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 468 transition count 453
Applied a total of 4 rules in 21 ms. Remains 468 /470 variables (removed 2) and now considering 453/455 (removed 2) transitions.
// Phase 1: matrix 453 rows 468 cols
[2025-06-01 01:40:51] [INFO ] Computed 91 invariants in 59 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:40:54] [INFO ] Implicit Places using invariants in 3228 ms returned [42, 48, 70, 75, 96, 101, 121, 127, 148, 153, 174, 251, 257, 279, 284, 304, 309, 330, 335, 356, 362, 383, 388, 408, 414, 436, 441, 460, 466]
[2025-06-01 01:40:54] [INFO ] Actually due to overlaps returned [257, 48, 42, 251]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 3235 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 464/480 places, 453/457 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 464 transition count 451
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 462 transition count 451
Applied a total of 4 rules in 20 ms. Remains 462 /464 variables (removed 2) and now considering 451/453 (removed 2) transitions.
// Phase 1: matrix 451 rows 462 cols
[2025-06-01 01:40:54] [INFO ] Invariants computation overflowed in 31 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:40:55] [INFO ] Implicit Places using invariants in 280 ms returned []
// Phase 1: matrix 451 rows 462 cols
[2025-06-01 01:40:55] [INFO ] Invariants computation overflowed in 31 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:40:55] [INFO ] State equation strengthened by 81 read => feed constraints.
[2025-06-01 01:41:07] [INFO ] Implicit Places using invariants and state equation in 12089 ms returned [67, 72, 93, 98, 118, 124, 145, 150, 171, 273, 278, 298, 303, 324, 329, 350, 356, 377, 382, 402, 408, 430, 435, 454, 460]
[2025-06-01 01:41:07] [INFO ] Actually due to overlaps returned [278, 72, 67, 273]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 12373 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 458/480 places, 451/457 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 458 transition count 449
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 456 transition count 449
Applied a total of 4 rules in 21 ms. Remains 456 /458 variables (removed 2) and now considering 449/451 (removed 2) transitions.
// Phase 1: matrix 449 rows 456 cols
[2025-06-01 01:41:07] [INFO ] Invariants computation overflowed in 31 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:41:07] [INFO ] Implicit Places using invariants in 266 ms returned []
// Phase 1: matrix 449 rows 456 cols
[2025-06-01 01:41:07] [INFO ] Invariants computation overflowed in 36 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:41:07] [INFO ] State equation strengthened by 81 read => feed constraints.
[2025-06-01 01:41:17] [INFO ] Implicit Places using invariants and state equation in 9886 ms returned [90, 95, 115, 121, 142, 147, 168, 292, 297, 318, 323, 344, 350, 371, 376, 396, 402, 424, 429, 448, 454]
[2025-06-01 01:41:17] [INFO ] Actually due to overlaps returned [297, 95, 90, 292]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 10164 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 452/480 places, 449/457 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 452 transition count 447
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 450 transition count 447
Applied a total of 4 rules in 20 ms. Remains 450 /452 variables (removed 2) and now considering 447/449 (removed 2) transitions.
// Phase 1: matrix 447 rows 450 cols
[2025-06-01 01:41:17] [INFO ] Invariants computation overflowed in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:41:17] [INFO ] Implicit Places using invariants in 263 ms returned []
// Phase 1: matrix 447 rows 450 cols
[2025-06-01 01:41:17] [INFO ] Invariants computation overflowed in 27 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:41:17] [INFO ] State equation strengthened by 81 read => feed constraints.
[2025-06-01 01:41:28] [INFO ] Implicit Places using invariants and state equation in 10678 ms returned [112, 118, 139, 144, 165, 312, 317, 338, 344, 365, 370, 390, 396, 418, 423, 442, 448]
[2025-06-01 01:41:28] [INFO ] Actually due to overlaps returned [317, 118, 112, 312]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 10943 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 446/480 places, 447/457 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 446 transition count 445
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 444 transition count 445
Applied a total of 4 rules in 24 ms. Remains 444 /446 variables (removed 2) and now considering 445/447 (removed 2) transitions.
// Phase 1: matrix 445 rows 444 cols
[2025-06-01 01:41:28] [INFO ] Invariants computation overflowed in 30 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:41:28] [INFO ] Implicit Places using invariants in 271 ms returned []
// Phase 1: matrix 445 rows 444 cols
[2025-06-01 01:41:28] [INFO ] Invariants computation overflowed in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:41:28] [INFO ] State equation strengthened by 81 read => feed constraints.
[2025-06-01 01:41:36] [INFO ] Implicit Places using invariants and state equation in 7936 ms returned [136, 141, 162, 332, 338, 359, 364, 384, 390, 412, 417, 436, 442]
[2025-06-01 01:41:36] [INFO ] Actually due to overlaps returned [338, 141, 136, 332]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 8214 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 440/480 places, 445/457 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 440 transition count 443
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 438 transition count 443
Applied a total of 4 rules in 21 ms. Remains 438 /440 variables (removed 2) and now considering 443/445 (removed 2) transitions.
// Phase 1: matrix 443 rows 438 cols
[2025-06-01 01:41:36] [INFO ] Invariants computation overflowed in 34 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:41:36] [INFO ] Implicit Places using invariants in 261 ms returned []
// Phase 1: matrix 443 rows 438 cols
[2025-06-01 01:41:36] [INFO ] Invariants computation overflowed in 36 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:41:37] [INFO ] State equation strengthened by 81 read => feed constraints.
[2025-06-01 01:41:49] [INFO ] Implicit Places using invariants and state equation in 12226 ms returned [159, 353, 358, 378, 384, 406, 411, 430, 436]
[2025-06-01 01:41:49] [INFO ] Actually due to overlaps returned [358, 159, 353]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 12490 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 435/480 places, 443/457 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 435 transition count 442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 434 transition count 442
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 434 transition count 442
Applied a total of 3 rules in 27 ms. Remains 434 /435 variables (removed 1) and now considering 442/443 (removed 1) transitions.
// Phase 1: matrix 442 rows 434 cols
[2025-06-01 01:41:49] [INFO ] Invariants computation overflowed in 49 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:41:49] [INFO ] Implicit Places using invariants in 276 ms returned []
// Phase 1: matrix 442 rows 434 cols
[2025-06-01 01:41:49] [INFO ] Invariants computation overflowed in 45 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:41:49] [INFO ] State equation strengthened by 81 read => feed constraints.
[2025-06-01 01:41:55] [INFO ] Implicit Places using invariants and state equation in 6184 ms returned [374, 380, 402, 407, 426, 432]
[2025-06-01 01:41:55] [INFO ] Actually due to overlaps returned [380, 374]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 6464 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 432/480 places, 442/457 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 432 transition count 441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 431 transition count 441
Applied a total of 2 rules in 19 ms. Remains 431 /432 variables (removed 1) and now considering 441/442 (removed 1) transitions.
// Phase 1: matrix 441 rows 431 cols
[2025-06-01 01:41:55] [INFO ] Computed 66 invariants in 61 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:41:57] [INFO ] Implicit Places using invariants in 1514 ms returned [399, 404, 423, 429]
[2025-06-01 01:41:57] [INFO ] Actually due to overlaps returned [404, 399]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1516 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 429/480 places, 441/457 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 429 transition count 440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 428 transition count 440
Applied a total of 2 rules in 17 ms. Remains 428 /429 variables (removed 1) and now considering 440/441 (removed 1) transitions.
// Phase 1: matrix 440 rows 428 cols
[2025-06-01 01:41:57] [INFO ] Computed 64 invariants in 60 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:41:58] [INFO ] Implicit Places using invariants in 1566 ms returned [420, 426]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1570 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 11 : 426/480 places, 440/457 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 426 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 425 transition count 439
Applied a total of 2 rules in 15 ms. Remains 425 /426 variables (removed 1) and now considering 439/440 (removed 1) transitions.
// Phase 1: matrix 439 rows 425 cols
[2025-06-01 01:41:58] [INFO ] Invariants computation overflowed in 49 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:41:59] [INFO ] Implicit Places using invariants in 258 ms returned []
// Phase 1: matrix 439 rows 425 cols
[2025-06-01 01:41:59] [INFO ] Invariants computation overflowed in 45 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:41:59] [INFO ] State equation strengthened by 81 read => feed constraints.
[2025-06-01 01:42:07] [INFO ] Implicit Places using invariants and state equation in 8274 ms returned []
Implicit Place search using SMT with State Equation took 8534 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 12 : 425/480 places, 439/457 transitions.
Finished structural reductions in REACHABILITY mode , in 12 iterations and 100886 ms. Remains : 425/480 places, 439/457 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND (NOT p2) (NOT p1) p3))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) p3 (NOT p0))))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) p3 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p3)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p3) p1 (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR p2 (NOT p3)))), (F (NOT (OR (NOT p3) p1 p0))), (F (NOT (OR p2 (NOT p3) p1))), (F p3)]
Knowledge based reduction with 15 factoid took 214 ms. Reduced automaton from 3 states, 7 edges and 4 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p2) p3), (AND (NOT p1) p3), (AND (NOT p2) p3)]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p2) p3), (AND (NOT p1) p3), (AND (NOT p2) p3)]
Support contains 4 out of 1057 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 233 transitions
Trivial Post-agglo rules discarded 233 transitions
Performed 233 trivial Post agglomeration. Transition count delta: 233
Iterating post reduction 0 with 233 rules applied. Total rules applied 234 place count 1055 transition count 762
Reduce places removed 233 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 236 rules applied. Total rules applied 470 place count 822 transition count 759
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 473 place count 819 transition count 759
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 473 place count 819 transition count 720
Deduced a syphon composed of 39 places in 6 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 551 place count 780 transition count 720
Performed 183 Post agglomeration using F-continuation condition.Transition count delta: 183
Deduced a syphon composed of 183 places in 2 ms
Reduce places removed 183 places and 0 transitions.
Iterating global reduction 3 with 366 rules applied. Total rules applied 917 place count 597 transition count 537
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 989 place count 561 transition count 537
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 990 place count 560 transition count 536
Applied a total of 990 rules in 85 ms. Remains 560 /1057 variables (removed 497) and now considering 536/997 (removed 461) transitions.
// Phase 1: matrix 536 rows 560 cols
[2025-06-01 01:42:07] [INFO ] Computed 99 invariants in 57 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:42:08] [INFO ] Implicit Places using invariants in 323 ms returned []
[2025-06-01 01:42:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:42:08] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-06-01 01:42:18] [INFO ] Implicit Places using invariants and state equation in 10680 ms returned []
Implicit Place search using SMT with State Equation took 11009 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 01:42:18] [INFO ] Redundant transitions in 37 ms returned []
Running 535 sub problems to find dead transitions.
[2025-06-01 01:42:18] [INFO ] Invariant cache hit.
[2025-06-01 01:42:18] [INFO ] State equation strengthened by 37 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/559 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/559 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/559 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 3 (OVERLAPS) 536/1095 variables, 559/658 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1095 variables, 37/695 constraints. Problems are: Problem set: 0 solved, 535 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1095/1096 variables, and 695 constraints, problems are : Problem set: 0 solved, 535 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 559/560 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 535/535 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 535 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/559 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/559 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/559 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 3 (OVERLAPS) 536/1095 variables, 559/658 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1095 variables, 37/695 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1095 variables, 532/1227 constraints. Problems are: Problem set: 0 solved, 535 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1095/1096 variables, and 1227 constraints, problems are : Problem set: 0 solved, 535 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 559/560 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 532/535 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60103ms problems are : Problem set: 0 solved, 535 unsolved
Search for dead transitions found 0 dead transitions in 60105ms
Starting structural reductions in SI_LTL mode, iteration 1 : 560/1057 places, 536/997 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71251 ms. Remains : 560/1057 places, 536/997 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1741 edges and 560 vertex of which 559 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p1) p3 (NOT p2)))), (X (NOT (AND p3 (NOT p2)))), (X (NOT (AND (NOT p1) p3))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) p3 (NOT p2))))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 134 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p2) p3), (AND p3 (NOT p1)), (AND (NOT p2) p3)]
RANDOM walk for 40000 steps (4559 resets) in 107 ms. (370 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (2939 resets) in 88 ms. (449 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (2855 resets) in 118 ms. (336 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (2882 resets) in 87 ms. (454 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (2854 resets) in 75 ms. (526 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (2907 resets) in 80 ms. (493 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (2904 resets) in 101 ms. (392 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 284345 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :4 out of 6
Probabilistic random walk after 284345 steps, saw 142233 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) properties seen :4
[2025-06-01 01:43:22] [INFO ] Invariant cache hit.
[2025-06-01 01:43:22] [INFO ] State equation strengthened by 37 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 165/167 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 179/346 variables, 59/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 45/391 variables, 9/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:22] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 40/431 variables, 10/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 51/482 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/482 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 20/502 variables, 10/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/502 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 526/1028 variables, 502/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1028 variables, 35/633 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1028 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1090/1096 variables, and 686 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2605 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 95/97 constraints, State Equation: 555/560 constraints, ReadFeed: 35/37 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 165/167 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 179/346 variables, 59/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 45/391 variables, 9/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 40/431 variables, 10/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 51/482 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/482 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 20/502 variables, 10/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/502 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 526/1028 variables, 502/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1028 variables, 35/633 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1028 variables, 2/635 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:25] [INFO ] Deduced a trap along path composed of 2 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:25] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:25] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1028 variables, 3/638 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1028 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1090/1096 variables, and 691 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2726 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 95/97 constraints, State Equation: 555/560 constraints, ReadFeed: 35/37 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 5341ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 560 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 560/560 places, 536/536 transitions.
Graph (complete) has 1663 edges and 560 vertex of which 559 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 559 transition count 533
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 557 transition count 533
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 555 transition count 531
Free-agglomeration rule (complex) applied 79 times.
Iterating global reduction 2 with 79 rules applied. Total rules applied 89 place count 555 transition count 452
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 2 with 79 rules applied. Total rules applied 168 place count 476 transition count 452
Partial Free-agglomeration rule applied 80 times.
Drop transitions (Partial Free agglomeration) removed 80 transitions
Iterating global reduction 3 with 80 rules applied. Total rules applied 248 place count 476 transition count 452
Applied a total of 248 rules in 52 ms. Remains 476 /560 variables (removed 84) and now considering 452/536 (removed 84) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 476/560 places, 452/536 transitions.
RANDOM walk for 40000 steps (5052 resets) in 80 ms. (493 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3343 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3338 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 310126 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :0 out of 2
Probabilistic random walk after 310126 steps, saw 155140 distinct states, run finished after 3001 ms. (steps per millisecond=103 ) properties seen :0
// Phase 1: matrix 452 rows 476 cols
[2025-06-01 01:43:31] [INFO ] Computed 99 invariants in 45 ms
[2025-06-01 01:43:31] [INFO ] State equation strengthened by 79 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 282/284 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:31] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:31] [INFO ] Deduced a trap composed of 9 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-01 01:43:31] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:31] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/284 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 184/468 variables, 71/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:31] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:32] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:32] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:32] [INFO ] Deduced a trap composed of 10 places in 246 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:32] [INFO ] Deduced a trap composed of 13 places in 275 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:33] [INFO ] Deduced a trap composed of 17 places in 276 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:33] [INFO ] Deduced a trap composed of 78 places in 707 ms of which 453 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:34] [INFO ] Deduced a trap composed of 18 places in 248 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:34] [INFO ] Deduced a trap composed of 78 places in 398 ms of which 151 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:34] [INFO ] Deduced a trap composed of 16 places in 278 ms of which 24 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 10/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:34] [INFO ] Deduced a trap composed of 16 places in 151 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:35] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:35] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:35] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:35] [INFO ] Deduced a trap composed of 22 places in 142 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:35] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:35] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:35] [INFO ] Deduced a trap composed of 25 places in 137 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:36] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:36] [INFO ] Deduced a trap composed of 26 places in 134 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:36] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:36] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:36] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:36] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:36] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:37] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:37] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:37] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:37] [INFO ] Deduced a trap composed of 40 places in 109 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:37] [INFO ] Deduced a trap composed of 40 places in 113 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 20/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:37] [INFO ] Deduced a trap composed of 43 places in 116 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:37] [INFO ] Deduced a trap composed of 43 places in 115 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:37] [INFO ] Deduced a trap composed of 44 places in 113 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:38] [INFO ] Deduced a trap composed of 46 places in 116 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:38] [INFO ] Deduced a trap composed of 49 places in 117 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:38] [INFO ] Deduced a trap composed of 50 places in 113 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:38] [INFO ] Deduced a trap composed of 51 places in 115 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:38] [INFO ] Deduced a trap composed of 52 places in 118 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:38] [INFO ] Deduced a trap composed of 55 places in 118 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:38] [INFO ] Deduced a trap composed of 59 places in 117 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:39] [INFO ] Deduced a trap composed of 77 places in 123 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:39] [INFO ] Deduced a trap composed of 60 places in 117 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:39] [INFO ] Deduced a trap composed of 91 places in 113 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:39] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:39] [INFO ] Deduced a trap composed of 48 places in 106 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:39] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:40] [INFO ] Deduced a trap composed of 79 places in 515 ms of which 265 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:40] [INFO ] Deduced a trap composed of 79 places in 319 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:41] [INFO ] Deduced a trap composed of 80 places in 845 ms of which 615 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:41] [INFO ] Deduced a trap composed of 80 places in 433 ms of which 188 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/468 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:41] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:42] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:42] [INFO ] Deduced a trap composed of 75 places in 92 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:43] [INFO ] Deduced a trap composed of 80 places in 1219 ms of which 962 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:44] [INFO ] Deduced a trap composed of 80 places in 1027 ms of which 777 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:44] [INFO ] Deduced a trap composed of 79 places in 383 ms of which 139 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:45] [INFO ] Deduced a trap composed of 80 places in 400 ms of which 169 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:46] [INFO ] Deduced a trap composed of 80 places in 736 ms of which 485 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:46] [INFO ] Deduced a trap composed of 79 places in 406 ms of which 159 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:46] [INFO ] Deduced a trap composed of 81 places in 480 ms of which 247 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:47] [INFO ] Deduced a trap composed of 81 places in 499 ms of which 249 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:48] [INFO ] Deduced a trap composed of 79 places in 798 ms of which 544 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:48] [INFO ] Deduced a trap composed of 80 places in 590 ms of which 339 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/468 variables, 13/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:49] [INFO ] Deduced a trap composed of 58 places in 87 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:49] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:49] [INFO ] Deduced a trap composed of 58 places in 114 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:49] [INFO ] Deduced a trap composed of 54 places in 115 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:49] [INFO ] Deduced a trap composed of 73 places in 127 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:49] [INFO ] Deduced a trap composed of 77 places in 124 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:49] [INFO ] Deduced a trap composed of 45 places in 113 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:50] [INFO ] Deduced a trap composed of 91 places in 132 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:51] [INFO ] Deduced a trap composed of 82 places in 1260 ms of which 1031 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:52] [INFO ] Deduced a trap composed of 86 places in 960 ms of which 733 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:52] [INFO ] Deduced a trap composed of 31 places in 251 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:52] [INFO ] Deduced a trap composed of 33 places in 255 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:53] [INFO ] Deduced a trap composed of 83 places in 353 ms of which 136 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:53] [INFO ] Deduced a trap composed of 21 places in 253 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:53] [INFO ] Deduced a trap composed of 87 places in 425 ms of which 216 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:54] [INFO ] Deduced a trap composed of 86 places in 472 ms of which 250 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/468 variables, 16/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:55] [INFO ] Deduced a trap composed of 83 places in 568 ms of which 332 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:55] [INFO ] Deduced a trap composed of 27 places in 237 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:56] [INFO ] Deduced a trap composed of 87 places in 932 ms of which 717 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/468 variables, 3/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:56] [INFO ] Deduced a trap composed of 43 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-01 01:43:57] [INFO ] Deduced a trap composed of 84 places in 724 ms of which 511 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:57] [INFO ] Deduced a trap composed of 88 places in 515 ms of which 288 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/468 variables, 3/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:58] [INFO ] Deduced a trap composed of 84 places in 424 ms of which 192 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:58] [INFO ] Deduced a trap composed of 88 places in 490 ms of which 279 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:59] [INFO ] Deduced a trap composed of 88 places in 495 ms of which 282 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/468 variables, 3/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:59] [INFO ] Deduced a trap composed of 72 places in 77 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:43:59] [INFO ] Deduced a trap composed of 55 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:44:01] [INFO ] Deduced a trap composed of 85 places in 1520 ms of which 1283 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:44:01] [INFO ] Deduced a trap composed of 89 places in 477 ms of which 237 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/468 variables, 4/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:44:02] [INFO ] Deduced a trap composed of 89 places in 787 ms of which 549 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:44:02] [INFO ] Deduced a trap composed of 93 places in 449 ms of which 213 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:44:03] [INFO ] Deduced a trap composed of 15 places in 234 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:44:03] [INFO ] Deduced a trap composed of 95 places in 536 ms of which 319 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/468 variables, 4/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:44:04] [INFO ] Deduced a trap composed of 84 places in 573 ms of which 360 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:44:04] [INFO ] Deduced a trap composed of 88 places in 382 ms of which 163 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/468 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/468 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 3/471 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:44:05] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 9 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/471 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/471 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 452/923 variables, 471/671 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/923 variables, 79/750 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/923 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 5/928 variables, 5/755 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/928 variables, 2/757 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/928 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/928 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 928/928 variables, and 757 constraints, problems are : Problem set: 0 solved, 2 unsolved in 36719 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 476/476 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 103/103 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 282/284 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/284 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 184/468 variables, 71/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 99/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:44:08] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:44:08] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:44:08] [INFO ] Deduced a trap composed of 14 places in 251 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:44:09] [INFO ] Deduced a trap composed of 80 places in 654 ms of which 417 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:44:10] [INFO ] Deduced a trap composed of 79 places in 1181 ms of which 931 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:44:11] [INFO ] Deduced a trap composed of 80 places in 696 ms of which 463 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:44:11] [INFO ] Deduced a trap composed of 80 places in 558 ms of which 326 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:44:12] [INFO ] Deduced a trap composed of 80 places in 673 ms of which 443 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:44:13] [INFO ] Deduced a trap composed of 79 places in 507 ms of which 261 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:44:13] [INFO ] Deduced a trap composed of 80 places in 513 ms of which 262 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 10/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:44:13] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:44:13] [INFO ] Deduced a trap composed of 34 places in 128 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:44:14] [INFO ] Deduced a trap composed of 46 places in 126 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:44:14] [INFO ] Deduced a trap composed of 80 places in 124 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/468 variables, 4/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/468 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 3/471 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:44:14] [INFO ] Deduced a trap composed of 51 places in 85 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/471 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/471 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 452/923 variables, 471/686 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/923 variables, 79/765 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/923 variables, 2/767 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/923 variables, 0/767 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 5/928 variables, 5/772 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/928 variables, 2/774 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/928 variables, 0/774 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/928 variables, 0/774 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 928/928 variables, and 774 constraints, problems are : Problem set: 0 solved, 2 unsolved in 10380 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 476/476 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 118/118 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47161ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 22211 ms.
Support contains 2 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 452/452 transitions.
Applied a total of 0 rules in 12 ms. Remains 476 /476 variables (removed 0) and now considering 452/452 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 476/476 places, 452/452 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 452/452 transitions.
Applied a total of 0 rules in 10 ms. Remains 476 /476 variables (removed 0) and now considering 452/452 (removed 0) transitions.
[2025-06-01 01:44:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:44:52] [INFO ] Implicit Places using invariants in 12002 ms returned [42, 48, 70, 75, 96, 101, 121, 127, 148, 153, 154, 174, 179, 200, 206, 213, 227, 233, 256, 262, 284, 289, 309, 314, 335, 340, 361, 367, 388, 390, 394, 414, 420, 442, 447, 451, 468, 474]
[2025-06-01 01:44:52] [INFO ] Actually due to overlaps returned [213, 153]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 12010 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 474/476 places, 452/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 474 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 473 transition count 451
Applied a total of 2 rules in 27 ms. Remains 473 /474 variables (removed 1) and now considering 451/452 (removed 1) transitions.
// Phase 1: matrix 451 rows 473 cols
[2025-06-01 01:44:52] [INFO ] Invariants computation overflowed in 30 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:44:53] [INFO ] Implicit Places using invariants in 455 ms returned []
// Phase 1: matrix 451 rows 473 cols
[2025-06-01 01:44:53] [INFO ] Invariants computation overflowed in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:44:53] [INFO ] State equation strengthened by 79 read => feed constraints.
[2025-06-01 01:45:13] [INFO ] Implicit Places using invariants and state equation in 20497 ms returned [42, 48, 70, 75, 96, 101, 121, 127, 148, 153, 173, 178, 199, 205, 224, 230, 253, 259, 281, 286, 306, 311, 332, 337, 358, 364, 385, 387, 391, 411, 417, 439, 444, 448, 465, 471]
[2025-06-01 01:45:13] [INFO ] Actually due to overlaps returned [448, 387]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 20966 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 471/476 places, 451/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 471 transition count 450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 470 transition count 450
Applied a total of 2 rules in 18 ms. Remains 470 /471 variables (removed 1) and now considering 450/451 (removed 1) transitions.
// Phase 1: matrix 450 rows 470 cols
[2025-06-01 01:45:13] [INFO ] Invariants computation overflowed in 33 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:45:14] [INFO ] Implicit Places using invariants in 465 ms returned []
// Phase 1: matrix 450 rows 470 cols
[2025-06-01 01:45:14] [INFO ] Invariants computation overflowed in 39 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:45:14] [INFO ] State equation strengthened by 79 read => feed constraints.
[2025-06-01 01:45:36] [INFO ] Implicit Places using invariants and state equation in 22889 ms returned [42, 48, 70, 75, 96, 101, 121, 127, 148, 153, 173, 178, 199, 205, 224, 230, 253, 259, 281, 286, 306, 311, 332, 337, 358, 364, 385, 390, 410, 416, 438, 443, 462, 468]
[2025-06-01 01:45:36] [INFO ] Actually due to overlaps returned [48, 42]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 23358 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 468/476 places, 450/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 468 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 467 transition count 449
Applied a total of 2 rules in 24 ms. Remains 467 /468 variables (removed 1) and now considering 449/450 (removed 1) transitions.
// Phase 1: matrix 449 rows 467 cols
[2025-06-01 01:45:37] [INFO ] Invariants computation overflowed in 33 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:45:37] [INFO ] Implicit Places using invariants in 437 ms returned []
// Phase 1: matrix 449 rows 467 cols
[2025-06-01 01:45:37] [INFO ] Invariants computation overflowed in 34 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:45:37] [INFO ] State equation strengthened by 79 read => feed constraints.
[2025-06-01 01:46:07] [INFO ] Performed 227/467 implicitness test of which 14 returned IMPLICIT in 30 seconds.
[2025-06-01 01:46:13] [INFO ] Implicit Places using invariants and state equation in 36499 ms returned [67, 72, 93, 98, 118, 124, 145, 150, 170, 175, 196, 202, 221, 227, 250, 256, 278, 283, 303, 308, 329, 334, 355, 361, 382, 387, 407, 413, 435, 440, 459, 465]
[2025-06-01 01:46:13] [INFO ] Actually due to overlaps returned [72, 67]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 36940 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 465/476 places, 449/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 465 transition count 448
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 464 transition count 448
Applied a total of 2 rules in 23 ms. Remains 464 /465 variables (removed 1) and now considering 448/449 (removed 1) transitions.
// Phase 1: matrix 448 rows 464 cols
[2025-06-01 01:46:13] [INFO ] Invariants computation overflowed in 35 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:46:14] [INFO ] Implicit Places using invariants in 425 ms returned []
// Phase 1: matrix 448 rows 464 cols
[2025-06-01 01:46:14] [INFO ] Invariants computation overflowed in 38 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:46:14] [INFO ] State equation strengthened by 79 read => feed constraints.
[2025-06-01 01:46:36] [INFO ] Implicit Places using invariants and state equation in 21773 ms returned [90, 95, 115, 121, 142, 147, 167, 172, 193, 199, 218, 224, 247, 253, 275, 280, 300, 305, 326, 331, 352, 358, 379, 384, 404, 410, 432, 437, 456, 462]
[2025-06-01 01:46:36] [INFO ] Actually due to overlaps returned [95, 90]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 22203 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 462/476 places, 448/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 462 transition count 447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 461 transition count 447
Applied a total of 2 rules in 29 ms. Remains 461 /462 variables (removed 1) and now considering 447/448 (removed 1) transitions.
// Phase 1: matrix 447 rows 461 cols
[2025-06-01 01:46:36] [INFO ] Invariants computation overflowed in 35 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:46:36] [INFO ] Implicit Places using invariants in 416 ms returned []
// Phase 1: matrix 447 rows 461 cols
[2025-06-01 01:46:36] [INFO ] Invariants computation overflowed in 28 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:46:36] [INFO ] State equation strengthened by 79 read => feed constraints.
[2025-06-01 01:46:54] [INFO ] Implicit Places using invariants and state equation in 18376 ms returned [112, 118, 139, 144, 164, 169, 190, 196, 215, 221, 244, 250, 272, 277, 297, 302, 323, 328, 349, 355, 376, 381, 401, 407, 429, 434, 453, 459]
[2025-06-01 01:46:54] [INFO ] Actually due to overlaps returned [118, 112]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 18797 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 459/476 places, 447/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 459 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 458 transition count 446
Applied a total of 2 rules in 24 ms. Remains 458 /459 variables (removed 1) and now considering 446/447 (removed 1) transitions.
// Phase 1: matrix 446 rows 458 cols
[2025-06-01 01:46:55] [INFO ] Invariants computation overflowed in 34 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:46:55] [INFO ] Implicit Places using invariants in 395 ms returned []
// Phase 1: matrix 446 rows 458 cols
[2025-06-01 01:46:55] [INFO ] Invariants computation overflowed in 40 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:46:55] [INFO ] State equation strengthened by 79 read => feed constraints.
[2025-06-01 01:47:18] [INFO ] Implicit Places using invariants and state equation in 22657 ms returned [136, 141, 161, 166, 187, 193, 212, 218, 241, 247, 269, 274, 294, 299, 320, 325, 346, 352, 373, 378, 398, 404, 426, 431, 450, 456]
[2025-06-01 01:47:18] [INFO ] Actually due to overlaps returned [141, 136]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 23056 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 456/476 places, 446/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 456 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 455 transition count 445
Applied a total of 2 rules in 23 ms. Remains 455 /456 variables (removed 1) and now considering 445/446 (removed 1) transitions.
// Phase 1: matrix 445 rows 455 cols
[2025-06-01 01:47:18] [INFO ] Invariants computation overflowed in 47 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:47:18] [INFO ] Implicit Places using invariants in 389 ms returned []
// Phase 1: matrix 445 rows 455 cols
[2025-06-01 01:47:18] [INFO ] Invariants computation overflowed in 51 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:47:18] [INFO ] State equation strengthened by 79 read => feed constraints.
[2025-06-01 01:47:34] [INFO ] Implicit Places using invariants and state equation in 15822 ms returned [158, 163, 184, 190, 209, 215, 238, 244, 266, 271, 291, 296, 317, 322, 343, 349, 370, 375, 395, 401, 423, 428, 447, 453]
[2025-06-01 01:47:34] [INFO ] Actually due to overlaps returned [163, 158]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 16225 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 453/476 places, 445/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 453 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 452 transition count 444
Applied a total of 2 rules in 20 ms. Remains 452 /453 variables (removed 1) and now considering 444/445 (removed 1) transitions.
// Phase 1: matrix 444 rows 452 cols
[2025-06-01 01:47:34] [INFO ] Invariants computation overflowed in 35 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:47:34] [INFO ] Implicit Places using invariants in 369 ms returned []
// Phase 1: matrix 444 rows 452 cols
[2025-06-01 01:47:34] [INFO ] Invariants computation overflowed in 27 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:47:34] [INFO ] State equation strengthened by 79 read => feed constraints.
[2025-06-01 01:47:58] [INFO ] Implicit Places using invariants and state equation in 23433 ms returned [181, 187, 206, 212, 235, 241, 263, 268, 288, 293, 314, 319, 340, 346, 367, 372, 392, 398, 420, 425, 444, 450]
[2025-06-01 01:47:58] [INFO ] Actually due to overlaps returned [187, 181]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 23808 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 450/476 places, 444/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 450 transition count 443
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 449 transition count 443
Applied a total of 2 rules in 25 ms. Remains 449 /450 variables (removed 1) and now considering 443/444 (removed 1) transitions.
// Phase 1: matrix 443 rows 449 cols
[2025-06-01 01:47:58] [INFO ] Invariants computation overflowed in 48 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:47:58] [INFO ] Implicit Places using invariants in 382 ms returned []
// Phase 1: matrix 443 rows 449 cols
[2025-06-01 01:47:58] [INFO ] Invariants computation overflowed in 51 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:47:58] [INFO ] State equation strengthened by 79 read => feed constraints.
[2025-06-01 01:48:19] [INFO ] Implicit Places using invariants and state equation in 20479 ms returned [203, 209, 232, 238, 260, 265, 285, 290, 311, 316, 337, 343, 364, 369, 389, 395, 417, 422, 441, 447]
[2025-06-01 01:48:19] [INFO ] Actually due to overlaps returned [209, 203]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 20864 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 447/476 places, 443/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 447 transition count 442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 446 transition count 442
Applied a total of 2 rules in 21 ms. Remains 446 /447 variables (removed 1) and now considering 442/443 (removed 1) transitions.
// Phase 1: matrix 442 rows 446 cols
[2025-06-01 01:48:19] [INFO ] Invariants computation overflowed in 35 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:48:19] [INFO ] Implicit Places using invariants in 335 ms returned []
// Phase 1: matrix 442 rows 446 cols
[2025-06-01 01:48:19] [INFO ] Invariants computation overflowed in 36 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:48:19] [INFO ] State equation strengthened by 79 read => feed constraints.
[2025-06-01 01:48:35] [INFO ] Implicit Places using invariants and state equation in 16440 ms returned [229, 235, 257, 262, 282, 287, 308, 313, 334, 340, 361, 366, 386, 392, 414, 419, 438, 444]
[2025-06-01 01:48:35] [INFO ] Actually due to overlaps returned [235, 229]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 16777 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 11 : 444/476 places, 442/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 444 transition count 441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 443 transition count 441
Applied a total of 2 rules in 16 ms. Remains 443 /444 variables (removed 1) and now considering 441/442 (removed 1) transitions.
// Phase 1: matrix 441 rows 443 cols
[2025-06-01 01:48:35] [INFO ] Invariants computation overflowed in 30 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:48:36] [INFO ] Implicit Places using invariants in 327 ms returned []
// Phase 1: matrix 441 rows 443 cols
[2025-06-01 01:48:36] [INFO ] Invariants computation overflowed in 33 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:48:36] [INFO ] State equation strengthened by 79 read => feed constraints.
[2025-06-01 01:48:57] [INFO ] Implicit Places using invariants and state equation in 21235 ms returned [254, 259, 279, 284, 305, 310, 331, 337, 358, 363, 383, 389, 411, 416, 435, 441]
[2025-06-01 01:48:57] [INFO ] Actually due to overlaps returned [259, 254]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 21567 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 12 : 441/476 places, 441/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 441 transition count 440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 440 transition count 440
Applied a total of 2 rules in 23 ms. Remains 440 /441 variables (removed 1) and now considering 440/441 (removed 1) transitions.
// Phase 1: matrix 440 rows 440 cols
[2025-06-01 01:48:57] [INFO ] Invariants computation overflowed in 41 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:48:57] [INFO ] Implicit Places using invariants in 344 ms returned []
// Phase 1: matrix 440 rows 440 cols
[2025-06-01 01:48:57] [INFO ] Invariants computation overflowed in 37 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:48:57] [INFO ] State equation strengthened by 79 read => feed constraints.
[2025-06-01 01:49:09] [INFO ] Implicit Places using invariants and state equation in 11291 ms returned [276, 281, 302, 307, 328, 334, 355, 360, 380, 386, 408, 413, 432, 438]
[2025-06-01 01:49:09] [INFO ] Actually due to overlaps returned [281, 276]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 11642 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 13 : 438/476 places, 440/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 438 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 437 transition count 439
Applied a total of 2 rules in 26 ms. Remains 437 /438 variables (removed 1) and now considering 439/440 (removed 1) transitions.
// Phase 1: matrix 439 rows 437 cols
[2025-06-01 01:49:09] [INFO ] Computed 73 invariants in 55 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:49:11] [INFO ] Implicit Places using invariants in 2527 ms returned [299, 304, 325, 331, 352, 357, 377, 383, 405, 410, 429, 435]
[2025-06-01 01:49:11] [INFO ] Actually due to overlaps returned [304, 299]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2528 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 14 : 435/476 places, 439/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 435 transition count 438
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 434 transition count 438
Applied a total of 2 rules in 22 ms. Remains 434 /435 variables (removed 1) and now considering 438/439 (removed 1) transitions.
// Phase 1: matrix 438 rows 434 cols
[2025-06-01 01:49:11] [INFO ] Invariants computation overflowed in 35 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:49:11] [INFO ] Implicit Places using invariants in 315 ms returned []
// Phase 1: matrix 438 rows 434 cols
[2025-06-01 01:49:11] [INFO ] Invariants computation overflowed in 28 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:49:12] [INFO ] State equation strengthened by 79 read => feed constraints.
[2025-06-01 01:49:20] [INFO ] Implicit Places using invariants and state equation in 8562 ms returned [322, 328, 349, 354, 374, 380, 402, 407, 426, 432]
[2025-06-01 01:49:20] [INFO ] Actually due to overlaps returned [328, 322]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8881 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 15 : 432/476 places, 438/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 432 transition count 437
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 431 transition count 437
Applied a total of 2 rules in 26 ms. Remains 431 /432 variables (removed 1) and now considering 437/438 (removed 1) transitions.
// Phase 1: matrix 437 rows 431 cols
[2025-06-01 01:49:20] [INFO ] Computed 69 invariants in 62 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:49:22] [INFO ] Implicit Places using invariants in 2082 ms returned [346, 351, 371, 377, 399, 404, 423, 429]
[2025-06-01 01:49:22] [INFO ] Actually due to overlaps returned [351, 346]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2083 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 16 : 429/476 places, 437/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 429 transition count 436
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 428 transition count 436
Applied a total of 2 rules in 18 ms. Remains 428 /429 variables (removed 1) and now considering 436/437 (removed 1) transitions.
// Phase 1: matrix 436 rows 428 cols
[2025-06-01 01:49:22] [INFO ] Invariants computation overflowed in 35 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:49:22] [INFO ] Implicit Places using invariants in 301 ms returned []
// Phase 1: matrix 436 rows 428 cols
[2025-06-01 01:49:22] [INFO ] Invariants computation overflowed in 30 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:49:23] [INFO ] State equation strengthened by 79 read => feed constraints.
[2025-06-01 01:49:31] [INFO ] Implicit Places using invariants and state equation in 8542 ms returned [368, 374, 396, 401, 420, 426]
[2025-06-01 01:49:31] [INFO ] Actually due to overlaps returned [374, 368]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8849 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 17 : 426/476 places, 436/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 426 transition count 435
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 425 transition count 435
Applied a total of 2 rules in 20 ms. Remains 425 /426 variables (removed 1) and now considering 435/436 (removed 1) transitions.
// Phase 1: matrix 435 rows 425 cols
[2025-06-01 01:49:31] [INFO ] Invariants computation overflowed in 37 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:49:31] [INFO ] Implicit Places using invariants in 288 ms returned []
// Phase 1: matrix 435 rows 425 cols
[2025-06-01 01:49:31] [INFO ] Invariants computation overflowed in 37 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:49:32] [INFO ] State equation strengthened by 79 read => feed constraints.
[2025-06-01 01:49:40] [INFO ] Implicit Places using invariants and state equation in 8332 ms returned [393, 398, 417, 423]
[2025-06-01 01:49:40] [INFO ] Actually due to overlaps returned [398, 393]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8622 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 18 : 423/476 places, 435/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 423 transition count 434
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 422 transition count 434
Applied a total of 2 rules in 15 ms. Remains 422 /423 variables (removed 1) and now considering 434/435 (removed 1) transitions.
// Phase 1: matrix 434 rows 422 cols
[2025-06-01 01:49:40] [INFO ] Invariants computation overflowed in 39 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:49:40] [INFO ] Implicit Places using invariants in 296 ms returned []
// Phase 1: matrix 434 rows 422 cols
[2025-06-01 01:49:40] [INFO ] Invariants computation overflowed in 36 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:49:40] [INFO ] State equation strengthened by 79 read => feed constraints.
[2025-06-01 01:49:49] [INFO ] Implicit Places using invariants and state equation in 9107 ms returned [414, 420]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9413 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 19 : 420/476 places, 434/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 420 transition count 433
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 419 transition count 433
Applied a total of 2 rules in 25 ms. Remains 419 /420 variables (removed 1) and now considering 433/434 (removed 1) transitions.
// Phase 1: matrix 433 rows 419 cols
[2025-06-01 01:49:49] [INFO ] Invariants computation overflowed in 30 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:49:49] [INFO ] Implicit Places using invariants in 272 ms returned []
// Phase 1: matrix 433 rows 419 cols
[2025-06-01 01:49:49] [INFO ] Invariants computation overflowed in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:49:50] [INFO ] State equation strengthened by 79 read => feed constraints.
[2025-06-01 01:49:59] [INFO ] Implicit Places using invariants and state equation in 9638 ms returned []
Implicit Place search using SMT with State Equation took 9912 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 20 : 419/476 places, 433/452 transitions.
Finished structural reductions in REACHABILITY mode , in 20 iterations and 318940 ms. Remains : 419/476 places, 433/452 transitions.
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p1) p3 (NOT p2)))), (X (NOT (AND p3 (NOT p2)))), (X (NOT (AND (NOT p1) p3))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) p3 (NOT p2))))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p3) p1))), (F (NOT (OR p2 (NOT p3)))), (F (NOT (OR p2 (NOT p3) p1))), (F p3)]
Knowledge based reduction with 13 factoid took 289 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p2) p3), (AND p3 (NOT p1)), (AND (NOT p2) p3)]
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p2) p3), (AND p3 (NOT p1)), (AND (NOT p2) p3)]
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p2) p3), (AND p3 (NOT p1)), (AND (NOT p2) p3)]
Product exploration explored 100000 steps with 11431 reset in 130 ms.
Product exploration explored 100000 steps with 11448 reset in 131 ms.
Built C files in :
/tmp/ltsmin11514273760553101863
[2025-06-01 01:50:00] [INFO ] Computing symmetric may disable matrix : 536 transitions.
[2025-06-01 01:50:00] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 01:50:00] [INFO ] Computing symmetric may enable matrix : 536 transitions.
[2025-06-01 01:50:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 01:50:00] [INFO ] Computing Do-Not-Accords matrix : 536 transitions.
[2025-06-01 01:50:00] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 01:50:00] [INFO ] Built C files in 108ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11514273760553101863
Running compilation step : cd /tmp/ltsmin11514273760553101863;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1419 ms.
Running link step : cd /tmp/ltsmin11514273760553101863;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin11514273760553101863;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased984081728449299881.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 560 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 560/560 places, 536/536 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 559 transition count 535
Applied a total of 2 rules in 16 ms. Remains 559 /560 variables (removed 1) and now considering 535/536 (removed 1) transitions.
// Phase 1: matrix 535 rows 559 cols
[2025-06-01 01:50:15] [INFO ] Invariants computation overflowed in 51 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:50:15] [INFO ] Implicit Places using invariants in 268 ms returned []
// Phase 1: matrix 535 rows 559 cols
[2025-06-01 01:50:15] [INFO ] Invariants computation overflowed in 46 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:50:16] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-06-01 01:50:28] [INFO ] Implicit Places using invariants and state equation in 12877 ms returned []
Implicit Place search using SMT with State Equation took 13147 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 01:50:28] [INFO ] Redundant transitions in 51 ms returned []
Running 534 sub problems to find dead transitions.
// Phase 1: matrix 535 rows 559 cols
[2025-06-01 01:50:28] [INFO ] Invariants computation overflowed in 39 ms
[2025-06-01 01:50:28] [INFO ] State equation strengthened by 37 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/558 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 1 (OVERLAPS) 535/1093 variables, 558/558 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1093 variables, 37/595 constraints. Problems are: Problem set: 0 solved, 534 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1093/1094 variables, and 595 constraints, problems are : Problem set: 0 solved, 534 unsolved in 30023 ms.
Refiners :[State Equation: 558/559 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 534/534 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 534 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/558 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 1 (OVERLAPS) 535/1093 variables, 558/558 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1093 variables, 37/595 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1093 variables, 531/1126 constraints. Problems are: Problem set: 0 solved, 534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1093/1094 variables, and 1126 constraints, problems are : Problem set: 0 solved, 534 unsolved in 30024 ms.
Refiners :[State Equation: 558/559 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 531/534 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60142ms problems are : Problem set: 0 solved, 534 unsolved
Search for dead transitions found 0 dead transitions in 60144ms
Starting structural reductions in SI_LTL mode, iteration 1 : 559/560 places, 535/536 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 73373 ms. Remains : 559/560 places, 535/536 transitions.
Built C files in :
/tmp/ltsmin14587384736504358689
[2025-06-01 01:51:29] [INFO ] Computing symmetric may disable matrix : 535 transitions.
[2025-06-01 01:51:29] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 01:51:29] [INFO ] Computing symmetric may enable matrix : 535 transitions.
[2025-06-01 01:51:29] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 01:51:29] [INFO ] Computing Do-Not-Accords matrix : 535 transitions.
[2025-06-01 01:51:29] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 01:51:29] [INFO ] Built C files in 77ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14587384736504358689
Running compilation step : cd /tmp/ltsmin14587384736504358689;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1327 ms.
Running link step : cd /tmp/ltsmin14587384736504358689;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin14587384736504358689;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11069173132396404585.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-01 01:51:44] [INFO ] Flatten gal took : 26 ms
[2025-06-01 01:51:44] [INFO ] Flatten gal took : 26 ms
[2025-06-01 01:51:44] [INFO ] Time to serialize gal into /tmp/LTL17659394136036256829.gal : 6 ms
[2025-06-01 01:51:44] [INFO ] Time to serialize properties into /tmp/LTL4081733639512850860.prop : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17659394136036256829.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5873166092285004932.hoa' '-atoms' '/tmp/LTL4081733639512850860.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4081733639512850860.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5873166092285004932.hoa
Detected timeout of ITS tools.
[2025-06-01 01:51:59] [INFO ] Flatten gal took : 24 ms
[2025-06-01 01:51:59] [INFO ] Flatten gal took : 23 ms
[2025-06-01 01:51:59] [INFO ] Time to serialize gal into /tmp/LTL16038506157594360747.gal : 5 ms
[2025-06-01 01:51:59] [INFO ] Time to serialize properties into /tmp/LTL12166056979228292428.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16038506157594360747.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12166056979228292428.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(G((F(G("((p389>=1)&&(p414>=1))")))U(((F("(p180>=1)"))U("(p509>=1)"))||(F(!("((p152>=1)&&(p56>=1))"))))))))
Formula 0 simplified : XF(GF!"((p389>=1)&&(p414>=1))" R ((G!"(p180>=1)" R !"(p509>=1)") & G"((p152>=1)&&(p56>=1))"))
Detected timeout of ITS tools.
[2025-06-01 01:52:14] [INFO ] Flatten gal took : 24 ms
[2025-06-01 01:52:14] [INFO ] Applying decomposition
[2025-06-01 01:52:14] [INFO ] Flatten gal took : 22 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/graph8047947447855564164.txt' '-o' '/tmp/graph8047947447855564164.bin' '-w' '/tmp/graph8047947447855564164.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8047947447855564164.bin' '-l' '-1' '-v' '-w' '/tmp/graph8047947447855564164.weights' '-q' '0' '-e' '0.001'
[2025-06-01 01:52:14] [INFO ] Decomposing Gal with order
[2025-06-01 01:52:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 01:52:14] [INFO ] Removed a total of 393 redundant transitions.
[2025-06-01 01:52:14] [INFO ] Flatten gal took : 133 ms
[2025-06-01 01:52:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 22 ms.
[2025-06-01 01:52:14] [INFO ] Time to serialize gal into /tmp/LTL4734300901830186168.gal : 20 ms
[2025-06-01 01:52:14] [INFO ] Time to serialize properties into /tmp/LTL7978940970084769488.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4734300901830186168.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7978940970084769488.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G((F(G("((i3.u65.p389>=1)&&(i3.u71.p414>=1))")))U(((F("(i1.u21.p180>=1)"))U("(i4.u96.p509>=1)"))||(F(!("((i1.u15.p152>=1)&&(i1.u1...175
Formula 0 simplified : XF(GF!"((i3.u65.p389>=1)&&(i3.u71.p414>=1))" R ((G!"(i1.u21.p180>=1)" R !"(i4.u96.p509>=1)") & G"((i1.u15.p152>=1)&&(i1.u107.p56>=1)...159
Detected timeout of ITS tools.
Treatment of property DoubleExponent-PT-020-LTLFireability-00 finished in 900100 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 242 transitions
Trivial Post-agglo rules discarded 242 transitions
Performed 242 trivial Post agglomeration. Transition count delta: 242
Iterating post reduction 0 with 242 rules applied. Total rules applied 243 place count 1055 transition count 753
Reduce places removed 242 places and 0 transitions.
Iterating post reduction 1 with 242 rules applied. Total rules applied 485 place count 813 transition count 753
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 485 place count 813 transition count 714
Deduced a syphon composed of 39 places in 6 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 563 place count 774 transition count 714
Performed 183 Post agglomeration using F-continuation condition.Transition count delta: 183
Deduced a syphon composed of 183 places in 3 ms
Reduce places removed 183 places and 0 transitions.
Iterating global reduction 2 with 366 rules applied. Total rules applied 929 place count 591 transition count 531
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 1003 place count 554 transition count 531
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1004 place count 553 transition count 530
Applied a total of 1004 rules in 69 ms. Remains 553 /1057 variables (removed 504) and now considering 530/997 (removed 467) transitions.
// Phase 1: matrix 530 rows 553 cols
[2025-06-01 01:52:30] [INFO ] Invariants computation overflowed in 32 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:52:30] [INFO ] Implicit Places using invariants in 372 ms returned []
// Phase 1: matrix 530 rows 553 cols
[2025-06-01 01:52:30] [INFO ] Invariants computation overflowed in 31 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:52:30] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-01 01:52:37] [INFO ] Implicit Places using invariants and state equation in 7453 ms returned []
Implicit Place search using SMT with State Equation took 7827 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 01:52:37] [INFO ] Redundant transitions in 3 ms returned []
Running 529 sub problems to find dead transitions.
// Phase 1: matrix 530 rows 553 cols
[2025-06-01 01:52:37] [INFO ] Invariants computation overflowed in 39 ms
[2025-06-01 01:52:37] [INFO ] State equation strengthened by 38 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 1 (OVERLAPS) 530/1082 variables, 552/552 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1082 variables, 38/590 constraints. Problems are: Problem set: 0 solved, 529 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1082/1083 variables, and 590 constraints, problems are : Problem set: 0 solved, 529 unsolved in 30026 ms.
Refiners :[State Equation: 552/553 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 529/529 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 529 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 1 (OVERLAPS) 530/1082 variables, 552/552 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1082 variables, 38/590 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1082 variables, 526/1116 constraints. Problems are: Problem set: 0 solved, 529 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1082/1083 variables, and 1116 constraints, problems are : Problem set: 0 solved, 529 unsolved in 30019 ms.
Refiners :[State Equation: 552/553 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 526/529 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60150ms problems are : Problem set: 0 solved, 529 unsolved
Search for dead transitions found 0 dead transitions in 60151ms
Starting structural reductions in SI_LTL mode, iteration 1 : 553/1057 places, 530/997 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 68061 ms. Remains : 553/1057 places, 530/997 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-01
Product exploration explored 100000 steps with 13896 reset in 215 ms.
Product exploration explored 100000 steps with 13834 reset in 126 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1743 edges and 553 vertex of which 552 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (5517 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3239 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 381543 steps, run timeout after 3001 ms. (steps per millisecond=127 ) properties seen :0 out of 1
Probabilistic random walk after 381543 steps, saw 190826 distinct states, run finished after 3001 ms. (steps per millisecond=127 ) properties seen :0
// Phase 1: matrix 530 rows 553 cols
[2025-06-01 01:53:41] [INFO ] Invariants computation overflowed in 40 ms
[2025-06-01 01:53:41] [INFO ] State equation strengthened by 38 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/12 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 32/44 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 64/108 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/108 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/108 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 87/195 variables, 42/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/195 variables, 4/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/195 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 100/295 variables, 50/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/295 variables, 3/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/295 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 107/402 variables, 55/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/402 variables, 3/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/402 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 93/495 variables, 50/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/495 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/495 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 63/558 variables, 36/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/558 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/558 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 55/613 variables, 28/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/613 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/613 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 55/668 variables, 28/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/668 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/668 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 55/723 variables, 28/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/723 variables, 2/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/723 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 55/778 variables, 28/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/778 variables, 2/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/778 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 55/833 variables, 28/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/833 variables, 2/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/833 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 55/888 variables, 28/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/888 variables, 2/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/888 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 55/943 variables, 28/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/943 variables, 2/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/943 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 55/998 variables, 28/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/998 variables, 2/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/998 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 53/1051 variables, 28/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1051 variables, 2/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1051 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 30/1081 variables, 21/586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1081 variables, 3/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1081 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1083/1083 variables, and 591 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1375 ms.
Refiners :[State Equation: 553/553 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/12 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 32/44 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/44 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 64/108 variables, 30/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/108 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/108 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 87/195 variables, 42/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/195 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/195 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 100/295 variables, 50/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/295 variables, 3/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/295 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 107/402 variables, 55/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/402 variables, 3/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/402 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 93/495 variables, 50/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/495 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:53:43] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 5 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/495 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/495 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 63/558 variables, 36/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/558 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/558 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 55/613 variables, 28/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/613 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/613 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 55/668 variables, 28/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/668 variables, 2/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/668 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 55/723 variables, 28/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/723 variables, 2/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/723 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 55/778 variables, 28/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/778 variables, 2/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/778 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 55/833 variables, 28/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/833 variables, 2/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/833 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 55/888 variables, 28/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/888 variables, 2/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/888 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 55/943 variables, 28/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/943 variables, 2/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/943 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 55/998 variables, 28/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/998 variables, 2/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/998 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 53/1051 variables, 28/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1051 variables, 2/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1051 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 30/1081 variables, 21/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1081 variables, 3/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1081 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (OVERLAPS) 2/1083 variables, 2/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1083 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (OVERLAPS) 0/1083 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1083/1083 variables, and 593 constraints, problems are : Problem set: 0 solved, 1 unsolved in 880 ms.
Refiners :[State Equation: 553/553 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2302ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 95 ms.
Support contains 1 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 530/530 transitions.
Graph (complete) has 1663 edges and 553 vertex of which 552 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 552 transition count 529
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 1 with 77 rules applied. Total rules applied 79 place count 552 transition count 452
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 156 place count 475 transition count 452
Partial Free-agglomeration rule applied 79 times.
Drop transitions (Partial Free agglomeration) removed 79 transitions
Iterating global reduction 2 with 79 rules applied. Total rules applied 235 place count 475 transition count 452
Applied a total of 235 rules in 41 ms. Remains 475 /553 variables (removed 78) and now considering 452/530 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 475/553 places, 452/530 transitions.
RANDOM walk for 40000 steps (5119 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3378 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 427779 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :0 out of 1
Probabilistic random walk after 427779 steps, saw 214020 distinct states, run finished after 3001 ms. (steps per millisecond=142 ) properties seen :0
// Phase 1: matrix 452 rows 475 cols
[2025-06-01 01:53:47] [INFO ] Invariants computation overflowed in 86 ms
[2025-06-01 01:53:47] [INFO ] State equation strengthened by 78 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/11 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 139/150 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 506/656 variables, 239/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/656 variables, 44/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/656 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 271/927 variables, 213/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/927 variables, 31/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/927 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/927 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 927/927 variables, and 553 constraints, problems are : Problem set: 0 solved, 1 unsolved in 537 ms.
Refiners :[State Equation: 475/475 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/11 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 139/150 variables, 19/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 506/656 variables, 239/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/656 variables, 44/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:53:48] [INFO ] Deduced a trap along path composed of 5 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:53:48] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/656 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/656 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 271/927 variables, 213/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/927 variables, 31/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/927 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/927 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 927/927 variables, and 556 constraints, problems are : Problem set: 0 solved, 1 unsolved in 866 ms.
Refiners :[State Equation: 475/475 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 1506ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 73 ms.
Support contains 1 out of 475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 452/452 transitions.
Applied a total of 0 rules in 9 ms. Remains 475 /475 variables (removed 0) and now considering 452/452 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 475/475 places, 452/452 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 452/452 transitions.
Applied a total of 0 rules in 8 ms. Remains 475 /475 variables (removed 0) and now considering 452/452 (removed 0) transitions.
// Phase 1: matrix 452 rows 475 cols
[2025-06-01 01:53:48] [INFO ] Invariants computation overflowed in 37 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:53:49] [INFO ] Implicit Places using invariants in 551 ms returned []
// Phase 1: matrix 452 rows 475 cols
[2025-06-01 01:53:49] [INFO ] Invariants computation overflowed in 41 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:53:49] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 01:54:20] [INFO ] Performed 154/475 implicitness test of which 11 returned IMPLICIT in 30 seconds.
[2025-06-01 01:54:33] [INFO ] Implicit Places using invariants and state equation in 44060 ms returned [42, 48, 68, 73, 94, 101, 121, 127, 148, 153, 154, 174, 179, 200, 206, 213, 227, 232, 255, 261, 283, 288, 308, 313, 334, 339, 360, 366, 387, 389, 393, 413, 419, 441, 446, 450, 467, 473]
[2025-06-01 01:54:33] [INFO ] Actually due to overlaps returned [213, 153]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 44619 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 473/475 places, 452/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 473 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 472 transition count 451
Applied a total of 2 rules in 21 ms. Remains 472 /473 variables (removed 1) and now considering 451/452 (removed 1) transitions.
// Phase 1: matrix 451 rows 472 cols
[2025-06-01 01:54:33] [INFO ] Invariants computation overflowed in 31 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:54:33] [INFO ] Implicit Places using invariants in 486 ms returned []
// Phase 1: matrix 451 rows 472 cols
[2025-06-01 01:54:33] [INFO ] Invariants computation overflowed in 32 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:54:34] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 01:54:57] [INFO ] Implicit Places using invariants and state equation in 23711 ms returned [42, 48, 68, 73, 94, 101, 121, 127, 148, 153, 173, 178, 199, 205, 224, 229, 252, 258, 280, 285, 305, 310, 331, 336, 357, 363, 384, 386, 390, 410, 416, 438, 443, 447, 464, 470]
[2025-06-01 01:54:57] [INFO ] Actually due to overlaps returned [447, 386]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 24211 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 470/475 places, 451/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 470 transition count 450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 469 transition count 450
Applied a total of 2 rules in 23 ms. Remains 469 /470 variables (removed 1) and now considering 450/451 (removed 1) transitions.
// Phase 1: matrix 450 rows 469 cols
[2025-06-01 01:54:57] [INFO ] Invariants computation overflowed in 33 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:54:58] [INFO ] Implicit Places using invariants in 453 ms returned []
// Phase 1: matrix 450 rows 469 cols
[2025-06-01 01:54:58] [INFO ] Invariants computation overflowed in 30 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:54:58] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 01:55:20] [INFO ] Implicit Places using invariants and state equation in 22371 ms returned [42, 48, 68, 73, 94, 101, 121, 127, 148, 153, 173, 178, 199, 205, 224, 229, 252, 258, 280, 285, 305, 310, 331, 336, 357, 363, 384, 389, 409, 415, 437, 442, 461, 467]
[2025-06-01 01:55:20] [INFO ] Actually due to overlaps returned [48, 42]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 22851 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 467/475 places, 450/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 467 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 466 transition count 449
Applied a total of 2 rules in 17 ms. Remains 466 /467 variables (removed 1) and now considering 449/450 (removed 1) transitions.
// Phase 1: matrix 449 rows 466 cols
[2025-06-01 01:55:20] [INFO ] Invariants computation overflowed in 41 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:55:20] [INFO ] Implicit Places using invariants in 435 ms returned []
// Phase 1: matrix 449 rows 466 cols
[2025-06-01 01:55:20] [INFO ] Invariants computation overflowed in 37 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:55:21] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 01:55:48] [INFO ] Implicit Places using invariants and state equation in 27327 ms returned [65, 70, 91, 98, 118, 124, 145, 150, 170, 175, 196, 202, 221, 226, 249, 255, 277, 282, 302, 307, 328, 333, 354, 360, 381, 386, 406, 412, 434, 439, 458, 464]
[2025-06-01 01:55:48] [INFO ] Actually due to overlaps returned [70, 65]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 27771 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 464/475 places, 449/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 464 transition count 448
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 463 transition count 448
Applied a total of 2 rules in 21 ms. Remains 463 /464 variables (removed 1) and now considering 448/449 (removed 1) transitions.
// Phase 1: matrix 448 rows 463 cols
[2025-06-01 01:55:48] [INFO ] Invariants computation overflowed in 28 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:55:48] [INFO ] Implicit Places using invariants in 415 ms returned []
// Phase 1: matrix 448 rows 463 cols
[2025-06-01 01:55:48] [INFO ] Invariants computation overflowed in 27 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:55:49] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 01:56:07] [INFO ] Implicit Places using invariants and state equation in 18929 ms returned [88, 95, 115, 121, 142, 147, 167, 172, 193, 199, 218, 223, 246, 252, 274, 279, 299, 304, 325, 330, 351, 357, 378, 383, 403, 409, 431, 436, 455, 461]
[2025-06-01 01:56:07] [INFO ] Actually due to overlaps returned [95, 88]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 19365 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 461/475 places, 448/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 461 transition count 447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 460 transition count 447
Applied a total of 2 rules in 26 ms. Remains 460 /461 variables (removed 1) and now considering 447/448 (removed 1) transitions.
// Phase 1: matrix 447 rows 460 cols
[2025-06-01 01:56:07] [INFO ] Invariants computation overflowed in 33 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:56:08] [INFO ] Implicit Places using invariants in 406 ms returned []
// Phase 1: matrix 447 rows 460 cols
[2025-06-01 01:56:08] [INFO ] Invariants computation overflowed in 26 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:56:08] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 01:56:23] [INFO ] Implicit Places using invariants and state equation in 14990 ms returned [112, 118, 139, 144, 164, 169, 190, 196, 215, 220, 243, 249, 271, 276, 296, 301, 322, 327, 348, 354, 375, 380, 400, 406, 428, 433, 452, 458]
[2025-06-01 01:56:23] [INFO ] Actually due to overlaps returned [118, 112]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 15399 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 458/475 places, 447/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 458 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 457 transition count 446
Applied a total of 2 rules in 23 ms. Remains 457 /458 variables (removed 1) and now considering 446/447 (removed 1) transitions.
// Phase 1: matrix 446 rows 457 cols
[2025-06-01 01:56:23] [INFO ] Invariants computation overflowed in 38 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:56:23] [INFO ] Implicit Places using invariants in 381 ms returned []
// Phase 1: matrix 446 rows 457 cols
[2025-06-01 01:56:23] [INFO ] Invariants computation overflowed in 29 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:56:23] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 01:56:41] [INFO ] Implicit Places using invariants and state equation in 17905 ms returned [136, 141, 161, 166, 187, 193, 212, 217, 240, 246, 268, 273, 293, 298, 319, 324, 345, 351, 372, 377, 397, 403, 425, 430, 449, 455]
[2025-06-01 01:56:41] [INFO ] Actually due to overlaps returned [141, 136]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 18312 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 455/475 places, 446/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 455 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 454 transition count 445
Applied a total of 2 rules in 25 ms. Remains 454 /455 variables (removed 1) and now considering 445/446 (removed 1) transitions.
// Phase 1: matrix 445 rows 454 cols
[2025-06-01 01:56:41] [INFO ] Invariants computation overflowed in 32 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:56:41] [INFO ] Implicit Places using invariants in 373 ms returned []
// Phase 1: matrix 445 rows 454 cols
[2025-06-01 01:56:41] [INFO ] Invariants computation overflowed in 26 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:56:42] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 01:57:03] [INFO ] Implicit Places using invariants and state equation in 21884 ms returned [158, 163, 184, 190, 209, 214, 237, 243, 265, 270, 290, 295, 316, 321, 342, 348, 369, 374, 394, 400, 422, 427, 446, 452]
[2025-06-01 01:57:03] [INFO ] Actually due to overlaps returned [163, 158]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 22268 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 452/475 places, 445/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 452 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 451 transition count 444
Applied a total of 2 rules in 20 ms. Remains 451 /452 variables (removed 1) and now considering 444/445 (removed 1) transitions.
// Phase 1: matrix 444 rows 451 cols
[2025-06-01 01:57:03] [INFO ] Computed 83 invariants in 59 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:57:07] [INFO ] Implicit Places using invariants in 3809 ms returned [181, 187, 206, 211, 234, 240, 262, 267, 287, 292, 313, 318, 339, 345, 366, 371, 391, 397, 419, 424, 443, 449]
[2025-06-01 01:57:07] [INFO ] Actually due to overlaps returned [187, 181]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 3814 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 449/475 places, 444/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 449 transition count 443
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 448 transition count 443
Applied a total of 2 rules in 22 ms. Remains 448 /449 variables (removed 1) and now considering 443/444 (removed 1) transitions.
// Phase 1: matrix 443 rows 448 cols
[2025-06-01 01:57:07] [INFO ] Computed 81 invariants in 67 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:57:11] [INFO ] Implicit Places using invariants in 3504 ms returned [203, 208, 231, 237, 259, 264, 284, 289, 310, 315, 336, 342, 363, 368, 388, 394, 416, 421, 440, 446]
[2025-06-01 01:57:11] [INFO ] Actually due to overlaps returned [208, 203]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 3507 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 446/475 places, 443/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 446 transition count 442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 445 transition count 442
Applied a total of 2 rules in 17 ms. Remains 445 /446 variables (removed 1) and now considering 442/443 (removed 1) transitions.
// Phase 1: matrix 442 rows 445 cols
[2025-06-01 01:57:11] [INFO ] Invariants computation overflowed in 58 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:57:11] [INFO ] Implicit Places using invariants in 351 ms returned []
// Phase 1: matrix 442 rows 445 cols
[2025-06-01 01:57:11] [INFO ] Invariants computation overflowed in 51 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:57:11] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 01:57:22] [INFO ] Implicit Places using invariants and state equation in 10940 ms returned [228, 234, 256, 261, 281, 286, 307, 312, 333, 339, 360, 365, 385, 391, 413, 418, 437, 443]
[2025-06-01 01:57:22] [INFO ] Actually due to overlaps returned [234, 228]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 11300 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 11 : 443/475 places, 442/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 443 transition count 441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 442 transition count 441
Applied a total of 2 rules in 17 ms. Remains 442 /443 variables (removed 1) and now considering 441/442 (removed 1) transitions.
// Phase 1: matrix 441 rows 442 cols
[2025-06-01 01:57:22] [INFO ] Invariants computation overflowed in 26 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:57:22] [INFO ] Implicit Places using invariants in 328 ms returned []
// Phase 1: matrix 441 rows 442 cols
[2025-06-01 01:57:22] [INFO ] Invariants computation overflowed in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:57:22] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 01:57:44] [INFO ] Implicit Places using invariants and state equation in 21687 ms returned [253, 258, 278, 283, 304, 309, 330, 336, 357, 362, 382, 388, 410, 415, 434, 440]
[2025-06-01 01:57:44] [INFO ] Actually due to overlaps returned [258, 253]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 22039 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 12 : 440/475 places, 441/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 440 transition count 440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 439 transition count 440
Applied a total of 2 rules in 15 ms. Remains 439 /440 variables (removed 1) and now considering 440/441 (removed 1) transitions.
// Phase 1: matrix 440 rows 439 cols
[2025-06-01 01:57:44] [INFO ] Invariants computation overflowed in 52 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:57:44] [INFO ] Implicit Places using invariants in 329 ms returned []
// Phase 1: matrix 440 rows 439 cols
[2025-06-01 01:57:44] [INFO ] Invariants computation overflowed in 56 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:57:45] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 01:58:01] [INFO ] Implicit Places using invariants and state equation in 16375 ms returned [275, 280, 301, 306, 327, 333, 354, 359, 379, 385, 407, 412, 431, 437]
[2025-06-01 01:58:01] [INFO ] Actually due to overlaps returned [280, 275]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 16710 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 13 : 437/475 places, 440/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 437 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 436 transition count 439
Applied a total of 2 rules in 20 ms. Remains 436 /437 variables (removed 1) and now considering 439/440 (removed 1) transitions.
// Phase 1: matrix 439 rows 436 cols
[2025-06-01 01:58:01] [INFO ] Invariants computation overflowed in 53 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:58:01] [INFO ] Implicit Places using invariants in 334 ms returned []
// Phase 1: matrix 439 rows 436 cols
[2025-06-01 01:58:01] [INFO ] Invariants computation overflowed in 54 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:58:01] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 01:58:11] [INFO ] Implicit Places using invariants and state equation in 9517 ms returned [298, 303, 324, 330, 351, 356, 376, 382, 404, 409, 428, 434]
[2025-06-01 01:58:11] [INFO ] Actually due to overlaps returned [303, 298]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9869 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 14 : 434/475 places, 439/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 434 transition count 438
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 433 transition count 438
Applied a total of 2 rules in 14 ms. Remains 433 /434 variables (removed 1) and now considering 438/439 (removed 1) transitions.
// Phase 1: matrix 438 rows 433 cols
[2025-06-01 01:58:11] [INFO ] Invariants computation overflowed in 30 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:58:11] [INFO ] Implicit Places using invariants in 295 ms returned []
// Phase 1: matrix 438 rows 433 cols
[2025-06-01 01:58:11] [INFO ] Invariants computation overflowed in 29 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:58:11] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 01:58:19] [INFO ] Implicit Places using invariants and state equation in 8028 ms returned [321, 327, 348, 353, 373, 379, 401, 406, 425, 431]
[2025-06-01 01:58:19] [INFO ] Actually due to overlaps returned [327, 321]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8342 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 15 : 431/475 places, 438/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 431 transition count 437
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 430 transition count 437
Applied a total of 2 rules in 18 ms. Remains 430 /431 variables (removed 1) and now considering 437/438 (removed 1) transitions.
// Phase 1: matrix 437 rows 430 cols
[2025-06-01 01:58:19] [INFO ] Invariants computation overflowed in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:58:19] [INFO ] Implicit Places using invariants in 281 ms returned []
// Phase 1: matrix 437 rows 430 cols
[2025-06-01 01:58:19] [INFO ] Invariants computation overflowed in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:58:19] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 01:58:29] [INFO ] Implicit Places using invariants and state equation in 9678 ms returned [345, 350, 370, 376, 398, 403, 422, 428]
[2025-06-01 01:58:29] [INFO ] Actually due to overlaps returned [350, 345]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9991 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 16 : 428/475 places, 437/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 428 transition count 436
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 427 transition count 436
Applied a total of 2 rules in 14 ms. Remains 427 /428 variables (removed 1) and now considering 436/437 (removed 1) transitions.
// Phase 1: matrix 436 rows 427 cols
[2025-06-01 01:58:29] [INFO ] Invariants computation overflowed in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:58:29] [INFO ] Implicit Places using invariants in 273 ms returned []
// Phase 1: matrix 436 rows 427 cols
[2025-06-01 01:58:29] [INFO ] Invariants computation overflowed in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:58:29] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 01:58:37] [INFO ] Implicit Places using invariants and state equation in 7794 ms returned [367, 373, 395, 400, 419, 425]
[2025-06-01 01:58:37] [INFO ] Actually due to overlaps returned [373, 367]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8085 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 17 : 425/475 places, 436/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 425 transition count 435
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 424 transition count 435
Applied a total of 2 rules in 20 ms. Remains 424 /425 variables (removed 1) and now considering 435/436 (removed 1) transitions.
// Phase 1: matrix 435 rows 424 cols
[2025-06-01 01:58:37] [INFO ] Invariants computation overflowed in 32 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:58:37] [INFO ] Implicit Places using invariants in 289 ms returned []
// Phase 1: matrix 435 rows 424 cols
[2025-06-01 01:58:37] [INFO ] Invariants computation overflowed in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:58:38] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 01:58:47] [INFO ] Implicit Places using invariants and state equation in 9250 ms returned [392, 397, 416, 422]
[2025-06-01 01:58:47] [INFO ] Actually due to overlaps returned [397, 392]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9553 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 18 : 422/475 places, 435/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 422 transition count 434
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 421 transition count 434
Applied a total of 2 rules in 13 ms. Remains 421 /422 variables (removed 1) and now considering 434/435 (removed 1) transitions.
// Phase 1: matrix 434 rows 421 cols
[2025-06-01 01:58:47] [INFO ] Invariants computation overflowed in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:58:47] [INFO ] Implicit Places using invariants in 270 ms returned []
// Phase 1: matrix 434 rows 421 cols
[2025-06-01 01:58:47] [INFO ] Invariants computation overflowed in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:58:47] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 01:58:57] [INFO ] Implicit Places using invariants and state equation in 9892 ms returned [413, 419]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10191 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 19 : 419/475 places, 434/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 419 transition count 433
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 418 transition count 433
Applied a total of 2 rules in 14 ms. Remains 418 /419 variables (removed 1) and now considering 433/434 (removed 1) transitions.
// Phase 1: matrix 433 rows 418 cols
[2025-06-01 01:58:57] [INFO ] Invariants computation overflowed in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:58:57] [INFO ] Implicit Places using invariants in 266 ms returned []
// Phase 1: matrix 433 rows 418 cols
[2025-06-01 01:58:57] [INFO ] Invariants computation overflowed in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:58:57] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 01:59:12] [INFO ] Implicit Places using invariants and state equation in 15176 ms returned []
Implicit Place search using SMT with State Equation took 15459 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 20 : 418/475 places, 433/452 transitions.
Finished structural reductions in REACHABILITY mode , in 20 iterations and 324035 ms. Remains : 418/475 places, 433/452 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 553/553 places, 530/530 transitions.
Applied a total of 0 rules in 14 ms. Remains 553 /553 variables (removed 0) and now considering 530/530 (removed 0) transitions.
// Phase 1: matrix 530 rows 553 cols
[2025-06-01 01:59:13] [INFO ] Invariants computation overflowed in 43 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:59:13] [INFO ] Implicit Places using invariants in 268 ms returned []
// Phase 1: matrix 530 rows 553 cols
[2025-06-01 01:59:13] [INFO ] Invariants computation overflowed in 38 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:59:13] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-01 01:59:20] [INFO ] Implicit Places using invariants and state equation in 7492 ms returned []
Implicit Place search using SMT with State Equation took 7763 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 01:59:20] [INFO ] Redundant transitions in 2 ms returned []
Running 529 sub problems to find dead transitions.
// Phase 1: matrix 530 rows 553 cols
[2025-06-01 01:59:20] [INFO ] Invariants computation overflowed in 30 ms
[2025-06-01 01:59:20] [INFO ] State equation strengthened by 38 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 1 (OVERLAPS) 530/1082 variables, 552/552 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1082 variables, 38/590 constraints. Problems are: Problem set: 0 solved, 529 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1082/1083 variables, and 590 constraints, problems are : Problem set: 0 solved, 529 unsolved in 30024 ms.
Refiners :[State Equation: 552/553 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 529/529 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 529 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 1 (OVERLAPS) 530/1082 variables, 552/552 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1082 variables, 38/590 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1082 variables, 526/1116 constraints. Problems are: Problem set: 0 solved, 529 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1082/1083 variables, and 1116 constraints, problems are : Problem set: 0 solved, 529 unsolved in 30033 ms.
Refiners :[State Equation: 552/553 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 526/529 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60144ms problems are : Problem set: 0 solved, 529 unsolved
Search for dead transitions found 0 dead transitions in 60145ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 67935 ms. Remains : 553/553 places, 530/530 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1743 edges and 553 vertex of which 552 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (5563 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3244 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 376940 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :0 out of 1
Probabilistic random walk after 376940 steps, saw 188533 distinct states, run finished after 3002 ms. (steps per millisecond=125 ) properties seen :0
// Phase 1: matrix 530 rows 553 cols
[2025-06-01 02:00:24] [INFO ] Invariants computation overflowed in 39 ms
[2025-06-01 02:00:24] [INFO ] State equation strengthened by 38 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/12 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 32/44 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 64/108 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/108 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/108 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 87/195 variables, 42/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/195 variables, 4/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/195 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 100/295 variables, 50/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/295 variables, 3/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/295 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 107/402 variables, 55/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/402 variables, 3/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/402 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 93/495 variables, 50/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/495 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/495 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 63/558 variables, 36/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/558 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/558 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 55/613 variables, 28/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/613 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/613 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 55/668 variables, 28/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/668 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/668 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 55/723 variables, 28/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/723 variables, 2/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/723 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 55/778 variables, 28/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/778 variables, 2/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/778 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 55/833 variables, 28/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/833 variables, 2/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/833 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 55/888 variables, 28/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/888 variables, 2/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/888 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 55/943 variables, 28/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/943 variables, 2/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/943 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 55/998 variables, 28/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/998 variables, 2/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/998 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 53/1051 variables, 28/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1051 variables, 2/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1051 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 30/1081 variables, 21/586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1081 variables, 3/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1081 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1083/1083 variables, and 591 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1385 ms.
Refiners :[State Equation: 553/553 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/12 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 32/44 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/44 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 64/108 variables, 30/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/108 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/108 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 87/195 variables, 42/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/195 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/195 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 100/295 variables, 50/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/295 variables, 3/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/295 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 107/402 variables, 55/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/402 variables, 3/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/402 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 93/495 variables, 50/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/495 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:00:25] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 4 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/495 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/495 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 63/558 variables, 36/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/558 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/558 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 55/613 variables, 28/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/613 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/613 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 55/668 variables, 28/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/668 variables, 2/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/668 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 55/723 variables, 28/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/723 variables, 2/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/723 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 55/778 variables, 28/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/778 variables, 2/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/778 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 55/833 variables, 28/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/833 variables, 2/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/833 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 55/888 variables, 28/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/888 variables, 2/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/888 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 55/943 variables, 28/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/943 variables, 2/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/943 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 55/998 variables, 28/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/998 variables, 2/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/998 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 53/1051 variables, 28/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1051 variables, 2/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1051 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 30/1081 variables, 21/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1081 variables, 3/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1081 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (OVERLAPS) 2/1083 variables, 2/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1083 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (OVERLAPS) 0/1083 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1083/1083 variables, and 593 constraints, problems are : Problem set: 0 solved, 1 unsolved in 908 ms.
Refiners :[State Equation: 553/553 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2344ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 97 ms.
Support contains 1 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 530/530 transitions.
Graph (complete) has 1663 edges and 553 vertex of which 552 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 552 transition count 529
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 1 with 77 rules applied. Total rules applied 79 place count 552 transition count 452
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 156 place count 475 transition count 452
Partial Free-agglomeration rule applied 79 times.
Drop transitions (Partial Free agglomeration) removed 79 transitions
Iterating global reduction 2 with 79 rules applied. Total rules applied 235 place count 475 transition count 452
Applied a total of 235 rules in 29 ms. Remains 475 /553 variables (removed 78) and now considering 452/530 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 475/553 places, 452/530 transitions.
RANDOM walk for 40000 steps (5070 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3384 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 411057 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :0 out of 1
Probabilistic random walk after 411057 steps, saw 205650 distinct states, run finished after 3001 ms. (steps per millisecond=136 ) properties seen :0
// Phase 1: matrix 452 rows 475 cols
[2025-06-01 02:00:29] [INFO ] Invariants computation overflowed in 46 ms
[2025-06-01 02:00:29] [INFO ] State equation strengthened by 78 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/11 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 139/150 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 506/656 variables, 239/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/656 variables, 44/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/656 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 271/927 variables, 213/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/927 variables, 31/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/927 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/927 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 927/927 variables, and 553 constraints, problems are : Problem set: 0 solved, 1 unsolved in 565 ms.
Refiners :[State Equation: 475/475 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/11 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 139/150 variables, 19/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 506/656 variables, 239/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/656 variables, 44/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:00:30] [INFO ] Deduced a trap along path composed of 5 places in 28 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:00:30] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/656 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/656 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 271/927 variables, 213/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/927 variables, 31/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/927 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/927 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 927/927 variables, and 556 constraints, problems are : Problem set: 0 solved, 1 unsolved in 842 ms.
Refiners :[State Equation: 475/475 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 1464ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 87 ms.
Support contains 1 out of 475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 452/452 transitions.
Applied a total of 0 rules in 9 ms. Remains 475 /475 variables (removed 0) and now considering 452/452 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 475/475 places, 452/452 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 452/452 transitions.
Applied a total of 0 rules in 9 ms. Remains 475 /475 variables (removed 0) and now considering 452/452 (removed 0) transitions.
// Phase 1: matrix 452 rows 475 cols
[2025-06-01 02:00:31] [INFO ] Invariants computation overflowed in 46 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:00:31] [INFO ] Implicit Places using invariants in 492 ms returned []
// Phase 1: matrix 452 rows 475 cols
[2025-06-01 02:00:31] [INFO ] Invariants computation overflowed in 43 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:00:32] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:01:02] [INFO ] Performed 154/475 implicitness test of which 11 returned IMPLICIT in 30 seconds.
[2025-06-01 02:01:14] [INFO ] Implicit Places using invariants and state equation in 42963 ms returned [42, 48, 68, 73, 94, 101, 121, 127, 148, 153, 154, 174, 179, 200, 206, 213, 227, 232, 255, 261, 283, 288, 308, 313, 334, 339, 360, 366, 387, 389, 393, 413, 419, 441, 446, 450, 467, 473]
[2025-06-01 02:01:14] [INFO ] Actually due to overlaps returned [213, 153]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 43462 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 473/475 places, 452/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 473 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 472 transition count 451
Applied a total of 2 rules in 28 ms. Remains 472 /473 variables (removed 1) and now considering 451/452 (removed 1) transitions.
// Phase 1: matrix 451 rows 472 cols
[2025-06-01 02:01:14] [INFO ] Invariants computation overflowed in 40 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:01:15] [INFO ] Implicit Places using invariants in 468 ms returned []
// Phase 1: matrix 451 rows 472 cols
[2025-06-01 02:01:15] [INFO ] Invariants computation overflowed in 38 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:01:15] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:01:39] [INFO ] Implicit Places using invariants and state equation in 23823 ms returned [42, 48, 68, 73, 94, 101, 121, 127, 148, 153, 173, 178, 199, 205, 224, 229, 252, 258, 280, 285, 305, 310, 331, 336, 357, 363, 384, 386, 390, 410, 416, 438, 443, 447, 464, 470]
[2025-06-01 02:01:39] [INFO ] Actually due to overlaps returned [447, 386]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 24310 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 470/475 places, 451/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 470 transition count 450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 469 transition count 450
Applied a total of 2 rules in 17 ms. Remains 469 /470 variables (removed 1) and now considering 450/451 (removed 1) transitions.
// Phase 1: matrix 450 rows 469 cols
[2025-06-01 02:01:39] [INFO ] Invariants computation overflowed in 34 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:01:39] [INFO ] Implicit Places using invariants in 438 ms returned []
// Phase 1: matrix 450 rows 469 cols
[2025-06-01 02:01:39] [INFO ] Invariants computation overflowed in 39 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:01:39] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:02:02] [INFO ] Implicit Places using invariants and state equation in 22541 ms returned [42, 48, 68, 73, 94, 101, 121, 127, 148, 153, 173, 178, 199, 205, 224, 229, 252, 258, 280, 285, 305, 310, 331, 336, 357, 363, 384, 389, 409, 415, 437, 442, 461, 467]
[2025-06-01 02:02:02] [INFO ] Actually due to overlaps returned [48, 42]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 22995 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 467/475 places, 450/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 467 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 466 transition count 449
Applied a total of 2 rules in 18 ms. Remains 466 /467 variables (removed 1) and now considering 449/450 (removed 1) transitions.
// Phase 1: matrix 449 rows 466 cols
[2025-06-01 02:02:02] [INFO ] Invariants computation overflowed in 36 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:02:02] [INFO ] Implicit Places using invariants in 435 ms returned []
// Phase 1: matrix 449 rows 466 cols
[2025-06-01 02:02:02] [INFO ] Invariants computation overflowed in 36 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:02:02] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:02:29] [INFO ] Implicit Places using invariants and state equation in 27178 ms returned [65, 70, 91, 98, 118, 124, 145, 150, 170, 175, 196, 202, 221, 226, 249, 255, 277, 282, 302, 307, 328, 333, 354, 360, 381, 386, 406, 412, 434, 439, 458, 464]
[2025-06-01 02:02:29] [INFO ] Actually due to overlaps returned [70, 65]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 27634 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 464/475 places, 449/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 464 transition count 448
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 463 transition count 448
Applied a total of 2 rules in 26 ms. Remains 463 /464 variables (removed 1) and now considering 448/449 (removed 1) transitions.
// Phase 1: matrix 448 rows 463 cols
[2025-06-01 02:02:29] [INFO ] Invariants computation overflowed in 27 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:02:30] [INFO ] Implicit Places using invariants in 425 ms returned []
// Phase 1: matrix 448 rows 463 cols
[2025-06-01 02:02:30] [INFO ] Invariants computation overflowed in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:02:30] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:02:49] [INFO ] Implicit Places using invariants and state equation in 18943 ms returned [88, 95, 115, 121, 142, 147, 167, 172, 193, 199, 218, 223, 246, 252, 274, 279, 299, 304, 325, 330, 351, 357, 378, 383, 403, 409, 431, 436, 455, 461]
[2025-06-01 02:02:49] [INFO ] Actually due to overlaps returned [95, 88]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 19386 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 461/475 places, 448/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 461 transition count 447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 460 transition count 447
Applied a total of 2 rules in 34 ms. Remains 460 /461 variables (removed 1) and now considering 447/448 (removed 1) transitions.
// Phase 1: matrix 447 rows 460 cols
[2025-06-01 02:02:49] [INFO ] Invariants computation overflowed in 32 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:02:49] [INFO ] Implicit Places using invariants in 386 ms returned []
// Phase 1: matrix 447 rows 460 cols
[2025-06-01 02:02:49] [INFO ] Invariants computation overflowed in 26 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:02:49] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:03:04] [INFO ] Implicit Places using invariants and state equation in 14619 ms returned [112, 118, 139, 144, 164, 169, 190, 196, 215, 220, 243, 249, 271, 276, 296, 301, 322, 327, 348, 354, 375, 380, 400, 406, 428, 433, 452, 458]
[2025-06-01 02:03:04] [INFO ] Actually due to overlaps returned [118, 112]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 15031 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 458/475 places, 447/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 458 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 457 transition count 446
Applied a total of 2 rules in 16 ms. Remains 457 /458 variables (removed 1) and now considering 446/447 (removed 1) transitions.
// Phase 1: matrix 446 rows 457 cols
[2025-06-01 02:03:04] [INFO ] Invariants computation overflowed in 29 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:03:04] [INFO ] Implicit Places using invariants in 371 ms returned []
// Phase 1: matrix 446 rows 457 cols
[2025-06-01 02:03:04] [INFO ] Invariants computation overflowed in 29 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:03:04] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:03:22] [INFO ] Implicit Places using invariants and state equation in 17845 ms returned [136, 141, 161, 166, 187, 193, 212, 217, 240, 246, 268, 273, 293, 298, 319, 324, 345, 351, 372, 377, 397, 403, 425, 430, 449, 455]
[2025-06-01 02:03:22] [INFO ] Actually due to overlaps returned [141, 136]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 18234 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 455/475 places, 446/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 455 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 454 transition count 445
Applied a total of 2 rules in 21 ms. Remains 454 /455 variables (removed 1) and now considering 445/446 (removed 1) transitions.
// Phase 1: matrix 445 rows 454 cols
[2025-06-01 02:03:22] [INFO ] Invariants computation overflowed in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:03:22] [INFO ] Implicit Places using invariants in 362 ms returned []
// Phase 1: matrix 445 rows 454 cols
[2025-06-01 02:03:22] [INFO ] Invariants computation overflowed in 24 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:03:23] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:03:45] [INFO ] Implicit Places using invariants and state equation in 22125 ms returned [158, 163, 184, 190, 209, 214, 237, 243, 265, 270, 290, 295, 316, 321, 342, 348, 369, 374, 394, 400, 422, 427, 446, 452]
[2025-06-01 02:03:45] [INFO ] Actually due to overlaps returned [163, 158]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 22501 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 452/475 places, 445/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 452 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 451 transition count 444
Applied a total of 2 rules in 21 ms. Remains 451 /452 variables (removed 1) and now considering 444/445 (removed 1) transitions.
// Phase 1: matrix 444 rows 451 cols
[2025-06-01 02:03:45] [INFO ] Computed 83 invariants in 58 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:03:49] [INFO ] Implicit Places using invariants in 3938 ms returned [181, 187, 206, 211, 234, 240, 262, 267, 287, 292, 313, 318, 339, 345, 366, 371, 391, 397, 419, 424, 443, 449]
[2025-06-01 02:03:49] [INFO ] Actually due to overlaps returned [187, 181]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 3953 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 449/475 places, 444/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 449 transition count 443
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 448 transition count 443
Applied a total of 2 rules in 15 ms. Remains 448 /449 variables (removed 1) and now considering 443/444 (removed 1) transitions.
// Phase 1: matrix 443 rows 448 cols
[2025-06-01 02:03:49] [INFO ] Computed 81 invariants in 55 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:03:52] [INFO ] Implicit Places using invariants in 3551 ms returned [203, 208, 231, 237, 259, 264, 284, 289, 310, 315, 336, 342, 363, 368, 388, 394, 416, 421, 440, 446]
[2025-06-01 02:03:52] [INFO ] Actually due to overlaps returned [208, 203]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 3572 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 446/475 places, 443/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 446 transition count 442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 445 transition count 442
Applied a total of 2 rules in 17 ms. Remains 445 /446 variables (removed 1) and now considering 442/443 (removed 1) transitions.
// Phase 1: matrix 442 rows 445 cols
[2025-06-01 02:03:52] [INFO ] Invariants computation overflowed in 59 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:03:53] [INFO ] Implicit Places using invariants in 381 ms returned []
// Phase 1: matrix 442 rows 445 cols
[2025-06-01 02:03:53] [INFO ] Invariants computation overflowed in 52 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:03:53] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:04:04] [INFO ] Implicit Places using invariants and state equation in 11031 ms returned [228, 234, 256, 261, 281, 286, 307, 312, 333, 339, 360, 365, 385, 391, 413, 418, 437, 443]
[2025-06-01 02:04:04] [INFO ] Actually due to overlaps returned [234, 228]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 11429 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 11 : 443/475 places, 442/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 443 transition count 441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 442 transition count 441
Applied a total of 2 rules in 15 ms. Remains 442 /443 variables (removed 1) and now considering 441/442 (removed 1) transitions.
// Phase 1: matrix 441 rows 442 cols
[2025-06-01 02:04:04] [INFO ] Invariants computation overflowed in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:04:04] [INFO ] Implicit Places using invariants in 348 ms returned []
// Phase 1: matrix 441 rows 442 cols
[2025-06-01 02:04:04] [INFO ] Invariants computation overflowed in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:04:04] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:04:26] [INFO ] Implicit Places using invariants and state equation in 22150 ms returned [253, 258, 278, 283, 304, 309, 330, 336, 357, 362, 382, 388, 410, 415, 434, 440]
[2025-06-01 02:04:26] [INFO ] Actually due to overlaps returned [258, 253]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 22526 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 12 : 440/475 places, 441/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 440 transition count 440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 439 transition count 440
Applied a total of 2 rules in 24 ms. Remains 439 /440 variables (removed 1) and now considering 440/441 (removed 1) transitions.
// Phase 1: matrix 440 rows 439 cols
[2025-06-01 02:04:26] [INFO ] Invariants computation overflowed in 49 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:04:26] [INFO ] Implicit Places using invariants in 322 ms returned []
// Phase 1: matrix 440 rows 439 cols
[2025-06-01 02:04:27] [INFO ] Invariants computation overflowed in 48 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:04:27] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:04:42] [INFO ] Implicit Places using invariants and state equation in 15723 ms returned [275, 280, 301, 306, 327, 333, 354, 359, 379, 385, 407, 412, 431, 437]
[2025-06-01 02:04:42] [INFO ] Actually due to overlaps returned [280, 275]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 16062 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 13 : 437/475 places, 440/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 437 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 436 transition count 439
Applied a total of 2 rules in 15 ms. Remains 436 /437 variables (removed 1) and now considering 439/440 (removed 1) transitions.
// Phase 1: matrix 439 rows 436 cols
[2025-06-01 02:04:42] [INFO ] Invariants computation overflowed in 48 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:04:43] [INFO ] Implicit Places using invariants in 322 ms returned []
// Phase 1: matrix 439 rows 436 cols
[2025-06-01 02:04:43] [INFO ] Invariants computation overflowed in 52 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:04:43] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:04:52] [INFO ] Implicit Places using invariants and state equation in 9093 ms returned [298, 303, 324, 330, 351, 356, 376, 382, 404, 409, 428, 434]
[2025-06-01 02:04:52] [INFO ] Actually due to overlaps returned [303, 298]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9429 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 14 : 434/475 places, 439/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 434 transition count 438
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 433 transition count 438
Applied a total of 2 rules in 15 ms. Remains 433 /434 variables (removed 1) and now considering 438/439 (removed 1) transitions.
// Phase 1: matrix 438 rows 433 cols
[2025-06-01 02:04:52] [INFO ] Invariants computation overflowed in 26 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:04:52] [INFO ] Implicit Places using invariants in 300 ms returned []
// Phase 1: matrix 438 rows 433 cols
[2025-06-01 02:04:52] [INFO ] Invariants computation overflowed in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:04:52] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:05:00] [INFO ] Implicit Places using invariants and state equation in 8138 ms returned [321, 327, 348, 353, 373, 379, 401, 406, 425, 431]
[2025-06-01 02:05:00] [INFO ] Actually due to overlaps returned [327, 321]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8472 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 15 : 431/475 places, 438/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 431 transition count 437
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 430 transition count 437
Applied a total of 2 rules in 15 ms. Remains 430 /431 variables (removed 1) and now considering 437/438 (removed 1) transitions.
// Phase 1: matrix 437 rows 430 cols
[2025-06-01 02:05:00] [INFO ] Invariants computation overflowed in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:05:00] [INFO ] Implicit Places using invariants in 295 ms returned []
// Phase 1: matrix 437 rows 430 cols
[2025-06-01 02:05:00] [INFO ] Invariants computation overflowed in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:05:01] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:05:10] [INFO ] Implicit Places using invariants and state equation in 9643 ms returned [345, 350, 370, 376, 398, 403, 422, 428]
[2025-06-01 02:05:10] [INFO ] Actually due to overlaps returned [350, 345]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9950 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 16 : 428/475 places, 437/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 428 transition count 436
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 427 transition count 436
Applied a total of 2 rules in 20 ms. Remains 427 /428 variables (removed 1) and now considering 436/437 (removed 1) transitions.
// Phase 1: matrix 436 rows 427 cols
[2025-06-01 02:05:10] [INFO ] Invariants computation overflowed in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:05:10] [INFO ] Implicit Places using invariants in 272 ms returned []
// Phase 1: matrix 436 rows 427 cols
[2025-06-01 02:05:10] [INFO ] Invariants computation overflowed in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:05:11] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:05:18] [INFO ] Implicit Places using invariants and state equation in 8074 ms returned [367, 373, 395, 400, 419, 425]
[2025-06-01 02:05:18] [INFO ] Actually due to overlaps returned [373, 367]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8360 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 17 : 425/475 places, 436/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 425 transition count 435
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 424 transition count 435
Applied a total of 2 rules in 13 ms. Remains 424 /425 variables (removed 1) and now considering 435/436 (removed 1) transitions.
// Phase 1: matrix 435 rows 424 cols
[2025-06-01 02:05:19] [INFO ] Invariants computation overflowed in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:05:19] [INFO ] Implicit Places using invariants in 289 ms returned []
// Phase 1: matrix 435 rows 424 cols
[2025-06-01 02:05:19] [INFO ] Invariants computation overflowed in 24 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:05:19] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:05:28] [INFO ] Implicit Places using invariants and state equation in 9232 ms returned [392, 397, 416, 422]
[2025-06-01 02:05:28] [INFO ] Actually due to overlaps returned [397, 392]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9523 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 18 : 422/475 places, 435/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 422 transition count 434
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 421 transition count 434
Applied a total of 2 rules in 21 ms. Remains 421 /422 variables (removed 1) and now considering 434/435 (removed 1) transitions.
// Phase 1: matrix 434 rows 421 cols
[2025-06-01 02:05:28] [INFO ] Invariants computation overflowed in 30 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:05:28] [INFO ] Implicit Places using invariants in 290 ms returned []
// Phase 1: matrix 434 rows 421 cols
[2025-06-01 02:05:28] [INFO ] Invariants computation overflowed in 28 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:05:29] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:05:39] [INFO ] Implicit Places using invariants and state equation in 10409 ms returned [413, 419]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10705 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 19 : 419/475 places, 434/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 419 transition count 433
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 418 transition count 433
Applied a total of 2 rules in 14 ms. Remains 418 /419 variables (removed 1) and now considering 433/434 (removed 1) transitions.
// Phase 1: matrix 433 rows 418 cols
[2025-06-01 02:05:39] [INFO ] Invariants computation overflowed in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:05:39] [INFO ] Implicit Places using invariants in 282 ms returned []
// Phase 1: matrix 433 rows 418 cols
[2025-06-01 02:05:39] [INFO ] Invariants computation overflowed in 24 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:05:39] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:05:55] [INFO ] Implicit Places using invariants and state equation in 15535 ms returned []
Implicit Place search using SMT with State Equation took 15819 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 20 : 418/475 places, 433/452 transitions.
Finished structural reductions in REACHABILITY mode , in 20 iterations and 323734 ms. Remains : 418/475 places, 433/452 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13840 reset in 103 ms.
Product exploration explored 100000 steps with 13755 reset in 107 ms.
Built C files in :
/tmp/ltsmin17089989151740088830
[2025-06-01 02:05:55] [INFO ] Computing symmetric may disable matrix : 530 transitions.
[2025-06-01 02:05:55] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 02:05:55] [INFO ] Computing symmetric may enable matrix : 530 transitions.
[2025-06-01 02:05:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 02:05:55] [INFO ] Computing Do-Not-Accords matrix : 530 transitions.
[2025-06-01 02:05:55] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 02:05:55] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17089989151740088830
Running compilation step : cd /tmp/ltsmin17089989151740088830;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1265 ms.
Running link step : cd /tmp/ltsmin17089989151740088830;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin17089989151740088830;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3947387294316647528.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 553/553 places, 530/530 transitions.
Applied a total of 0 rules in 18 ms. Remains 553 /553 variables (removed 0) and now considering 530/530 (removed 0) transitions.
// Phase 1: matrix 530 rows 553 cols
[2025-06-01 02:06:10] [INFO ] Invariants computation overflowed in 38 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:06:11] [INFO ] Implicit Places using invariants in 270 ms returned []
// Phase 1: matrix 530 rows 553 cols
[2025-06-01 02:06:11] [INFO ] Invariants computation overflowed in 44 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:06:11] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-01 02:06:18] [INFO ] Implicit Places using invariants and state equation in 7650 ms returned []
Implicit Place search using SMT with State Equation took 7925 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 02:06:18] [INFO ] Redundant transitions in 5 ms returned []
Running 529 sub problems to find dead transitions.
// Phase 1: matrix 530 rows 553 cols
[2025-06-01 02:06:18] [INFO ] Invariants computation overflowed in 34 ms
[2025-06-01 02:06:18] [INFO ] State equation strengthened by 38 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 1 (OVERLAPS) 530/1082 variables, 552/552 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1082 variables, 38/590 constraints. Problems are: Problem set: 0 solved, 529 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1082/1083 variables, and 590 constraints, problems are : Problem set: 0 solved, 529 unsolved in 30023 ms.
Refiners :[State Equation: 552/553 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 529/529 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 529 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 1 (OVERLAPS) 530/1082 variables, 552/552 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1082 variables, 38/590 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1082 variables, 526/1116 constraints. Problems are: Problem set: 0 solved, 529 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1082/1083 variables, and 1116 constraints, problems are : Problem set: 0 solved, 529 unsolved in 30020 ms.
Refiners :[State Equation: 552/553 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 526/529 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60140ms problems are : Problem set: 0 solved, 529 unsolved
Search for dead transitions found 0 dead transitions in 60142ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 68107 ms. Remains : 553/553 places, 530/530 transitions.
Built C files in :
/tmp/ltsmin15334381865725729703
[2025-06-01 02:07:18] [INFO ] Computing symmetric may disable matrix : 530 transitions.
[2025-06-01 02:07:18] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 02:07:18] [INFO ] Computing symmetric may enable matrix : 530 transitions.
[2025-06-01 02:07:18] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 02:07:18] [INFO ] Computing Do-Not-Accords matrix : 530 transitions.
[2025-06-01 02:07:18] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 02:07:18] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15334381865725729703
Running compilation step : cd /tmp/ltsmin15334381865725729703;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1243 ms.
Running link step : cd /tmp/ltsmin15334381865725729703;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin15334381865725729703;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8059523227968285316.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-01 02:07:34] [INFO ] Flatten gal took : 17 ms
[2025-06-01 02:07:34] [INFO ] Flatten gal took : 17 ms
[2025-06-01 02:07:34] [INFO ] Time to serialize gal into /tmp/LTL16261043022107293155.gal : 4 ms
[2025-06-01 02:07:34] [INFO ] Time to serialize properties into /tmp/LTL15734576290078152688.prop : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16261043022107293155.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8635472561358546036.hoa' '-atoms' '/tmp/LTL15734576290078152688.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15734576290078152688.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8635472561358546036.hoa
Detected timeout of ITS tools.
[2025-06-01 02:07:49] [INFO ] Flatten gal took : 18 ms
[2025-06-01 02:07:49] [INFO ] Flatten gal took : 20 ms
[2025-06-01 02:07:49] [INFO ] Time to serialize gal into /tmp/LTL11244245673206900043.gal : 6 ms
[2025-06-01 02:07:49] [INFO ] Time to serialize properties into /tmp/LTL14222559990382411702.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11244245673206900043.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14222559990382411702.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("(p245<1)"))))
Formula 0 simplified : FG!"(p245<1)"
Detected timeout of ITS tools.
[2025-06-01 02:08:04] [INFO ] Flatten gal took : 16 ms
[2025-06-01 02:08:04] [INFO ] Applying decomposition
[2025-06-01 02:08:04] [INFO ] Flatten gal took : 13 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/graph15117181729373744372.txt' '-o' '/tmp/graph15117181729373744372.bin' '-w' '/tmp/graph15117181729373744372.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15117181729373744372.bin' '-l' '-1' '-v' '-w' '/tmp/graph15117181729373744372.weights' '-q' '0' '-e' '0.001'
[2025-06-01 02:08:04] [INFO ] Decomposing Gal with order
[2025-06-01 02:08:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 02:08:04] [INFO ] Removed a total of 411 redundant transitions.
[2025-06-01 02:08:04] [INFO ] Flatten gal took : 34 ms
[2025-06-01 02:08:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 21 ms.
[2025-06-01 02:08:04] [INFO ] Time to serialize gal into /tmp/LTL22840722228017848.gal : 6 ms
[2025-06-01 02:08:04] [INFO ] Time to serialize properties into /tmp/LTL11616646603661939826.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL22840722228017848.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11616646603661939826.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((G(F("(i5.i2.u42.p245<1)"))))
Formula 0 simplified : FG!"(i5.i2.u42.p245<1)"
Detected timeout of ITS tools.
Treatment of property DoubleExponent-PT-020-LTLFireability-01 finished in 949563 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0&&F(p1)))&&F((G(F(p2))||(!p3&&F(p2))))))'
Support contains 6 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 28 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2025-06-01 02:08:19] [INFO ] Invariants computation overflowed in 106 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:08:20] [INFO ] Implicit Places using invariants in 445 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2025-06-01 02:08:20] [INFO ] Invariants computation overflowed in 111 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:08:33] [INFO ] Implicit Places using invariants and state equation in 13930 ms returned []
Implicit Place search using SMT with State Equation took 14388 ms to find 0 implicit places.
Running 996 sub problems to find dead transitions.
// Phase 1: matrix 997 rows 1057 cols
[2025-06-01 02:08:34] [INFO ] Invariants computation overflowed in 102 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1056 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 996 unsolved
SMT process timed out in 30235ms, After SMT, problems are : Problem set: 0 solved, 996 unsolved
Search for dead transitions found 0 dead transitions in 30238ms
Finished structural reductions in LTL mode , in 1 iterations and 44657 ms. Remains : 1057/1057 places, 997/997 transitions.
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p2), true, (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 296 ms.
Product exploration explored 100000 steps with 50000 reset in 285 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p3) p2 p0 p1), (X (NOT p3)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p2), (X p1), (X (X (NOT p3))), (X (X p1)), (X (X p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 21 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-020-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-020-LTLFireability-02 finished in 45531 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 3 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 240 place count 1055 transition count 756
Reduce places removed 239 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 240 rules applied. Total rules applied 480 place count 816 transition count 755
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 481 place count 815 transition count 755
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 481 place count 815 transition count 715
Deduced a syphon composed of 40 places in 6 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 561 place count 775 transition count 715
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 2 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 3 with 364 rules applied. Total rules applied 925 place count 593 transition count 533
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 1001 place count 555 transition count 533
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1002 place count 554 transition count 532
Applied a total of 1002 rules in 66 ms. Remains 554 /1057 variables (removed 503) and now considering 532/997 (removed 465) transitions.
// Phase 1: matrix 532 rows 554 cols
[2025-06-01 02:09:05] [INFO ] Computed 99 invariants in 58 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:09:05] [INFO ] Implicit Places using invariants in 329 ms returned []
[2025-06-01 02:09:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:09:05] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-01 02:09:15] [INFO ] Implicit Places using invariants and state equation in 10291 ms returned []
Implicit Place search using SMT with State Equation took 10637 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 02:09:15] [INFO ] Redundant transitions in 2 ms returned []
Running 531 sub problems to find dead transitions.
[2025-06-01 02:09:15] [INFO ] Invariant cache hit.
[2025-06-01 02:09:15] [INFO ] State equation strengthened by 38 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/553 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/553 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/553 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 3 (OVERLAPS) 532/1085 variables, 553/652 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1085 variables, 38/690 constraints. Problems are: Problem set: 0 solved, 531 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1085/1086 variables, and 690 constraints, problems are : Problem set: 0 solved, 531 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 553/554 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 531/531 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 531 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/553 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/553 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/553 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 3 (OVERLAPS) 532/1085 variables, 553/652 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1085 variables, 38/690 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1085 variables, 528/1218 constraints. Problems are: Problem set: 0 solved, 531 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1085/1086 variables, and 1218 constraints, problems are : Problem set: 0 solved, 531 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 553/554 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 528/531 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60091ms problems are : Problem set: 0 solved, 531 unsolved
Search for dead transitions found 0 dead transitions in 60092ms
Starting structural reductions in SI_LTL mode, iteration 1 : 554/1057 places, 532/997 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70811 ms. Remains : 554/1057 places, 532/997 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-03
Product exploration explored 100000 steps with 13929 reset in 112 ms.
Product exploration explored 100000 steps with 13870 reset in 115 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1741 edges and 554 vertex of which 553 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 100 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (5512 resets) in 96 ms. (412 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3208 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3235 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 379327 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :1 out of 2
Probabilistic random walk after 379327 steps, saw 189714 distinct states, run finished after 3002 ms. (steps per millisecond=126 ) properties seen :1
[2025-06-01 02:10:19] [INFO ] Invariant cache hit.
[2025-06-01 02:10:19] [INFO ] State equation strengthened by 38 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 178/180 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 260/440 variables, 54/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/440 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/497 variables, 24/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 522/1019 variables, 497/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1019 variables, 36/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1019 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 61/1080 variables, 52/680 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1080 variables, 2/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1080 variables, 1/683 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1080 variables, 0/683 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/1082 variables, 2/685 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1082 variables, 2/687 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1082 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/1086 variables, 3/690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1086 variables, 1/691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1086 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1086 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1086/1086 variables, and 691 constraints, problems are : Problem set: 0 solved, 1 unsolved in 713 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 554/554 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 178/180 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 260/440 variables, 54/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/440 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/497 variables, 24/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:20] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 522/1019 variables, 497/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1019 variables, 36/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:20] [INFO ] Deduced a trap along path composed of 8 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:20] [INFO ] Deduced a trap along path composed of 4 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:20] [INFO ] Deduced a trap along path composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1019 variables, 3/632 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1019 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 61/1080 variables, 52/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1080 variables, 2/686 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1080 variables, 1/687 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1080/1086 variables, and 688 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1974 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 95/97 constraints, State Equation: 549/554 constraints, ReadFeed: 37/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 2694ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 554 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 554/554 places, 532/532 transitions.
Graph (complete) has 1661 edges and 554 vertex of which 553 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 553 transition count 530
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 552 transition count 530
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 6 place count 551 transition count 529
Free-agglomeration rule (complex) applied 75 times.
Iterating global reduction 2 with 75 rules applied. Total rules applied 81 place count 551 transition count 454
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 2 with 75 rules applied. Total rules applied 156 place count 476 transition count 454
Partial Free-agglomeration rule applied 79 times.
Drop transitions (Partial Free agglomeration) removed 79 transitions
Iterating global reduction 3 with 79 rules applied. Total rules applied 235 place count 476 transition count 454
Applied a total of 235 rules in 40 ms. Remains 476 /554 variables (removed 78) and now considering 454/532 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 476/554 places, 454/532 transitions.
RANDOM walk for 40000 steps (5065 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3325 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 415185 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :0 out of 1
Probabilistic random walk after 415185 steps, saw 207715 distinct states, run finished after 3002 ms. (steps per millisecond=138 ) properties seen :0
// Phase 1: matrix 454 rows 476 cols
[2025-06-01 02:10:25] [INFO ] Invariants computation overflowed in 42 ms
[2025-06-01 02:10:25] [INFO ] State equation strengthened by 78 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 126/134 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 504/638 variables, 232/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/638 variables, 45/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/638 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 292/930 variables, 227/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/930 variables, 33/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/930 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/930 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 930/930 variables, and 554 constraints, problems are : Problem set: 0 solved, 1 unsolved in 730 ms.
Refiners :[State Equation: 476/476 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 126/134 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 504/638 variables, 232/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/638 variables, 45/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/638 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 292/930 variables, 227/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/930 variables, 33/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:27] [INFO ] Deduced a trap composed of 8 places in 250 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:27] [INFO ] Deduced a trap composed of 13 places in 244 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:27] [INFO ] Deduced a trap composed of 9 places in 239 ms of which 17 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/930 variables, 3/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/930 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/930 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 930/930 variables, and 558 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1681 ms.
Refiners :[State Equation: 476/476 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2467ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 46 ms.
Support contains 2 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 454/454 transitions.
Applied a total of 0 rules in 8 ms. Remains 476 /476 variables (removed 0) and now considering 454/454 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 476/476 places, 454/454 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 454/454 transitions.
Applied a total of 0 rules in 8 ms. Remains 476 /476 variables (removed 0) and now considering 454/454 (removed 0) transitions.
// Phase 1: matrix 454 rows 476 cols
[2025-06-01 02:10:27] [INFO ] Invariants computation overflowed in 42 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:10:28] [INFO ] Implicit Places using invariants in 421 ms returned []
// Phase 1: matrix 454 rows 476 cols
[2025-06-01 02:10:28] [INFO ] Invariants computation overflowed in 42 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:10:28] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:10:58] [INFO ] Performed 329/476 implicitness test of which 23 returned IMPLICIT in 30 seconds.
[2025-06-01 02:11:01] [INFO ] Implicit Places using invariants and state equation in 33297 ms returned [42, 70, 75, 97, 102, 122, 128, 149, 154, 155, 175, 180, 201, 207, 214, 228, 233, 256, 262, 284, 289, 309, 314, 335, 340, 361, 367, 388, 390, 394, 414, 420, 442, 447, 451, 468, 474]
[2025-06-01 02:11:01] [INFO ] Actually due to overlaps returned [75, 214, 70, 154]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 33725 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 472/476 places, 454/454 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 472 transition count 453
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 471 transition count 453
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 471 transition count 453
Applied a total of 4 rules in 29 ms. Remains 471 /472 variables (removed 1) and now considering 453/454 (removed 1) transitions.
// Phase 1: matrix 453 rows 471 cols
[2025-06-01 02:11:01] [INFO ] Invariants computation overflowed in 44 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:11:02] [INFO ] Implicit Places using invariants in 400 ms returned []
// Phase 1: matrix 453 rows 471 cols
[2025-06-01 02:11:02] [INFO ] Invariants computation overflowed in 24 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:11:02] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:11:28] [INFO ] Implicit Places using invariants and state equation in 26229 ms returned [42, 95, 100, 120, 126, 147, 152, 172, 177, 198, 204, 223, 228, 251, 257, 279, 284, 304, 309, 330, 335, 356, 362, 383, 385, 389, 409, 415, 437, 442, 446, 463, 469]
[2025-06-01 02:11:28] [INFO ] Actually due to overlaps returned [100, 446, 95, 385]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 26632 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 467/476 places, 453/454 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 467 transition count 451
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 465 transition count 451
Applied a total of 4 rules in 24 ms. Remains 465 /467 variables (removed 2) and now considering 451/453 (removed 2) transitions.
// Phase 1: matrix 451 rows 465 cols
[2025-06-01 02:11:28] [INFO ] Invariants computation overflowed in 30 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:11:28] [INFO ] Implicit Places using invariants in 429 ms returned []
// Phase 1: matrix 451 rows 465 cols
[2025-06-01 02:11:28] [INFO ] Invariants computation overflowed in 29 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:11:28] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:11:59] [INFO ] Performed 336/465 implicitness test of which 19 returned IMPLICIT in 30 seconds.
[2025-06-01 02:12:00] [INFO ] Implicit Places using invariants and state equation in 32145 ms returned [42, 117, 123, 144, 149, 169, 174, 195, 201, 220, 225, 248, 254, 276, 281, 301, 306, 327, 332, 353, 359, 380, 385, 405, 411, 433, 438, 457, 463]
[2025-06-01 02:12:00] [INFO ] Actually due to overlaps returned [123, 42, 117]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 32622 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 462/476 places, 451/454 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 462 transition count 450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 461 transition count 450
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 461 transition count 450
Applied a total of 3 rules in 25 ms. Remains 461 /462 variables (removed 1) and now considering 450/451 (removed 1) transitions.
// Phase 1: matrix 450 rows 461 cols
[2025-06-01 02:12:01] [INFO ] Computed 88 invariants in 67 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:12:05] [INFO ] Implicit Places using invariants in 4750 ms returned [140, 145, 165, 170, 191, 197, 216, 221, 244, 250, 272, 277, 297, 302, 323, 328, 349, 355, 376, 381, 401, 407, 429, 434, 453, 459]
[2025-06-01 02:12:05] [INFO ] Actually due to overlaps returned [145, 140]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 4753 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 459/476 places, 450/454 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 459 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 458 transition count 449
Applied a total of 2 rules in 16 ms. Remains 458 /459 variables (removed 1) and now considering 449/450 (removed 1) transitions.
// Phase 1: matrix 449 rows 458 cols
[2025-06-01 02:12:05] [INFO ] Invariants computation overflowed in 28 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:12:06] [INFO ] Implicit Places using invariants in 334 ms returned []
// Phase 1: matrix 449 rows 458 cols
[2025-06-01 02:12:06] [INFO ] Invariants computation overflowed in 27 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:12:06] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:12:21] [INFO ] Implicit Places using invariants and state equation in 15882 ms returned [162, 167, 188, 194, 213, 218, 241, 247, 269, 274, 294, 299, 320, 325, 346, 352, 373, 378, 398, 404, 426, 431, 450, 456]
[2025-06-01 02:12:21] [INFO ] Actually due to overlaps returned [167, 162]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 16233 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 456/476 places, 449/454 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 456 transition count 448
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 455 transition count 448
Applied a total of 2 rules in 17 ms. Remains 455 /456 variables (removed 1) and now considering 448/449 (removed 1) transitions.
// Phase 1: matrix 448 rows 455 cols
[2025-06-01 02:12:21] [INFO ] Invariants computation overflowed in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:12:22] [INFO ] Implicit Places using invariants in 326 ms returned []
// Phase 1: matrix 448 rows 455 cols
[2025-06-01 02:12:22] [INFO ] Invariants computation overflowed in 26 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:12:22] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:12:37] [INFO ] Implicit Places using invariants and state equation in 14865 ms returned [185, 191, 210, 215, 238, 244, 266, 271, 291, 296, 317, 322, 343, 349, 370, 375, 395, 401, 423, 428, 447, 453]
[2025-06-01 02:12:37] [INFO ] Actually due to overlaps returned [191, 185]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 15212 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 453/476 places, 448/454 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 453 transition count 447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 452 transition count 447
Applied a total of 2 rules in 19 ms. Remains 452 /453 variables (removed 1) and now considering 447/448 (removed 1) transitions.
// Phase 1: matrix 447 rows 452 cols
[2025-06-01 02:12:37] [INFO ] Invariants computation overflowed in 26 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:12:37] [INFO ] Implicit Places using invariants in 320 ms returned []
// Phase 1: matrix 447 rows 452 cols
[2025-06-01 02:12:37] [INFO ] Invariants computation overflowed in 35 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:12:37] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:12:54] [INFO ] Implicit Places using invariants and state equation in 17453 ms returned [207, 212, 235, 241, 263, 268, 288, 293, 314, 319, 340, 346, 367, 372, 392, 398, 420, 425, 444, 450]
[2025-06-01 02:12:54] [INFO ] Actually due to overlaps returned [212, 207]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 17788 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 450/476 places, 447/454 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 450 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 449 transition count 446
Applied a total of 2 rules in 27 ms. Remains 449 /450 variables (removed 1) and now considering 446/447 (removed 1) transitions.
// Phase 1: matrix 446 rows 449 cols
[2025-06-01 02:12:55] [INFO ] Invariants computation overflowed in 30 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:12:55] [INFO ] Implicit Places using invariants in 309 ms returned []
// Phase 1: matrix 446 rows 449 cols
[2025-06-01 02:12:55] [INFO ] Invariants computation overflowed in 34 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:12:55] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:13:11] [INFO ] Implicit Places using invariants and state equation in 16555 ms returned [232, 238, 260, 265, 285, 290, 311, 316, 337, 343, 364, 369, 389, 395, 417, 422, 441, 447]
[2025-06-01 02:13:11] [INFO ] Actually due to overlaps returned [238, 232]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 16881 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 447/476 places, 446/454 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 447 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 446 transition count 445
Applied a total of 2 rules in 22 ms. Remains 446 /447 variables (removed 1) and now considering 445/446 (removed 1) transitions.
// Phase 1: matrix 445 rows 446 cols
[2025-06-01 02:13:11] [INFO ] Invariants computation overflowed in 32 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:13:12] [INFO ] Implicit Places using invariants in 288 ms returned []
// Phase 1: matrix 445 rows 446 cols
[2025-06-01 02:13:12] [INFO ] Invariants computation overflowed in 24 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:13:12] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:13:22] [INFO ] Implicit Places using invariants and state equation in 10209 ms returned [257, 262, 282, 287, 308, 313, 334, 340, 361, 366, 386, 392, 414, 419, 438, 444]
[2025-06-01 02:13:22] [INFO ] Actually due to overlaps returned [262, 257]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10511 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 444/476 places, 445/454 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 444 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 443 transition count 444
Applied a total of 2 rules in 18 ms. Remains 443 /444 variables (removed 1) and now considering 444/445 (removed 1) transitions.
// Phase 1: matrix 444 rows 443 cols
[2025-06-01 02:13:22] [INFO ] Computed 76 invariants in 35 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:13:24] [INFO ] Implicit Places using invariants in 2492 ms returned [279, 284, 305, 310, 331, 337, 358, 363, 383, 389, 411, 416, 435, 441]
[2025-06-01 02:13:24] [INFO ] Actually due to overlaps returned [284, 279]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2498 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 441/476 places, 444/454 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 441 transition count 443
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 440 transition count 443
Applied a total of 2 rules in 16 ms. Remains 440 /441 variables (removed 1) and now considering 443/444 (removed 1) transitions.
// Phase 1: matrix 443 rows 440 cols
[2025-06-01 02:13:24] [INFO ] Invariants computation overflowed in 39 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:13:25] [INFO ] Implicit Places using invariants in 293 ms returned []
// Phase 1: matrix 443 rows 440 cols
[2025-06-01 02:13:25] [INFO ] Invariants computation overflowed in 34 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:13:25] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:13:34] [INFO ] Implicit Places using invariants and state equation in 9674 ms returned [302, 307, 328, 334, 355, 360, 380, 386, 408, 413, 432, 438]
[2025-06-01 02:13:34] [INFO ] Actually due to overlaps returned [307, 302]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9997 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 11 : 438/476 places, 443/454 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 438 transition count 442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 437 transition count 442
Applied a total of 2 rules in 14 ms. Remains 437 /438 variables (removed 1) and now considering 442/443 (removed 1) transitions.
// Phase 1: matrix 442 rows 437 cols
[2025-06-01 02:13:35] [INFO ] Invariants computation overflowed in 37 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:13:35] [INFO ] Implicit Places using invariants in 279 ms returned []
// Phase 1: matrix 442 rows 437 cols
[2025-06-01 02:13:35] [INFO ] Invariants computation overflowed in 32 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:13:35] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:13:47] [INFO ] Implicit Places using invariants and state equation in 12060 ms returned [325, 331, 352, 357, 377, 383, 405, 410, 429, 435]
[2025-06-01 02:13:47] [INFO ] Actually due to overlaps returned [331, 325]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 12343 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 12 : 435/476 places, 442/454 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 435 transition count 441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 434 transition count 441
Applied a total of 2 rules in 22 ms. Remains 434 /435 variables (removed 1) and now considering 441/442 (removed 1) transitions.
// Phase 1: matrix 441 rows 434 cols
[2025-06-01 02:13:47] [INFO ] Invariants computation overflowed in 34 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:13:47] [INFO ] Implicit Places using invariants in 286 ms returned []
// Phase 1: matrix 441 rows 434 cols
[2025-06-01 02:13:47] [INFO ] Invariants computation overflowed in 46 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:13:47] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:14:02] [INFO ] Implicit Places using invariants and state equation in 14523 ms returned [349, 354, 374, 380, 402, 407, 426, 432]
[2025-06-01 02:14:02] [INFO ] Actually due to overlaps returned [354, 349]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 14822 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 13 : 432/476 places, 441/454 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 432 transition count 440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 431 transition count 440
Applied a total of 2 rules in 15 ms. Remains 431 /432 variables (removed 1) and now considering 440/441 (removed 1) transitions.
// Phase 1: matrix 440 rows 431 cols
[2025-06-01 02:14:02] [INFO ] Invariants computation overflowed in 37 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:14:02] [INFO ] Implicit Places using invariants in 268 ms returned []
// Phase 1: matrix 440 rows 431 cols
[2025-06-01 02:14:02] [INFO ] Invariants computation overflowed in 33 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:14:02] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:14:14] [INFO ] Implicit Places using invariants and state equation in 11809 ms returned [371, 377, 399, 404, 423, 429]
[2025-06-01 02:14:14] [INFO ] Actually due to overlaps returned [377, 371]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 12092 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 14 : 429/476 places, 440/454 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 429 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 428 transition count 439
Applied a total of 2 rules in 20 ms. Remains 428 /429 variables (removed 1) and now considering 439/440 (removed 1) transitions.
// Phase 1: matrix 439 rows 428 cols
[2025-06-01 02:14:14] [INFO ] Invariants computation overflowed in 41 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:14:14] [INFO ] Implicit Places using invariants in 271 ms returned []
// Phase 1: matrix 439 rows 428 cols
[2025-06-01 02:14:14] [INFO ] Invariants computation overflowed in 40 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:14:14] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:14:23] [INFO ] Implicit Places using invariants and state equation in 8568 ms returned [396, 401, 420, 426]
[2025-06-01 02:14:23] [INFO ] Actually due to overlaps returned [401, 396]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8847 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 15 : 426/476 places, 439/454 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 426 transition count 438
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 425 transition count 438
Applied a total of 2 rules in 18 ms. Remains 425 /426 variables (removed 1) and now considering 438/439 (removed 1) transitions.
// Phase 1: matrix 438 rows 425 cols
[2025-06-01 02:14:23] [INFO ] Invariants computation overflowed in 35 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:14:23] [INFO ] Implicit Places using invariants in 269 ms returned []
// Phase 1: matrix 438 rows 425 cols
[2025-06-01 02:14:23] [INFO ] Invariants computation overflowed in 34 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:14:23] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:14:31] [INFO ] Implicit Places using invariants and state equation in 8535 ms returned [417, 423]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8833 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 16 : 423/476 places, 438/454 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 423 transition count 437
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 422 transition count 437
Applied a total of 2 rules in 15 ms. Remains 422 /423 variables (removed 1) and now considering 437/438 (removed 1) transitions.
// Phase 1: matrix 437 rows 422 cols
[2025-06-01 02:14:32] [INFO ] Invariants computation overflowed in 39 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:14:32] [INFO ] Implicit Places using invariants in 261 ms returned []
// Phase 1: matrix 437 rows 422 cols
[2025-06-01 02:14:32] [INFO ] Invariants computation overflowed in 39 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:14:32] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:14:41] [INFO ] Implicit Places using invariants and state equation in 9591 ms returned []
Implicit Place search using SMT with State Equation took 9874 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 17 : 422/476 places, 437/454 transitions.
Finished structural reductions in REACHABILITY mode , in 17 iterations and 253995 ms. Remains : 422/476 places, 437/454 transitions.
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 108 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 78 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 554 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 554/554 places, 532/532 transitions.
Applied a total of 0 rules in 15 ms. Remains 554 /554 variables (removed 0) and now considering 532/532 (removed 0) transitions.
// Phase 1: matrix 532 rows 554 cols
[2025-06-01 02:14:42] [INFO ] Computed 99 invariants in 64 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:14:42] [INFO ] Implicit Places using invariants in 334 ms returned []
[2025-06-01 02:14:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:14:42] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-01 02:14:52] [INFO ] Implicit Places using invariants and state equation in 10266 ms returned []
Implicit Place search using SMT with State Equation took 10625 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 02:14:52] [INFO ] Redundant transitions in 2 ms returned []
Running 531 sub problems to find dead transitions.
[2025-06-01 02:14:52] [INFO ] Invariant cache hit.
[2025-06-01 02:14:52] [INFO ] State equation strengthened by 38 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/553 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/553 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/553 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 3 (OVERLAPS) 532/1085 variables, 553/652 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1085 variables, 38/690 constraints. Problems are: Problem set: 0 solved, 531 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1085/1086 variables, and 690 constraints, problems are : Problem set: 0 solved, 531 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 553/554 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 531/531 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 531 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/553 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/553 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/553 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 3 (OVERLAPS) 532/1085 variables, 553/652 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1085 variables, 38/690 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1085 variables, 528/1218 constraints. Problems are: Problem set: 0 solved, 531 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1085/1086 variables, and 1218 constraints, problems are : Problem set: 0 solved, 531 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 553/554 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 528/531 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60106ms problems are : Problem set: 0 solved, 531 unsolved
Search for dead transitions found 0 dead transitions in 60107ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 70757 ms. Remains : 554/554 places, 532/532 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1741 edges and 554 vertex of which 553 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 99 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (5591 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3283 resets) in 42 ms. (930 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3255 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 380479 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :1 out of 2
Probabilistic random walk after 380479 steps, saw 190298 distinct states, run finished after 3001 ms. (steps per millisecond=126 ) properties seen :1
[2025-06-01 02:15:56] [INFO ] Invariant cache hit.
[2025-06-01 02:15:56] [INFO ] State equation strengthened by 38 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 178/180 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 260/440 variables, 54/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/440 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/497 variables, 24/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 522/1019 variables, 497/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1019 variables, 36/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1019 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 61/1080 variables, 52/680 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1080 variables, 2/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1080 variables, 1/683 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1080 variables, 0/683 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/1082 variables, 2/685 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1082 variables, 2/687 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1082 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/1086 variables, 3/690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1086 variables, 1/691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1086 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1086 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1086/1086 variables, and 691 constraints, problems are : Problem set: 0 solved, 1 unsolved in 656 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 554/554 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 178/180 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 260/440 variables, 54/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/440 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/497 variables, 24/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:15:57] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 522/1019 variables, 497/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1019 variables, 36/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:15:57] [INFO ] Deduced a trap along path composed of 8 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:15:57] [INFO ] Deduced a trap along path 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-01 02:15:57] [INFO ] Deduced a trap along path composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1019 variables, 3/632 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1019 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 61/1080 variables, 52/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1080 variables, 2/686 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1080 variables, 1/687 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1080/1086 variables, and 688 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1951 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 95/97 constraints, State Equation: 549/554 constraints, ReadFeed: 37/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 2633ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 554 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 554/554 places, 532/532 transitions.
Graph (complete) has 1661 edges and 554 vertex of which 553 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 553 transition count 530
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 552 transition count 530
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 551 transition count 529
Free-agglomeration rule (complex) applied 75 times.
Iterating global reduction 2 with 75 rules applied. Total rules applied 81 place count 551 transition count 454
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 2 with 75 rules applied. Total rules applied 156 place count 476 transition count 454
Partial Free-agglomeration rule applied 79 times.
Drop transitions (Partial Free agglomeration) removed 79 transitions
Iterating global reduction 3 with 79 rules applied. Total rules applied 235 place count 476 transition count 454
Applied a total of 235 rules in 44 ms. Remains 476 /554 variables (removed 78) and now considering 454/532 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 476/554 places, 454/532 transitions.
RANDOM walk for 40000 steps (5071 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3327 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 411401 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :0 out of 1
Probabilistic random walk after 411401 steps, saw 205819 distinct states, run finished after 3003 ms. (steps per millisecond=136 ) properties seen :0
// Phase 1: matrix 454 rows 476 cols
[2025-06-01 02:16:01] [INFO ] Invariants computation overflowed in 32 ms
[2025-06-01 02:16:01] [INFO ] State equation strengthened by 78 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 126/134 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 504/638 variables, 232/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/638 variables, 45/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/638 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 292/930 variables, 227/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/930 variables, 33/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/930 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/930 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 930/930 variables, and 554 constraints, problems are : Problem set: 0 solved, 1 unsolved in 769 ms.
Refiners :[State Equation: 476/476 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 126/134 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 504/638 variables, 232/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/638 variables, 45/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/638 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 292/930 variables, 227/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/930 variables, 33/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:03] [INFO ] Deduced a trap composed of 8 places in 219 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:04] [INFO ] Deduced a trap composed of 13 places in 232 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:04] [INFO ] Deduced a trap composed of 9 places in 233 ms of which 16 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/930 variables, 3/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/930 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/930 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 930/930 variables, and 558 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1657 ms.
Refiners :[State Equation: 476/476 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2470ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 50 ms.
Support contains 2 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 454/454 transitions.
Applied a total of 0 rules in 9 ms. Remains 476 /476 variables (removed 0) and now considering 454/454 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 476/476 places, 454/454 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 454/454 transitions.
Applied a total of 0 rules in 8 ms. Remains 476 /476 variables (removed 0) and now considering 454/454 (removed 0) transitions.
// Phase 1: matrix 454 rows 476 cols
[2025-06-01 02:16:04] [INFO ] Invariants computation overflowed in 40 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:16:04] [INFO ] Implicit Places using invariants in 412 ms returned []
// Phase 1: matrix 454 rows 476 cols
[2025-06-01 02:16:04] [INFO ] Invariants computation overflowed in 39 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:16:05] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:16:35] [INFO ] Performed 345/476 implicitness test of which 25 returned IMPLICIT in 30 seconds.
[2025-06-01 02:16:37] [INFO ] Implicit Places using invariants and state equation in 32648 ms returned [42, 70, 75, 97, 102, 122, 128, 149, 154, 155, 175, 180, 201, 207, 214, 228, 233, 256, 262, 284, 289, 309, 314, 335, 340, 361, 367, 388, 390, 394, 414, 420, 442, 447, 451, 468, 474]
[2025-06-01 02:16:37] [INFO ] Actually due to overlaps returned [75, 214, 70, 154]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 33065 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 472/476 places, 454/454 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 472 transition count 453
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 471 transition count 453
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 471 transition count 453
Applied a total of 4 rules in 29 ms. Remains 471 /472 variables (removed 1) and now considering 453/454 (removed 1) transitions.
// Phase 1: matrix 453 rows 471 cols
[2025-06-01 02:16:37] [INFO ] Invariants computation overflowed in 31 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:16:37] [INFO ] Implicit Places using invariants in 381 ms returned []
// Phase 1: matrix 453 rows 471 cols
[2025-06-01 02:16:37] [INFO ] Invariants computation overflowed in 24 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:16:38] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:17:04] [INFO ] Implicit Places using invariants and state equation in 26269 ms returned [42, 95, 100, 120, 126, 147, 152, 172, 177, 198, 204, 223, 228, 251, 257, 279, 284, 304, 309, 330, 335, 356, 362, 383, 385, 389, 409, 415, 437, 442, 446, 463, 469]
[2025-06-01 02:17:04] [INFO ] Actually due to overlaps returned [100, 446, 95, 385]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 26655 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 467/476 places, 453/454 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 467 transition count 451
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 465 transition count 451
Applied a total of 4 rules in 22 ms. Remains 465 /467 variables (removed 2) and now considering 451/453 (removed 2) transitions.
// Phase 1: matrix 451 rows 465 cols
[2025-06-01 02:17:04] [INFO ] Invariants computation overflowed in 45 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:17:04] [INFO ] Implicit Places using invariants in 421 ms returned []
// Phase 1: matrix 451 rows 465 cols
[2025-06-01 02:17:04] [INFO ] Invariants computation overflowed in 32 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:17:04] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:17:35] [INFO ] Performed 254/465 implicitness test of which 13 returned IMPLICIT in 30 seconds.
[2025-06-01 02:17:40] [INFO ] Implicit Places using invariants and state equation in 35551 ms returned [42, 117, 123, 144, 149, 169, 174, 195, 201, 220, 225, 248, 254, 276, 281, 301, 306, 327, 332, 353, 359, 380, 385, 405, 411, 433, 438, 457, 463]
[2025-06-01 02:17:40] [INFO ] Actually due to overlaps returned [123, 42, 117]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 35981 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 462/476 places, 451/454 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 462 transition count 450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 461 transition count 450
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 461 transition count 450
Applied a total of 3 rules in 25 ms. Remains 461 /462 variables (removed 1) and now considering 450/451 (removed 1) transitions.
// Phase 1: matrix 450 rows 461 cols
[2025-06-01 02:17:40] [INFO ] Computed 88 invariants in 63 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:17:45] [INFO ] Implicit Places using invariants in 5074 ms returned [140, 145, 165, 170, 191, 197, 216, 221, 244, 250, 272, 277, 297, 302, 323, 328, 349, 355, 376, 381, 401, 407, 429, 434, 453, 459]
[2025-06-01 02:17:45] [INFO ] Actually due to overlaps returned [145, 140]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 5077 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 459/476 places, 450/454 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 459 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 458 transition count 449
Applied a total of 2 rules in 19 ms. Remains 458 /459 variables (removed 1) and now considering 449/450 (removed 1) transitions.
// Phase 1: matrix 449 rows 458 cols
[2025-06-01 02:17:45] [INFO ] Invariants computation overflowed in 35 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:17:45] [INFO ] Implicit Places using invariants in 328 ms returned []
// Phase 1: matrix 449 rows 458 cols
[2025-06-01 02:17:45] [INFO ] Invariants computation overflowed in 27 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:17:45] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:18:01] [INFO ] Implicit Places using invariants and state equation in 16300 ms returned [162, 167, 188, 194, 213, 218, 241, 247, 269, 274, 294, 299, 320, 325, 346, 352, 373, 378, 398, 404, 426, 431, 450, 456]
[2025-06-01 02:18:01] [INFO ] Actually due to overlaps returned [167, 162]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 16643 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 456/476 places, 449/454 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 456 transition count 448
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 455 transition count 448
Applied a total of 2 rules in 14 ms. Remains 455 /456 variables (removed 1) and now considering 448/449 (removed 1) transitions.
// Phase 1: matrix 448 rows 455 cols
[2025-06-01 02:18:02] [INFO ] Invariants computation overflowed in 26 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:18:02] [INFO ] Implicit Places using invariants in 322 ms returned []
// Phase 1: matrix 448 rows 455 cols
[2025-06-01 02:18:02] [INFO ] Invariants computation overflowed in 26 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:18:02] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:18:16] [INFO ] Implicit Places using invariants and state equation in 14505 ms returned [185, 191, 210, 215, 238, 244, 266, 271, 291, 296, 317, 322, 343, 349, 370, 375, 395, 401, 423, 428, 447, 453]
[2025-06-01 02:18:16] [INFO ] Actually due to overlaps returned [191, 185]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 14838 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 453/476 places, 448/454 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 453 transition count 447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 452 transition count 447
Applied a total of 2 rules in 19 ms. Remains 452 /453 variables (removed 1) and now considering 447/448 (removed 1) transitions.
// Phase 1: matrix 447 rows 452 cols
[2025-06-01 02:18:16] [INFO ] Invariants computation overflowed in 30 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:18:17] [INFO ] Implicit Places using invariants in 324 ms returned []
// Phase 1: matrix 447 rows 452 cols
[2025-06-01 02:18:17] [INFO ] Invariants computation overflowed in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:18:17] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:18:34] [INFO ] Implicit Places using invariants and state equation in 17123 ms returned [207, 212, 235, 241, 263, 268, 288, 293, 314, 319, 340, 346, 367, 372, 392, 398, 420, 425, 444, 450]
[2025-06-01 02:18:34] [INFO ] Actually due to overlaps returned [212, 207]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 17450 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 450/476 places, 447/454 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 450 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 449 transition count 446
Applied a total of 2 rules in 23 ms. Remains 449 /450 variables (removed 1) and now considering 446/447 (removed 1) transitions.
// Phase 1: matrix 446 rows 449 cols
[2025-06-01 02:18:34] [INFO ] Invariants computation overflowed in 31 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:18:34] [INFO ] Implicit Places using invariants in 294 ms returned []
// Phase 1: matrix 446 rows 449 cols
[2025-06-01 02:18:34] [INFO ] Invariants computation overflowed in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:18:34] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:18:51] [INFO ] Implicit Places using invariants and state equation in 16581 ms returned [232, 238, 260, 265, 285, 290, 311, 316, 337, 343, 364, 369, 389, 395, 417, 422, 441, 447]
[2025-06-01 02:18:51] [INFO ] Actually due to overlaps returned [238, 232]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 16880 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 447/476 places, 446/454 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 447 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 446 transition count 445
Applied a total of 2 rules in 20 ms. Remains 446 /447 variables (removed 1) and now considering 445/446 (removed 1) transitions.
// Phase 1: matrix 445 rows 446 cols
[2025-06-01 02:18:51] [INFO ] Invariants computation overflowed in 32 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:18:51] [INFO ] Implicit Places using invariants in 316 ms returned []
// Phase 1: matrix 445 rows 446 cols
[2025-06-01 02:18:51] [INFO ] Invariants computation overflowed in 24 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:18:51] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:19:01] [INFO ] Implicit Places using invariants and state equation in 9936 ms returned [257, 262, 282, 287, 308, 313, 334, 340, 361, 366, 386, 392, 414, 419, 438, 444]
[2025-06-01 02:19:01] [INFO ] Actually due to overlaps returned [262, 257]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10268 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 444/476 places, 445/454 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 444 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 443 transition count 444
Applied a total of 2 rules in 21 ms. Remains 443 /444 variables (removed 1) and now considering 444/445 (removed 1) transitions.
// Phase 1: matrix 444 rows 443 cols
[2025-06-01 02:19:01] [INFO ] Computed 76 invariants in 40 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:19:03] [INFO ] Implicit Places using invariants in 2467 ms returned [279, 284, 305, 310, 331, 337, 358, 363, 383, 389, 411, 416, 435, 441]
[2025-06-01 02:19:04] [INFO ] Actually due to overlaps returned [284, 279]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2473 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 441/476 places, 444/454 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 441 transition count 443
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 440 transition count 443
Applied a total of 2 rules in 14 ms. Remains 440 /441 variables (removed 1) and now considering 443/444 (removed 1) transitions.
// Phase 1: matrix 443 rows 440 cols
[2025-06-01 02:19:04] [INFO ] Invariants computation overflowed in 33 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:19:04] [INFO ] Implicit Places using invariants in 274 ms returned []
// Phase 1: matrix 443 rows 440 cols
[2025-06-01 02:19:04] [INFO ] Invariants computation overflowed in 37 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:19:04] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:19:13] [INFO ] Implicit Places using invariants and state equation in 9506 ms returned [302, 307, 328, 334, 355, 360, 380, 386, 408, 413, 432, 438]
[2025-06-01 02:19:13] [INFO ] Actually due to overlaps returned [307, 302]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9798 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 11 : 438/476 places, 443/454 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 438 transition count 442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 437 transition count 442
Applied a total of 2 rules in 23 ms. Remains 437 /438 variables (removed 1) and now considering 442/443 (removed 1) transitions.
// Phase 1: matrix 442 rows 437 cols
[2025-06-01 02:19:13] [INFO ] Invariants computation overflowed in 34 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:19:14] [INFO ] Implicit Places using invariants in 289 ms returned []
// Phase 1: matrix 442 rows 437 cols
[2025-06-01 02:19:14] [INFO ] Invariants computation overflowed in 32 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:19:14] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:19:26] [INFO ] Implicit Places using invariants and state equation in 12405 ms returned [325, 331, 352, 357, 377, 383, 405, 410, 429, 435]
[2025-06-01 02:19:26] [INFO ] Actually due to overlaps returned [331, 325]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 12697 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 12 : 435/476 places, 442/454 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 435 transition count 441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 434 transition count 441
Applied a total of 2 rules in 21 ms. Remains 434 /435 variables (removed 1) and now considering 441/442 (removed 1) transitions.
// Phase 1: matrix 441 rows 434 cols
[2025-06-01 02:19:26] [INFO ] Invariants computation overflowed in 33 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:19:26] [INFO ] Implicit Places using invariants in 304 ms returned []
// Phase 1: matrix 441 rows 434 cols
[2025-06-01 02:19:26] [INFO ] Invariants computation overflowed in 34 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:19:27] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:19:41] [INFO ] Implicit Places using invariants and state equation in 14632 ms returned [349, 354, 374, 380, 402, 407, 426, 432]
[2025-06-01 02:19:41] [INFO ] Actually due to overlaps returned [354, 349]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 14938 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 13 : 432/476 places, 441/454 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 432 transition count 440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 431 transition count 440
Applied a total of 2 rules in 16 ms. Remains 431 /432 variables (removed 1) and now considering 440/441 (removed 1) transitions.
// Phase 1: matrix 440 rows 431 cols
[2025-06-01 02:19:41] [INFO ] Invariants computation overflowed in 39 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:19:41] [INFO ] Implicit Places using invariants in 271 ms returned []
// Phase 1: matrix 440 rows 431 cols
[2025-06-01 02:19:41] [INFO ] Invariants computation overflowed in 35 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:19:42] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:19:53] [INFO ] Implicit Places using invariants and state equation in 11828 ms returned [371, 377, 399, 404, 423, 429]
[2025-06-01 02:19:53] [INFO ] Actually due to overlaps returned [377, 371]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 12124 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 14 : 429/476 places, 440/454 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 429 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 428 transition count 439
Applied a total of 2 rules in 17 ms. Remains 428 /429 variables (removed 1) and now considering 439/440 (removed 1) transitions.
// Phase 1: matrix 439 rows 428 cols
[2025-06-01 02:19:53] [INFO ] Invariants computation overflowed in 46 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:19:53] [INFO ] Implicit Places using invariants in 288 ms returned []
// Phase 1: matrix 439 rows 428 cols
[2025-06-01 02:19:53] [INFO ] Invariants computation overflowed in 40 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:19:54] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:20:02] [INFO ] Implicit Places using invariants and state equation in 8530 ms returned [396, 401, 420, 426]
[2025-06-01 02:20:02] [INFO ] Actually due to overlaps returned [401, 396]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8827 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 15 : 426/476 places, 439/454 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 426 transition count 438
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 425 transition count 438
Applied a total of 2 rules in 26 ms. Remains 425 /426 variables (removed 1) and now considering 438/439 (removed 1) transitions.
// Phase 1: matrix 438 rows 425 cols
[2025-06-01 02:20:02] [INFO ] Invariants computation overflowed in 37 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:20:02] [INFO ] Implicit Places using invariants in 276 ms returned []
// Phase 1: matrix 438 rows 425 cols
[2025-06-01 02:20:02] [INFO ] Invariants computation overflowed in 38 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:20:03] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:20:11] [INFO ] Implicit Places using invariants and state equation in 8410 ms returned [417, 423]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8697 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 16 : 423/476 places, 438/454 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 423 transition count 437
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 422 transition count 437
Applied a total of 2 rules in 13 ms. Remains 422 /423 variables (removed 1) and now considering 437/438 (removed 1) transitions.
// Phase 1: matrix 437 rows 422 cols
[2025-06-01 02:20:11] [INFO ] Invariants computation overflowed in 40 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:20:11] [INFO ] Implicit Places using invariants in 258 ms returned []
// Phase 1: matrix 437 rows 422 cols
[2025-06-01 02:20:11] [INFO ] Invariants computation overflowed in 39 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:20:11] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:20:21] [INFO ] Implicit Places using invariants and state equation in 9609 ms returned []
Implicit Place search using SMT with State Equation took 9879 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 17 : 422/476 places, 437/454 transitions.
Finished structural reductions in REACHABILITY mode , in 17 iterations and 256629 ms. Remains : 422/476 places, 437/454 transitions.
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 108 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 13872 reset in 114 ms.
Product exploration explored 100000 steps with 14004 reset in 113 ms.
Built C files in :
/tmp/ltsmin12450368983335843506
[2025-06-01 02:20:21] [INFO ] Computing symmetric may disable matrix : 532 transitions.
[2025-06-01 02:20:21] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 02:20:21] [INFO ] Computing symmetric may enable matrix : 532 transitions.
[2025-06-01 02:20:21] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 02:20:21] [INFO ] Computing Do-Not-Accords matrix : 532 transitions.
[2025-06-01 02:20:21] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 02:20:21] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12450368983335843506
Running compilation step : cd /tmp/ltsmin12450368983335843506;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1233 ms.
Running link step : cd /tmp/ltsmin12450368983335843506;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin12450368983335843506;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased96854954189183563.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 554 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 554/554 places, 532/532 transitions.
Applied a total of 0 rules in 15 ms. Remains 554 /554 variables (removed 0) and now considering 532/532 (removed 0) transitions.
// Phase 1: matrix 532 rows 554 cols
[2025-06-01 02:20:36] [INFO ] Computed 99 invariants in 51 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:20:37] [INFO ] Implicit Places using invariants in 327 ms returned []
[2025-06-01 02:20:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:20:37] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-01 02:20:47] [INFO ] Implicit Places using invariants and state equation in 10592 ms returned []
Implicit Place search using SMT with State Equation took 10928 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 02:20:47] [INFO ] Redundant transitions in 2 ms returned []
Running 531 sub problems to find dead transitions.
[2025-06-01 02:20:47] [INFO ] Invariant cache hit.
[2025-06-01 02:20:47] [INFO ] State equation strengthened by 38 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/553 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/553 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/553 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 3 (OVERLAPS) 532/1085 variables, 553/652 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1085 variables, 38/690 constraints. Problems are: Problem set: 0 solved, 531 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1085/1086 variables, and 690 constraints, problems are : Problem set: 0 solved, 531 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 553/554 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 531/531 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 531 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/553 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/553 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/553 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 3 (OVERLAPS) 532/1085 variables, 553/652 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1085 variables, 38/690 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1085 variables, 528/1218 constraints. Problems are: Problem set: 0 solved, 531 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1085/1086 variables, and 1218 constraints, problems are : Problem set: 0 solved, 531 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 553/554 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 528/531 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60103ms problems are : Problem set: 0 solved, 531 unsolved
Search for dead transitions found 0 dead transitions in 60104ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 71059 ms. Remains : 554/554 places, 532/532 transitions.
Built C files in :
/tmp/ltsmin257205212422224697
[2025-06-01 02:21:47] [INFO ] Computing symmetric may disable matrix : 532 transitions.
[2025-06-01 02:21:47] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 02:21:47] [INFO ] Computing symmetric may enable matrix : 532 transitions.
[2025-06-01 02:21:47] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 02:21:47] [INFO ] Computing Do-Not-Accords matrix : 532 transitions.
[2025-06-01 02:21:48] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 02:21:48] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin257205212422224697
Running compilation step : cd /tmp/ltsmin257205212422224697;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1259 ms.
Running link step : cd /tmp/ltsmin257205212422224697;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin257205212422224697;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased774588448673489688.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-01 02:22:03] [INFO ] Flatten gal took : 14 ms
[2025-06-01 02:22:03] [INFO ] Flatten gal took : 14 ms
[2025-06-01 02:22:03] [INFO ] Time to serialize gal into /tmp/LTL13684506987707162733.gal : 3 ms
[2025-06-01 02:22:03] [INFO ] Time to serialize properties into /tmp/LTL4293062355371645907.prop : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13684506987707162733.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3249656870192638373.hoa' '-atoms' '/tmp/LTL4293062355371645907.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4293062355371645907.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3249656870192638373.hoa
Detected timeout of ITS tools.
[2025-06-01 02:22:18] [INFO ] Flatten gal took : 14 ms
[2025-06-01 02:22:18] [INFO ] Flatten gal took : 14 ms
[2025-06-01 02:22:18] [INFO ] Time to serialize gal into /tmp/LTL1129464855643881375.gal : 2 ms
[2025-06-01 02:22:18] [INFO ] Time to serialize properties into /tmp/LTL14023815127872251213.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1129464855643881375.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14023815127872251213.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((F(G("((p149<1)||(p212<1))")))&&(F("(p118<1)")))))
Formula 0 simplified : F(GF!"((p149<1)||(p212<1))" | G!"(p118<1)")
Detected timeout of ITS tools.
[2025-06-01 02:22:33] [INFO ] Flatten gal took : 14 ms
[2025-06-01 02:22:33] [INFO ] Applying decomposition
[2025-06-01 02:22:33] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13381259957456847853.txt' '-o' '/tmp/graph13381259957456847853.bin' '-w' '/tmp/graph13381259957456847853.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13381259957456847853.bin' '-l' '-1' '-v' '-w' '/tmp/graph13381259957456847853.weights' '-q' '0' '-e' '0.001'
[2025-06-01 02:22:33] [INFO ] Decomposing Gal with order
[2025-06-01 02:22:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 02:22:33] [INFO ] Removed a total of 402 redundant transitions.
[2025-06-01 02:22:33] [INFO ] Flatten gal took : 32 ms
[2025-06-01 02:22:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 7 ms.
[2025-06-01 02:22:33] [INFO ] Time to serialize gal into /tmp/LTL14274751031846273381.gal : 7 ms
[2025-06-01 02:22:33] [INFO ] Time to serialize properties into /tmp/LTL6760302642649351892.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14274751031846273381.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6760302642649351892.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((F(G("((i2.u20.p149<1)||(i1.u31.p212<1))")))&&(F("(i2.u12.p118<1)")))))
Formula 0 simplified : F(GF!"((i2.u20.p149<1)||(i1.u31.p212<1))" | G!"(i2.u12.p118<1)")
Detected timeout of ITS tools.
Treatment of property DoubleExponent-PT-020-LTLFireability-03 finished in 823392 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)||(G(p1)&&F((p2||G(p3)))))))'
Support contains 5 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 34 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2025-06-01 02:22:48] [INFO ] Invariants computation overflowed in 118 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:22:48] [INFO ] Implicit Places using invariants in 412 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2025-06-01 02:22:49] [INFO ] Invariants computation overflowed in 118 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:23:04] [INFO ] Implicit Places using invariants and state equation in 15267 ms returned []
Implicit Place search using SMT with State Equation took 15684 ms to find 0 implicit places.
Running 996 sub problems to find dead transitions.
// Phase 1: matrix 997 rows 1057 cols
[2025-06-01 02:23:04] [INFO ] Invariants computation overflowed in 156 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1056 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 996 unsolved
SMT process timed out in 30279ms, After SMT, problems are : Problem set: 0 solved, 996 unsolved
Search for dead transitions found 0 dead transitions in 30281ms
Finished structural reductions in LTL mode , in 1 iterations and 46002 ms. Remains : 1057/1057 places, 997/997 transitions.
Stuttering acceptance computed with spot in 196 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p3))]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-04
Stuttering criterion allowed to conclude after 78 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-020-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLFireability-04 finished in 46246 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X((p0&&X(p1)))||G(!p0)))))'
Support contains 2 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 35 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2025-06-01 02:23:34] [INFO ] Invariants computation overflowed in 108 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:23:35] [INFO ] Implicit Places using invariants in 399 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2025-06-01 02:23:35] [INFO ] Invariants computation overflowed in 101 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:23:49] [INFO ] Implicit Places using invariants and state equation in 14632 ms returned []
Implicit Place search using SMT with State Equation took 15034 ms to find 0 implicit places.
Running 996 sub problems to find dead transitions.
// Phase 1: matrix 997 rows 1057 cols
[2025-06-01 02:23:49] [INFO ] Invariants computation overflowed in 106 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1056 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 996 unsolved
SMT process timed out in 30235ms, After SMT, problems are : Problem set: 0 solved, 996 unsolved
Search for dead transitions found 0 dead transitions in 30237ms
Finished structural reductions in LTL mode , in 1 iterations and 45317 ms. Remains : 1057/1057 places, 997/997 transitions.
Stuttering acceptance computed with spot in 316 ms :[(NOT p1), (AND (NOT p1) p0), true, (OR (NOT p0) (NOT p1)), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), p0]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-05
Entered a terminal (fully accepting) state of product in 289 steps with 8 reset in 1 ms.
FORMULA DoubleExponent-PT-020-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLFireability-05 finished in 45668 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G((X(p2)&&p1)))||p0)))'
Support contains 5 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 35 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2025-06-01 02:24:20] [INFO ] Invariants computation overflowed in 108 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:24:20] [INFO ] Implicit Places using invariants in 394 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2025-06-01 02:24:20] [INFO ] Invariants computation overflowed in 100 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:24:35] [INFO ] Implicit Places using invariants and state equation in 14410 ms returned []
Implicit Place search using SMT with State Equation took 14808 ms to find 0 implicit places.
Running 996 sub problems to find dead transitions.
// Phase 1: matrix 997 rows 1057 cols
[2025-06-01 02:24:35] [INFO ] Invariants computation overflowed in 107 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1056 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 996 unsolved
SMT process timed out in 30234ms, After SMT, problems are : Problem set: 0 solved, 996 unsolved
Search for dead transitions found 0 dead transitions in 30246ms
Finished structural reductions in LTL mode , in 1 iterations and 45091 ms. Remains : 1057/1057 places, 997/997 transitions.
Stuttering acceptance computed with spot in 162 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-06
Product exploration explored 100000 steps with 3335 reset in 120 ms.
Product exploration explored 100000 steps with 3304 reset in 127 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT p1)), (X p0), (X (X p2)), (X (X (NOT p1))), (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 103 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1))]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (1310 resets) in 103 ms. (384 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (1138 resets) in 75 ms. (526 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (1135 resets) in 75 ms. (526 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1135 resets) in 65 ms. (606 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (1122 resets) in 66 ms. (597 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 170113 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :0 out of 4
Probabilistic random walk after 170113 steps, saw 85078 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
// Phase 1: matrix 997 rows 1057 cols
[2025-06-01 02:25:09] [INFO ] Invariants computation overflowed in 113 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 12/17 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 61/78 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 135/213 variables, 60/87 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 223/436 variables, 103/190 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 294/730 variables, 144/334 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/730 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 286/1016 variables, 156/490 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1016 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 257/1273 variables, 131/621 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:10] [INFO ] Deduced a trap along path composed of 20 places in 46 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:10] [INFO ] Deduced a trap along path composed of 17 places in 50 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:10] [INFO ] Deduced a trap along path composed of 17 places in 42 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:10] [INFO ] Deduced a trap along path composed of 16 places in 43 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1273 variables, 4/625 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1273 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 254/1527 variables, 133/758 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:10] [INFO ] Deduced a trap along path composed of 9 places in 42 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1527 variables, 1/759 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/1527 variables, 0/759 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 213/1740 variables, 118/877 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1740 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 123/1863 variables, 78/955 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1863 variables, 0/955 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 60/1923 variables, 32/987 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1923 variables, 0/987 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 55/1978 variables, 30/1017 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1978 variables, 0/1017 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 35/2013 variables, 21/1038 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2013 variables, 0/1038 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 21/2034 variables, 11/1049 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2034 variables, 0/1049 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (OVERLAPS) 11/2045 variables, 8/1057 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2045 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (OVERLAPS) 4/2049 variables, 2/1059 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2049 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (OVERLAPS) 4/2053 variables, 2/1061 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2053 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (OVERLAPS) 1/2054 variables, 1/1062 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2054/2054 variables, and 1062 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5034 ms.
Refiners :[State Equation: 1057/1057 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 12/17 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 61/78 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 135/213 variables, 60/91 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 223/436 variables, 103/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/436 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 294/730 variables, 144/338 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/730 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 286/1016 variables, 156/494 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1016 variables, 4/498 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1016 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 257/1273 variables, 131/629 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1273 variables, 1/630 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:15] [INFO ] Deduced a trap along path composed of 16 places in 44 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1273 variables, 1/631 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1273 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 254/1527 variables, 133/764 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:15] [INFO ] Deduced a trap along path composed of 25 places in 43 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:15] [INFO ] Deduced a trap along path composed of 20 places in 48 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1527 variables, 2/766 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:16] [INFO ] Deduced a trap along path composed of 19 places in 40 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:16] [INFO ] Deduced a trap along path composed of 7 places in 40 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1527 variables, 2/768 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1527 variables, 0/768 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 213/1740 variables, 118/886 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:17] [INFO ] Deduced a trap along path composed of 17 places in 50 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:17] [INFO ] Deduced a trap along path composed of 16 places in 41 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:17] [INFO ] Deduced a trap along path composed of 16 places in 31 ms of which 0 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1740 variables, 3/889 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1740 variables, 0/889 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 123/1863 variables, 78/967 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:19] [INFO ] Deduced a trap composed of 41 places in 206 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:19] [INFO ] Deduced a trap composed of 43 places in 209 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:19] [INFO ] Deduced a trap composed of 60 places in 199 ms of which 27 ms to minimize.
SMT process timed out in 10358ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 1057 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 237 transitions
Trivial Post-agglo rules discarded 237 transitions
Performed 237 trivial Post agglomeration. Transition count delta: 237
Iterating post reduction 0 with 238 rules applied. Total rules applied 239 place count 1055 transition count 758
Reduce places removed 237 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 239 rules applied. Total rules applied 478 place count 818 transition count 756
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 480 place count 816 transition count 756
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 480 place count 816 transition count 715
Deduced a syphon composed of 41 places in 7 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 562 place count 775 transition count 715
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 2 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 3 with 364 rules applied. Total rules applied 926 place count 593 transition count 533
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 1002 place count 555 transition count 533
Free-agglomeration rule (complex) applied 76 times.
Iterating global reduction 3 with 76 rules applied. Total rules applied 1078 place count 555 transition count 457
Reduce places removed 76 places and 0 transitions.
Iterating post reduction 3 with 76 rules applied. Total rules applied 1154 place count 479 transition count 457
Partial Free-agglomeration rule applied 80 times.
Drop transitions (Partial Free agglomeration) removed 80 transitions
Iterating global reduction 4 with 80 rules applied. Total rules applied 1234 place count 479 transition count 457
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1235 place count 478 transition count 456
Applied a total of 1235 rules in 81 ms. Remains 478 /1057 variables (removed 579) and now considering 456/997 (removed 541) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 478/1057 places, 456/997 transitions.
RANDOM walk for 40000 steps (5123 resets) in 101 ms. (392 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (3428 resets) in 56 ms. (701 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3395 resets) in 66 ms. (597 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3383 resets) in 53 ms. (740 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (3458 resets) in 48 ms. (816 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 234983 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :0 out of 4
Probabilistic random walk after 234983 steps, saw 117554 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
// Phase 1: matrix 456 rows 478 cols
[2025-06-01 02:25:22] [INFO ] Computed 99 invariants in 60 ms
[2025-06-01 02:25:22] [INFO ] State equation strengthened by 78 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 282/287 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:23] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:23] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:23] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:23] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:23] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/287 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 184/471 variables, 77/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:23] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:24] [INFO ] Deduced a trap composed of 6 places in 181 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:24] [INFO ] Deduced a trap composed of 7 places in 187 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:24] [INFO ] Deduced a trap composed of 8 places in 168 ms of which 13 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/471 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/473 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:24] [INFO ] Deduced a trap composed of 9 places in 190 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:25] [INFO ] Deduced a trap composed of 10 places in 191 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:25] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 16 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/473 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/473 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 456/929 variables, 473/582 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/929 variables, 78/660 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/929 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 5/934 variables, 5/665 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/934 variables, 2/667 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/934 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/934 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 934/934 variables, and 667 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3615 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 478/478 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 282/287 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/287 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 184/471 variables, 77/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/471 variables, 6/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/473 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/473 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:26] [INFO ] Deduced a trap composed of 11 places in 216 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:27] [INFO ] Deduced a trap composed of 13 places in 215 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:27] [INFO ] Deduced a trap composed of 13 places in 243 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:27] [INFO ] Deduced a trap composed of 14 places in 228 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:27] [INFO ] Deduced a trap composed of 17 places in 211 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:28] [INFO ] Deduced a trap composed of 17 places in 212 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:28] [INFO ] Deduced a trap composed of 19 places in 216 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:28] [INFO ] Deduced a trap composed of 19 places in 219 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:28] [INFO ] Deduced a trap composed of 19 places in 219 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:29] [INFO ] Deduced a trap composed of 20 places in 224 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:29] [INFO ] Deduced a trap composed of 21 places in 233 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:29] [INFO ] Deduced a trap composed of 23 places in 213 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:29] [INFO ] Deduced a trap composed of 23 places in 223 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:30] [INFO ] Deduced a trap composed of 25 places in 230 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:30] [INFO ] Deduced a trap composed of 26 places in 226 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:30] [INFO ] Deduced a trap composed of 27 places in 228 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:30] [INFO ] Deduced a trap composed of 31 places in 231 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:31] [INFO ] Deduced a trap composed of 32 places in 221 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:31] [INFO ] Deduced a trap composed of 32 places in 237 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:31] [INFO ] Deduced a trap composed of 35 places in 237 ms of which 35 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/473 variables, 20/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:31] [INFO ] Deduced a trap composed of 36 places in 173 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:31] [INFO ] Deduced a trap composed of 76 places in 151 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:32] [INFO ] Deduced a trap composed of 38 places in 150 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:32] [INFO ] Deduced a trap composed of 40 places in 147 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:32] [INFO ] Deduced a trap composed of 76 places in 144 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:32] [INFO ] Deduced a trap composed of 38 places in 141 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:32] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:32] [INFO ] Deduced a trap composed of 75 places in 140 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:32] [INFO ] Deduced a trap composed of 78 places in 145 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:33] [INFO ] Deduced a trap composed of 34 places in 139 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:33] [INFO ] Deduced a trap composed of 78 places in 138 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:33] [INFO ] Deduced a trap composed of 79 places in 150 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:33] [INFO ] Deduced a trap composed of 38 places in 129 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:33] [INFO ] Deduced a trap composed of 78 places in 141 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:33] [INFO ] Deduced a trap composed of 79 places in 144 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:34] [INFO ] Deduced a trap composed of 41 places in 146 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:34] [INFO ] Deduced a trap composed of 76 places in 138 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:34] [INFO ] Deduced a trap composed of 77 places in 137 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:34] [INFO ] Deduced a trap composed of 78 places in 162 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:34] [INFO ] Deduced a trap composed of 78 places in 132 ms of which 12 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/473 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:34] [INFO ] Deduced a trap composed of 76 places in 144 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:35] [INFO ] Deduced a trap composed of 76 places in 147 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:35] [INFO ] Deduced a trap composed of 77 places in 147 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:35] [INFO ] Deduced a trap composed of 77 places in 147 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:35] [INFO ] Deduced a trap composed of 76 places in 147 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:35] [INFO ] Deduced a trap composed of 77 places in 145 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:35] [INFO ] Deduced a trap composed of 76 places in 145 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:35] [INFO ] Deduced a trap composed of 77 places in 138 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:36] [INFO ] Deduced a trap composed of 76 places in 130 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:36] [INFO ] Deduced a trap composed of 77 places in 136 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:36] [INFO ] Deduced a trap composed of 76 places in 149 ms of which 12 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/473 variables, 11/160 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/473 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 456/929 variables, 473/633 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/929 variables, 78/711 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/929 variables, 4/715 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:39] [INFO ] Deduced a trap composed of 30 places in 145 ms of which 11 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/929 variables, 1/716 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:39] [INFO ] Deduced a trap along path composed of 7 places in 43 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:39] [INFO ] Deduced a trap along path composed of 8 places in 41 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:39] [INFO ] Deduced a trap along path composed of 8 places in 42 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:40] [INFO ] Deduced a trap along path composed of 6 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:40] [INFO ] Deduced a trap along path composed of 4 places in 43 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/929 variables, 5/721 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/929 variables, 0/721 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 5/934 variables, 5/726 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/934 variables, 2/728 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/934 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/934 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 934/934 variables, and 728 constraints, problems are : Problem set: 0 solved, 4 unsolved in 16347 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 478/478 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 64/64 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 20033ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 30001 ms.
Support contains 5 out of 478 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 456/456 transitions.
Applied a total of 0 rules in 10 ms. Remains 478 /478 variables (removed 0) and now considering 456/456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 478/478 places, 456/456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 456/456 transitions.
Applied a total of 0 rules in 8 ms. Remains 478 /478 variables (removed 0) and now considering 456/456 (removed 0) transitions.
[2025-06-01 02:26:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:26:18] [INFO ] Implicit Places using invariants in 5479 ms returned [42, 48, 75, 96, 101, 121, 127, 148, 153, 154, 174, 179, 200, 206, 213, 228, 233, 256, 262, 285, 290, 310, 315, 336, 341, 362, 368, 389, 391, 395, 416, 422, 444, 449, 453, 470, 476]
[2025-06-01 02:26:18] [INFO ] Actually due to overlaps returned [213, 262, 153, 256]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 5493 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 474/478 places, 456/456 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 474 transition count 455
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 473 transition count 455
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 473 transition count 455
Applied a total of 4 rules in 25 ms. Remains 473 /474 variables (removed 1) and now considering 455/456 (removed 1) transitions.
// Phase 1: matrix 455 rows 473 cols
[2025-06-01 02:26:18] [INFO ] Invariants computation overflowed in 38 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:26:18] [INFO ] Implicit Places using invariants in 296 ms returned []
// Phase 1: matrix 455 rows 473 cols
[2025-06-01 02:26:18] [INFO ] Invariants computation overflowed in 36 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:26:18] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:26:28] [INFO ] Implicit Places using invariants and state equation in 9690 ms returned [42, 48, 75, 96, 101, 121, 127, 148, 153, 173, 178, 199, 205, 225, 230, 280, 285, 305, 310, 331, 336, 357, 363, 384, 386, 390, 411, 417, 439, 444, 448, 465, 471]
[2025-06-01 02:26:28] [INFO ] Actually due to overlaps returned [448, 285, 280, 386]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 9991 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 469/478 places, 455/456 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 469 transition count 453
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 467 transition count 453
Applied a total of 4 rules in 20 ms. Remains 467 /469 variables (removed 2) and now considering 453/455 (removed 2) transitions.
// Phase 1: matrix 453 rows 467 cols
[2025-06-01 02:26:28] [INFO ] Invariants computation overflowed in 42 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:26:28] [INFO ] Implicit Places using invariants in 296 ms returned []
// Phase 1: matrix 453 rows 467 cols
[2025-06-01 02:26:28] [INFO ] Invariants computation overflowed in 33 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:26:28] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:26:37] [INFO ] Implicit Places using invariants and state equation in 8620 ms returned [42, 48, 75, 96, 101, 121, 127, 148, 153, 173, 178, 199, 205, 225, 230, 302, 307, 328, 333, 354, 360, 381, 386, 407, 413, 435, 440, 459, 465]
[2025-06-01 02:26:37] [INFO ] Actually due to overlaps returned [48, 307, 42, 302]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 8934 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 463/478 places, 453/456 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 463 transition count 451
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 461 transition count 451
Applied a total of 4 rules in 21 ms. Remains 461 /463 variables (removed 2) and now considering 451/453 (removed 2) transitions.
// Phase 1: matrix 451 rows 461 cols
[2025-06-01 02:26:37] [INFO ] Invariants computation overflowed in 35 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:26:37] [INFO ] Implicit Places using invariants in 285 ms returned []
// Phase 1: matrix 451 rows 461 cols
[2025-06-01 02:26:37] [INFO ] Invariants computation overflowed in 35 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:26:37] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:26:46] [INFO ] Implicit Places using invariants and state equation in 8695 ms returned [72, 93, 98, 118, 124, 145, 150, 170, 175, 196, 202, 222, 227, 322, 327, 348, 354, 375, 380, 401, 407, 429, 434, 453, 459]
[2025-06-01 02:26:46] [INFO ] Actually due to overlaps returned [72, 327, 322]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 8991 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 458/478 places, 451/456 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 458 transition count 450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 457 transition count 450
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 457 transition count 450
Applied a total of 3 rules in 25 ms. Remains 457 /458 variables (removed 1) and now considering 450/451 (removed 1) transitions.
// Phase 1: matrix 450 rows 457 cols
[2025-06-01 02:26:46] [INFO ] Computed 84 invariants in 55 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:26:49] [INFO ] Implicit Places using invariants in 2974 ms returned [92, 97, 117, 123, 144, 149, 169, 174, 195, 201, 221, 226, 344, 350, 371, 376, 397, 403, 425, 430, 449, 455]
[2025-06-01 02:26:49] [INFO ] Actually due to overlaps returned [97, 350, 92, 344]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 2982 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 453/478 places, 450/456 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 453 transition count 448
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 451 transition count 448
Applied a total of 4 rules in 18 ms. Remains 451 /453 variables (removed 2) and now considering 448/450 (removed 2) transitions.
// Phase 1: matrix 448 rows 451 cols
[2025-06-01 02:26:49] [INFO ] Invariants computation overflowed in 37 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:26:49] [INFO ] Implicit Places using invariants in 261 ms returned []
// Phase 1: matrix 448 rows 451 cols
[2025-06-01 02:26:49] [INFO ] Invariants computation overflowed in 32 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:26:49] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:27:02] [INFO ] Implicit Places using invariants and state equation in 12440 ms returned [114, 120, 141, 146, 166, 171, 192, 198, 218, 223, 365, 370, 391, 397, 419, 424, 443, 449]
[2025-06-01 02:27:02] [INFO ] Actually due to overlaps returned [120, 370, 114, 365]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 12726 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 447/478 places, 448/456 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 447 transition count 446
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 445 transition count 446
Applied a total of 4 rules in 16 ms. Remains 445 /447 variables (removed 2) and now considering 446/448 (removed 2) transitions.
// Phase 1: matrix 446 rows 445 cols
[2025-06-01 02:27:02] [INFO ] Invariants computation overflowed in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:27:02] [INFO ] Implicit Places using invariants in 253 ms returned []
// Phase 1: matrix 446 rows 445 cols
[2025-06-01 02:27:02] [INFO ] Invariants computation overflowed in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:27:02] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:27:09] [INFO ] Implicit Places using invariants and state equation in 6853 ms returned [138, 143, 163, 168, 189, 195, 215, 220, 385, 391, 413, 418, 437, 443]
[2025-06-01 02:27:09] [INFO ] Actually due to overlaps returned [143, 391, 138, 385]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 7132 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 441/478 places, 446/456 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 441 transition count 444
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 439 transition count 444
Applied a total of 4 rules in 16 ms. Remains 439 /441 variables (removed 2) and now considering 444/446 (removed 2) transitions.
// Phase 1: matrix 444 rows 439 cols
[2025-06-01 02:27:09] [INFO ] Invariants computation overflowed in 32 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:27:09] [INFO ] Implicit Places using invariants in 242 ms returned []
// Phase 1: matrix 444 rows 439 cols
[2025-06-01 02:27:09] [INFO ] Invariants computation overflowed in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:27:09] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:27:16] [INFO ] Implicit Places using invariants and state equation in 6714 ms returned [160, 165, 186, 192, 212, 217, 407, 412, 431, 437]
[2025-06-01 02:27:16] [INFO ] Actually due to overlaps returned [165, 412, 160, 407]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 6992 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 435/478 places, 444/456 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 435 transition count 442
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 433 transition count 442
Applied a total of 4 rules in 15 ms. Remains 433 /435 variables (removed 2) and now considering 442/444 (removed 2) transitions.
// Phase 1: matrix 442 rows 433 cols
[2025-06-01 02:27:16] [INFO ] Invariants computation overflowed in 24 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:27:16] [INFO ] Implicit Places using invariants in 238 ms returned []
// Phase 1: matrix 442 rows 433 cols
[2025-06-01 02:27:16] [INFO ] Invariants computation overflowed in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:27:16] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:27:22] [INFO ] Implicit Places using invariants and state equation in 6437 ms returned [183, 189, 209, 214, 425, 431]
[2025-06-01 02:27:22] [INFO ] Actually due to overlaps returned [189, 183, 425, 431]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 6701 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 429/478 places, 442/456 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 429 transition count 440
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 427 transition count 440
Applied a total of 4 rules in 14 ms. Remains 427 /429 variables (removed 2) and now considering 440/442 (removed 2) transitions.
// Phase 1: matrix 440 rows 427 cols
[2025-06-01 02:27:23] [INFO ] Invariants computation overflowed in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:27:23] [INFO ] Implicit Places using invariants in 231 ms returned []
// Phase 1: matrix 440 rows 427 cols
[2025-06-01 02:27:23] [INFO ] Invariants computation overflowed in 24 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:27:23] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:27:29] [INFO ] Implicit Places using invariants and state equation in 6185 ms returned [206, 211]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 6438 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 425/478 places, 440/456 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 425 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 424 transition count 439
Applied a total of 2 rules in 22 ms. Remains 424 /425 variables (removed 1) and now considering 439/440 (removed 1) transitions.
// Phase 1: matrix 439 rows 424 cols
[2025-06-01 02:27:29] [INFO ] Invariants computation overflowed in 42 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:27:29] [INFO ] Implicit Places using invariants in 242 ms returned []
// Phase 1: matrix 439 rows 424 cols
[2025-06-01 02:27:29] [INFO ] Invariants computation overflowed in 28 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:27:29] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:27:36] [INFO ] Implicit Places using invariants and state equation in 6993 ms returned []
Implicit Place search using SMT with State Equation took 7263 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 11 : 424/478 places, 439/456 transitions.
Finished structural reductions in REACHABILITY mode , in 11 iterations and 83851 ms. Remains : 424/478 places, 439/456 transitions.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT p1)), (X p0), (X (X p2)), (X (X (NOT p1))), (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 79 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 95 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1))]
Support contains 5 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 30 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2025-06-01 02:27:37] [INFO ] Invariants computation overflowed in 103 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:27:37] [INFO ] Implicit Places using invariants in 377 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2025-06-01 02:27:37] [INFO ] Invariants computation overflowed in 106 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:27:50] [INFO ] Implicit Places using invariants and state equation in 13067 ms returned []
Implicit Place search using SMT with State Equation took 13463 ms to find 0 implicit places.
Running 996 sub problems to find dead transitions.
// Phase 1: matrix 997 rows 1057 cols
[2025-06-01 02:27:50] [INFO ] Invariants computation overflowed in 98 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1056 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 996 unsolved
SMT process timed out in 30234ms, After SMT, problems are : Problem set: 0 solved, 996 unsolved
Search for dead transitions found 0 dead transitions in 30235ms
Finished structural reductions in LTL mode , in 1 iterations and 43731 ms. Remains : 1057/1057 places, 997/997 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT p1)), (X p0), (X (X p2)), (X (X (NOT p1))), (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 72 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1))]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (1326 resets) in 110 ms. (360 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (1125 resets) in 84 ms. (470 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (1126 resets) in 82 ms. (481 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1111 resets) in 103 ms. (384 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (1120 resets) in 83 ms. (476 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 165436 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :0 out of 4
Probabilistic random walk after 165436 steps, saw 82739 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) properties seen :0
// Phase 1: matrix 997 rows 1057 cols
[2025-06-01 02:28:24] [INFO ] Invariants computation overflowed in 98 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 12/17 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 61/78 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 135/213 variables, 60/87 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 223/436 variables, 103/190 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 294/730 variables, 144/334 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/730 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 286/1016 variables, 156/490 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1016 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 257/1273 variables, 131/621 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:25] [INFO ] Deduced a trap along path composed of 20 places in 51 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:25] [INFO ] Deduced a trap along path composed of 17 places in 50 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:25] [INFO ] Deduced a trap along path composed of 17 places in 49 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:25] [INFO ] Deduced a trap along path composed of 16 places in 48 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1273 variables, 4/625 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1273 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 254/1527 variables, 133/758 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:25] [INFO ] Deduced a trap along path composed of 9 places in 55 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1527 variables, 1/759 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/1527 variables, 0/759 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 213/1740 variables, 118/877 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1740 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 123/1863 variables, 78/955 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1863 variables, 0/955 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 60/1923 variables, 32/987 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1923 variables, 0/987 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 55/1978 variables, 30/1017 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1978 variables, 0/1017 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 35/2013 variables, 21/1038 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2013 variables, 0/1038 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 21/2034 variables, 11/1049 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2034 variables, 0/1049 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (OVERLAPS) 11/2045 variables, 8/1057 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2045 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (OVERLAPS) 4/2049 variables, 2/1059 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2049 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (OVERLAPS) 4/2053 variables, 2/1061 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2053 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (OVERLAPS) 1/2054 variables, 1/1062 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:29] [INFO ] Deduced a trap composed of 43 places in 270 ms of which 27 ms to minimize.
SMT process timed out in 5364ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 1057 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 237 transitions
Trivial Post-agglo rules discarded 237 transitions
Performed 237 trivial Post agglomeration. Transition count delta: 237
Iterating post reduction 0 with 238 rules applied. Total rules applied 239 place count 1055 transition count 758
Reduce places removed 237 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 239 rules applied. Total rules applied 478 place count 818 transition count 756
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 480 place count 816 transition count 756
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 480 place count 816 transition count 715
Deduced a syphon composed of 41 places in 6 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 562 place count 775 transition count 715
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 3 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 3 with 364 rules applied. Total rules applied 926 place count 593 transition count 533
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 3 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 1002 place count 555 transition count 533
Free-agglomeration rule (complex) applied 76 times.
Iterating global reduction 3 with 76 rules applied. Total rules applied 1078 place count 555 transition count 457
Reduce places removed 76 places and 0 transitions.
Iterating post reduction 3 with 76 rules applied. Total rules applied 1154 place count 479 transition count 457
Partial Free-agglomeration rule applied 80 times.
Drop transitions (Partial Free agglomeration) removed 80 transitions
Iterating global reduction 4 with 80 rules applied. Total rules applied 1234 place count 479 transition count 457
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1235 place count 478 transition count 456
Applied a total of 1235 rules in 87 ms. Remains 478 /1057 variables (removed 579) and now considering 456/997 (removed 541) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 478/1057 places, 456/997 transitions.
RANDOM walk for 40000 steps (5117 resets) in 124 ms. (320 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3414 resets) in 71 ms. (555 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3341 resets) in 69 ms. (571 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3367 resets) in 69 ms. (571 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (3389 resets) in 95 ms. (416 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 213506 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 4
Probabilistic random walk after 213506 steps, saw 106809 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
// Phase 1: matrix 456 rows 478 cols
[2025-06-01 02:28:32] [INFO ] Computed 99 invariants in 61 ms
[2025-06-01 02:28:32] [INFO ] State equation strengthened by 78 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 282/287 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:33] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:33] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:33] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:33] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:33] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/287 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 184/471 variables, 77/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:34] [INFO ] Deduced a trap composed of 4 places in 202 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:34] [INFO ] Deduced a trap composed of 6 places in 176 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:34] [INFO ] Deduced a trap composed of 7 places in 180 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:34] [INFO ] Deduced a trap composed of 8 places in 193 ms of which 13 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/471 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/473 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:35] [INFO ] Deduced a trap composed of 9 places in 178 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:35] [INFO ] Deduced a trap composed of 10 places in 186 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:35] [INFO ] Deduced a trap composed of 10 places in 180 ms of which 14 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/473 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/473 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 456/929 variables, 473/582 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/929 variables, 78/660 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/929 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 5/934 variables, 5/665 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/934 variables, 2/667 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/934 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/934 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 934/934 variables, and 667 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3823 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 478/478 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 282/287 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/287 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 184/471 variables, 77/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/471 variables, 6/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/473 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/473 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:37] [INFO ] Deduced a trap composed of 11 places in 237 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:37] [INFO ] Deduced a trap composed of 13 places in 226 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:37] [INFO ] Deduced a trap composed of 13 places in 217 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:37] [INFO ] Deduced a trap composed of 14 places in 231 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:38] [INFO ] Deduced a trap composed of 17 places in 230 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:38] [INFO ] Deduced a trap composed of 17 places in 224 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:38] [INFO ] Deduced a trap composed of 19 places in 236 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:38] [INFO ] Deduced a trap composed of 19 places in 212 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:39] [INFO ] Deduced a trap composed of 19 places in 223 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:39] [INFO ] Deduced a trap composed of 20 places in 221 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:39] [INFO ] Deduced a trap composed of 21 places in 221 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:39] [INFO ] Deduced a trap composed of 23 places in 213 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:40] [INFO ] Deduced a trap composed of 23 places in 220 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:40] [INFO ] Deduced a trap composed of 25 places in 214 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:40] [INFO ] Deduced a trap composed of 26 places in 223 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:40] [INFO ] Deduced a trap composed of 27 places in 231 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:41] [INFO ] Deduced a trap composed of 31 places in 233 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:41] [INFO ] Deduced a trap composed of 32 places in 214 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:41] [INFO ] Deduced a trap composed of 32 places in 230 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:41] [INFO ] Deduced a trap composed of 35 places in 238 ms of which 34 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/473 variables, 20/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:41] [INFO ] Deduced a trap composed of 36 places in 145 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:42] [INFO ] Deduced a trap composed of 76 places in 150 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:42] [INFO ] Deduced a trap composed of 38 places in 146 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:42] [INFO ] Deduced a trap composed of 40 places in 149 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:42] [INFO ] Deduced a trap composed of 76 places in 135 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:42] [INFO ] Deduced a trap composed of 38 places in 140 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:42] [INFO ] Deduced a trap composed of 39 places in 140 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:43] [INFO ] Deduced a trap composed of 75 places in 144 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:43] [INFO ] Deduced a trap composed of 78 places in 145 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:43] [INFO ] Deduced a trap composed of 34 places in 144 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:43] [INFO ] Deduced a trap composed of 78 places in 140 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:43] [INFO ] Deduced a trap composed of 79 places in 154 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:43] [INFO ] Deduced a trap composed of 38 places in 155 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:44] [INFO ] Deduced a trap composed of 78 places in 140 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:44] [INFO ] Deduced a trap composed of 79 places in 155 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:44] [INFO ] Deduced a trap composed of 41 places in 160 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:44] [INFO ] Deduced a trap composed of 76 places in 139 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:44] [INFO ] Deduced a trap composed of 77 places in 141 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:44] [INFO ] Deduced a trap composed of 78 places in 154 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:44] [INFO ] Deduced a trap composed of 78 places in 138 ms of which 13 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/473 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:45] [INFO ] Deduced a trap composed of 76 places in 147 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:45] [INFO ] Deduced a trap composed of 76 places in 154 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:45] [INFO ] Deduced a trap composed of 77 places in 158 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:45] [INFO ] Deduced a trap composed of 77 places in 143 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:45] [INFO ] Deduced a trap composed of 76 places in 142 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:45] [INFO ] Deduced a trap composed of 77 places in 140 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:46] [INFO ] Deduced a trap composed of 76 places in 139 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:46] [INFO ] Deduced a trap composed of 77 places in 129 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:46] [INFO ] Deduced a trap composed of 76 places in 138 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:46] [INFO ] Deduced a trap composed of 77 places in 136 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:46] [INFO ] Deduced a trap composed of 76 places in 148 ms of which 12 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/473 variables, 11/160 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/473 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 456/929 variables, 473/633 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/929 variables, 78/711 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/929 variables, 4/715 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:49] [INFO ] Deduced a trap composed of 30 places in 166 ms of which 9 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/929 variables, 1/716 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:49] [INFO ] Deduced a trap along path composed of 7 places in 45 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:50] [INFO ] Deduced a trap along path composed of 8 places in 40 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:50] [INFO ] Deduced a trap along path composed of 8 places in 40 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:50] [INFO ] Deduced a trap along path composed of 6 places in 39 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:28:50] [INFO ] Deduced a trap along path composed of 4 places in 31 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/929 variables, 5/721 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/929 variables, 0/721 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 5/934 variables, 5/726 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/934 variables, 2/728 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/934 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/934 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 934/934 variables, and 728 constraints, problems are : Problem set: 0 solved, 4 unsolved in 16338 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 478/478 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 64/64 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 20261ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 30000 ms.
Support contains 5 out of 478 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 456/456 transitions.
Applied a total of 0 rules in 9 ms. Remains 478 /478 variables (removed 0) and now considering 456/456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 478/478 places, 456/456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 456/456 transitions.
Applied a total of 0 rules in 9 ms. Remains 478 /478 variables (removed 0) and now considering 456/456 (removed 0) transitions.
[2025-06-01 02:29:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:29:28] [INFO ] Implicit Places using invariants in 5543 ms returned [42, 48, 75, 96, 101, 121, 127, 148, 153, 154, 174, 179, 200, 206, 213, 228, 233, 256, 262, 285, 290, 310, 315, 336, 341, 362, 368, 389, 391, 395, 416, 422, 444, 449, 453, 470, 476]
[2025-06-01 02:29:28] [INFO ] Actually due to overlaps returned [213, 262, 153, 256]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 5552 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 474/478 places, 456/456 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 474 transition count 455
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 473 transition count 455
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 473 transition count 455
Applied a total of 4 rules in 26 ms. Remains 473 /474 variables (removed 1) and now considering 455/456 (removed 1) transitions.
// Phase 1: matrix 455 rows 473 cols
[2025-06-01 02:29:28] [INFO ] Invariants computation overflowed in 39 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:29:29] [INFO ] Implicit Places using invariants in 309 ms returned []
// Phase 1: matrix 455 rows 473 cols
[2025-06-01 02:29:29] [INFO ] Invariants computation overflowed in 43 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:29:29] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:29:39] [INFO ] Implicit Places using invariants and state equation in 10208 ms returned [42, 48, 75, 96, 101, 121, 127, 148, 153, 173, 178, 199, 205, 225, 230, 280, 285, 305, 310, 331, 336, 357, 363, 384, 386, 390, 411, 417, 439, 444, 448, 465, 471]
[2025-06-01 02:29:39] [INFO ] Actually due to overlaps returned [448, 285, 280, 386]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 10523 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 469/478 places, 455/456 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 469 transition count 453
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 467 transition count 453
Applied a total of 4 rules in 20 ms. Remains 467 /469 variables (removed 2) and now considering 453/455 (removed 2) transitions.
// Phase 1: matrix 453 rows 467 cols
[2025-06-01 02:29:39] [INFO ] Invariants computation overflowed in 39 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:29:39] [INFO ] Implicit Places using invariants in 313 ms returned []
// Phase 1: matrix 453 rows 467 cols
[2025-06-01 02:29:39] [INFO ] Invariants computation overflowed in 42 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:29:39] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:29:48] [INFO ] Implicit Places using invariants and state equation in 8845 ms returned [42, 48, 75, 96, 101, 121, 127, 148, 153, 173, 178, 199, 205, 225, 230, 302, 307, 328, 333, 354, 360, 381, 386, 407, 413, 435, 440, 459, 465]
[2025-06-01 02:29:48] [INFO ] Actually due to overlaps returned [48, 307, 42, 302]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 9162 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 463/478 places, 453/456 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 463 transition count 451
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 461 transition count 451
Applied a total of 4 rules in 22 ms. Remains 461 /463 variables (removed 2) and now considering 451/453 (removed 2) transitions.
// Phase 1: matrix 451 rows 461 cols
[2025-06-01 02:29:48] [INFO ] Invariants computation overflowed in 35 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:29:48] [INFO ] Implicit Places using invariants in 290 ms returned []
// Phase 1: matrix 451 rows 461 cols
[2025-06-01 02:29:48] [INFO ] Invariants computation overflowed in 43 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:29:49] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:29:58] [INFO ] Implicit Places using invariants and state equation in 9219 ms returned [72, 93, 98, 118, 124, 145, 150, 170, 175, 196, 202, 222, 227, 322, 327, 348, 354, 375, 380, 401, 407, 429, 434, 453, 459]
[2025-06-01 02:29:58] [INFO ] Actually due to overlaps returned [72, 327, 322]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 9510 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 458/478 places, 451/456 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 458 transition count 450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 457 transition count 450
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 457 transition count 450
Applied a total of 3 rules in 33 ms. Remains 457 /458 variables (removed 1) and now considering 450/451 (removed 1) transitions.
// Phase 1: matrix 450 rows 457 cols
[2025-06-01 02:29:58] [INFO ] Computed 84 invariants in 53 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:30:01] [INFO ] Implicit Places using invariants in 3030 ms returned [92, 97, 117, 123, 144, 149, 169, 174, 195, 201, 221, 226, 344, 350, 371, 376, 397, 403, 425, 430, 449, 455]
[2025-06-01 02:30:01] [INFO ] Actually due to overlaps returned [97, 350, 92, 344]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 3032 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 453/478 places, 450/456 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 453 transition count 448
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 451 transition count 448
Applied a total of 4 rules in 16 ms. Remains 451 /453 variables (removed 2) and now considering 448/450 (removed 2) transitions.
// Phase 1: matrix 448 rows 451 cols
[2025-06-01 02:30:01] [INFO ] Invariants computation overflowed in 42 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:30:01] [INFO ] Implicit Places using invariants in 280 ms returned []
// Phase 1: matrix 448 rows 451 cols
[2025-06-01 02:30:01] [INFO ] Invariants computation overflowed in 40 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:30:01] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:30:14] [INFO ] Implicit Places using invariants and state equation in 13019 ms returned [114, 120, 141, 146, 166, 171, 192, 198, 218, 223, 365, 370, 391, 397, 419, 424, 443, 449]
[2025-06-01 02:30:14] [INFO ] Actually due to overlaps returned [120, 370, 114, 365]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 13302 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 447/478 places, 448/456 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 447 transition count 446
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 445 transition count 446
Applied a total of 4 rules in 14 ms. Remains 445 /447 variables (removed 2) and now considering 446/448 (removed 2) transitions.
// Phase 1: matrix 446 rows 445 cols
[2025-06-01 02:30:14] [INFO ] Invariants computation overflowed in 30 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:30:14] [INFO ] Implicit Places using invariants in 272 ms returned []
// Phase 1: matrix 446 rows 445 cols
[2025-06-01 02:30:14] [INFO ] Invariants computation overflowed in 28 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:30:14] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:30:21] [INFO ] Implicit Places using invariants and state equation in 7033 ms returned [138, 143, 163, 168, 189, 195, 215, 220, 385, 391, 413, 418, 437, 443]
[2025-06-01 02:30:21] [INFO ] Actually due to overlaps returned [143, 391, 138, 385]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 7308 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 441/478 places, 446/456 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 441 transition count 444
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 439 transition count 444
Applied a total of 4 rules in 18 ms. Remains 439 /441 variables (removed 2) and now considering 444/446 (removed 2) transitions.
// Phase 1: matrix 444 rows 439 cols
[2025-06-01 02:30:21] [INFO ] Invariants computation overflowed in 32 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:30:22] [INFO ] Implicit Places using invariants in 263 ms returned []
// Phase 1: matrix 444 rows 439 cols
[2025-06-01 02:30:22] [INFO ] Invariants computation overflowed in 32 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:30:22] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:30:29] [INFO ] Implicit Places using invariants and state equation in 7282 ms returned [160, 165, 186, 192, 212, 217, 407, 412, 431, 437]
[2025-06-01 02:30:29] [INFO ] Actually due to overlaps returned [165, 412, 160, 407]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 7548 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 435/478 places, 444/456 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 435 transition count 442
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 433 transition count 442
Applied a total of 4 rules in 19 ms. Remains 433 /435 variables (removed 2) and now considering 442/444 (removed 2) transitions.
// Phase 1: matrix 442 rows 433 cols
[2025-06-01 02:30:29] [INFO ] Invariants computation overflowed in 33 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:30:29] [INFO ] Implicit Places using invariants in 249 ms returned []
// Phase 1: matrix 442 rows 433 cols
[2025-06-01 02:30:29] [INFO ] Invariants computation overflowed in 33 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:30:29] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:30:36] [INFO ] Implicit Places using invariants and state equation in 6988 ms returned [183, 189, 209, 214, 425, 431]
[2025-06-01 02:30:36] [INFO ] Actually due to overlaps returned [189, 183, 425, 431]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 7240 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 429/478 places, 442/456 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 429 transition count 440
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 427 transition count 440
Applied a total of 4 rules in 19 ms. Remains 427 /429 variables (removed 2) and now considering 440/442 (removed 2) transitions.
// Phase 1: matrix 440 rows 427 cols
[2025-06-01 02:30:36] [INFO ] Invariants computation overflowed in 37 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:30:36] [INFO ] Implicit Places using invariants in 239 ms returned []
// Phase 1: matrix 440 rows 427 cols
[2025-06-01 02:30:36] [INFO ] Invariants computation overflowed in 34 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:30:37] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:30:43] [INFO ] Implicit Places using invariants and state equation in 6618 ms returned [206, 211]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 6859 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 425/478 places, 440/456 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 425 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 424 transition count 439
Applied a total of 2 rules in 19 ms. Remains 424 /425 variables (removed 1) and now considering 439/440 (removed 1) transitions.
// Phase 1: matrix 439 rows 424 cols
[2025-06-01 02:30:43] [INFO ] Invariants computation overflowed in 33 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:30:43] [INFO ] Implicit Places using invariants in 248 ms returned []
// Phase 1: matrix 439 rows 424 cols
[2025-06-01 02:30:43] [INFO ] Invariants computation overflowed in 29 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:30:43] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-01 02:30:50] [INFO ] Implicit Places using invariants and state equation in 7248 ms returned []
Implicit Place search using SMT with State Equation took 7502 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 11 : 424/478 places, 439/456 transitions.
Finished structural reductions in REACHABILITY mode , in 11 iterations and 87756 ms. Remains : 424/478 places, 439/456 transitions.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT p1)), (X p0), (X (X p2)), (X (X (NOT p1))), (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 102 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 142 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 155 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 3330 reset in 123 ms.
Product exploration explored 100000 steps with 3336 reset in 141 ms.
Applying partial POR strategy [true, false, false, true]
Stuttering acceptance computed with spot in 151 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1))]
Support contains 5 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 236 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 236 rules applied. Total rules applied 237 place count 1056 transition count 996
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 42 Pre rules applied. Total rules applied 237 place count 1056 transition count 1035
Deduced a syphon composed of 278 places in 8 ms
Iterating global reduction 1 with 42 rules applied. Total rules applied 279 place count 1056 transition count 1035
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 283 place count 1052 transition count 1031
Deduced a syphon composed of 274 places in 8 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 287 place count 1052 transition count 1031
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 456 places in 5 ms
Iterating global reduction 1 with 182 rules applied. Total rules applied 469 place count 1052 transition count 1071
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 470 place count 1051 transition count 1070
Deduced a syphon composed of 455 places in 6 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 471 place count 1051 transition count 1070
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -246
Deduced a syphon composed of 495 places in 8 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 511 place count 1051 transition count 1316
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 552 place count 1010 transition count 1234
Deduced a syphon composed of 454 places in 4 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 593 place count 1010 transition count 1234
Deduced a syphon composed of 454 places in 4 ms
Applied a total of 593 rules in 376 ms. Remains 1010 /1057 variables (removed 47) and now considering 1234/997 (removed -237) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 02:30:52] [INFO ] Redundant transitions in 12 ms returned []
Running 1233 sub problems to find dead transitions.
// Phase 1: matrix 1234 rows 1010 cols
[2025-06-01 02:30:52] [INFO ] Invariants computation overflowed in 105 ms
[2025-06-01 02:30:52] [INFO ] State equation strengthened by 39 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1009/2244 variables, and 0 constraints, problems are : Problem set: 0 solved, 1233 unsolved in 30026 ms.
Refiners :[State Equation: 0/1010 constraints, ReadFeed: 0/39 constraints, PredecessorRefiner: 1233/1233 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1233 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/2244 variables, and 0 constraints, problems are : Problem set: 0 solved, 1233 unsolved in 30029 ms.
Refiners :[State Equation: 0/1010 constraints, ReadFeed: 0/39 constraints, PredecessorRefiner: 0/1233 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60368ms problems are : Problem set: 0 solved, 1233 unsolved
Search for dead transitions found 0 dead transitions in 60371ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1010/1057 places, 1234/997 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60772 ms. Remains : 1010/1057 places, 1234/997 transitions.
Built C files in :
/tmp/ltsmin11577338840579010986
[2025-06-01 02:31:52] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11577338840579010986
Running compilation step : cd /tmp/ltsmin11577338840579010986;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1694 ms.
Running link step : cd /tmp/ltsmin11577338840579010986;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin11577338840579010986;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2152524425543801639.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 37 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2025-06-01 02:32:08] [INFO ] Invariants computation overflowed in 123 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:32:08] [INFO ] Implicit Places using invariants in 395 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2025-06-01 02:32:08] [INFO ] Invariants computation overflowed in 118 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:32:22] [INFO ] Implicit Places using invariants and state equation in 14309 ms returned []
Implicit Place search using SMT with State Equation took 14709 ms to find 0 implicit places.
Running 996 sub problems to find dead transitions.
// Phase 1: matrix 997 rows 1057 cols
[2025-06-01 02:32:22] [INFO ] Invariants computation overflowed in 110 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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="DoubleExponent-PT-020"
export BK_EXAMINATION="LTLFireability"
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 DoubleExponent-PT-020, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r072-tall-174860067600500"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-020.tgz
mv DoubleExponent-PT-020 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;