Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r168-tall-174881266900372.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 gold2024
Input is PolyORBNT-COL-S10J20, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-174881266900372
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K 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 4.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K 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 16K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K 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.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 92K 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

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1748900970145

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBNT-COL-S10J20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-02 21:49:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-02 21:49:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 21:49:31] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-02 21:49:31] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-02 21:49:32] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 628 ms
[2025-06-02 21:49:32] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 494 PT places and 11822.0 transition bindings in 20 ms.
[2025-06-02 21:49:32] [INFO ] Unfolded HLPN to a Petri net with 494 places and 11780 transitions 111159 arcs in 195 ms.
[2025-06-02 21:49:32] [INFO ] Unfolded 38 HLPN properties in 4 ms.
Initial state reduction rules removed 2 formulas.
[2025-06-02 21:49:32] [INFO ] Reduced 9285 identical enabling conditions.
[2025-06-02 21:49:32] [INFO ] Reduced 780 identical enabling conditions.
[2025-06-02 21:49:32] [INFO ] Reduced 45 identical enabling conditions.
Deduced a syphon composed of 20 places in 31 ms
Reduce places removed 20 places and 20 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
RANDOM walk for 40000 steps (2239 resets) in 4505 ms. (8 steps per ms) remains 30/36 properties
BEST_FIRST walk for 4003 steps (41 resets) in 198 ms. (20 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (40 resets) in 124 ms. (32 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (40 resets) in 128 ms. (31 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (41 resets) in 124 ms. (32 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (40 resets) in 101 ms. (39 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (40 resets) in 88 ms. (44 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (40 resets) in 89 ms. (44 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (42 resets) in 89 ms. (44 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (40 resets) in 71 ms. (55 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (39 resets) in 90 ms. (43 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (40 resets) in 84 ms. (47 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (40 resets) in 91 ms. (43 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (40 resets) in 76 ms. (51 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (40 resets) in 83 ms. (47 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (40 resets) in 74 ms. (53 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 399 ms. (10 steps per ms) remains 22/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 8/22 properties
BEST_FIRST walk for 4004 steps (39 resets) in 216 ms. (18 steps per ms) remains 8/8 properties
[2025-06-02 21:49:34] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
// Phase 1: matrix 1641 rows 474 cols
[2025-06-02 21:49:34] [INFO ] Computed 72 invariants in 72 ms
[2025-06-02 21:49:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 402/443 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/443 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/443 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 22/465 variables, 22/65 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 8/473 variables, 6/71 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/473 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 1/474 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/474 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 1641/2115 variables, 474/546 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2115 variables, 1/547 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2115 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2025-06-02 21:49:39] [INFO ] Deduced a trap composed of 218 places in 477 ms of which 29 ms to minimize.
[2025-06-02 21:49:39] [INFO ] Deduced a trap composed of 123 places in 429 ms of which 4 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/2115 variables, 2/549 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2115 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2115/2115 variables, and 549 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5061 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 474/474 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/6 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 402/443 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/443 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/443 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 22/465 variables, 22/65 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 8/473 variables, 6/71 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/473 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2025-06-02 21:49:41] [INFO ] Deduced a trap composed of 205 places in 201 ms of which 3 ms to minimize.
[2025-06-02 21:49:41] [INFO ] Deduced a trap composed of 224 places in 212 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/473 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/473 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 1/474 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/474 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 1641/2115 variables, 474/550 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2115 variables, 1/551 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2115 variables, 6/557 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2115/2115 variables, and 557 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 474/474 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/6 constraints, Known Traps: 4/4 constraints]
After SMT, in 11191ms problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 41 out of 474 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 474/474 places, 1650/1650 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 464 transition count 1625
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 60 place count 439 transition count 1625
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 60 place count 439 transition count 1602
Deduced a syphon composed of 23 places in 2 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 106 place count 416 transition count 1602
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 107 place count 415 transition count 1601
Iterating global reduction 2 with 1 rules applied. Total rules applied 108 place count 415 transition count 1601
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 112 place count 413 transition count 1599
Applied a total of 112 rules in 236 ms. Remains 413 /474 variables (removed 61) and now considering 1599/1650 (removed 51) transitions.
Running 1588 sub problems to find dead transitions.
[2025-06-02 21:49:46] [INFO ] Flow matrix only has 1590 transitions (discarded 9 similar events)
// Phase 1: matrix 1590 rows 413 cols
[2025-06-02 21:49:46] [INFO ] Computed 62 invariants in 38 ms
[2025-06-02 21:49:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/403 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 403/2003 variables, and 52 constraints, problems are : Problem set: 0 solved, 1588 unsolved in 20052 ms.
Refiners :[Positive P Invariants (semi-flows): 46/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/413 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1588/588 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1588 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/403 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
[2025-06-02 21:50:33] [INFO ] Deduced a trap composed of 117 places in 228 ms of which 3 ms to minimize.
[2025-06-02 21:50:33] [INFO ] Deduced a trap composed of 76 places in 195 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/403 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
[2025-06-02 21:50:36] [INFO ] Deduced a trap composed of 19 places in 352 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 403/2003 variables, and 55 constraints, problems are : Problem set: 0 solved, 1588 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 46/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/413 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/588 constraints, Known Traps: 3/3 constraints]
After SMT, in 54271ms problems are : Problem set: 0 solved, 1588 unsolved
Search for dead transitions found 0 dead transitions in 54309ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54568 ms. Remains : 413/474 places, 1599/1650 transitions.
RANDOM walk for 4000002 steps (261712 resets) in 55742 ms. (71 steps per ms) remains 1/8 properties
BEST_FIRST walk for 4000004 steps (37694 resets) in 8244 ms. (485 steps per ms) remains 1/1 properties
[2025-06-02 21:50:58] [INFO ] Flow matrix only has 1590 transitions (discarded 9 similar events)
[2025-06-02 21:50:58] [INFO ] Invariant cache hit.
[2025-06-02 21:50:58] [INFO ] State equation strengthened by 1 read => feed constraints.
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) 10/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 78/89 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 313/402 variables, 52/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/403 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/403 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/411 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/412 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/412 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1590/2002 variables, 412/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2002 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2002 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/2003 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2003 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2003 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2003/2003 variables, and 476 constraints, problems are : Problem set: 0 solved, 1 unsolved in 575 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 413/413 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 78/89 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 313/402 variables, 52/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/403 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/403 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/411 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/412 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/412 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1590/2002 variables, 412/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2002 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2002 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/2003 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2003 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2003 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/2003 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2003/2003 variables, and 477 constraints, problems are : Problem set: 0 solved, 1 unsolved in 718 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 413/413 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1314ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 42 ms.
Support contains 1 out of 413 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 1599/1599 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 413 transition count 1598
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 412 transition count 1598
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 412 transition count 1596
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 410 transition count 1596
Applied a total of 6 rules in 102 ms. Remains 410 /413 variables (removed 3) and now considering 1596/1599 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 410/413 places, 1596/1599 transitions.
RANDOM walk for 4000000 steps (290784 resets) in 72445 ms. (55 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000002 steps (38559 resets) in 9925 ms. (402 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 8311675 steps, run timeout after 66001 ms. (steps per millisecond=125 ) properties seen :0 out of 1
Probabilistic random walk after 8311675 steps, saw 1450461 distinct states, run finished after 66007 ms. (steps per millisecond=125 ) properties seen :0
[2025-06-02 21:52:28] [INFO ] Flow matrix only has 1587 transitions (discarded 9 similar events)
// Phase 1: matrix 1587 rows 410 cols
[2025-06-02 21:52:28] [INFO ] Computed 62 invariants in 28 ms
[2025-06-02 21:52:28] [INFO ] State equation strengthened by 1 read => feed constraints.
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) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 77/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 313/399 variables, 52/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/400 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/408 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/409 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/409 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1587/1996 variables, 409/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1996 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1996 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1997 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1997 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1997 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1997/1997 variables, and 473 constraints, problems are : Problem set: 0 solved, 1 unsolved in 539 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 410/410 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 77/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 313/399 variables, 52/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/400 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/408 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/409 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/409 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1587/1996 variables, 409/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1996 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1996 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1997 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1997 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1997 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1997 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1997/1997 variables, and 474 constraints, problems are : Problem set: 0 solved, 1 unsolved in 675 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 410/410 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1259ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 32 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 1596/1596 transitions.
Applied a total of 0 rules in 53 ms. Remains 410 /410 variables (removed 0) and now considering 1596/1596 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 410/410 places, 1596/1596 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 1596/1596 transitions.
Applied a total of 0 rules in 38 ms. Remains 410 /410 variables (removed 0) and now considering 1596/1596 (removed 0) transitions.
[2025-06-02 21:52:29] [INFO ] Flow matrix only has 1587 transitions (discarded 9 similar events)
[2025-06-02 21:52:29] [INFO ] Invariant cache hit.
[2025-06-02 21:52:30] [INFO ] Implicit Places using invariants in 474 ms returned []
[2025-06-02 21:52:30] [INFO ] Flow matrix only has 1587 transitions (discarded 9 similar events)
[2025-06-02 21:52:30] [INFO ] Invariant cache hit.
[2025-06-02 21:52:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:52:32] [INFO ] Implicit Places using invariants and state equation in 2025 ms returned []
Implicit Place search using SMT with State Equation took 2510 ms to find 0 implicit places.
[2025-06-02 21:52:32] [INFO ] Redundant transitions in 85 ms returned []
Running 1585 sub problems to find dead transitions.
[2025-06-02 21:52:32] [INFO ] Flow matrix only has 1587 transitions (discarded 9 similar events)
[2025-06-02 21:52:32] [INFO ] Invariant cache hit.
[2025-06-02 21:52:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1585 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1585 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1585 unsolved
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD941 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD944 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1007 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1019 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1071 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1293 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1301 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1303 is UNSAT
Problem TDEAD1304 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1306 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1313 is UNSAT
Problem TDEAD1314 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1326 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1343 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1355 is UNSAT
Problem TDEAD1360 is UNSAT
Problem TDEAD1361 is UNSAT
Problem TDEAD1362 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1364 is UNSAT
Problem TDEAD1365 is UNSAT
Problem TDEAD1366 is UNSAT
Problem TDEAD1369 is UNSAT
Problem TDEAD1372 is UNSAT
Problem TDEAD1376 is UNSAT
Problem TDEAD1381 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1388 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1390 is UNSAT
Problem TDEAD1391 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1393 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1397 is UNSAT
Problem TDEAD1400 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1409 is UNSAT
Problem TDEAD1415 is UNSAT
Problem TDEAD1422 is UNSAT
Problem TDEAD1423 is UNSAT
Problem TDEAD1424 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1426 is UNSAT
Problem TDEAD1427 is UNSAT
Problem TDEAD1428 is UNSAT
Problem TDEAD1429 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1440 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1451 is UNSAT
Problem TDEAD1458 is UNSAT
Problem TDEAD1466 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1469 is UNSAT
Problem TDEAD1470 is UNSAT
Problem TDEAD1471 is UNSAT
Problem TDEAD1472 is UNSAT
Problem TDEAD1473 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1475 is UNSAT
Problem TDEAD1478 is UNSAT
Problem TDEAD1481 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1503 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1520 is UNSAT
Problem TDEAD1521 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1523 is UNSAT
Problem TDEAD1524 is UNSAT
Problem TDEAD1525 is UNSAT
Problem TDEAD1526 is UNSAT
Problem TDEAD1527 is UNSAT
Problem TDEAD1528 is UNSAT
Problem TDEAD1529 is UNSAT
Problem TDEAD1530 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1536 is UNSAT
Problem TDEAD1540 is UNSAT
Problem TDEAD1545 is UNSAT
Problem TDEAD1551 is UNSAT
Problem TDEAD1558 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1575 is UNSAT
Problem TDEAD1585 is UNSAT
At refinement iteration 3 (OVERLAPS) 9/409 variables, 9/61 constraints. Problems are: Problem set: 558 solved, 1027 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/409 variables, 0/61 constraints. Problems are: Problem set: 558 solved, 1027 unsolved
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1092 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1395 is UNSAT
Problem TDEAD1431 is UNSAT
Problem TDEAD1476 is UNSAT
Problem TDEAD1531 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/410 variables, 1/62 constraints. Problems are: Problem set: 615 solved, 970 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 410/1997 variables, and 62 constraints, problems are : Problem set: 615 solved, 970 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1585/585 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 615 solved, 970 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 46/46 constraints. Problems are: Problem set: 615 solved, 970 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 6/52 constraints. Problems are: Problem set: 615 solved, 970 unsolved
[2025-06-02 21:53:19] [INFO ] Deduced a trap composed of 18 places in 359 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 1/53 constraints. Problems are: Problem set: 615 solved, 970 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 0/53 constraints. Problems are: Problem set: 615 solved, 970 unsolved
At refinement iteration 4 (OVERLAPS) 9/409 variables, 9/62 constraints. Problems are: Problem set: 615 solved, 970 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 0/62 constraints. Problems are: Problem set: 615 solved, 970 unsolved
SMT process timed out in 75528ms, After SMT, problems are : Problem set: 615 solved, 970 unsolved
Search for dead transitions found 615 dead transitions in 75546ms
Found 615 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 615 transitions
Dead transitions reduction (with SMT) removed 615 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 410/410 places, 981/1596 transitions.
Applied a total of 0 rules in 31 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2025-06-02 21:53:47] [INFO ] Redundant transitions in 9 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 78239 ms. Remains : 410/410 places, 981/1596 transitions.
RANDOM walk for 4000000 steps (290569 resets) in 37710 ms. (106 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (38286 resets) in 6945 ms. (575 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 6076455 steps, run timeout after 33001 ms. (steps per millisecond=184 ) properties seen :0 out of 1
Probabilistic random walk after 6076455 steps, saw 1055023 distinct states, run finished after 33001 ms. (steps per millisecond=184 ) properties seen :0
[2025-06-02 21:54:32] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2025-06-02 21:54:32] [INFO ] Computed 62 invariants in 21 ms
[2025-06-02 21:54:32] [INFO ] State equation strengthened by 1 read => feed constraints.
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) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 77/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 313/399 variables, 52/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/400 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/408 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/409 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/409 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 972/1381 variables, 409/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1381 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1381 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1382 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1382 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1382 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1382/1382 variables, and 473 constraints, problems are : Problem set: 0 solved, 1 unsolved in 410 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 410/410 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 77/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 313/399 variables, 52/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/400 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/408 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 21:54:32] [INFO ] Deduced a trap composed of 172 places in 172 ms of which 3 ms to minimize.
[2025-06-02 21:54:33] [INFO ] Deduced a trap composed of 164 places in 173 ms of which 3 ms to minimize.
[2025-06-02 21:54:33] [INFO ] Deduced a trap composed of 162 places in 179 ms of which 2 ms to minimize.
[2025-06-02 21:54:33] [INFO ] Deduced a trap composed of 170 places in 181 ms of which 3 ms to minimize.
[2025-06-02 21:54:33] [INFO ] Deduced a trap composed of 166 places in 181 ms of which 2 ms to minimize.
[2025-06-02 21:54:33] [INFO ] Deduced a trap composed of 166 places in 176 ms of which 3 ms to minimize.
[2025-06-02 21:54:34] [INFO ] Deduced a trap composed of 164 places in 207 ms of which 2 ms to minimize.
[2025-06-02 21:54:34] [INFO ] Deduced a trap composed of 166 places in 201 ms of which 2 ms to minimize.
[2025-06-02 21:54:34] [INFO ] Deduced a trap composed of 164 places in 196 ms of which 2 ms to minimize.
[2025-06-02 21:54:34] [INFO ] Deduced a trap composed of 166 places in 200 ms of which 3 ms to minimize.
[2025-06-02 21:54:34] [INFO ] Deduced a trap composed of 164 places in 196 ms of which 2 ms to minimize.
[2025-06-02 21:54:35] [INFO ] Deduced a trap composed of 170 places in 200 ms of which 2 ms to minimize.
[2025-06-02 21:54:35] [INFO ] Deduced a trap composed of 160 places in 194 ms of which 3 ms to minimize.
[2025-06-02 21:54:35] [INFO ] Deduced a trap composed of 162 places in 192 ms of which 3 ms to minimize.
[2025-06-02 21:54:35] [INFO ] Deduced a trap composed of 162 places in 188 ms of which 2 ms to minimize.
[2025-06-02 21:54:36] [INFO ] Deduced a trap composed of 162 places in 193 ms of which 2 ms to minimize.
[2025-06-02 21:54:36] [INFO ] Deduced a trap composed of 164 places in 189 ms of which 2 ms to minimize.
[2025-06-02 21:54:36] [INFO ] Deduced a trap composed of 170 places in 187 ms of which 3 ms to minimize.
[2025-06-02 21:54:36] [INFO ] Deduced a trap composed of 164 places in 193 ms of which 3 ms to minimize.
[2025-06-02 21:54:36] [INFO ] Deduced a trap composed of 162 places in 192 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 21:54:37] [INFO ] Deduced a trap composed of 172 places in 193 ms of which 2 ms to minimize.
[2025-06-02 21:54:37] [INFO ] Deduced a trap composed of 166 places in 175 ms of which 3 ms to minimize.
[2025-06-02 21:54:37] [INFO ] Deduced a trap composed of 164 places in 190 ms of which 2 ms to minimize.
[2025-06-02 21:54:37] [INFO ] Deduced a trap composed of 168 places in 200 ms of which 3 ms to minimize.
[2025-06-02 21:54:37] [INFO ] Deduced a trap composed of 162 places in 170 ms of which 2 ms to minimize.
[2025-06-02 21:54:38] [INFO ] Deduced a trap composed of 160 places in 184 ms of which 3 ms to minimize.
[2025-06-02 21:54:38] [INFO ] Deduced a trap composed of 162 places in 178 ms of which 3 ms to minimize.
[2025-06-02 21:54:38] [INFO ] Deduced a trap composed of 164 places in 188 ms of which 2 ms to minimize.
[2025-06-02 21:54:38] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 3 ms to minimize.
[2025-06-02 21:54:38] [INFO ] Deduced a trap composed of 162 places in 185 ms of which 2 ms to minimize.
[2025-06-02 21:54:39] [INFO ] Deduced a trap composed of 164 places in 169 ms of which 3 ms to minimize.
[2025-06-02 21:54:39] [INFO ] Deduced a trap composed of 164 places in 165 ms of which 3 ms to minimize.
[2025-06-02 21:54:39] [INFO ] Deduced a trap composed of 162 places in 183 ms of which 2 ms to minimize.
[2025-06-02 21:54:39] [INFO ] Deduced a trap composed of 162 places in 166 ms of which 3 ms to minimize.
[2025-06-02 21:54:39] [INFO ] Deduced a trap composed of 162 places in 164 ms of which 2 ms to minimize.
[2025-06-02 21:54:40] [INFO ] Deduced a trap composed of 160 places in 165 ms of which 2 ms to minimize.
[2025-06-02 21:54:40] [INFO ] Deduced a trap composed of 166 places in 167 ms of which 2 ms to minimize.
[2025-06-02 21:54:40] [INFO ] Deduced a trap composed of 160 places in 169 ms of which 3 ms to minimize.
[2025-06-02 21:54:40] [INFO ] Deduced a trap composed of 166 places in 174 ms of which 2 ms to minimize.
[2025-06-02 21:54:40] [INFO ] Deduced a trap composed of 166 places in 179 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/408 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 21:54:40] [INFO ] Deduced a trap composed of 174 places in 175 ms of which 3 ms to minimize.
[2025-06-02 21:54:41] [INFO ] Deduced a trap composed of 166 places in 191 ms of which 3 ms to minimize.
[2025-06-02 21:54:41] [INFO ] Deduced a trap composed of 166 places in 178 ms of which 3 ms to minimize.
[2025-06-02 21:54:41] [INFO ] Deduced a trap composed of 166 places in 178 ms of which 2 ms to minimize.
[2025-06-02 21:54:41] [INFO ] Deduced a trap composed of 166 places in 190 ms of which 2 ms to minimize.
[2025-06-02 21:54:41] [INFO ] Deduced a trap composed of 162 places in 196 ms of which 2 ms to minimize.
[2025-06-02 21:54:42] [INFO ] Deduced a trap composed of 166 places in 192 ms of which 3 ms to minimize.
[2025-06-02 21:54:42] [INFO ] Deduced a trap composed of 162 places in 191 ms of which 2 ms to minimize.
[2025-06-02 21:54:42] [INFO ] Deduced a trap composed of 156 places in 179 ms of which 4 ms to minimize.
[2025-06-02 21:54:42] [INFO ] Deduced a trap composed of 164 places in 184 ms of which 3 ms to minimize.
[2025-06-02 21:54:42] [INFO ] Deduced a trap composed of 164 places in 181 ms of which 2 ms to minimize.
[2025-06-02 21:54:43] [INFO ] Deduced a trap composed of 166 places in 175 ms of which 3 ms to minimize.
[2025-06-02 21:54:43] [INFO ] Deduced a trap composed of 161 places in 183 ms of which 2 ms to minimize.
[2025-06-02 21:54:43] [INFO ] Deduced a trap composed of 160 places in 189 ms of which 2 ms to minimize.
[2025-06-02 21:54:43] [INFO ] Deduced a trap composed of 164 places in 190 ms of which 2 ms to minimize.
[2025-06-02 21:54:43] [INFO ] Deduced a trap composed of 166 places in 196 ms of which 3 ms to minimize.
[2025-06-02 21:54:44] [INFO ] Deduced a trap composed of 166 places in 194 ms of which 3 ms to minimize.
[2025-06-02 21:54:44] [INFO ] Deduced a trap composed of 164 places in 184 ms of which 2 ms to minimize.
[2025-06-02 21:54:44] [INFO ] Deduced a trap composed of 168 places in 177 ms of which 2 ms to minimize.
[2025-06-02 21:54:44] [INFO ] Deduced a trap composed of 164 places in 167 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/408 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 21:54:44] [INFO ] Deduced a trap composed of 164 places in 168 ms of which 2 ms to minimize.
[2025-06-02 21:54:45] [INFO ] Deduced a trap composed of 158 places in 188 ms of which 2 ms to minimize.
[2025-06-02 21:54:45] [INFO ] Deduced a trap composed of 166 places in 189 ms of which 2 ms to minimize.
[2025-06-02 21:54:45] [INFO ] Deduced a trap composed of 168 places in 169 ms of which 2 ms to minimize.
[2025-06-02 21:54:45] [INFO ] Deduced a trap composed of 170 places in 198 ms of which 2 ms to minimize.
[2025-06-02 21:54:45] [INFO ] Deduced a trap composed of 162 places in 178 ms of which 3 ms to minimize.
[2025-06-02 21:54:46] [INFO ] Deduced a trap composed of 158 places in 186 ms of which 2 ms to minimize.
[2025-06-02 21:54:46] [INFO ] Deduced a trap composed of 166 places in 196 ms of which 3 ms to minimize.
[2025-06-02 21:54:47] [INFO ] Deduced a trap composed of 160 places in 194 ms of which 3 ms to minimize.
[2025-06-02 21:54:47] [INFO ] Deduced a trap composed of 162 places in 185 ms of which 2 ms to minimize.
[2025-06-02 21:54:47] [INFO ] Deduced a trap composed of 162 places in 183 ms of which 2 ms to minimize.
[2025-06-02 21:54:47] [INFO ] Deduced a trap composed of 166 places in 173 ms of which 2 ms to minimize.
[2025-06-02 21:54:47] [INFO ] Deduced a trap composed of 162 places in 180 ms of which 3 ms to minimize.
[2025-06-02 21:54:48] [INFO ] Deduced a trap composed of 166 places in 198 ms of which 3 ms to minimize.
[2025-06-02 21:54:49] [INFO ] Deduced a trap composed of 166 places in 186 ms of which 3 ms to minimize.
[2025-06-02 21:54:49] [INFO ] Deduced a trap composed of 166 places in 187 ms of which 3 ms to minimize.
[2025-06-02 21:54:49] [INFO ] Deduced a trap composed of 166 places in 183 ms of which 2 ms to minimize.
[2025-06-02 21:54:49] [INFO ] Deduced a trap composed of 166 places in 198 ms of which 3 ms to minimize.
[2025-06-02 21:54:49] [INFO ] Deduced a trap composed of 166 places in 209 ms of which 2 ms to minimize.
[2025-06-02 21:54:50] [INFO ] Deduced a trap composed of 166 places in 198 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/408 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 21:54:50] [INFO ] Deduced a trap composed of 164 places in 209 ms of which 3 ms to minimize.
[2025-06-02 21:54:50] [INFO ] Deduced a trap composed of 168 places in 192 ms of which 3 ms to minimize.
[2025-06-02 21:54:50] [INFO ] Deduced a trap composed of 172 places in 202 ms of which 2 ms to minimize.
[2025-06-02 21:54:51] [INFO ] Deduced a trap composed of 162 places in 194 ms of which 3 ms to minimize.
[2025-06-02 21:54:51] [INFO ] Deduced a trap composed of 168 places in 201 ms of which 3 ms to minimize.
[2025-06-02 21:54:51] [INFO ] Deduced a trap composed of 162 places in 190 ms of which 2 ms to minimize.
[2025-06-02 21:54:51] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 3 ms to minimize.
[2025-06-02 21:54:51] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 3 ms to minimize.
[2025-06-02 21:54:52] [INFO ] Deduced a trap composed of 166 places in 187 ms of which 2 ms to minimize.
[2025-06-02 21:54:52] [INFO ] Deduced a trap composed of 162 places in 193 ms of which 4 ms to minimize.
[2025-06-02 21:54:52] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 6 ms to minimize.
[2025-06-02 21:54:52] [INFO ] Deduced a trap composed of 168 places in 192 ms of which 3 ms to minimize.
[2025-06-02 21:54:53] [INFO ] Deduced a trap composed of 172 places in 206 ms of which 3 ms to minimize.
[2025-06-02 21:54:53] [INFO ] Deduced a trap composed of 164 places in 203 ms of which 2 ms to minimize.
[2025-06-02 21:54:53] [INFO ] Deduced a trap composed of 162 places in 198 ms of which 3 ms to minimize.
[2025-06-02 21:54:53] [INFO ] Deduced a trap composed of 160 places in 190 ms of which 3 ms to minimize.
[2025-06-02 21:54:54] [INFO ] Deduced a trap composed of 164 places in 193 ms of which 3 ms to minimize.
[2025-06-02 21:54:54] [INFO ] Deduced a trap composed of 162 places in 195 ms of which 2 ms to minimize.
[2025-06-02 21:54:54] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 3 ms to minimize.
[2025-06-02 21:54:54] [INFO ] Deduced a trap composed of 168 places in 197 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/408 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 21:54:55] [INFO ] Deduced a trap composed of 164 places in 195 ms of which 3 ms to minimize.
[2025-06-02 21:54:55] [INFO ] Deduced a trap composed of 168 places in 202 ms of which 2 ms to minimize.
[2025-06-02 21:54:55] [INFO ] Deduced a trap composed of 166 places in 191 ms of which 2 ms to minimize.
[2025-06-02 21:54:56] [INFO ] Deduced a trap composed of 164 places in 188 ms of which 2 ms to minimize.
[2025-06-02 21:54:56] [INFO ] Deduced a trap composed of 158 places in 190 ms of which 2 ms to minimize.
[2025-06-02 21:54:56] [INFO ] Deduced a trap composed of 164 places in 184 ms of which 3 ms to minimize.
[2025-06-02 21:54:56] [INFO ] Deduced a trap composed of 160 places in 189 ms of which 3 ms to minimize.
[2025-06-02 21:54:56] [INFO ] Deduced a trap composed of 172 places in 185 ms of which 3 ms to minimize.
[2025-06-02 21:54:57] [INFO ] Deduced a trap composed of 160 places in 200 ms of which 3 ms to minimize.
[2025-06-02 21:54:57] [INFO ] Deduced a trap composed of 158 places in 196 ms of which 2 ms to minimize.
[2025-06-02 21:54:57] [INFO ] Deduced a trap composed of 162 places in 191 ms of which 2 ms to minimize.
[2025-06-02 21:54:57] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 2 ms to minimize.
[2025-06-02 21:54:58] [INFO ] Deduced a trap composed of 164 places in 199 ms of which 3 ms to minimize.
[2025-06-02 21:54:58] [INFO ] Deduced a trap composed of 164 places in 199 ms of which 3 ms to minimize.
[2025-06-02 21:54:58] [INFO ] Deduced a trap composed of 164 places in 198 ms of which 3 ms to minimize.
[2025-06-02 21:54:58] [INFO ] Deduced a trap composed of 168 places in 195 ms of which 2 ms to minimize.
[2025-06-02 21:54:58] [INFO ] Deduced a trap composed of 176 places in 197 ms of which 2 ms to minimize.
[2025-06-02 21:54:59] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 3 ms to minimize.
[2025-06-02 21:54:59] [INFO ] Deduced a trap composed of 164 places in 190 ms of which 2 ms to minimize.
[2025-06-02 21:54:59] [INFO ] Deduced a trap composed of 172 places in 194 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/408 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 21:54:59] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 2 ms to minimize.
[2025-06-02 21:55:00] [INFO ] Deduced a trap composed of 162 places in 198 ms of which 3 ms to minimize.
[2025-06-02 21:55:00] [INFO ] Deduced a trap composed of 158 places in 204 ms of which 2 ms to minimize.
[2025-06-02 21:55:00] [INFO ] Deduced a trap composed of 160 places in 200 ms of which 3 ms to minimize.
[2025-06-02 21:55:00] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 3 ms to minimize.
[2025-06-02 21:55:01] [INFO ] Deduced a trap composed of 162 places in 204 ms of which 3 ms to minimize.
[2025-06-02 21:55:01] [INFO ] Deduced a trap composed of 166 places in 208 ms of which 3 ms to minimize.
[2025-06-02 21:55:01] [INFO ] Deduced a trap composed of 164 places in 196 ms of which 2 ms to minimize.
[2025-06-02 21:55:01] [INFO ] Deduced a trap composed of 162 places in 198 ms of which 2 ms to minimize.
[2025-06-02 21:55:01] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 2 ms to minimize.
[2025-06-02 21:55:02] [INFO ] Deduced a trap composed of 166 places in 203 ms of which 2 ms to minimize.
[2025-06-02 21:55:02] [INFO ] Deduced a trap composed of 170 places in 200 ms of which 3 ms to minimize.
[2025-06-02 21:55:02] [INFO ] Deduced a trap composed of 162 places in 204 ms of which 3 ms to minimize.
[2025-06-02 21:55:02] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 3 ms to minimize.
[2025-06-02 21:55:03] [INFO ] Deduced a trap composed of 158 places in 200 ms of which 3 ms to minimize.
[2025-06-02 21:55:03] [INFO ] Deduced a trap composed of 166 places in 204 ms of which 3 ms to minimize.
[2025-06-02 21:55:03] [INFO ] Deduced a trap composed of 162 places in 203 ms of which 2 ms to minimize.
[2025-06-02 21:55:04] [INFO ] Deduced a trap composed of 160 places in 202 ms of which 3 ms to minimize.
[2025-06-02 21:55:04] [INFO ] Deduced a trap composed of 160 places in 193 ms of which 3 ms to minimize.
[2025-06-02 21:55:04] [INFO ] Deduced a trap composed of 160 places in 192 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/408 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 21:55:04] [INFO ] Deduced a trap composed of 178 places in 184 ms of which 3 ms to minimize.
[2025-06-02 21:55:04] [INFO ] Deduced a trap composed of 158 places in 197 ms of which 2 ms to minimize.
[2025-06-02 21:55:05] [INFO ] Deduced a trap composed of 164 places in 198 ms of which 2 ms to minimize.
[2025-06-02 21:55:05] [INFO ] Deduced a trap composed of 164 places in 195 ms of which 3 ms to minimize.
[2025-06-02 21:55:05] [INFO ] Deduced a trap composed of 168 places in 191 ms of which 3 ms to minimize.
[2025-06-02 21:55:05] [INFO ] Deduced a trap composed of 172 places in 194 ms of which 3 ms to minimize.
[2025-06-02 21:55:05] [INFO ] Deduced a trap composed of 174 places in 194 ms of which 3 ms to minimize.
[2025-06-02 21:55:06] [INFO ] Deduced a trap composed of 168 places in 190 ms of which 3 ms to minimize.
[2025-06-02 21:55:06] [INFO ] Deduced a trap composed of 166 places in 192 ms of which 2 ms to minimize.
[2025-06-02 21:55:06] [INFO ] Deduced a trap composed of 162 places in 181 ms of which 2 ms to minimize.
[2025-06-02 21:55:06] [INFO ] Deduced a trap composed of 170 places in 192 ms of which 3 ms to minimize.
[2025-06-02 21:55:06] [INFO ] Deduced a trap composed of 170 places in 191 ms of which 2 ms to minimize.
[2025-06-02 21:55:07] [INFO ] Deduced a trap composed of 166 places in 185 ms of which 2 ms to minimize.
[2025-06-02 21:55:07] [INFO ] Deduced a trap composed of 164 places in 178 ms of which 3 ms to minimize.
[2025-06-02 21:55:07] [INFO ] Deduced a trap composed of 156 places in 189 ms of which 2 ms to minimize.
[2025-06-02 21:55:07] [INFO ] Deduced a trap composed of 168 places in 187 ms of which 3 ms to minimize.
[2025-06-02 21:55:08] [INFO ] Deduced a trap composed of 172 places in 197 ms of which 2 ms to minimize.
[2025-06-02 21:55:08] [INFO ] Deduced a trap composed of 168 places in 192 ms of which 3 ms to minimize.
[2025-06-02 21:55:08] [INFO ] Deduced a trap composed of 168 places in 191 ms of which 2 ms to minimize.
[2025-06-02 21:55:08] [INFO ] Deduced a trap composed of 164 places in 199 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/408 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 21:55:09] [INFO ] Deduced a trap composed of 170 places in 204 ms of which 2 ms to minimize.
[2025-06-02 21:55:09] [INFO ] Deduced a trap composed of 164 places in 198 ms of which 2 ms to minimize.
[2025-06-02 21:55:09] [INFO ] Deduced a trap composed of 164 places in 194 ms of which 3 ms to minimize.
[2025-06-02 21:55:09] [INFO ] Deduced a trap composed of 164 places in 198 ms of which 2 ms to minimize.
[2025-06-02 21:55:10] [INFO ] Deduced a trap composed of 158 places in 201 ms of which 3 ms to minimize.
[2025-06-02 21:55:10] [INFO ] Deduced a trap composed of 166 places in 195 ms of which 2 ms to minimize.
[2025-06-02 21:55:10] [INFO ] Deduced a trap composed of 158 places in 192 ms of which 2 ms to minimize.
[2025-06-02 21:55:10] [INFO ] Deduced a trap composed of 162 places in 191 ms of which 2 ms to minimize.
[2025-06-02 21:55:11] [INFO ] Deduced a trap composed of 168 places in 206 ms of which 3 ms to minimize.
[2025-06-02 21:55:11] [INFO ] Deduced a trap composed of 166 places in 198 ms of which 3 ms to minimize.
[2025-06-02 21:55:11] [INFO ] Deduced a trap composed of 166 places in 208 ms of which 2 ms to minimize.
[2025-06-02 21:55:12] [INFO ] Deduced a trap composed of 168 places in 204 ms of which 2 ms to minimize.
[2025-06-02 21:55:12] [INFO ] Deduced a trap composed of 164 places in 217 ms of which 3 ms to minimize.
[2025-06-02 21:55:12] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 2 ms to minimize.
[2025-06-02 21:55:12] [INFO ] Deduced a trap composed of 166 places in 183 ms of which 2 ms to minimize.
[2025-06-02 21:55:12] [INFO ] Deduced a trap composed of 160 places in 192 ms of which 2 ms to minimize.
[2025-06-02 21:55:13] [INFO ] Deduced a trap composed of 154 places in 206 ms of which 3 ms to minimize.
[2025-06-02 21:55:13] [INFO ] Deduced a trap composed of 160 places in 201 ms of which 2 ms to minimize.
[2025-06-02 21:55:13] [INFO ] Deduced a trap composed of 164 places in 207 ms of which 3 ms to minimize.
[2025-06-02 21:55:13] [INFO ] Deduced a trap composed of 162 places in 202 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/408 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 21:55:14] [INFO ] Deduced a trap composed of 168 places in 213 ms of which 2 ms to minimize.
[2025-06-02 21:55:14] [INFO ] Deduced a trap composed of 162 places in 209 ms of which 2 ms to minimize.
[2025-06-02 21:55:15] [INFO ] Deduced a trap composed of 164 places in 216 ms of which 2 ms to minimize.
[2025-06-02 21:55:15] [INFO ] Deduced a trap composed of 168 places in 195 ms of which 3 ms to minimize.
[2025-06-02 21:55:15] [INFO ] Deduced a trap composed of 166 places in 211 ms of which 2 ms to minimize.
[2025-06-02 21:55:15] [INFO ] Deduced a trap composed of 160 places in 210 ms of which 2 ms to minimize.
[2025-06-02 21:55:16] [INFO ] Deduced a trap composed of 166 places in 206 ms of which 3 ms to minimize.
[2025-06-02 21:55:16] [INFO ] Deduced a trap composed of 170 places in 220 ms of which 2 ms to minimize.
[2025-06-02 21:55:16] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 3 ms to minimize.
[2025-06-02 21:55:16] [INFO ] Deduced a trap composed of 172 places in 208 ms of which 2 ms to minimize.
[2025-06-02 21:55:17] [INFO ] Deduced a trap composed of 166 places in 226 ms of which 5 ms to minimize.
[2025-06-02 21:55:17] [INFO ] Deduced a trap composed of 162 places in 218 ms of which 2 ms to minimize.
[2025-06-02 21:55:17] [INFO ] Deduced a trap composed of 166 places in 197 ms of which 3 ms to minimize.
[2025-06-02 21:55:17] [INFO ] Deduced a trap composed of 168 places in 218 ms of which 3 ms to minimize.
[2025-06-02 21:55:17] [INFO ] Deduced a trap composed of 160 places in 205 ms of which 3 ms to minimize.
[2025-06-02 21:55:18] [INFO ] Deduced a trap composed of 158 places in 206 ms of which 3 ms to minimize.
[2025-06-02 21:55:18] [INFO ] Deduced a trap composed of 166 places in 200 ms of which 3 ms to minimize.
[2025-06-02 21:55:18] [INFO ] Deduced a trap composed of 166 places in 205 ms of which 3 ms to minimize.
[2025-06-02 21:55:18] [INFO ] Deduced a trap composed of 160 places in 218 ms of which 3 ms to minimize.
[2025-06-02 21:55:19] [INFO ] Deduced a trap composed of 166 places in 216 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/408 variables, 20/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 21:55:19] [INFO ] Deduced a trap composed of 162 places in 214 ms of which 3 ms to minimize.
[2025-06-02 21:55:19] [INFO ] Deduced a trap composed of 160 places in 220 ms of which 3 ms to minimize.
[2025-06-02 21:55:19] [INFO ] Deduced a trap composed of 168 places in 205 ms of which 3 ms to minimize.
[2025-06-02 21:55:19] [INFO ] Deduced a trap composed of 162 places in 210 ms of which 3 ms to minimize.
[2025-06-02 21:55:20] [INFO ] Deduced a trap composed of 166 places in 197 ms of which 2 ms to minimize.
[2025-06-02 21:55:20] [INFO ] Deduced a trap composed of 168 places in 190 ms of which 2 ms to minimize.
[2025-06-02 21:55:20] [INFO ] Deduced a trap composed of 166 places in 192 ms of which 2 ms to minimize.
[2025-06-02 21:55:20] [INFO ] Deduced a trap composed of 166 places in 191 ms of which 2 ms to minimize.
[2025-06-02 21:55:21] [INFO ] Deduced a trap composed of 164 places in 213 ms of which 2 ms to minimize.
[2025-06-02 21:55:21] [INFO ] Deduced a trap composed of 170 places in 207 ms of which 2 ms to minimize.
[2025-06-02 21:55:21] [INFO ] Deduced a trap composed of 162 places in 189 ms of which 2 ms to minimize.
[2025-06-02 21:55:22] [INFO ] Deduced a trap composed of 162 places in 208 ms of which 2 ms to minimize.
[2025-06-02 21:55:22] [INFO ] Deduced a trap composed of 160 places in 205 ms of which 2 ms to minimize.
[2025-06-02 21:55:23] [INFO ] Deduced a trap composed of 170 places in 208 ms of which 2 ms to minimize.
[2025-06-02 21:55:23] [INFO ] Deduced a trap composed of 172 places in 205 ms of which 2 ms to minimize.
[2025-06-02 21:55:24] [INFO ] Deduced a trap composed of 158 places in 210 ms of which 2 ms to minimize.
[2025-06-02 21:55:24] [INFO ] Deduced a trap composed of 160 places in 195 ms of which 2 ms to minimize.
[2025-06-02 21:55:24] [INFO ] Deduced a trap composed of 156 places in 200 ms of which 2 ms to minimize.
[2025-06-02 21:55:25] [INFO ] Deduced a trap composed of 158 places in 212 ms of which 2 ms to minimize.
[2025-06-02 21:55:25] [INFO ] Deduced a trap composed of 170 places in 203 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/408 variables, 20/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 21:55:25] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 2 ms to minimize.
[2025-06-02 21:55:26] [INFO ] Deduced a trap composed of 160 places in 200 ms of which 3 ms to minimize.
[2025-06-02 21:55:26] [INFO ] Deduced a trap composed of 160 places in 195 ms of which 2 ms to minimize.
[2025-06-02 21:55:26] [INFO ] Deduced a trap composed of 158 places in 197 ms of which 4 ms to minimize.
[2025-06-02 21:55:26] [INFO ] Deduced a trap composed of 160 places in 198 ms of which 2 ms to minimize.
[2025-06-02 21:55:26] [INFO ] Deduced a trap composed of 160 places in 192 ms of which 3 ms to minimize.
[2025-06-02 21:55:27] [INFO ] Deduced a trap composed of 164 places in 191 ms of which 3 ms to minimize.
[2025-06-02 21:55:27] [INFO ] Deduced a trap composed of 167 places in 219 ms of which 3 ms to minimize.
[2025-06-02 21:55:27] [INFO ] Deduced a trap composed of 166 places in 196 ms of which 3 ms to minimize.
[2025-06-02 21:55:27] [INFO ] Deduced a trap composed of 166 places in 198 ms of which 2 ms to minimize.
[2025-06-02 21:55:27] [INFO ] Deduced a trap composed of 164 places in 189 ms of which 2 ms to minimize.
[2025-06-02 21:55:28] [INFO ] Deduced a trap composed of 158 places in 192 ms of which 3 ms to minimize.
[2025-06-02 21:55:28] [INFO ] Deduced a trap composed of 166 places in 216 ms of which 3 ms to minimize.
[2025-06-02 21:55:28] [INFO ] Deduced a trap composed of 166 places in 203 ms of which 3 ms to minimize.
[2025-06-02 21:55:29] [INFO ] Deduced a trap composed of 164 places in 203 ms of which 2 ms to minimize.
[2025-06-02 21:55:29] [INFO ] Deduced a trap composed of 156 places in 219 ms of which 2 ms to minimize.
[2025-06-02 21:55:29] [INFO ] Deduced a trap composed of 154 places in 225 ms of which 2 ms to minimize.
[2025-06-02 21:55:29] [INFO ] Deduced a trap composed of 158 places in 217 ms of which 3 ms to minimize.
[2025-06-02 21:55:30] [INFO ] Deduced a trap composed of 165 places in 218 ms of which 2 ms to minimize.
[2025-06-02 21:55:30] [INFO ] Deduced a trap composed of 168 places in 209 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/408 variables, 20/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 21:55:30] [INFO ] Deduced a trap composed of 166 places in 213 ms of which 4 ms to minimize.
[2025-06-02 21:55:30] [INFO ] Deduced a trap composed of 170 places in 216 ms of which 3 ms to minimize.
[2025-06-02 21:55:31] [INFO ] Deduced a trap composed of 164 places in 222 ms of which 2 ms to minimize.
[2025-06-02 21:55:31] [INFO ] Deduced a trap composed of 160 places in 208 ms of which 2 ms to minimize.
[2025-06-02 21:55:32] [INFO ] Deduced a trap composed of 162 places in 208 ms of which 3 ms to minimize.
[2025-06-02 21:55:36] [INFO ] Deduced a trap composed of 156 places in 214 ms of which 2 ms to minimize.
[2025-06-02 21:55:36] [INFO ] Deduced a trap composed of 154 places in 205 ms of which 3 ms to minimize.
[2025-06-02 21:55:37] [INFO ] Deduced a trap composed of 162 places in 198 ms of which 6 ms to minimize.
[2025-06-02 21:55:37] [INFO ] Deduced a trap composed of 168 places in 202 ms of which 2 ms to minimize.
[2025-06-02 21:55:39] [INFO ] Deduced a trap composed of 164 places in 219 ms of which 2 ms to minimize.
[2025-06-02 21:55:39] [INFO ] Deduced a trap composed of 162 places in 211 ms of which 2 ms to minimize.
[2025-06-02 21:55:39] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 2 ms to minimize.
[2025-06-02 21:55:39] [INFO ] Deduced a trap composed of 162 places in 211 ms of which 2 ms to minimize.
[2025-06-02 21:55:40] [INFO ] Deduced a trap composed of 164 places in 215 ms of which 2 ms to minimize.
[2025-06-02 21:55:40] [INFO ] Deduced a trap composed of 152 places in 204 ms of which 2 ms to minimize.
[2025-06-02 21:55:41] [INFO ] Deduced a trap composed of 166 places in 214 ms of which 2 ms to minimize.
[2025-06-02 21:55:45] [INFO ] Deduced a trap composed of 170 places in 211 ms of which 3 ms to minimize.
[2025-06-02 21:55:47] [INFO ] Deduced a trap composed of 164 places in 220 ms of which 3 ms to minimize.
[2025-06-02 21:55:48] [INFO ] Deduced a trap composed of 156 places in 230 ms of which 3 ms to minimize.
[2025-06-02 21:55:48] [INFO ] Deduced a trap composed of 162 places in 226 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/408 variables, 20/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 21:55:48] [INFO ] Deduced a trap composed of 162 places in 217 ms of which 2 ms to minimize.
[2025-06-02 21:55:49] [INFO ] Deduced a trap composed of 170 places in 214 ms of which 3 ms to minimize.
[2025-06-02 21:55:49] [INFO ] Deduced a trap composed of 158 places in 210 ms of which 2 ms to minimize.
[2025-06-02 21:55:49] [INFO ] Deduced a trap composed of 156 places in 216 ms of which 2 ms to minimize.
[2025-06-02 21:55:49] [INFO ] Deduced a trap composed of 162 places in 216 ms of which 3 ms to minimize.
[2025-06-02 21:55:50] [INFO ] Deduced a trap composed of 164 places in 220 ms of which 3 ms to minimize.
[2025-06-02 21:55:50] [INFO ] Deduced a trap composed of 162 places in 226 ms of which 2 ms to minimize.
[2025-06-02 21:55:53] [INFO ] Deduced a trap composed of 164 places in 223 ms of which 2 ms to minimize.
[2025-06-02 21:55:53] [INFO ] Deduced a trap composed of 166 places in 215 ms of which 2 ms to minimize.
[2025-06-02 21:55:54] [INFO ] Deduced a trap composed of 164 places in 218 ms of which 3 ms to minimize.
[2025-06-02 21:55:54] [INFO ] Deduced a trap composed of 162 places in 212 ms of which 3 ms to minimize.
[2025-06-02 21:55:54] [INFO ] Deduced a trap composed of 156 places in 212 ms of which 3 ms to minimize.
[2025-06-02 21:55:54] [INFO ] Deduced a trap composed of 160 places in 217 ms of which 2 ms to minimize.
[2025-06-02 21:55:55] [INFO ] Deduced a trap composed of 164 places in 216 ms of which 2 ms to minimize.
[2025-06-02 21:55:55] [INFO ] Deduced a trap composed of 162 places in 196 ms of which 3 ms to minimize.
[2025-06-02 21:55:55] [INFO ] Deduced a trap composed of 166 places in 216 ms of which 2 ms to minimize.
[2025-06-02 21:55:55] [INFO ] Deduced a trap composed of 160 places in 216 ms of which 2 ms to minimize.
[2025-06-02 21:55:56] [INFO ] Deduced a trap composed of 164 places in 216 ms of which 2 ms to minimize.
[2025-06-02 21:55:56] [INFO ] Deduced a trap composed of 162 places in 207 ms of which 3 ms to minimize.
[2025-06-02 21:55:56] [INFO ] Deduced a trap composed of 164 places in 218 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/408 variables, 20/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 21:55:56] [INFO ] Deduced a trap composed of 164 places in 215 ms of which 2 ms to minimize.
[2025-06-02 21:55:57] [INFO ] Deduced a trap composed of 156 places in 211 ms of which 3 ms to minimize.
[2025-06-02 21:55:57] [INFO ] Deduced a trap composed of 160 places in 235 ms of which 3 ms to minimize.
[2025-06-02 21:55:57] [INFO ] Deduced a trap composed of 164 places in 227 ms of which 2 ms to minimize.
[2025-06-02 21:55:57] [INFO ] Deduced a trap composed of 172 places in 222 ms of which 3 ms to minimize.
[2025-06-02 21:55:58] [INFO ] Deduced a trap composed of 166 places in 230 ms of which 3 ms to minimize.
[2025-06-02 21:55:58] [INFO ] Deduced a trap composed of 168 places in 223 ms of which 2 ms to minimize.
[2025-06-02 21:55:58] [INFO ] Deduced a trap composed of 162 places in 229 ms of which 2 ms to minimize.
[2025-06-02 21:55:58] [INFO ] Deduced a trap composed of 164 places in 227 ms of which 2 ms to minimize.
[2025-06-02 21:55:59] [INFO ] Deduced a trap composed of 166 places in 220 ms of which 3 ms to minimize.
[2025-06-02 21:55:59] [INFO ] Deduced a trap composed of 162 places in 231 ms of which 3 ms to minimize.
[2025-06-02 21:55:59] [INFO ] Deduced a trap composed of 170 places in 227 ms of which 3 ms to minimize.
[2025-06-02 21:55:59] [INFO ] Deduced a trap composed of 168 places in 224 ms of which 2 ms to minimize.
[2025-06-02 21:55:59] [INFO ] Deduced a trap composed of 166 places in 215 ms of which 2 ms to minimize.
[2025-06-02 21:56:00] [INFO ] Deduced a trap composed of 162 places in 217 ms of which 3 ms to minimize.
[2025-06-02 21:56:00] [INFO ] Deduced a trap composed of 166 places in 208 ms of which 3 ms to minimize.
[2025-06-02 21:56:00] [INFO ] Deduced a trap composed of 158 places in 218 ms of which 2 ms to minimize.
[2025-06-02 21:56:00] [INFO ] Deduced a trap composed of 168 places in 213 ms of which 3 ms to minimize.
[2025-06-02 21:56:01] [INFO ] Deduced a trap composed of 158 places in 221 ms of which 2 ms to minimize.
[2025-06-02 21:56:01] [INFO ] Deduced a trap composed of 166 places in 216 ms of which 3 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/408 variables, 20/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 21:56:01] [INFO ] Deduced a trap composed of 160 places in 215 ms of which 3 ms to minimize.
[2025-06-02 21:56:02] [INFO ] Deduced a trap composed of 166 places in 217 ms of which 2 ms to minimize.
[2025-06-02 21:56:02] [INFO ] Deduced a trap composed of 162 places in 218 ms of which 3 ms to minimize.
[2025-06-02 21:56:02] [INFO ] Deduced a trap composed of 158 places in 219 ms of which 3 ms to minimize.
[2025-06-02 21:56:02] [INFO ] Deduced a trap composed of 156 places in 218 ms of which 3 ms to minimize.
SMT process timed out in 90569ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 22 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 410/410 places, 981/981 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 25 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2025-06-02 21:56:02] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2025-06-02 21:56:02] [INFO ] Invariant cache hit.
[2025-06-02 21:56:03] [INFO ] Implicit Places using invariants in 353 ms returned []
[2025-06-02 21:56:03] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2025-06-02 21:56:03] [INFO ] Invariant cache hit.
[2025-06-02 21:56:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:56:04] [INFO ] Implicit Places using invariants and state equation in 1613 ms returned []
Implicit Place search using SMT with State Equation took 1968 ms to find 0 implicit places.
[2025-06-02 21:56:04] [INFO ] Redundant transitions in 44 ms returned []
Running 970 sub problems to find dead transitions.
[2025-06-02 21:56:04] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2025-06-02 21:56:04] [INFO ] Invariant cache hit.
[2025-06-02 21:56:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 970 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2025-06-02 21:56:15] [INFO ] Deduced a trap composed of 117 places in 153 ms of which 3 ms to minimize.
[2025-06-02 21:56:15] [INFO ] Deduced a trap composed of 165 places in 159 ms of which 2 ms to minimize.
[2025-06-02 21:56:15] [INFO ] Deduced a trap composed of 131 places in 152 ms of which 2 ms to minimize.
[2025-06-02 21:56:15] [INFO ] Deduced a trap composed of 131 places in 154 ms of which 3 ms to minimize.
[2025-06-02 21:56:16] [INFO ] Deduced a trap composed of 127 places in 152 ms of which 3 ms to minimize.
[2025-06-02 21:56:16] [INFO ] Deduced a trap composed of 127 places in 154 ms of which 3 ms to minimize.
[2025-06-02 21:56:16] [INFO ] Deduced a trap composed of 137 places in 154 ms of which 3 ms to minimize.
[2025-06-02 21:56:16] [INFO ] Deduced a trap composed of 127 places in 154 ms of which 2 ms to minimize.
[2025-06-02 21:56:16] [INFO ] Deduced a trap composed of 127 places in 148 ms of which 3 ms to minimize.
[2025-06-02 21:56:16] [INFO ] Deduced a trap composed of 127 places in 150 ms of which 2 ms to minimize.
[2025-06-02 21:56:17] [INFO ] Deduced a trap composed of 127 places in 151 ms of which 3 ms to minimize.
[2025-06-02 21:56:17] [INFO ] Deduced a trap composed of 166 places in 158 ms of which 2 ms to minimize.
[2025-06-02 21:56:17] [INFO ] Deduced a trap composed of 122 places in 157 ms of which 2 ms to minimize.
[2025-06-02 21:56:17] [INFO ] Deduced a trap composed of 127 places in 153 ms of which 3 ms to minimize.
[2025-06-02 21:56:17] [INFO ] Deduced a trap composed of 122 places in 150 ms of which 3 ms to minimize.
[2025-06-02 21:56:17] [INFO ] Deduced a trap composed of 116 places in 159 ms of which 3 ms to minimize.
[2025-06-02 21:56:18] [INFO ] Deduced a trap composed of 116 places in 156 ms of which 3 ms to minimize.
[2025-06-02 21:56:18] [INFO ] Deduced a trap composed of 116 places in 157 ms of which 2 ms to minimize.
[2025-06-02 21:56:18] [INFO ] Deduced a trap composed of 116 places in 155 ms of which 3 ms to minimize.
[2025-06-02 21:56:18] [INFO ] Deduced a trap composed of 116 places in 156 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2025-06-02 21:56:19] [INFO ] Deduced a trap composed of 166 places in 148 ms of which 2 ms to minimize.
[2025-06-02 21:56:19] [INFO ] Deduced a trap composed of 168 places in 157 ms of which 2 ms to minimize.
[2025-06-02 21:56:19] [INFO ] Deduced a trap composed of 168 places in 150 ms of which 2 ms to minimize.
[2025-06-02 21:56:19] [INFO ] Deduced a trap composed of 168 places in 149 ms of which 3 ms to minimize.
[2025-06-02 21:56:19] [INFO ] Deduced a trap composed of 170 places in 143 ms of which 2 ms to minimize.
[2025-06-02 21:56:19] [INFO ] Deduced a trap composed of 170 places in 141 ms of which 5 ms to minimize.
[2025-06-02 21:56:20] [INFO ] Deduced a trap composed of 168 places in 157 ms of which 2 ms to minimize.
[2025-06-02 21:56:20] [INFO ] Deduced a trap composed of 170 places in 154 ms of which 2 ms to minimize.
[2025-06-02 21:56:20] [INFO ] Deduced a trap composed of 170 places in 155 ms of which 3 ms to minimize.
[2025-06-02 21:56:20] [INFO ] Deduced a trap composed of 164 places in 156 ms of which 2 ms to minimize.
[2025-06-02 21:56:20] [INFO ] Deduced a trap composed of 166 places in 158 ms of which 3 ms to minimize.
[2025-06-02 21:56:20] [INFO ] Deduced a trap composed of 168 places in 155 ms of which 3 ms to minimize.
[2025-06-02 21:56:21] [INFO ] Deduced a trap composed of 168 places in 153 ms of which 2 ms to minimize.
[2025-06-02 21:56:21] [INFO ] Deduced a trap composed of 168 places in 162 ms of which 2 ms to minimize.
[2025-06-02 21:56:21] [INFO ] Deduced a trap composed of 166 places in 154 ms of which 2 ms to minimize.
[2025-06-02 21:56:21] [INFO ] Deduced a trap composed of 166 places in 156 ms of which 2 ms to minimize.
[2025-06-02 21:56:21] [INFO ] Deduced a trap composed of 166 places in 151 ms of which 2 ms to minimize.
[2025-06-02 21:56:21] [INFO ] Deduced a trap composed of 166 places in 155 ms of which 3 ms to minimize.
[2025-06-02 21:56:22] [INFO ] Deduced a trap composed of 162 places in 163 ms of which 2 ms to minimize.
[2025-06-02 21:56:22] [INFO ] Deduced a trap composed of 164 places in 155 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2025-06-02 21:56:29] [INFO ] Deduced a trap composed of 166 places in 160 ms of which 3 ms to minimize.
[2025-06-02 21:56:29] [INFO ] Deduced a trap composed of 164 places in 159 ms of which 3 ms to minimize.
[2025-06-02 21:56:29] [INFO ] Deduced a trap composed of 136 places in 166 ms of which 2 ms to minimize.
[2025-06-02 21:56:29] [INFO ] Deduced a trap composed of 164 places in 157 ms of which 2 ms to minimize.
[2025-06-02 21:56:29] [INFO ] Deduced a trap composed of 166 places in 169 ms of which 3 ms to minimize.
[2025-06-02 21:56:29] [INFO ] Deduced a trap composed of 162 places in 154 ms of which 3 ms to minimize.
[2025-06-02 21:56:30] [INFO ] Deduced a trap composed of 164 places in 160 ms of which 3 ms to minimize.
[2025-06-02 21:56:30] [INFO ] Deduced a trap composed of 162 places in 163 ms of which 3 ms to minimize.
[2025-06-02 21:56:30] [INFO ] Deduced a trap composed of 166 places in 162 ms of which 3 ms to minimize.
[2025-06-02 21:56:30] [INFO ] Deduced a trap composed of 166 places in 163 ms of which 2 ms to minimize.
[2025-06-02 21:56:30] [INFO ] Deduced a trap composed of 164 places in 164 ms of which 3 ms to minimize.
[2025-06-02 21:56:30] [INFO ] Deduced a trap composed of 168 places in 157 ms of which 3 ms to minimize.
[2025-06-02 21:56:31] [INFO ] Deduced a trap composed of 166 places in 158 ms of which 3 ms to minimize.
[2025-06-02 21:56:31] [INFO ] Deduced a trap composed of 164 places in 165 ms of which 3 ms to minimize.
[2025-06-02 21:56:31] [INFO ] Deduced a trap composed of 116 places in 157 ms of which 2 ms to minimize.
[2025-06-02 21:56:31] [INFO ] Deduced a trap composed of 162 places in 157 ms of which 2 ms to minimize.
[2025-06-02 21:56:31] [INFO ] Deduced a trap composed of 162 places in 155 ms of which 3 ms to minimize.
[2025-06-02 21:56:32] [INFO ] Deduced a trap composed of 160 places in 159 ms of which 2 ms to minimize.
[2025-06-02 21:56:32] [INFO ] Deduced a trap composed of 121 places in 161 ms of which 2 ms to minimize.
[2025-06-02 21:56:32] [INFO ] Deduced a trap composed of 160 places in 157 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2025-06-02 21:56:34] [INFO ] Deduced a trap composed of 58 places in 164 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 400/1382 variables, and 113 constraints, problems are : Problem set: 0 solved, 970 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 46/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 970/970 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 970 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 970 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 970 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 61/113 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2025-06-02 21:56:40] [INFO ] Deduced a trap composed of 111 places in 160 ms of which 2 ms to minimize.
[2025-06-02 21:56:40] [INFO ] Deduced a trap composed of 171 places in 158 ms of which 2 ms to minimize.
[2025-06-02 21:56:40] [INFO ] Deduced a trap composed of 183 places in 148 ms of which 2 ms to minimize.
[2025-06-02 21:56:40] [INFO ] Deduced a trap composed of 123 places in 148 ms of which 3 ms to minimize.
[2025-06-02 21:56:41] [INFO ] Deduced a trap composed of 141 places in 147 ms of which 2 ms to minimize.
[2025-06-02 21:56:41] [INFO ] Deduced a trap composed of 171 places in 147 ms of which 3 ms to minimize.
[2025-06-02 21:56:41] [INFO ] Deduced a trap composed of 171 places in 145 ms of which 2 ms to minimize.
[2025-06-02 21:56:41] [INFO ] Deduced a trap composed of 174 places in 147 ms of which 3 ms to minimize.
[2025-06-02 21:56:41] [INFO ] Deduced a trap composed of 177 places in 149 ms of which 2 ms to minimize.
[2025-06-02 21:56:41] [INFO ] Deduced a trap composed of 174 places in 149 ms of which 3 ms to minimize.
[2025-06-02 21:56:42] [INFO ] Deduced a trap composed of 171 places in 147 ms of which 2 ms to minimize.
[2025-06-02 21:56:42] [INFO ] Deduced a trap composed of 162 places in 145 ms of which 3 ms to minimize.
[2025-06-02 21:56:42] [INFO ] Deduced a trap composed of 171 places in 166 ms of which 2 ms to minimize.
[2025-06-02 21:56:42] [INFO ] Deduced a trap composed of 174 places in 145 ms of which 3 ms to minimize.
[2025-06-02 21:56:42] [INFO ] Deduced a trap composed of 174 places in 232 ms of which 2 ms to minimize.
[2025-06-02 21:56:43] [INFO ] Deduced a trap composed of 174 places in 254 ms of which 3 ms to minimize.
[2025-06-02 21:56:43] [INFO ] Deduced a trap composed of 180 places in 231 ms of which 2 ms to minimize.
[2025-06-02 21:56:43] [INFO ] Deduced a trap composed of 180 places in 233 ms of which 2 ms to minimize.
[2025-06-02 21:56:44] [INFO ] Deduced a trap composed of 186 places in 230 ms of which 3 ms to minimize.
[2025-06-02 21:56:44] [INFO ] Deduced a trap composed of 174 places in 225 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 20/133 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2025-06-02 21:56:45] [INFO ] Deduced a trap composed of 18 places in 165 ms of which 1 ms to minimize.
[2025-06-02 21:56:46] [INFO ] Deduced a trap composed of 132 places in 257 ms of which 3 ms to minimize.
[2025-06-02 21:56:46] [INFO ] Deduced a trap composed of 116 places in 251 ms of which 2 ms to minimize.
[2025-06-02 21:56:47] [INFO ] Deduced a trap composed of 116 places in 250 ms of which 3 ms to minimize.
[2025-06-02 21:56:47] [INFO ] Deduced a trap composed of 116 places in 271 ms of which 3 ms to minimize.
[2025-06-02 21:56:47] [INFO ] Deduced a trap composed of 130 places in 253 ms of which 2 ms to minimize.
[2025-06-02 21:56:53] [INFO ] Deduced a trap composed of 171 places in 242 ms of which 2 ms to minimize.
[2025-06-02 21:56:53] [INFO ] Deduced a trap composed of 156 places in 238 ms of which 2 ms to minimize.
[2025-06-02 21:56:53] [INFO ] Deduced a trap composed of 162 places in 242 ms of which 3 ms to minimize.
[2025-06-02 21:56:53] [INFO ] Deduced a trap composed of 173 places in 223 ms of which 2 ms to minimize.
[2025-06-02 21:56:54] [INFO ] Deduced a trap composed of 162 places in 221 ms of which 3 ms to minimize.
[2025-06-02 21:56:54] [INFO ] Deduced a trap composed of 164 places in 225 ms of which 2 ms to minimize.
[2025-06-02 21:56:54] [INFO ] Deduced a trap composed of 162 places in 251 ms of which 3 ms to minimize.
[2025-06-02 21:56:55] [INFO ] Deduced a trap composed of 160 places in 233 ms of which 2 ms to minimize.
[2025-06-02 21:56:55] [INFO ] Deduced a trap composed of 164 places in 225 ms of which 2 ms to minimize.
[2025-06-02 21:56:55] [INFO ] Deduced a trap composed of 164 places in 247 ms of which 3 ms to minimize.
[2025-06-02 21:56:55] [INFO ] Deduced a trap composed of 164 places in 227 ms of which 3 ms to minimize.
[2025-06-02 21:56:56] [INFO ] Deduced a trap composed of 162 places in 224 ms of which 3 ms to minimize.
[2025-06-02 21:56:56] [INFO ] Deduced a trap composed of 162 places in 228 ms of which 3 ms to minimize.
[2025-06-02 21:56:56] [INFO ] Deduced a trap composed of 169 places in 231 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2025-06-02 21:57:06] [INFO ] Deduced a trap composed of 164 places in 166 ms of which 3 ms to minimize.
[2025-06-02 21:57:07] [INFO ] Deduced a trap composed of 168 places in 164 ms of which 2 ms to minimize.
[2025-06-02 21:57:07] [INFO ] Deduced a trap composed of 164 places in 182 ms of which 2 ms to minimize.
[2025-06-02 21:57:07] [INFO ] Deduced a trap composed of 164 places in 176 ms of which 2 ms to minimize.
[2025-06-02 21:57:07] [INFO ] Deduced a trap composed of 166 places in 173 ms of which 2 ms to minimize.
[2025-06-02 21:57:07] [INFO ] Deduced a trap composed of 162 places in 164 ms of which 3 ms to minimize.
[2025-06-02 21:57:08] [INFO ] Deduced a trap composed of 164 places in 175 ms of which 2 ms to minimize.
[2025-06-02 21:57:08] [INFO ] Deduced a trap composed of 162 places in 166 ms of which 3 ms to minimize.
[2025-06-02 21:57:08] [INFO ] Deduced a trap composed of 166 places in 169 ms of which 3 ms to minimize.
[2025-06-02 21:57:08] [INFO ] Deduced a trap composed of 162 places in 163 ms of which 2 ms to minimize.
[2025-06-02 21:57:08] [INFO ] Deduced a trap composed of 166 places in 163 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 400/1382 variables, and 164 constraints, problems are : Problem set: 0 solved, 970 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 46/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/970 constraints, Known Traps: 112/112 constraints]
After SMT, in 64226ms problems are : Problem set: 0 solved, 970 unsolved
Search for dead transitions found 0 dead transitions in 64241ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66293 ms. Remains : 410/410 places, 981/981 transitions.
RANDOM walk for 400000 steps (28944 resets) in 4703 ms. (85 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
[2025-06-02 21:57:10] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2025-06-02 21:57:10] [INFO ] Invariant cache hit.
[2025-06-02 21:57:10] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2025-06-02 21:57:10] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 16 ms returned sat
[2025-06-02 21:57:10] [INFO ] After 231ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-02 21:57:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:57:10] [INFO ] After 13ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-02 21:57:10] [INFO ] After 68ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-02 21:57:10] [INFO ] After 418ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-02 21:57:10] [INFO ] [Nat]Absence check using 55 positive place invariants in 11 ms returned sat
[2025-06-02 21:57:10] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 10 ms returned sat
[2025-06-02 21:57:11] [INFO ] After 231ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-02 21:57:11] [INFO ] After 54ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-02 21:57:11] [INFO ] Deduced a trap composed of 164 places in 245 ms of which 2 ms to minimize.
[2025-06-02 21:57:11] [INFO ] Deduced a trap composed of 162 places in 244 ms of which 3 ms to minimize.
[2025-06-02 21:57:11] [INFO ] Deduced a trap composed of 164 places in 240 ms of which 2 ms to minimize.
[2025-06-02 21:57:12] [INFO ] Deduced a trap composed of 156 places in 247 ms of which 2 ms to minimize.
[2025-06-02 21:57:12] [INFO ] Deduced a trap composed of 160 places in 227 ms of which 2 ms to minimize.
[2025-06-02 21:57:12] [INFO ] Deduced a trap composed of 158 places in 219 ms of which 2 ms to minimize.
[2025-06-02 21:57:13] [INFO ] Deduced a trap composed of 166 places in 245 ms of which 3 ms to minimize.
[2025-06-02 21:57:13] [INFO ] Deduced a trap composed of 154 places in 244 ms of which 2 ms to minimize.
[2025-06-02 21:57:13] [INFO ] Deduced a trap composed of 162 places in 238 ms of which 2 ms to minimize.
[2025-06-02 21:57:13] [INFO ] Deduced a trap composed of 158 places in 244 ms of which 3 ms to minimize.
[2025-06-02 21:57:14] [INFO ] Deduced a trap composed of 164 places in 238 ms of which 3 ms to minimize.
[2025-06-02 21:57:14] [INFO ] Deduced a trap composed of 156 places in 223 ms of which 2 ms to minimize.
[2025-06-02 21:57:14] [INFO ] Deduced a trap composed of 164 places in 225 ms of which 3 ms to minimize.
[2025-06-02 21:57:14] [INFO ] Deduced a trap composed of 158 places in 227 ms of which 2 ms to minimize.
[2025-06-02 21:57:15] [INFO ] Deduced a trap composed of 162 places in 229 ms of which 3 ms to minimize.
[2025-06-02 21:57:15] [INFO ] Deduced a trap composed of 166 places in 226 ms of which 3 ms to minimize.
[2025-06-02 21:57:15] [INFO ] Deduced a trap composed of 158 places in 247 ms of which 3 ms to minimize.
[2025-06-02 21:57:16] [INFO ] Deduced a trap composed of 162 places in 240 ms of which 2 ms to minimize.
[2025-06-02 21:57:16] [INFO ] Deduced a trap composed of 162 places in 239 ms of which 3 ms to minimize.
[2025-06-02 21:57:16] [INFO ] Deduced a trap composed of 162 places in 229 ms of which 2 ms to minimize.
[2025-06-02 21:57:16] [INFO ] Deduced a trap composed of 160 places in 223 ms of which 3 ms to minimize.
[2025-06-02 21:57:17] [INFO ] Deduced a trap composed of 162 places in 227 ms of which 3 ms to minimize.
[2025-06-02 21:57:17] [INFO ] Deduced a trap composed of 166 places in 228 ms of which 2 ms to minimize.
[2025-06-02 21:57:17] [INFO ] Deduced a trap composed of 169 places in 244 ms of which 2 ms to minimize.
[2025-06-02 21:57:18] [INFO ] Deduced a trap composed of 164 places in 246 ms of which 2 ms to minimize.
[2025-06-02 21:57:18] [INFO ] Deduced a trap composed of 164 places in 226 ms of which 3 ms to minimize.
[2025-06-02 21:57:18] [INFO ] Deduced a trap composed of 158 places in 251 ms of which 3 ms to minimize.
[2025-06-02 21:57:18] [INFO ] Deduced a trap composed of 156 places in 251 ms of which 2 ms to minimize.
[2025-06-02 21:57:19] [INFO ] Deduced a trap composed of 160 places in 253 ms of which 3 ms to minimize.
[2025-06-02 21:57:19] [INFO ] Deduced a trap composed of 164 places in 228 ms of which 2 ms to minimize.
[2025-06-02 21:57:19] [INFO ] Deduced a trap composed of 156 places in 227 ms of which 2 ms to minimize.
[2025-06-02 21:57:20] [INFO ] Deduced a trap composed of 164 places in 223 ms of which 2 ms to minimize.
[2025-06-02 21:57:20] [INFO ] Deduced a trap composed of 166 places in 221 ms of which 2 ms to minimize.
[2025-06-02 21:57:20] [INFO ] Deduced a trap composed of 152 places in 227 ms of which 2 ms to minimize.
[2025-06-02 21:57:20] [INFO ] Deduced a trap composed of 166 places in 248 ms of which 2 ms to minimize.
[2025-06-02 21:57:21] [INFO ] Deduced a trap composed of 158 places in 244 ms of which 2 ms to minimize.
[2025-06-02 21:57:21] [INFO ] Deduced a trap composed of 160 places in 245 ms of which 3 ms to minimize.
[2025-06-02 21:57:21] [INFO ] Deduced a trap composed of 177 places in 252 ms of which 2 ms to minimize.
[2025-06-02 21:57:22] [INFO ] Deduced a trap composed of 162 places in 250 ms of which 3 ms to minimize.
[2025-06-02 21:57:23] [INFO ] Deduced a trap composed of 162 places in 251 ms of which 3 ms to minimize.
[2025-06-02 21:57:23] [INFO ] Deduced a trap composed of 158 places in 246 ms of which 2 ms to minimize.
[2025-06-02 21:57:23] [INFO ] Deduced a trap composed of 185 places in 240 ms of which 2 ms to minimize.
[2025-06-02 21:57:24] [INFO ] Deduced a trap composed of 179 places in 229 ms of which 3 ms to minimize.
[2025-06-02 21:57:25] [INFO ] Deduced a trap composed of 166 places in 220 ms of which 3 ms to minimize.
[2025-06-02 21:57:25] [INFO ] Deduced a trap composed of 162 places in 229 ms of which 2 ms to minimize.
[2025-06-02 21:57:26] [INFO ] Deduced a trap composed of 158 places in 227 ms of which 3 ms to minimize.
[2025-06-02 21:57:26] [INFO ] Deduced a trap composed of 158 places in 222 ms of which 2 ms to minimize.
[2025-06-02 21:57:26] [INFO ] Deduced a trap composed of 160 places in 228 ms of which 2 ms to minimize.
[2025-06-02 21:57:26] [INFO ] Deduced a trap composed of 156 places in 228 ms of which 3 ms to minimize.
[2025-06-02 21:57:27] [INFO ] Deduced a trap composed of 168 places in 247 ms of which 3 ms to minimize.
[2025-06-02 21:57:27] [INFO ] Deduced a trap composed of 170 places in 242 ms of which 3 ms to minimize.
[2025-06-02 21:57:27] [INFO ] Deduced a trap composed of 173 places in 248 ms of which 3 ms to minimize.
[2025-06-02 21:57:28] [INFO ] Deduced a trap composed of 175 places in 247 ms of which 2 ms to minimize.
[2025-06-02 21:57:28] [INFO ] Deduced a trap composed of 172 places in 244 ms of which 2 ms to minimize.
[2025-06-02 21:57:28] [INFO ] Deduced a trap composed of 168 places in 243 ms of which 2 ms to minimize.
[2025-06-02 21:57:29] [INFO ] Deduced a trap composed of 167 places in 243 ms of which 2 ms to minimize.
[2025-06-02 21:57:29] [INFO ] Deduced a trap composed of 162 places in 249 ms of which 2 ms to minimize.
[2025-06-02 21:57:29] [INFO ] Deduced a trap composed of 156 places in 246 ms of which 3 ms to minimize.
[2025-06-02 21:57:30] [INFO ] Deduced a trap composed of 158 places in 246 ms of which 2 ms to minimize.
[2025-06-02 21:57:30] [INFO ] Deduced a trap composed of 162 places in 243 ms of which 3 ms to minimize.
[2025-06-02 21:57:30] [INFO ] Deduced a trap composed of 168 places in 247 ms of which 3 ms to minimize.
[2025-06-02 21:57:30] [INFO ] Deduced a trap composed of 168 places in 245 ms of which 2 ms to minimize.
[2025-06-02 21:57:31] [INFO ] Deduced a trap composed of 162 places in 243 ms of which 3 ms to minimize.
[2025-06-02 21:57:31] [INFO ] Deduced a trap composed of 168 places in 244 ms of which 3 ms to minimize.
[2025-06-02 21:57:31] [INFO ] Deduced a trap composed of 164 places in 227 ms of which 3 ms to minimize.
[2025-06-02 21:57:32] [INFO ] Deduced a trap composed of 164 places in 224 ms of which 2 ms to minimize.
[2025-06-02 21:57:32] [INFO ] Deduced a trap composed of 160 places in 241 ms of which 2 ms to minimize.
[2025-06-02 21:57:32] [INFO ] Deduced a trap composed of 158 places in 244 ms of which 3 ms to minimize.
[2025-06-02 21:57:33] [INFO ] Deduced a trap composed of 156 places in 244 ms of which 3 ms to minimize.
[2025-06-02 21:57:33] [INFO ] Deduced a trap composed of 166 places in 245 ms of which 2 ms to minimize.
[2025-06-02 21:57:34] [INFO ] Deduced a trap composed of 166 places in 241 ms of which 3 ms to minimize.
[2025-06-02 21:57:34] [INFO ] Deduced a trap composed of 160 places in 245 ms of which 2 ms to minimize.
[2025-06-02 21:57:34] [INFO ] Deduced a trap composed of 160 places in 246 ms of which 2 ms to minimize.
[2025-06-02 21:57:34] [INFO ] Deduced a trap composed of 158 places in 248 ms of which 3 ms to minimize.
[2025-06-02 21:57:35] [INFO ] Deduced a trap composed of 160 places in 244 ms of which 3 ms to minimize.
[2025-06-02 21:57:36] [INFO ] Deduced a trap composed of 172 places in 242 ms of which 3 ms to minimize.
[2025-06-02 21:57:36] [INFO ] Deduced a trap composed of 164 places in 248 ms of which 3 ms to minimize.
[2025-06-02 21:57:37] [INFO ] Deduced a trap composed of 160 places in 244 ms of which 2 ms to minimize.
[2025-06-02 21:57:37] [INFO ] Deduced a trap composed of 160 places in 258 ms of which 2 ms to minimize.
[2025-06-02 21:57:38] [INFO ] Deduced a trap composed of 158 places in 247 ms of which 3 ms to minimize.
[2025-06-02 21:57:38] [INFO ] Deduced a trap composed of 156 places in 240 ms of which 2 ms to minimize.
[2025-06-02 21:57:42] [INFO ] Deduced a trap composed of 168 places in 243 ms of which 3 ms to minimize.
[2025-06-02 21:57:43] [INFO ] Deduced a trap composed of 164 places in 242 ms of which 2 ms to minimize.
[2025-06-02 21:57:43] [INFO ] Deduced a trap composed of 160 places in 241 ms of which 2 ms to minimize.
[2025-06-02 21:57:43] [INFO ] Deduced a trap composed of 156 places in 241 ms of which 3 ms to minimize.
[2025-06-02 21:57:44] [INFO ] Deduced a trap composed of 162 places in 247 ms of which 3 ms to minimize.
[2025-06-02 21:57:46] [INFO ] Deduced a trap composed of 162 places in 230 ms of which 2 ms to minimize.
[2025-06-02 21:57:47] [INFO ] Deduced a trap composed of 164 places in 231 ms of which 3 ms to minimize.
[2025-06-02 21:57:48] [INFO ] Deduced a trap composed of 158 places in 242 ms of which 2 ms to minimize.
[2025-06-02 21:57:48] [INFO ] Deduced a trap composed of 158 places in 241 ms of which 3 ms to minimize.
[2025-06-02 21:57:48] [INFO ] Deduced a trap composed of 162 places in 232 ms of which 3 ms to minimize.
[2025-06-02 21:57:49] [INFO ] Deduced a trap composed of 160 places in 228 ms of which 2 ms to minimize.
[2025-06-02 21:57:49] [INFO ] Deduced a trap composed of 164 places in 245 ms of which 3 ms to minimize.
[2025-06-02 21:57:49] [INFO ] Deduced a trap composed of 162 places in 229 ms of which 3 ms to minimize.
[2025-06-02 21:57:50] [INFO ] Deduced a trap composed of 162 places in 244 ms of which 2 ms to minimize.
[2025-06-02 21:57:50] [INFO ] Deduced a trap composed of 162 places in 229 ms of which 2 ms to minimize.
[2025-06-02 21:58:10] [INFO ] Trap strengthening (SAT) tested/added 96/96 trap constraints in 59477 ms
TRAPS : Iteration 1
[2025-06-02 21:58:10] [INFO ] After 59603ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2025-06-02 21:58:10] [INFO ] After 59933ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
RANDOM walk for 4000000 steps (290658 resets) in 39026 ms. (102 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (38545 resets) in 7254 ms. (551 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 6729217 steps, run timeout after 36001 ms. (steps per millisecond=186 ) properties seen :0 out of 1
Probabilistic random walk after 6729217 steps, saw 1170308 distinct states, run finished after 36002 ms. (steps per millisecond=186 ) properties seen :0
[2025-06-02 21:58:58] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2025-06-02 21:58:58] [INFO ] Invariant cache hit.
[2025-06-02 21:58:58] [INFO ] State equation strengthened by 1 read => feed constraints.
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) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 77/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 313/399 variables, 52/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/400 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/408 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/409 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/409 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 972/1381 variables, 409/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1381 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1381 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1382 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1382 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1382 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1382/1382 variables, and 473 constraints, problems are : Problem set: 0 solved, 1 unsolved in 402 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 410/410 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 77/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 313/399 variables, 52/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/400 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/408 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 21:58:59] [INFO ] Deduced a trap composed of 164 places in 207 ms of which 3 ms to minimize.
[2025-06-02 21:58:59] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 3 ms to minimize.
[2025-06-02 21:58:59] [INFO ] Deduced a trap composed of 168 places in 206 ms of which 2 ms to minimize.
[2025-06-02 21:59:00] [INFO ] Deduced a trap composed of 166 places in 217 ms of which 2 ms to minimize.
[2025-06-02 21:59:00] [INFO ] Deduced a trap composed of 166 places in 213 ms of which 3 ms to minimize.
[2025-06-02 21:59:00] [INFO ] Deduced a trap composed of 164 places in 214 ms of which 3 ms to minimize.
[2025-06-02 21:59:00] [INFO ] Deduced a trap composed of 162 places in 211 ms of which 2 ms to minimize.
[2025-06-02 21:59:01] [INFO ] Deduced a trap composed of 168 places in 205 ms of which 2 ms to minimize.
[2025-06-02 21:59:01] [INFO ] Deduced a trap composed of 164 places in 213 ms of which 3 ms to minimize.
[2025-06-02 21:59:01] [INFO ] Deduced a trap composed of 162 places in 217 ms of which 3 ms to minimize.
[2025-06-02 21:59:01] [INFO ] Deduced a trap composed of 160 places in 211 ms of which 3 ms to minimize.
[2025-06-02 21:59:01] [INFO ] Deduced a trap composed of 168 places in 206 ms of which 3 ms to minimize.
[2025-06-02 21:59:02] [INFO ] Deduced a trap composed of 164 places in 204 ms of which 3 ms to minimize.
[2025-06-02 21:59:02] [INFO ] Deduced a trap composed of 162 places in 215 ms of which 2 ms to minimize.
[2025-06-02 21:59:02] [INFO ] Deduced a trap composed of 170 places in 203 ms of which 2 ms to minimize.
[2025-06-02 21:59:02] [INFO ] Deduced a trap composed of 170 places in 194 ms of which 2 ms to minimize.
[2025-06-02 21:59:03] [INFO ] Deduced a trap composed of 164 places in 213 ms of which 3 ms to minimize.
[2025-06-02 21:59:03] [INFO ] Deduced a trap composed of 166 places in 208 ms of which 2 ms to minimize.
[2025-06-02 21:59:03] [INFO ] Deduced a trap composed of 158 places in 213 ms of which 2 ms to minimize.
[2025-06-02 21:59:03] [INFO ] Deduced a trap composed of 160 places in 215 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 21:59:03] [INFO ] Deduced a trap composed of 160 places in 213 ms of which 3 ms to minimize.
[2025-06-02 21:59:04] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 3 ms to minimize.
[2025-06-02 21:59:04] [INFO ] Deduced a trap composed of 166 places in 207 ms of which 3 ms to minimize.
[2025-06-02 21:59:04] [INFO ] Deduced a trap composed of 170 places in 205 ms of which 3 ms to minimize.
[2025-06-02 21:59:04] [INFO ] Deduced a trap composed of 162 places in 203 ms of which 2 ms to minimize.
[2025-06-02 21:59:05] [INFO ] Deduced a trap composed of 164 places in 203 ms of which 2 ms to minimize.
[2025-06-02 21:59:05] [INFO ] Deduced a trap composed of 164 places in 203 ms of which 2 ms to minimize.
[2025-06-02 21:59:05] [INFO ] Deduced a trap composed of 166 places in 200 ms of which 2 ms to minimize.
[2025-06-02 21:59:05] [INFO ] Deduced a trap composed of 172 places in 204 ms of which 3 ms to minimize.
[2025-06-02 21:59:05] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 3 ms to minimize.
[2025-06-02 21:59:06] [INFO ] Deduced a trap composed of 168 places in 206 ms of which 2 ms to minimize.
[2025-06-02 21:59:06] [INFO ] Deduced a trap composed of 156 places in 221 ms of which 3 ms to minimize.
[2025-06-02 21:59:06] [INFO ] Deduced a trap composed of 160 places in 207 ms of which 2 ms to minimize.
[2025-06-02 21:59:06] [INFO ] Deduced a trap composed of 158 places in 193 ms of which 3 ms to minimize.
[2025-06-02 21:59:07] [INFO ] Deduced a trap composed of 164 places in 212 ms of which 3 ms to minimize.
[2025-06-02 21:59:07] [INFO ] Deduced a trap composed of 164 places in 207 ms of which 2 ms to minimize.
[2025-06-02 21:59:07] [INFO ] Deduced a trap composed of 166 places in 217 ms of which 2 ms to minimize.
[2025-06-02 21:59:07] [INFO ] Deduced a trap composed of 160 places in 197 ms of which 2 ms to minimize.
[2025-06-02 21:59:08] [INFO ] Deduced a trap composed of 168 places in 199 ms of which 3 ms to minimize.
[2025-06-02 21:59:08] [INFO ] Deduced a trap composed of 166 places in 199 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/408 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 21:59:08] [INFO ] Deduced a trap composed of 166 places in 193 ms of which 2 ms to minimize.
[2025-06-02 21:59:08] [INFO ] Deduced a trap composed of 164 places in 195 ms of which 3 ms to minimize.
[2025-06-02 21:59:08] [INFO ] Deduced a trap composed of 146 places in 215 ms of which 2 ms to minimize.
[2025-06-02 21:59:09] [INFO ] Deduced a trap composed of 172 places in 213 ms of which 3 ms to minimize.
[2025-06-02 21:59:09] [INFO ] Deduced a trap composed of 164 places in 216 ms of which 3 ms to minimize.
[2025-06-02 21:59:09] [INFO ] Deduced a trap composed of 162 places in 214 ms of which 2 ms to minimize.
[2025-06-02 21:59:09] [INFO ] Deduced a trap composed of 166 places in 206 ms of which 2 ms to minimize.
[2025-06-02 21:59:10] [INFO ] Deduced a trap composed of 166 places in 211 ms of which 2 ms to minimize.
[2025-06-02 21:59:10] [INFO ] Deduced a trap composed of 162 places in 216 ms of which 3 ms to minimize.
[2025-06-02 21:59:10] [INFO ] Deduced a trap composed of 158 places in 206 ms of which 3 ms to minimize.
[2025-06-02 21:59:10] [INFO ] Deduced a trap composed of 164 places in 216 ms of which 2 ms to minimize.
[2025-06-02 21:59:10] [INFO ] Deduced a trap composed of 166 places in 214 ms of which 3 ms to minimize.
[2025-06-02 21:59:11] [INFO ] Deduced a trap composed of 170 places in 207 ms of which 2 ms to minimize.
[2025-06-02 21:59:11] [INFO ] Deduced a trap composed of 168 places in 205 ms of which 2 ms to minimize.
[2025-06-02 21:59:11] [INFO ] Deduced a trap composed of 166 places in 215 ms of which 3 ms to minimize.
[2025-06-02 21:59:11] [INFO ] Deduced a trap composed of 164 places in 216 ms of which 2 ms to minimize.
[2025-06-02 21:59:12] [INFO ] Deduced a trap composed of 138 places in 224 ms of which 2 ms to minimize.
[2025-06-02 21:59:12] [INFO ] Deduced a trap composed of 168 places in 223 ms of which 2 ms to minimize.
[2025-06-02 21:59:12] [INFO ] Deduced a trap composed of 166 places in 214 ms of which 3 ms to minimize.
[2025-06-02 21:59:12] [INFO ] Deduced a trap composed of 168 places in 214 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/408 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 21:59:13] [INFO ] Deduced a trap composed of 166 places in 215 ms of which 2 ms to minimize.
[2025-06-02 21:59:13] [INFO ] Deduced a trap composed of 162 places in 220 ms of which 2 ms to minimize.
[2025-06-02 21:59:13] [INFO ] Deduced a trap composed of 158 places in 203 ms of which 3 ms to minimize.
[2025-06-02 21:59:14] [INFO ] Deduced a trap composed of 164 places in 196 ms of which 3 ms to minimize.
[2025-06-02 21:59:14] [INFO ] Deduced a trap composed of 164 places in 221 ms of which 3 ms to minimize.
[2025-06-02 21:59:14] [INFO ] Deduced a trap composed of 166 places in 221 ms of which 3 ms to minimize.
[2025-06-02 21:59:14] [INFO ] Deduced a trap composed of 162 places in 215 ms of which 2 ms to minimize.
[2025-06-02 21:59:15] [INFO ] Deduced a trap composed of 172 places in 213 ms of which 3 ms to minimize.
[2025-06-02 21:59:15] [INFO ] Deduced a trap composed of 160 places in 218 ms of which 3 ms to minimize.
[2025-06-02 21:59:15] [INFO ] Deduced a trap composed of 154 places in 213 ms of which 2 ms to minimize.
[2025-06-02 21:59:15] [INFO ] Deduced a trap composed of 166 places in 208 ms of which 2 ms to minimize.
[2025-06-02 21:59:16] [INFO ] Deduced a trap composed of 164 places in 220 ms of which 2 ms to minimize.
[2025-06-02 21:59:16] [INFO ] Deduced a trap composed of 168 places in 219 ms of which 3 ms to minimize.
[2025-06-02 21:59:16] [INFO ] Deduced a trap composed of 160 places in 215 ms of which 3 ms to minimize.
[2025-06-02 21:59:16] [INFO ] Deduced a trap composed of 168 places in 212 ms of which 3 ms to minimize.
[2025-06-02 21:59:17] [INFO ] Deduced a trap composed of 168 places in 211 ms of which 3 ms to minimize.
[2025-06-02 21:59:17] [INFO ] Deduced a trap composed of 160 places in 212 ms of which 2 ms to minimize.
[2025-06-02 21:59:17] [INFO ] Deduced a trap composed of 158 places in 216 ms of which 2 ms to minimize.
[2025-06-02 21:59:17] [INFO ] Deduced a trap composed of 160 places in 213 ms of which 3 ms to minimize.
[2025-06-02 21:59:18] [INFO ] Deduced a trap composed of 154 places in 210 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/408 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 21:59:18] [INFO ] Deduced a trap composed of 166 places in 205 ms of which 2 ms to minimize.
[2025-06-02 21:59:18] [INFO ] Deduced a trap composed of 170 places in 216 ms of which 2 ms to minimize.
[2025-06-02 21:59:19] [INFO ] Deduced a trap composed of 166 places in 197 ms of which 2 ms to minimize.
[2025-06-02 21:59:19] [INFO ] Deduced a trap composed of 164 places in 195 ms of which 2 ms to minimize.
[2025-06-02 21:59:19] [INFO ] Deduced a trap composed of 160 places in 196 ms of which 2 ms to minimize.
[2025-06-02 21:59:19] [INFO ] Deduced a trap composed of 162 places in 217 ms of which 2 ms to minimize.
[2025-06-02 21:59:20] [INFO ] Deduced a trap composed of 166 places in 187 ms of which 3 ms to minimize.
[2025-06-02 21:59:20] [INFO ] Deduced a trap composed of 158 places in 198 ms of which 2 ms to minimize.
[2025-06-02 21:59:21] [INFO ] Deduced a trap composed of 160 places in 208 ms of which 3 ms to minimize.
[2025-06-02 21:59:21] [INFO ] Deduced a trap composed of 162 places in 210 ms of which 2 ms to minimize.
[2025-06-02 21:59:21] [INFO ] Deduced a trap composed of 158 places in 193 ms of which 3 ms to minimize.
[2025-06-02 21:59:21] [INFO ] Deduced a trap composed of 158 places in 197 ms of which 3 ms to minimize.
[2025-06-02 21:59:21] [INFO ] Deduced a trap composed of 166 places in 190 ms of which 2 ms to minimize.
[2025-06-02 21:59:22] [INFO ] Deduced a trap composed of 168 places in 193 ms of which 2 ms to minimize.
[2025-06-02 21:59:22] [INFO ] Deduced a trap composed of 166 places in 214 ms of which 2 ms to minimize.
[2025-06-02 21:59:22] [INFO ] Deduced a trap composed of 170 places in 220 ms of which 3 ms to minimize.
[2025-06-02 21:59:22] [INFO ] Deduced a trap composed of 156 places in 226 ms of which 2 ms to minimize.
[2025-06-02 21:59:23] [INFO ] Deduced a trap composed of 164 places in 219 ms of which 3 ms to minimize.
[2025-06-02 21:59:23] [INFO ] Deduced a trap composed of 168 places in 204 ms of which 3 ms to minimize.
[2025-06-02 21:59:24] [INFO ] Deduced a trap composed of 172 places in 194 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/408 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 21:59:24] [INFO ] Deduced a trap composed of 172 places in 203 ms of which 3 ms to minimize.
[2025-06-02 21:59:24] [INFO ] Deduced a trap composed of 164 places in 207 ms of which 2 ms to minimize.
[2025-06-02 21:59:25] [INFO ] Deduced a trap composed of 150 places in 215 ms of which 3 ms to minimize.
[2025-06-02 21:59:25] [INFO ] Deduced a trap composed of 156 places in 219 ms of which 3 ms to minimize.
[2025-06-02 21:59:27] [INFO ] Deduced a trap composed of 162 places in 181 ms of which 2 ms to minimize.
[2025-06-02 21:59:28] [INFO ] Deduced a trap composed of 164 places in 214 ms of which 3 ms to minimize.
[2025-06-02 21:59:28] [INFO ] Deduced a trap composed of 156 places in 210 ms of which 2 ms to minimize.
[2025-06-02 21:59:28] [INFO ] Deduced a trap composed of 164 places in 254 ms of which 3 ms to minimize.
[2025-06-02 21:59:28] [INFO ] Deduced a trap composed of 166 places in 206 ms of which 2 ms to minimize.
[2025-06-02 21:59:29] [INFO ] Deduced a trap composed of 166 places in 196 ms of which 3 ms to minimize.
[2025-06-02 21:59:29] [INFO ] Deduced a trap composed of 162 places in 211 ms of which 2 ms to minimize.
[2025-06-02 21:59:29] [INFO ] Deduced a trap composed of 154 places in 200 ms of which 2 ms to minimize.
[2025-06-02 21:59:29] [INFO ] Deduced a trap composed of 166 places in 232 ms of which 3 ms to minimize.
[2025-06-02 21:59:30] [INFO ] Deduced a trap composed of 160 places in 191 ms of which 4 ms to minimize.
[2025-06-02 21:59:30] [INFO ] Deduced a trap composed of 166 places in 208 ms of which 2 ms to minimize.
[2025-06-02 21:59:30] [INFO ] Deduced a trap composed of 158 places in 203 ms of which 3 ms to minimize.
[2025-06-02 21:59:30] [INFO ] Deduced a trap composed of 164 places in 211 ms of which 3 ms to minimize.
[2025-06-02 21:59:31] [INFO ] Deduced a trap composed of 164 places in 211 ms of which 2 ms to minimize.
[2025-06-02 21:59:31] [INFO ] Deduced a trap composed of 160 places in 186 ms of which 3 ms to minimize.
[2025-06-02 21:59:31] [INFO ] Deduced a trap composed of 164 places in 193 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/408 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 21:59:32] [INFO ] Deduced a trap composed of 166 places in 213 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 408/1382 variables, and 182 constraints, problems are : Problem set: 0 solved, 1 unsolved in 44911 ms.
Refiners :[Positive P Invariants (semi-flows): 54/55 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 121/121 constraints]
After SMT, in 45326ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 36 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 410/410 places, 981/981 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 29 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2025-06-02 21:59:44] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2025-06-02 21:59:44] [INFO ] Invariant cache hit.
[2025-06-02 21:59:44] [INFO ] Implicit Places using invariants in 494 ms returned []
[2025-06-02 21:59:44] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2025-06-02 21:59:44] [INFO ] Invariant cache hit.
[2025-06-02 21:59:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:59:46] [INFO ] Implicit Places using invariants and state equation in 1477 ms returned []
Implicit Place search using SMT with State Equation took 2003 ms to find 0 implicit places.
[2025-06-02 21:59:46] [INFO ] Redundant transitions in 11 ms returned []
Running 970 sub problems to find dead transitions.
[2025-06-02 21:59:46] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2025-06-02 21:59:46] [INFO ] Invariant cache hit.
[2025-06-02 21:59:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 970 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2025-06-02 21:59:56] [INFO ] Deduced a trap composed of 117 places in 174 ms of which 3 ms to minimize.
[2025-06-02 21:59:56] [INFO ] Deduced a trap composed of 165 places in 149 ms of which 3 ms to minimize.
[2025-06-02 21:59:56] [INFO ] Deduced a trap composed of 131 places in 152 ms of which 3 ms to minimize.
[2025-06-02 21:59:57] [INFO ] Deduced a trap composed of 131 places in 220 ms of which 2 ms to minimize.
[2025-06-02 21:59:57] [INFO ] Deduced a trap composed of 127 places in 151 ms of which 2 ms to minimize.
[2025-06-02 21:59:57] [INFO ] Deduced a trap composed of 127 places in 169 ms of which 3 ms to minimize.
[2025-06-02 21:59:57] [INFO ] Deduced a trap composed of 137 places in 151 ms of which 3 ms to minimize.
[2025-06-02 21:59:57] [INFO ] Deduced a trap composed of 127 places in 150 ms of which 3 ms to minimize.
[2025-06-02 21:59:58] [INFO ] Deduced a trap composed of 127 places in 145 ms of which 3 ms to minimize.
[2025-06-02 21:59:58] [INFO ] Deduced a trap composed of 127 places in 151 ms of which 2 ms to minimize.
[2025-06-02 21:59:58] [INFO ] Deduced a trap composed of 127 places in 151 ms of which 3 ms to minimize.
[2025-06-02 21:59:58] [INFO ] Deduced a trap composed of 166 places in 158 ms of which 2 ms to minimize.
[2025-06-02 21:59:58] [INFO ] Deduced a trap composed of 122 places in 161 ms of which 2 ms to minimize.
[2025-06-02 21:59:58] [INFO ] Deduced a trap composed of 127 places in 158 ms of which 3 ms to minimize.
[2025-06-02 21:59:59] [INFO ] Deduced a trap composed of 122 places in 154 ms of which 2 ms to minimize.
[2025-06-02 21:59:59] [INFO ] Deduced a trap composed of 116 places in 161 ms of which 2 ms to minimize.
[2025-06-02 21:59:59] [INFO ] Deduced a trap composed of 116 places in 154 ms of which 2 ms to minimize.
[2025-06-02 21:59:59] [INFO ] Deduced a trap composed of 116 places in 153 ms of which 2 ms to minimize.
[2025-06-02 21:59:59] [INFO ] Deduced a trap composed of 116 places in 152 ms of which 2 ms to minimize.
[2025-06-02 21:59:59] [INFO ] Deduced a trap composed of 116 places in 155 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2025-06-02 22:00:00] [INFO ] Deduced a trap composed of 166 places in 156 ms of which 2 ms to minimize.
[2025-06-02 22:00:00] [INFO ] Deduced a trap composed of 168 places in 155 ms of which 2 ms to minimize.
[2025-06-02 22:00:00] [INFO ] Deduced a trap composed of 168 places in 153 ms of which 3 ms to minimize.
[2025-06-02 22:00:00] [INFO ] Deduced a trap composed of 168 places in 157 ms of which 2 ms to minimize.
[2025-06-02 22:00:01] [INFO ] Deduced a trap composed of 170 places in 152 ms of which 2 ms to minimize.
[2025-06-02 22:00:01] [INFO ] Deduced a trap composed of 170 places in 151 ms of which 2 ms to minimize.
[2025-06-02 22:00:01] [INFO ] Deduced a trap composed of 168 places in 173 ms of which 2 ms to minimize.
[2025-06-02 22:00:01] [INFO ] Deduced a trap composed of 170 places in 151 ms of which 2 ms to minimize.
[2025-06-02 22:00:01] [INFO ] Deduced a trap composed of 170 places in 151 ms of which 2 ms to minimize.
[2025-06-02 22:00:01] [INFO ] Deduced a trap composed of 164 places in 153 ms of which 3 ms to minimize.
[2025-06-02 22:00:02] [INFO ] Deduced a trap composed of 166 places in 152 ms of which 2 ms to minimize.
[2025-06-02 22:00:02] [INFO ] Deduced a trap composed of 168 places in 154 ms of which 2 ms to minimize.
[2025-06-02 22:00:02] [INFO ] Deduced a trap composed of 168 places in 159 ms of which 2 ms to minimize.
[2025-06-02 22:00:02] [INFO ] Deduced a trap composed of 168 places in 163 ms of which 2 ms to minimize.
[2025-06-02 22:00:02] [INFO ] Deduced a trap composed of 166 places in 161 ms of which 3 ms to minimize.
[2025-06-02 22:00:02] [INFO ] Deduced a trap composed of 166 places in 154 ms of which 2 ms to minimize.
[2025-06-02 22:00:03] [INFO ] Deduced a trap composed of 166 places in 151 ms of which 2 ms to minimize.
[2025-06-02 22:00:03] [INFO ] Deduced a trap composed of 166 places in 153 ms of which 2 ms to minimize.
[2025-06-02 22:00:03] [INFO ] Deduced a trap composed of 162 places in 153 ms of which 2 ms to minimize.
[2025-06-02 22:00:03] [INFO ] Deduced a trap composed of 164 places in 158 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2025-06-02 22:00:10] [INFO ] Deduced a trap composed of 166 places in 147 ms of which 2 ms to minimize.
[2025-06-02 22:00:10] [INFO ] Deduced a trap composed of 164 places in 142 ms of which 2 ms to minimize.
[2025-06-02 22:00:10] [INFO ] Deduced a trap composed of 136 places in 150 ms of which 2 ms to minimize.
[2025-06-02 22:00:10] [INFO ] Deduced a trap composed of 164 places in 153 ms of which 2 ms to minimize.
[2025-06-02 22:00:10] [INFO ] Deduced a trap composed of 166 places in 154 ms of which 3 ms to minimize.
[2025-06-02 22:00:11] [INFO ] Deduced a trap composed of 162 places in 153 ms of which 3 ms to minimize.
[2025-06-02 22:00:11] [INFO ] Deduced a trap composed of 164 places in 159 ms of which 3 ms to minimize.
[2025-06-02 22:00:11] [INFO ] Deduced a trap composed of 162 places in 157 ms of which 2 ms to minimize.
[2025-06-02 22:00:11] [INFO ] Deduced a trap composed of 166 places in 155 ms of which 2 ms to minimize.
[2025-06-02 22:00:11] [INFO ] Deduced a trap composed of 166 places in 159 ms of which 2 ms to minimize.
[2025-06-02 22:00:11] [INFO ] Deduced a trap composed of 164 places in 161 ms of which 2 ms to minimize.
[2025-06-02 22:00:12] [INFO ] Deduced a trap composed of 168 places in 153 ms of which 2 ms to minimize.
[2025-06-02 22:00:12] [INFO ] Deduced a trap composed of 166 places in 147 ms of which 2 ms to minimize.
[2025-06-02 22:00:12] [INFO ] Deduced a trap composed of 164 places in 157 ms of which 3 ms to minimize.
[2025-06-02 22:00:12] [INFO ] Deduced a trap composed of 116 places in 146 ms of which 3 ms to minimize.
[2025-06-02 22:00:12] [INFO ] Deduced a trap composed of 162 places in 141 ms of which 2 ms to minimize.
[2025-06-02 22:00:12] [INFO ] Deduced a trap composed of 162 places in 145 ms of which 2 ms to minimize.
[2025-06-02 22:00:13] [INFO ] Deduced a trap composed of 160 places in 160 ms of which 2 ms to minimize.
[2025-06-02 22:00:13] [INFO ] Deduced a trap composed of 121 places in 160 ms of which 2 ms to minimize.
[2025-06-02 22:00:13] [INFO ] Deduced a trap composed of 160 places in 147 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2025-06-02 22:00:15] [INFO ] Deduced a trap composed of 58 places in 148 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 400/1382 variables, and 113 constraints, problems are : Problem set: 0 solved, 970 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 46/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 970/970 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 970 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 970 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 970 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 61/113 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2025-06-02 22:00:21] [INFO ] Deduced a trap composed of 111 places in 167 ms of which 3 ms to minimize.
[2025-06-02 22:00:21] [INFO ] Deduced a trap composed of 171 places in 162 ms of which 2 ms to minimize.
[2025-06-02 22:00:21] [INFO ] Deduced a trap composed of 183 places in 157 ms of which 2 ms to minimize.
[2025-06-02 22:00:22] [INFO ] Deduced a trap composed of 123 places in 158 ms of which 2 ms to minimize.
[2025-06-02 22:00:22] [INFO ] Deduced a trap composed of 141 places in 158 ms of which 2 ms to minimize.
[2025-06-02 22:00:22] [INFO ] Deduced a trap composed of 171 places in 168 ms of which 2 ms to minimize.
[2025-06-02 22:00:22] [INFO ] Deduced a trap composed of 171 places in 158 ms of which 2 ms to minimize.
[2025-06-02 22:00:22] [INFO ] Deduced a trap composed of 174 places in 157 ms of which 3 ms to minimize.
[2025-06-02 22:00:22] [INFO ] Deduced a trap composed of 177 places in 156 ms of which 2 ms to minimize.
[2025-06-02 22:00:23] [INFO ] Deduced a trap composed of 174 places in 162 ms of which 2 ms to minimize.
[2025-06-02 22:00:23] [INFO ] Deduced a trap composed of 171 places in 158 ms of which 2 ms to minimize.
[2025-06-02 22:00:23] [INFO ] Deduced a trap composed of 162 places in 160 ms of which 2 ms to minimize.
[2025-06-02 22:00:23] [INFO ] Deduced a trap composed of 171 places in 158 ms of which 2 ms to minimize.
[2025-06-02 22:00:23] [INFO ] Deduced a trap composed of 174 places in 163 ms of which 2 ms to minimize.
[2025-06-02 22:00:24] [INFO ] Deduced a trap composed of 174 places in 259 ms of which 2 ms to minimize.
[2025-06-02 22:00:24] [INFO ] Deduced a trap composed of 174 places in 259 ms of which 3 ms to minimize.
[2025-06-02 22:00:24] [INFO ] Deduced a trap composed of 180 places in 257 ms of which 2 ms to minimize.
[2025-06-02 22:00:25] [INFO ] Deduced a trap composed of 180 places in 257 ms of which 2 ms to minimize.
[2025-06-02 22:00:25] [INFO ] Deduced a trap composed of 186 places in 271 ms of which 2 ms to minimize.
[2025-06-02 22:00:25] [INFO ] Deduced a trap composed of 174 places in 250 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 20/133 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2025-06-02 22:00:26] [INFO ] Deduced a trap composed of 18 places in 177 ms of which 1 ms to minimize.
[2025-06-02 22:00:27] [INFO ] Deduced a trap composed of 132 places in 260 ms of which 2 ms to minimize.
[2025-06-02 22:00:28] [INFO ] Deduced a trap composed of 116 places in 257 ms of which 2 ms to minimize.
[2025-06-02 22:00:28] [INFO ] Deduced a trap composed of 116 places in 247 ms of which 3 ms to minimize.
[2025-06-02 22:00:28] [INFO ] Deduced a trap composed of 116 places in 244 ms of which 3 ms to minimize.
[2025-06-02 22:00:29] [INFO ] Deduced a trap composed of 130 places in 258 ms of which 2 ms to minimize.
[2025-06-02 22:00:34] [INFO ] Deduced a trap composed of 171 places in 240 ms of which 2 ms to minimize.
[2025-06-02 22:00:34] [INFO ] Deduced a trap composed of 156 places in 236 ms of which 3 ms to minimize.
[2025-06-02 22:00:35] [INFO ] Deduced a trap composed of 162 places in 251 ms of which 2 ms to minimize.
[2025-06-02 22:00:35] [INFO ] Deduced a trap composed of 173 places in 239 ms of which 2 ms to minimize.
[2025-06-02 22:00:35] [INFO ] Deduced a trap composed of 162 places in 234 ms of which 2 ms to minimize.
[2025-06-02 22:00:35] [INFO ] Deduced a trap composed of 164 places in 235 ms of which 3 ms to minimize.
[2025-06-02 22:00:36] [INFO ] Deduced a trap composed of 162 places in 251 ms of which 2 ms to minimize.
[2025-06-02 22:00:36] [INFO ] Deduced a trap composed of 160 places in 257 ms of which 2 ms to minimize.
[2025-06-02 22:00:36] [INFO ] Deduced a trap composed of 164 places in 254 ms of which 3 ms to minimize.
[2025-06-02 22:00:37] [INFO ] Deduced a trap composed of 164 places in 250 ms of which 3 ms to minimize.
[2025-06-02 22:00:37] [INFO ] Deduced a trap composed of 164 places in 247 ms of which 3 ms to minimize.
[2025-06-02 22:00:37] [INFO ] Deduced a trap composed of 162 places in 249 ms of which 2 ms to minimize.
[2025-06-02 22:00:38] [INFO ] Deduced a trap composed of 162 places in 253 ms of which 2 ms to minimize.
[2025-06-02 22:00:38] [INFO ] Deduced a trap composed of 169 places in 261 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2025-06-02 22:00:48] [INFO ] Deduced a trap composed of 164 places in 177 ms of which 2 ms to minimize.
[2025-06-02 22:00:48] [INFO ] Deduced a trap composed of 168 places in 193 ms of which 3 ms to minimize.
[2025-06-02 22:00:49] [INFO ] Deduced a trap composed of 164 places in 188 ms of which 2 ms to minimize.
[2025-06-02 22:00:49] [INFO ] Deduced a trap composed of 164 places in 175 ms of which 2 ms to minimize.
[2025-06-02 22:00:49] [INFO ] Deduced a trap composed of 166 places in 194 ms of which 2 ms to minimize.
[2025-06-02 22:00:49] [INFO ] Deduced a trap composed of 162 places in 188 ms of which 3 ms to minimize.
[2025-06-02 22:00:49] [INFO ] Deduced a trap composed of 164 places in 175 ms of which 2 ms to minimize.
[2025-06-02 22:00:50] [INFO ] Deduced a trap composed of 162 places in 181 ms of which 2 ms to minimize.
SMT process timed out in 63951ms, After SMT, problems are : Problem set: 0 solved, 970 unsolved
Search for dead transitions found 0 dead transitions in 63961ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66036 ms. Remains : 410/410 places, 981/981 transitions.
RANDOM walk for 400000 steps (28931 resets) in 4911 ms. (81 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
[2025-06-02 22:00:51] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2025-06-02 22:00:51] [INFO ] Invariant cache hit.
[2025-06-02 22:00:51] [INFO ] [Real]Absence check using 55 positive place invariants in 12 ms returned sat
[2025-06-02 22:00:51] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 10 ms returned sat
[2025-06-02 22:00:51] [INFO ] After 222ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-02 22:00:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 22:00:51] [INFO ] After 11ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-02 22:00:52] [INFO ] After 62ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-02 22:00:52] [INFO ] After 386ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-02 22:00:52] [INFO ] [Nat]Absence check using 55 positive place invariants in 10 ms returned sat
[2025-06-02 22:00:52] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 9 ms returned sat
[2025-06-02 22:00:52] [INFO ] After 225ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-02 22:00:52] [INFO ] After 54ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-02 22:00:52] [INFO ] Deduced a trap composed of 164 places in 236 ms of which 2 ms to minimize.
[2025-06-02 22:00:52] [INFO ] Deduced a trap composed of 162 places in 267 ms of which 2 ms to minimize.
[2025-06-02 22:00:53] [INFO ] Deduced a trap composed of 164 places in 244 ms of which 2 ms to minimize.
[2025-06-02 22:00:53] [INFO ] Deduced a trap composed of 156 places in 243 ms of which 2 ms to minimize.
[2025-06-02 22:00:53] [INFO ] Deduced a trap composed of 160 places in 238 ms of which 2 ms to minimize.
[2025-06-02 22:00:54] [INFO ] Deduced a trap composed of 158 places in 253 ms of which 3 ms to minimize.
[2025-06-02 22:00:54] [INFO ] Deduced a trap composed of 166 places in 262 ms of which 2 ms to minimize.
[2025-06-02 22:00:54] [INFO ] Deduced a trap composed of 154 places in 239 ms of which 2 ms to minimize.
[2025-06-02 22:00:54] [INFO ] Deduced a trap composed of 162 places in 258 ms of which 2 ms to minimize.
[2025-06-02 22:00:55] [INFO ] Deduced a trap composed of 158 places in 251 ms of which 2 ms to minimize.
[2025-06-02 22:00:55] [INFO ] Deduced a trap composed of 164 places in 253 ms of which 3 ms to minimize.
[2025-06-02 22:00:55] [INFO ] Deduced a trap composed of 156 places in 236 ms of which 3 ms to minimize.
[2025-06-02 22:00:56] [INFO ] Deduced a trap composed of 164 places in 240 ms of which 3 ms to minimize.
[2025-06-02 22:00:56] [INFO ] Deduced a trap composed of 158 places in 248 ms of which 2 ms to minimize.
[2025-06-02 22:00:56] [INFO ] Deduced a trap composed of 162 places in 251 ms of which 2 ms to minimize.
[2025-06-02 22:00:56] [INFO ] Deduced a trap composed of 166 places in 238 ms of which 2 ms to minimize.
[2025-06-02 22:00:57] [INFO ] Deduced a trap composed of 158 places in 246 ms of which 2 ms to minimize.
[2025-06-02 22:00:57] [INFO ] Deduced a trap composed of 162 places in 239 ms of which 2 ms to minimize.
[2025-06-02 22:00:57] [INFO ] Deduced a trap composed of 162 places in 240 ms of which 2 ms to minimize.
[2025-06-02 22:00:58] [INFO ] Deduced a trap composed of 162 places in 251 ms of which 2 ms to minimize.
[2025-06-02 22:00:58] [INFO ] Deduced a trap composed of 160 places in 236 ms of which 2 ms to minimize.
[2025-06-02 22:00:58] [INFO ] Deduced a trap composed of 162 places in 257 ms of which 2 ms to minimize.
[2025-06-02 22:00:59] [INFO ] Deduced a trap composed of 166 places in 269 ms of which 2 ms to minimize.
[2025-06-02 22:00:59] [INFO ] Deduced a trap composed of 169 places in 254 ms of which 3 ms to minimize.
[2025-06-02 22:00:59] [INFO ] Deduced a trap composed of 164 places in 242 ms of which 3 ms to minimize.
[2025-06-02 22:00:59] [INFO ] Deduced a trap composed of 164 places in 229 ms of which 2 ms to minimize.
[2025-06-02 22:01:00] [INFO ] Deduced a trap composed of 158 places in 243 ms of which 3 ms to minimize.
[2025-06-02 22:01:00] [INFO ] Deduced a trap composed of 156 places in 265 ms of which 2 ms to minimize.
[2025-06-02 22:01:00] [INFO ] Deduced a trap composed of 160 places in 247 ms of which 2 ms to minimize.
[2025-06-02 22:01:01] [INFO ] Deduced a trap composed of 164 places in 252 ms of which 2 ms to minimize.
[2025-06-02 22:01:01] [INFO ] Deduced a trap composed of 156 places in 257 ms of which 2 ms to minimize.
[2025-06-02 22:01:01] [INFO ] Deduced a trap composed of 164 places in 236 ms of which 3 ms to minimize.
[2025-06-02 22:01:01] [INFO ] Deduced a trap composed of 166 places in 242 ms of which 2 ms to minimize.
[2025-06-02 22:01:02] [INFO ] Deduced a trap composed of 152 places in 230 ms of which 2 ms to minimize.
[2025-06-02 22:01:02] [INFO ] Deduced a trap composed of 166 places in 269 ms of which 3 ms to minimize.
[2025-06-02 22:01:02] [INFO ] Deduced a trap composed of 158 places in 223 ms of which 2 ms to minimize.
[2025-06-02 22:01:03] [INFO ] Deduced a trap composed of 160 places in 252 ms of which 2 ms to minimize.
[2025-06-02 22:01:03] [INFO ] Deduced a trap composed of 177 places in 240 ms of which 2 ms to minimize.
[2025-06-02 22:01:04] [INFO ] Deduced a trap composed of 162 places in 269 ms of which 3 ms to minimize.
[2025-06-02 22:01:04] [INFO ] Deduced a trap composed of 162 places in 251 ms of which 3 ms to minimize.
[2025-06-02 22:01:05] [INFO ] Deduced a trap composed of 158 places in 264 ms of which 2 ms to minimize.
[2025-06-02 22:01:05] [INFO ] Deduced a trap composed of 185 places in 237 ms of which 2 ms to minimize.
[2025-06-02 22:01:06] [INFO ] Deduced a trap composed of 179 places in 231 ms of which 2 ms to minimize.
[2025-06-02 22:01:07] [INFO ] Deduced a trap composed of 166 places in 231 ms of which 3 ms to minimize.
[2025-06-02 22:01:07] [INFO ] Deduced a trap composed of 162 places in 244 ms of which 2 ms to minimize.
[2025-06-02 22:01:07] [INFO ] Deduced a trap composed of 158 places in 252 ms of which 2 ms to minimize.
[2025-06-02 22:01:07] [INFO ] Deduced a trap composed of 158 places in 279 ms of which 2 ms to minimize.
[2025-06-02 22:01:08] [INFO ] Deduced a trap composed of 160 places in 240 ms of which 2 ms to minimize.
[2025-06-02 22:01:08] [INFO ] Deduced a trap composed of 156 places in 240 ms of which 2 ms to minimize.
[2025-06-02 22:01:08] [INFO ] Deduced a trap composed of 168 places in 259 ms of which 2 ms to minimize.
[2025-06-02 22:01:09] [INFO ] Deduced a trap composed of 170 places in 229 ms of which 2 ms to minimize.
[2025-06-02 22:01:09] [INFO ] Deduced a trap composed of 173 places in 265 ms of which 2 ms to minimize.
[2025-06-02 22:01:09] [INFO ] Deduced a trap composed of 175 places in 239 ms of which 2 ms to minimize.
[2025-06-02 22:01:10] [INFO ] Deduced a trap composed of 172 places in 262 ms of which 2 ms to minimize.
[2025-06-02 22:01:10] [INFO ] Deduced a trap composed of 168 places in 239 ms of which 2 ms to minimize.
[2025-06-02 22:01:10] [INFO ] Deduced a trap composed of 167 places in 250 ms of which 2 ms to minimize.
[2025-06-02 22:01:10] [INFO ] Deduced a trap composed of 162 places in 226 ms of which 3 ms to minimize.
[2025-06-02 22:01:11] [INFO ] Deduced a trap composed of 156 places in 239 ms of which 2 ms to minimize.
[2025-06-02 22:01:11] [INFO ] Deduced a trap composed of 158 places in 239 ms of which 2 ms to minimize.
[2025-06-02 22:01:11] [INFO ] Deduced a trap composed of 162 places in 236 ms of which 2 ms to minimize.
[2025-06-02 22:01:12] [INFO ] Deduced a trap composed of 168 places in 261 ms of which 3 ms to minimize.
[2025-06-02 22:01:12] [INFO ] Deduced a trap composed of 168 places in 235 ms of which 3 ms to minimize.
[2025-06-02 22:01:12] [INFO ] Deduced a trap composed of 162 places in 236 ms of which 3 ms to minimize.
[2025-06-02 22:01:13] [INFO ] Deduced a trap composed of 168 places in 242 ms of which 2 ms to minimize.
[2025-06-02 22:01:13] [INFO ] Deduced a trap composed of 164 places in 229 ms of which 3 ms to minimize.
[2025-06-02 22:01:13] [INFO ] Deduced a trap composed of 164 places in 247 ms of which 3 ms to minimize.
[2025-06-02 22:01:14] [INFO ] Deduced a trap composed of 160 places in 228 ms of which 2 ms to minimize.
[2025-06-02 22:01:14] [INFO ] Deduced a trap composed of 158 places in 243 ms of which 3 ms to minimize.
[2025-06-02 22:01:14] [INFO ] Deduced a trap composed of 156 places in 245 ms of which 2 ms to minimize.
[2025-06-02 22:01:15] [INFO ] Deduced a trap composed of 166 places in 256 ms of which 2 ms to minimize.
[2025-06-02 22:01:15] [INFO ] Deduced a trap composed of 166 places in 229 ms of which 2 ms to minimize.
[2025-06-02 22:01:15] [INFO ] Deduced a trap composed of 160 places in 245 ms of which 2 ms to minimize.
[2025-06-02 22:01:16] [INFO ] Deduced a trap composed of 160 places in 242 ms of which 3 ms to minimize.
[2025-06-02 22:01:16] [INFO ] Deduced a trap composed of 158 places in 239 ms of which 3 ms to minimize.
[2025-06-02 22:01:16] [INFO ] Deduced a trap composed of 160 places in 272 ms of which 2 ms to minimize.
[2025-06-02 22:01:17] [INFO ] Deduced a trap composed of 172 places in 230 ms of which 2 ms to minimize.
[2025-06-02 22:01:18] [INFO ] Deduced a trap composed of 164 places in 238 ms of which 2 ms to minimize.
[2025-06-02 22:01:18] [INFO ] Deduced a trap composed of 160 places in 227 ms of which 2 ms to minimize.
[2025-06-02 22:01:19] [INFO ] Deduced a trap composed of 160 places in 225 ms of which 2 ms to minimize.
[2025-06-02 22:01:19] [INFO ] Deduced a trap composed of 158 places in 227 ms of which 2 ms to minimize.
[2025-06-02 22:01:19] [INFO ] Deduced a trap composed of 156 places in 236 ms of which 2 ms to minimize.
[2025-06-02 22:01:23] [INFO ] Deduced a trap composed of 168 places in 237 ms of which 2 ms to minimize.
[2025-06-02 22:01:24] [INFO ] Deduced a trap composed of 164 places in 227 ms of which 2 ms to minimize.
[2025-06-02 22:01:24] [INFO ] Deduced a trap composed of 160 places in 266 ms of which 2 ms to minimize.
[2025-06-02 22:01:24] [INFO ] Deduced a trap composed of 156 places in 255 ms of which 2 ms to minimize.
[2025-06-02 22:01:25] [INFO ] Deduced a trap composed of 162 places in 225 ms of which 3 ms to minimize.
[2025-06-02 22:01:27] [INFO ] Deduced a trap composed of 162 places in 220 ms of which 3 ms to minimize.
[2025-06-02 22:01:28] [INFO ] Deduced a trap composed of 164 places in 251 ms of which 3 ms to minimize.
[2025-06-02 22:01:29] [INFO ] Deduced a trap composed of 158 places in 225 ms of which 2 ms to minimize.
[2025-06-02 22:01:29] [INFO ] Deduced a trap composed of 158 places in 229 ms of which 2 ms to minimize.
[2025-06-02 22:01:30] [INFO ] Deduced a trap composed of 162 places in 247 ms of which 2 ms to minimize.
[2025-06-02 22:01:30] [INFO ] Deduced a trap composed of 160 places in 219 ms of which 2 ms to minimize.
[2025-06-02 22:01:30] [INFO ] Deduced a trap composed of 164 places in 212 ms of which 3 ms to minimize.
[2025-06-02 22:01:31] [INFO ] Deduced a trap composed of 162 places in 218 ms of which 3 ms to minimize.
[2025-06-02 22:01:31] [INFO ] Deduced a trap composed of 162 places in 237 ms of which 2 ms to minimize.
[2025-06-02 22:01:31] [INFO ] Deduced a trap composed of 162 places in 230 ms of which 2 ms to minimize.
[2025-06-02 22:01:51] [INFO ] Trap strengthening (SAT) tested/added 96/96 trap constraints in 59370 ms
TRAPS : Iteration 1
[2025-06-02 22:01:51] [INFO ] After 59483ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2025-06-02 22:01:51] [INFO ] After 59836ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
RANDOM walk for 40000 steps (2927 resets) in 648 ms. (61 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (390 resets) in 131 ms. (303 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 543531 steps, run timeout after 3001 ms. (steps per millisecond=181 ) properties seen :0 out of 1
Probabilistic random walk after 543531 steps, saw 88424 distinct states, run finished after 3001 ms. (steps per millisecond=181 ) properties seen :0
[2025-06-02 22:01:55] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2025-06-02 22:01:55] [INFO ] Invariant cache hit.
[2025-06-02 22:01:55] [INFO ] State equation strengthened by 1 read => feed constraints.
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) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 77/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 313/399 variables, 52/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/400 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/408 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/409 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/409 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 972/1381 variables, 409/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1381 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1381 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1382 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1382 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1382 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1382/1382 variables, and 473 constraints, problems are : Problem set: 0 solved, 1 unsolved in 397 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 410/410 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 77/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 313/399 variables, 52/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/400 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/408 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 22:01:55] [INFO ] Deduced a trap composed of 164 places in 214 ms of which 2 ms to minimize.
[2025-06-02 22:01:56] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 2 ms to minimize.
[2025-06-02 22:01:56] [INFO ] Deduced a trap composed of 168 places in 203 ms of which 2 ms to minimize.
[2025-06-02 22:01:56] [INFO ] Deduced a trap composed of 166 places in 218 ms of which 3 ms to minimize.
[2025-06-02 22:01:56] [INFO ] Deduced a trap composed of 162 places in 207 ms of which 2 ms to minimize.
[2025-06-02 22:01:56] [INFO ] Deduced a trap composed of 164 places in 227 ms of which 3 ms to minimize.
[2025-06-02 22:01:57] [INFO ] Deduced a trap composed of 166 places in 202 ms of which 3 ms to minimize.
[2025-06-02 22:01:57] [INFO ] Deduced a trap composed of 168 places in 224 ms of which 2 ms to minimize.
[2025-06-02 22:01:57] [INFO ] Deduced a trap composed of 162 places in 209 ms of which 2 ms to minimize.
[2025-06-02 22:01:57] [INFO ] Deduced a trap composed of 164 places in 219 ms of which 2 ms to minimize.
[2025-06-02 22:01:58] [INFO ] Deduced a trap composed of 162 places in 209 ms of which 2 ms to minimize.
[2025-06-02 22:01:58] [INFO ] Deduced a trap composed of 166 places in 201 ms of which 3 ms to minimize.
[2025-06-02 22:01:58] [INFO ] Deduced a trap composed of 164 places in 199 ms of which 2 ms to minimize.
[2025-06-02 22:01:58] [INFO ] Deduced a trap composed of 164 places in 214 ms of which 2 ms to minimize.
[2025-06-02 22:01:58] [INFO ] Deduced a trap composed of 166 places in 204 ms of which 3 ms to minimize.
[2025-06-02 22:01:59] [INFO ] Deduced a trap composed of 160 places in 213 ms of which 2 ms to minimize.
[2025-06-02 22:01:59] [INFO ] Deduced a trap composed of 158 places in 209 ms of which 2 ms to minimize.
[2025-06-02 22:01:59] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 2 ms to minimize.
[2025-06-02 22:01:59] [INFO ] Deduced a trap composed of 160 places in 211 ms of which 3 ms to minimize.
[2025-06-02 22:02:00] [INFO ] Deduced a trap composed of 170 places in 232 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 22:02:00] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 3 ms to minimize.
[2025-06-02 22:02:00] [INFO ] Deduced a trap composed of 166 places in 212 ms of which 2 ms to minimize.
[2025-06-02 22:02:00] [INFO ] Deduced a trap composed of 166 places in 200 ms of which 3 ms to minimize.
SMT process timed out in 5588ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 24 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
Running 970 sub problems to find dead transitions.
[2025-06-02 22:02:00] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2025-06-02 22:02:00] [INFO ] Invariant cache hit.
[2025-06-02 22:02:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 970 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2025-06-02 22:02:12] [INFO ] Deduced a trap composed of 117 places in 153 ms of which 2 ms to minimize.
[2025-06-02 22:02:12] [INFO ] Deduced a trap composed of 165 places in 177 ms of which 3 ms to minimize.
[2025-06-02 22:02:12] [INFO ] Deduced a trap composed of 131 places in 168 ms of which 3 ms to minimize.
[2025-06-02 22:02:12] [INFO ] Deduced a trap composed of 131 places in 180 ms of which 2 ms to minimize.
[2025-06-02 22:02:12] [INFO ] Deduced a trap composed of 127 places in 170 ms of which 2 ms to minimize.
[2025-06-02 22:02:13] [INFO ] Deduced a trap composed of 127 places in 166 ms of which 3 ms to minimize.
[2025-06-02 22:02:13] [INFO ] Deduced a trap composed of 137 places in 180 ms of which 4 ms to minimize.
[2025-06-02 22:02:13] [INFO ] Deduced a trap composed of 127 places in 191 ms of which 2 ms to minimize.
[2025-06-02 22:02:13] [INFO ] Deduced a trap composed of 127 places in 151 ms of which 2 ms to minimize.
[2025-06-02 22:02:13] [INFO ] Deduced a trap composed of 127 places in 162 ms of which 2 ms to minimize.
[2025-06-02 22:02:14] [INFO ] Deduced a trap composed of 127 places in 158 ms of which 2 ms to minimize.
[2025-06-02 22:02:14] [INFO ] Deduced a trap composed of 166 places in 167 ms of which 2 ms to minimize.
[2025-06-02 22:02:14] [INFO ] Deduced a trap composed of 122 places in 158 ms of which 2 ms to minimize.
[2025-06-02 22:02:14] [INFO ] Deduced a trap composed of 127 places in 155 ms of which 3 ms to minimize.
[2025-06-02 22:02:14] [INFO ] Deduced a trap composed of 122 places in 158 ms of which 2 ms to minimize.
[2025-06-02 22:02:14] [INFO ] Deduced a trap composed of 116 places in 154 ms of which 2 ms to minimize.
[2025-06-02 22:02:15] [INFO ] Deduced a trap composed of 116 places in 167 ms of which 2 ms to minimize.
[2025-06-02 22:02:15] [INFO ] Deduced a trap composed of 116 places in 181 ms of which 2 ms to minimize.
[2025-06-02 22:02:15] [INFO ] Deduced a trap composed of 116 places in 161 ms of which 4 ms to minimize.
[2025-06-02 22:02:15] [INFO ] Deduced a trap composed of 116 places in 165 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2025-06-02 22:02:16] [INFO ] Deduced a trap composed of 166 places in 170 ms of which 2 ms to minimize.
[2025-06-02 22:02:16] [INFO ] Deduced a trap composed of 168 places in 178 ms of which 3 ms to minimize.
[2025-06-02 22:02:16] [INFO ] Deduced a trap composed of 168 places in 153 ms of which 2 ms to minimize.
[2025-06-02 22:02:16] [INFO ] Deduced a trap composed of 168 places in 161 ms of which 2 ms to minimize.
[2025-06-02 22:02:16] [INFO ] Deduced a trap composed of 170 places in 162 ms of which 3 ms to minimize.
[2025-06-02 22:02:17] [INFO ] Deduced a trap composed of 170 places in 160 ms of which 2 ms to minimize.
[2025-06-02 22:02:17] [INFO ] Deduced a trap composed of 168 places in 149 ms of which 2 ms to minimize.
[2025-06-02 22:02:17] [INFO ] Deduced a trap composed of 170 places in 175 ms of which 3 ms to minimize.
[2025-06-02 22:02:17] [INFO ] Deduced a trap composed of 170 places in 170 ms of which 2 ms to minimize.
[2025-06-02 22:02:17] [INFO ] Deduced a trap composed of 164 places in 170 ms of which 3 ms to minimize.
[2025-06-02 22:02:17] [INFO ] Deduced a trap composed of 166 places in 156 ms of which 2 ms to minimize.
[2025-06-02 22:02:18] [INFO ] Deduced a trap composed of 168 places in 187 ms of which 2 ms to minimize.
[2025-06-02 22:02:18] [INFO ] Deduced a trap composed of 168 places in 177 ms of which 2 ms to minimize.
[2025-06-02 22:02:18] [INFO ] Deduced a trap composed of 168 places in 166 ms of which 2 ms to minimize.
[2025-06-02 22:02:18] [INFO ] Deduced a trap composed of 166 places in 167 ms of which 2 ms to minimize.
[2025-06-02 22:02:18] [INFO ] Deduced a trap composed of 166 places in 185 ms of which 2 ms to minimize.
[2025-06-02 22:02:19] [INFO ] Deduced a trap composed of 166 places in 175 ms of which 3 ms to minimize.
[2025-06-02 22:02:19] [INFO ] Deduced a trap composed of 166 places in 156 ms of which 2 ms to minimize.
[2025-06-02 22:02:19] [INFO ] Deduced a trap composed of 162 places in 168 ms of which 3 ms to minimize.
[2025-06-02 22:02:19] [INFO ] Deduced a trap composed of 164 places in 166 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 970 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 400/1382 variables, and 92 constraints, problems are : Problem set: 0 solved, 970 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 46/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 970/970 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 970 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 970 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 970 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 40/92 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2025-06-02 22:02:26] [INFO ] Deduced a trap composed of 102 places in 180 ms of which 3 ms to minimize.
[2025-06-02 22:02:26] [INFO ] Deduced a trap composed of 130 places in 186 ms of which 2 ms to minimize.
[2025-06-02 22:02:27] [INFO ] Deduced a trap composed of 123 places in 177 ms of which 2 ms to minimize.
[2025-06-02 22:02:27] [INFO ] Deduced a trap composed of 116 places in 175 ms of which 3 ms to minimize.
[2025-06-02 22:02:31] [INFO ] Deduced a trap composed of 13 places in 178 ms of which 3 ms to minimize.
[2025-06-02 22:02:32] [INFO ] Deduced a trap composed of 166 places in 177 ms of which 3 ms to minimize.
[2025-06-02 22:02:32] [INFO ] Deduced a trap composed of 164 places in 163 ms of which 3 ms to minimize.
[2025-06-02 22:02:32] [INFO ] Deduced a trap composed of 162 places in 161 ms of which 3 ms to minimize.
[2025-06-02 22:02:33] [INFO ] Deduced a trap composed of 166 places in 184 ms of which 2 ms to minimize.
[2025-06-02 22:02:33] [INFO ] Deduced a trap composed of 162 places in 165 ms of which 3 ms to minimize.
[2025-06-02 22:02:33] [INFO ] Deduced a trap composed of 168 places in 165 ms of which 2 ms to minimize.
[2025-06-02 22:02:33] [INFO ] Deduced a trap composed of 162 places in 256 ms of which 2 ms to minimize.
[2025-06-02 22:02:34] [INFO ] Deduced a trap composed of 158 places in 243 ms of which 3 ms to minimize.
[2025-06-02 22:02:34] [INFO ] Deduced a trap composed of 162 places in 229 ms of which 2 ms to minimize.
[2025-06-02 22:02:34] [INFO ] Deduced a trap composed of 160 places in 245 ms of which 2 ms to minimize.
[2025-06-02 22:02:34] [INFO ] Deduced a trap composed of 156 places in 247 ms of which 2 ms to minimize.
[2025-06-02 22:02:35] [INFO ] Deduced a trap composed of 165 places in 252 ms of which 3 ms to minimize.
[2025-06-02 22:02:35] [INFO ] Deduced a trap composed of 158 places in 251 ms of which 2 ms to minimize.
[2025-06-02 22:02:35] [INFO ] Deduced a trap composed of 158 places in 255 ms of which 2 ms to minimize.
[2025-06-02 22:02:35] [INFO ] Deduced a trap composed of 162 places in 229 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2025-06-02 22:02:37] [INFO ] Deduced a trap composed of 18 places in 194 ms of which 1 ms to minimize.
[2025-06-02 22:02:43] [INFO ] Deduced a trap composed of 160 places in 162 ms of which 2 ms to minimize.
[2025-06-02 22:02:43] [INFO ] Deduced a trap composed of 154 places in 176 ms of which 2 ms to minimize.
[2025-06-02 22:02:43] [INFO ] Deduced a trap composed of 154 places in 170 ms of which 2 ms to minimize.
[2025-06-02 22:02:44] [INFO ] Deduced a trap composed of 158 places in 169 ms of which 3 ms to minimize.
[2025-06-02 22:02:44] [INFO ] Deduced a trap composed of 158 places in 192 ms of which 2 ms to minimize.
[2025-06-02 22:02:44] [INFO ] Deduced a trap composed of 162 places in 244 ms of which 2 ms to minimize.
[2025-06-02 22:02:44] [INFO ] Deduced a trap composed of 164 places in 252 ms of which 2 ms to minimize.
[2025-06-02 22:02:45] [INFO ] Deduced a trap composed of 164 places in 254 ms of which 2 ms to minimize.
[2025-06-02 22:02:45] [INFO ] Deduced a trap composed of 164 places in 256 ms of which 2 ms to minimize.
SMT process timed out in 44600ms, After SMT, problems are : Problem set: 0 solved, 970 unsolved
Search for dead transitions found 0 dead transitions in 44610ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44637 ms. Remains : 410/410 places, 981/981 transitions.
RANDOM walk for 40000 steps (2885 resets) in 693 ms. (57 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (405 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 543056 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :0 out of 1
Probabilistic random walk after 543056 steps, saw 88337 distinct states, run finished after 3001 ms. (steps per millisecond=180 ) properties seen :0
[2025-06-02 22:02:48] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2025-06-02 22:02:48] [INFO ] Invariant cache hit.
[2025-06-02 22:02:48] [INFO ] State equation strengthened by 1 read => feed constraints.
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) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 77/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 313/399 variables, 52/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/400 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/408 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/409 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/409 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 972/1381 variables, 409/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1381 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1381 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1382 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1382 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1382 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1382/1382 variables, and 473 constraints, problems are : Problem set: 0 solved, 1 unsolved in 501 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 410/410 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 77/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 313/399 variables, 52/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/400 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/408 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 22:02:49] [INFO ] Deduced a trap composed of 164 places in 213 ms of which 2 ms to minimize.
[2025-06-02 22:02:49] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 2 ms to minimize.
[2025-06-02 22:02:49] [INFO ] Deduced a trap composed of 168 places in 206 ms of which 2 ms to minimize.
[2025-06-02 22:02:50] [INFO ] Deduced a trap composed of 166 places in 216 ms of which 3 ms to minimize.
[2025-06-02 22:02:50] [INFO ] Deduced a trap composed of 162 places in 206 ms of which 2 ms to minimize.
[2025-06-02 22:02:50] [INFO ] Deduced a trap composed of 164 places in 226 ms of which 2 ms to minimize.
[2025-06-02 22:02:50] [INFO ] Deduced a trap composed of 166 places in 214 ms of which 3 ms to minimize.
[2025-06-02 22:02:50] [INFO ] Deduced a trap composed of 168 places in 203 ms of which 2 ms to minimize.
[2025-06-02 22:02:51] [INFO ] Deduced a trap composed of 162 places in 216 ms of which 2 ms to minimize.
[2025-06-02 22:02:51] [INFO ] Deduced a trap composed of 164 places in 215 ms of which 3 ms to minimize.
[2025-06-02 22:02:51] [INFO ] Deduced a trap composed of 162 places in 208 ms of which 2 ms to minimize.
[2025-06-02 22:02:51] [INFO ] Deduced a trap composed of 166 places in 202 ms of which 2 ms to minimize.
[2025-06-02 22:02:52] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 2 ms to minimize.
[2025-06-02 22:02:52] [INFO ] Deduced a trap composed of 164 places in 210 ms of which 2 ms to minimize.
[2025-06-02 22:02:52] [INFO ] Deduced a trap composed of 166 places in 207 ms of which 2 ms to minimize.
[2025-06-02 22:02:52] [INFO ] Deduced a trap composed of 160 places in 210 ms of which 2 ms to minimize.
[2025-06-02 22:02:52] [INFO ] Deduced a trap composed of 158 places in 208 ms of which 2 ms to minimize.
[2025-06-02 22:02:53] [INFO ] Deduced a trap composed of 164 places in 199 ms of which 3 ms to minimize.
[2025-06-02 22:02:53] [INFO ] Deduced a trap composed of 160 places in 217 ms of which 2 ms to minimize.
[2025-06-02 22:02:53] [INFO ] Deduced a trap composed of 170 places in 209 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 22:02:53] [INFO ] Deduced a trap composed of 164 places in 231 ms of which 2 ms to minimize.
[2025-06-02 22:02:54] [INFO ] Deduced a trap composed of 166 places in 212 ms of which 2 ms to minimize.
[2025-06-02 22:02:54] [INFO ] Deduced a trap composed of 166 places in 195 ms of which 2 ms to minimize.
[2025-06-02 22:02:54] [INFO ] Deduced a trap composed of 164 places in 214 ms of which 2 ms to minimize.
[2025-06-02 22:02:54] [INFO ] Deduced a trap composed of 162 places in 204 ms of which 2 ms to minimize.
[2025-06-02 22:02:54] [INFO ] Deduced a trap composed of 156 places in 198 ms of which 3 ms to minimize.
[2025-06-02 22:02:55] [INFO ] Deduced a trap composed of 162 places in 218 ms of which 3 ms to minimize.
[2025-06-02 22:02:55] [INFO ] Deduced a trap composed of 164 places in 220 ms of which 3 ms to minimize.
[2025-06-02 22:02:55] [INFO ] Deduced a trap composed of 158 places in 213 ms of which 2 ms to minimize.
[2025-06-02 22:02:55] [INFO ] Deduced a trap composed of 162 places in 212 ms of which 2 ms to minimize.
[2025-06-02 22:02:56] [INFO ] Deduced a trap composed of 162 places in 210 ms of which 2 ms to minimize.
[2025-06-02 22:02:56] [INFO ] Deduced a trap composed of 158 places in 199 ms of which 2 ms to minimize.
[2025-06-02 22:02:56] [INFO ] Deduced a trap composed of 166 places in 217 ms of which 3 ms to minimize.
[2025-06-02 22:02:56] [INFO ] Deduced a trap composed of 158 places in 215 ms of which 2 ms to minimize.
[2025-06-02 22:02:57] [INFO ] Deduced a trap composed of 170 places in 195 ms of which 3 ms to minimize.
[2025-06-02 22:02:57] [INFO ] Deduced a trap composed of 170 places in 203 ms of which 2 ms to minimize.
[2025-06-02 22:02:57] [INFO ] Deduced a trap composed of 170 places in 221 ms of which 3 ms to minimize.
[2025-06-02 22:02:57] [INFO ] Deduced a trap composed of 172 places in 206 ms of which 2 ms to minimize.
[2025-06-02 22:02:58] [INFO ] Deduced a trap composed of 166 places in 231 ms of which 2 ms to minimize.
[2025-06-02 22:02:58] [INFO ] Deduced a trap composed of 160 places in 218 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/408 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 22:02:58] [INFO ] Deduced a trap composed of 162 places in 215 ms of which 3 ms to minimize.
[2025-06-02 22:02:58] [INFO ] Deduced a trap composed of 168 places in 196 ms of which 3 ms to minimize.
[2025-06-02 22:02:59] [INFO ] Deduced a trap composed of 170 places in 198 ms of which 3 ms to minimize.
[2025-06-02 22:02:59] [INFO ] Deduced a trap composed of 166 places in 208 ms of which 2 ms to minimize.
[2025-06-02 22:02:59] [INFO ] Deduced a trap composed of 164 places in 216 ms of which 2 ms to minimize.
[2025-06-02 22:02:59] [INFO ] Deduced a trap composed of 158 places in 216 ms of which 3 ms to minimize.
[2025-06-02 22:02:59] [INFO ] Deduced a trap composed of 164 places in 222 ms of which 2 ms to minimize.
[2025-06-02 22:03:00] [INFO ] Deduced a trap composed of 168 places in 202 ms of which 3 ms to minimize.
[2025-06-02 22:03:00] [INFO ] Deduced a trap composed of 164 places in 211 ms of which 3 ms to minimize.
[2025-06-02 22:03:00] [INFO ] Deduced a trap composed of 160 places in 206 ms of which 3 ms to minimize.
[2025-06-02 22:03:00] [INFO ] Deduced a trap composed of 162 places in 217 ms of which 2 ms to minimize.
[2025-06-02 22:03:01] [INFO ] Deduced a trap composed of 162 places in 213 ms of which 3 ms to minimize.
[2025-06-02 22:03:01] [INFO ] Deduced a trap composed of 168 places in 208 ms of which 2 ms to minimize.
[2025-06-02 22:03:01] [INFO ] Deduced a trap composed of 166 places in 211 ms of which 2 ms to minimize.
[2025-06-02 22:03:01] [INFO ] Deduced a trap composed of 160 places in 217 ms of which 2 ms to minimize.
[2025-06-02 22:03:02] [INFO ] Deduced a trap composed of 166 places in 206 ms of which 3 ms to minimize.
[2025-06-02 22:03:02] [INFO ] Deduced a trap composed of 160 places in 222 ms of which 2 ms to minimize.
[2025-06-02 22:03:02] [INFO ] Deduced a trap composed of 170 places in 237 ms of which 3 ms to minimize.
[2025-06-02 22:03:02] [INFO ] Deduced a trap composed of 158 places in 218 ms of which 3 ms to minimize.
[2025-06-02 22:03:03] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/408 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 22:03:03] [INFO ] Deduced a trap composed of 168 places in 221 ms of which 3 ms to minimize.
[2025-06-02 22:03:03] [INFO ] Deduced a trap composed of 166 places in 211 ms of which 2 ms to minimize.
[2025-06-02 22:03:03] [INFO ] Deduced a trap composed of 168 places in 204 ms of which 2 ms to minimize.
[2025-06-02 22:03:04] [INFO ] Deduced a trap composed of 162 places in 230 ms of which 3 ms to minimize.
[2025-06-02 22:03:04] [INFO ] Deduced a trap composed of 158 places in 225 ms of which 2 ms to minimize.
[2025-06-02 22:03:04] [INFO ] Deduced a trap composed of 170 places in 204 ms of which 3 ms to minimize.
[2025-06-02 22:03:04] [INFO ] Deduced a trap composed of 166 places in 206 ms of which 2 ms to minimize.
[2025-06-02 22:03:04] [INFO ] Deduced a trap composed of 164 places in 215 ms of which 2 ms to minimize.
[2025-06-02 22:03:05] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 3 ms to minimize.
[2025-06-02 22:03:05] [INFO ] Deduced a trap composed of 164 places in 193 ms of which 3 ms to minimize.
[2025-06-02 22:03:05] [INFO ] Deduced a trap composed of 170 places in 210 ms of which 2 ms to minimize.
[2025-06-02 22:03:06] [INFO ] Deduced a trap composed of 162 places in 221 ms of which 3 ms to minimize.
[2025-06-02 22:03:06] [INFO ] Deduced a trap composed of 164 places in 207 ms of which 2 ms to minimize.
[2025-06-02 22:03:06] [INFO ] Deduced a trap composed of 160 places in 215 ms of which 2 ms to minimize.
[2025-06-02 22:03:06] [INFO ] Deduced a trap composed of 158 places in 211 ms of which 2 ms to minimize.
[2025-06-02 22:03:06] [INFO ] Deduced a trap composed of 162 places in 213 ms of which 3 ms to minimize.
[2025-06-02 22:03:08] [INFO ] Deduced a trap composed of 164 places in 192 ms of which 2 ms to minimize.
[2025-06-02 22:03:09] [INFO ] Deduced a trap composed of 160 places in 213 ms of which 3 ms to minimize.
[2025-06-02 22:03:09] [INFO ] Deduced a trap composed of 166 places in 213 ms of which 2 ms to minimize.
[2025-06-02 22:03:09] [INFO ] Deduced a trap composed of 158 places in 206 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/408 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 22:03:10] [INFO ] Deduced a trap composed of 172 places in 210 ms of which 2 ms to minimize.
[2025-06-02 22:03:10] [INFO ] Deduced a trap composed of 168 places in 223 ms of which 2 ms to minimize.
[2025-06-02 22:03:10] [INFO ] Deduced a trap composed of 158 places in 198 ms of which 2 ms to minimize.
[2025-06-02 22:03:10] [INFO ] Deduced a trap composed of 164 places in 207 ms of which 3 ms to minimize.
[2025-06-02 22:03:11] [INFO ] Deduced a trap composed of 168 places in 209 ms of which 2 ms to minimize.
[2025-06-02 22:03:11] [INFO ] Deduced a trap composed of 166 places in 214 ms of which 3 ms to minimize.
[2025-06-02 22:03:11] [INFO ] Deduced a trap composed of 160 places in 211 ms of which 2 ms to minimize.
[2025-06-02 22:03:11] [INFO ] Deduced a trap composed of 166 places in 215 ms of which 2 ms to minimize.
[2025-06-02 22:03:11] [INFO ] Deduced a trap composed of 158 places in 202 ms of which 2 ms to minimize.
[2025-06-02 22:03:12] [INFO ] Deduced a trap composed of 160 places in 209 ms of which 3 ms to minimize.
[2025-06-02 22:03:12] [INFO ] Deduced a trap composed of 162 places in 218 ms of which 2 ms to minimize.
[2025-06-02 22:03:12] [INFO ] Deduced a trap composed of 164 places in 207 ms of which 3 ms to minimize.
[2025-06-02 22:03:12] [INFO ] Deduced a trap composed of 166 places in 191 ms of which 3 ms to minimize.
[2025-06-02 22:03:12] [INFO ] Deduced a trap composed of 168 places in 199 ms of which 3 ms to minimize.
[2025-06-02 22:03:13] [INFO ] Deduced a trap composed of 166 places in 212 ms of which 3 ms to minimize.
[2025-06-02 22:03:13] [INFO ] Deduced a trap composed of 162 places in 210 ms of which 3 ms to minimize.
[2025-06-02 22:03:13] [INFO ] Deduced a trap composed of 164 places in 203 ms of which 2 ms to minimize.
[2025-06-02 22:03:13] [INFO ] Deduced a trap composed of 166 places in 220 ms of which 2 ms to minimize.
[2025-06-02 22:03:14] [INFO ] Deduced a trap composed of 166 places in 189 ms of which 2 ms to minimize.
[2025-06-02 22:03:14] [INFO ] Deduced a trap composed of 164 places in 209 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/408 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 22:03:14] [INFO ] Deduced a trap composed of 164 places in 196 ms of which 3 ms to minimize.
[2025-06-02 22:03:14] [INFO ] Deduced a trap composed of 172 places in 198 ms of which 3 ms to minimize.
[2025-06-02 22:03:14] [INFO ] Deduced a trap composed of 162 places in 198 ms of which 2 ms to minimize.
[2025-06-02 22:03:15] [INFO ] Deduced a trap composed of 160 places in 191 ms of which 2 ms to minimize.
[2025-06-02 22:03:15] [INFO ] Deduced a trap composed of 166 places in 199 ms of which 2 ms to minimize.
[2025-06-02 22:03:15] [INFO ] Deduced a trap composed of 164 places in 218 ms of which 2 ms to minimize.
[2025-06-02 22:03:15] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 3 ms to minimize.
[2025-06-02 22:03:16] [INFO ] Deduced a trap composed of 164 places in 178 ms of which 3 ms to minimize.
[2025-06-02 22:03:16] [INFO ] Deduced a trap composed of 164 places in 192 ms of which 2 ms to minimize.
[2025-06-02 22:03:16] [INFO ] Deduced a trap composed of 156 places in 193 ms of which 3 ms to minimize.
[2025-06-02 22:03:16] [INFO ] Deduced a trap composed of 162 places in 203 ms of which 3 ms to minimize.
[2025-06-02 22:03:17] [INFO ] Deduced a trap composed of 158 places in 199 ms of which 2 ms to minimize.
[2025-06-02 22:03:17] [INFO ] Deduced a trap composed of 164 places in 214 ms of which 2 ms to minimize.
[2025-06-02 22:03:18] [INFO ] Deduced a trap composed of 167 places in 216 ms of which 3 ms to minimize.
[2025-06-02 22:03:18] [INFO ] Deduced a trap composed of 162 places in 233 ms of which 2 ms to minimize.
[2025-06-02 22:03:19] [INFO ] Deduced a trap composed of 162 places in 224 ms of which 3 ms to minimize.
[2025-06-02 22:03:19] [INFO ] Deduced a trap composed of 162 places in 222 ms of which 2 ms to minimize.
[2025-06-02 22:03:19] [INFO ] Deduced a trap composed of 166 places in 226 ms of which 2 ms to minimize.
[2025-06-02 22:03:19] [INFO ] Deduced a trap composed of 162 places in 227 ms of which 2 ms to minimize.
[2025-06-02 22:03:20] [INFO ] Deduced a trap composed of 164 places in 220 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/408 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 22:03:20] [INFO ] Deduced a trap composed of 168 places in 217 ms of which 2 ms to minimize.
[2025-06-02 22:03:20] [INFO ] Deduced a trap composed of 169 places in 228 ms of which 2 ms to minimize.
[2025-06-02 22:03:20] [INFO ] Deduced a trap composed of 160 places in 214 ms of which 2 ms to minimize.
[2025-06-02 22:03:21] [INFO ] Deduced a trap composed of 168 places in 210 ms of which 2 ms to minimize.
[2025-06-02 22:03:21] [INFO ] Deduced a trap composed of 160 places in 201 ms of which 2 ms to minimize.
[2025-06-02 22:03:21] [INFO ] Deduced a trap composed of 158 places in 201 ms of which 2 ms to minimize.
[2025-06-02 22:03:22] [INFO ] Deduced a trap composed of 168 places in 209 ms of which 2 ms to minimize.
[2025-06-02 22:03:22] [INFO ] Deduced a trap composed of 168 places in 231 ms of which 2 ms to minimize.
[2025-06-02 22:03:22] [INFO ] Deduced a trap composed of 138 places in 222 ms of which 2 ms to minimize.
[2025-06-02 22:03:22] [INFO ] Deduced a trap composed of 168 places in 221 ms of which 2 ms to minimize.
[2025-06-02 22:03:22] [INFO ] Deduced a trap composed of 166 places in 213 ms of which 2 ms to minimize.
[2025-06-02 22:03:23] [INFO ] Deduced a trap composed of 158 places in 236 ms of which 2 ms to minimize.
[2025-06-02 22:03:23] [INFO ] Deduced a trap composed of 168 places in 214 ms of which 2 ms to minimize.
[2025-06-02 22:03:23] [INFO ] Deduced a trap composed of 168 places in 216 ms of which 3 ms to minimize.
[2025-06-02 22:03:23] [INFO ] Deduced a trap composed of 142 places in 204 ms of which 3 ms to minimize.
[2025-06-02 22:03:24] [INFO ] Deduced a trap composed of 170 places in 225 ms of which 2 ms to minimize.
[2025-06-02 22:03:24] [INFO ] Deduced a trap composed of 164 places in 212 ms of which 2 ms to minimize.
[2025-06-02 22:03:24] [INFO ] Deduced a trap composed of 168 places in 215 ms of which 3 ms to minimize.
[2025-06-02 22:03:25] [INFO ] Deduced a trap composed of 168 places in 188 ms of which 3 ms to minimize.
[2025-06-02 22:03:26] [INFO ] Deduced a trap composed of 160 places in 408 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/408 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 22:03:26] [INFO ] Deduced a trap composed of 162 places in 328 ms of which 3 ms to minimize.
[2025-06-02 22:03:27] [INFO ] Deduced a trap composed of 164 places in 215 ms of which 3 ms to minimize.
[2025-06-02 22:03:27] [INFO ] Deduced a trap composed of 164 places in 216 ms of which 2 ms to minimize.
[2025-06-02 22:03:27] [INFO ] Deduced a trap composed of 160 places in 204 ms of which 2 ms to minimize.
[2025-06-02 22:03:28] [INFO ] Deduced a trap composed of 160 places in 219 ms of which 2 ms to minimize.
[2025-06-02 22:03:28] [INFO ] Deduced a trap composed of 160 places in 228 ms of which 2 ms to minimize.
[2025-06-02 22:03:28] [INFO ] Deduced a trap composed of 160 places in 243 ms of which 2 ms to minimize.
[2025-06-02 22:03:28] [INFO ] Deduced a trap composed of 160 places in 225 ms of which 2 ms to minimize.
[2025-06-02 22:03:29] [INFO ] Deduced a trap composed of 164 places in 240 ms of which 3 ms to minimize.
[2025-06-02 22:03:29] [INFO ] Deduced a trap composed of 156 places in 235 ms of which 3 ms to minimize.
[2025-06-02 22:03:29] [INFO ] Deduced a trap composed of 158 places in 230 ms of which 2 ms to minimize.
[2025-06-02 22:03:29] [INFO ] Deduced a trap composed of 162 places in 223 ms of which 2 ms to minimize.
[2025-06-02 22:03:30] [INFO ] Deduced a trap composed of 156 places in 248 ms of which 2 ms to minimize.
[2025-06-02 22:03:30] [INFO ] Deduced a trap composed of 164 places in 225 ms of which 2 ms to minimize.
[2025-06-02 22:03:30] [INFO ] Deduced a trap composed of 158 places in 215 ms of which 2 ms to minimize.
[2025-06-02 22:03:30] [INFO ] Deduced a trap composed of 164 places in 210 ms of which 3 ms to minimize.
[2025-06-02 22:03:31] [INFO ] Deduced a trap composed of 164 places in 226 ms of which 2 ms to minimize.
[2025-06-02 22:03:31] [INFO ] Deduced a trap composed of 162 places in 230 ms of which 2 ms to minimize.
[2025-06-02 22:03:31] [INFO ] Deduced a trap composed of 158 places in 205 ms of which 2 ms to minimize.
[2025-06-02 22:03:31] [INFO ] Deduced a trap composed of 166 places in 221 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/408 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 22:03:31] [INFO ] Deduced a trap composed of 160 places in 220 ms of which 2 ms to minimize.
[2025-06-02 22:03:32] [INFO ] Deduced a trap composed of 156 places in 238 ms of which 3 ms to minimize.
[2025-06-02 22:03:32] [INFO ] Deduced a trap composed of 160 places in 219 ms of which 2 ms to minimize.
[2025-06-02 22:03:32] [INFO ] Deduced a trap composed of 162 places in 224 ms of which 2 ms to minimize.
[2025-06-02 22:03:32] [INFO ] Deduced a trap composed of 166 places in 225 ms of which 3 ms to minimize.
[2025-06-02 22:03:33] [INFO ] Deduced a trap composed of 164 places in 231 ms of which 2 ms to minimize.
[2025-06-02 22:03:33] [INFO ] Deduced a trap composed of 166 places in 228 ms of which 3 ms to minimize.
[2025-06-02 22:03:33] [INFO ] Deduced a trap composed of 160 places in 231 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 408/1382 variables, and 229 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45007 ms.
Refiners :[Positive P Invariants (semi-flows): 54/55 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 168/168 constraints]
After SMT, in 45532ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 16 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 410/410 places, 981/981 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 16 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2025-06-02 22:03:34] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2025-06-02 22:03:34] [INFO ] Invariant cache hit.
[2025-06-02 22:03:34] [INFO ] Implicit Places using invariants in 520 ms returned []
[2025-06-02 22:03:34] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2025-06-02 22:03:34] [INFO ] Invariant cache hit.
[2025-06-02 22:03:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 22:03:36] [INFO ] Implicit Places using invariants and state equation in 1530 ms returned []
Implicit Place search using SMT with State Equation took 2085 ms to find 0 implicit places.
[2025-06-02 22:03:36] [INFO ] Redundant transitions in 8 ms returned []
Running 970 sub problems to find dead transitions.
[2025-06-02 22:03:36] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2025-06-02 22:03:36] [INFO ] Invariant cache hit.
[2025-06-02 22:03:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 970 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2025-06-02 22:03:46] [INFO ] Deduced a trap composed of 117 places in 149 ms of which 2 ms to minimize.
[2025-06-02 22:03:47] [INFO ] Deduced a trap composed of 165 places in 161 ms of which 2 ms to minimize.
[2025-06-02 22:03:47] [INFO ] Deduced a trap composed of 131 places in 162 ms of which 2 ms to minimize.
[2025-06-02 22:03:47] [INFO ] Deduced a trap composed of 131 places in 152 ms of which 2 ms to minimize.
[2025-06-02 22:03:47] [INFO ] Deduced a trap composed of 127 places in 164 ms of which 2 ms to minimize.
[2025-06-02 22:03:47] [INFO ] Deduced a trap composed of 127 places in 152 ms of which 2 ms to minimize.
[2025-06-02 22:03:48] [INFO ] Deduced a trap composed of 137 places in 164 ms of which 3 ms to minimize.
[2025-06-02 22:03:48] [INFO ] Deduced a trap composed of 127 places in 159 ms of which 2 ms to minimize.
[2025-06-02 22:03:48] [INFO ] Deduced a trap composed of 127 places in 159 ms of which 2 ms to minimize.
[2025-06-02 22:03:48] [INFO ] Deduced a trap composed of 127 places in 164 ms of which 2 ms to minimize.
[2025-06-02 22:03:48] [INFO ] Deduced a trap composed of 127 places in 168 ms of which 2 ms to minimize.
[2025-06-02 22:03:48] [INFO ] Deduced a trap composed of 166 places in 163 ms of which 3 ms to minimize.
[2025-06-02 22:03:49] [INFO ] Deduced a trap composed of 122 places in 158 ms of which 2 ms to minimize.
[2025-06-02 22:03:49] [INFO ] Deduced a trap composed of 127 places in 156 ms of which 3 ms to minimize.
[2025-06-02 22:03:49] [INFO ] Deduced a trap composed of 122 places in 161 ms of which 2 ms to minimize.
[2025-06-02 22:03:49] [INFO ] Deduced a trap composed of 116 places in 163 ms of which 2 ms to minimize.
[2025-06-02 22:03:49] [INFO ] Deduced a trap composed of 116 places in 171 ms of which 3 ms to minimize.
[2025-06-02 22:03:49] [INFO ] Deduced a trap composed of 116 places in 161 ms of which 2 ms to minimize.
[2025-06-02 22:03:50] [INFO ] Deduced a trap composed of 116 places in 155 ms of which 2 ms to minimize.
[2025-06-02 22:03:50] [INFO ] Deduced a trap composed of 116 places in 154 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2025-06-02 22:03:50] [INFO ] Deduced a trap composed of 166 places in 154 ms of which 3 ms to minimize.
[2025-06-02 22:03:50] [INFO ] Deduced a trap composed of 168 places in 153 ms of which 2 ms to minimize.
[2025-06-02 22:03:51] [INFO ] Deduced a trap composed of 168 places in 158 ms of which 2 ms to minimize.
[2025-06-02 22:03:51] [INFO ] Deduced a trap composed of 168 places in 169 ms of which 2 ms to minimize.
[2025-06-02 22:03:51] [INFO ] Deduced a trap composed of 170 places in 167 ms of which 3 ms to minimize.
[2025-06-02 22:03:51] [INFO ] Deduced a trap composed of 170 places in 164 ms of which 2 ms to minimize.
[2025-06-02 22:03:51] [INFO ] Deduced a trap composed of 168 places in 143 ms of which 2 ms to minimize.
[2025-06-02 22:03:52] [INFO ] Deduced a trap composed of 170 places in 169 ms of which 2 ms to minimize.
[2025-06-02 22:03:52] [INFO ] Deduced a trap composed of 170 places in 161 ms of which 2 ms to minimize.
[2025-06-02 22:03:52] [INFO ] Deduced a trap composed of 164 places in 159 ms of which 2 ms to minimize.
[2025-06-02 22:03:52] [INFO ] Deduced a trap composed of 166 places in 151 ms of which 2 ms to minimize.
[2025-06-02 22:03:52] [INFO ] Deduced a trap composed of 168 places in 167 ms of which 2 ms to minimize.
[2025-06-02 22:03:52] [INFO ] Deduced a trap composed of 168 places in 162 ms of which 2 ms to minimize.
[2025-06-02 22:03:53] [INFO ] Deduced a trap composed of 168 places in 182 ms of which 2 ms to minimize.
[2025-06-02 22:03:53] [INFO ] Deduced a trap composed of 166 places in 157 ms of which 3 ms to minimize.
[2025-06-02 22:03:53] [INFO ] Deduced a trap composed of 166 places in 155 ms of which 2 ms to minimize.
[2025-06-02 22:03:53] [INFO ] Deduced a trap composed of 166 places in 157 ms of which 2 ms to minimize.
[2025-06-02 22:03:53] [INFO ] Deduced a trap composed of 166 places in 159 ms of which 3 ms to minimize.
[2025-06-02 22:03:53] [INFO ] Deduced a trap composed of 162 places in 157 ms of which 2 ms to minimize.
[2025-06-02 22:03:54] [INFO ] Deduced a trap composed of 164 places in 159 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2025-06-02 22:04:00] [INFO ] Deduced a trap composed of 166 places in 142 ms of which 2 ms to minimize.
[2025-06-02 22:04:01] [INFO ] Deduced a trap composed of 164 places in 168 ms of which 2 ms to minimize.
[2025-06-02 22:04:01] [INFO ] Deduced a trap composed of 136 places in 170 ms of which 2 ms to minimize.
[2025-06-02 22:04:01] [INFO ] Deduced a trap composed of 164 places in 160 ms of which 2 ms to minimize.
[2025-06-02 22:04:01] [INFO ] Deduced a trap composed of 166 places in 160 ms of which 3 ms to minimize.
[2025-06-02 22:04:01] [INFO ] Deduced a trap composed of 162 places in 161 ms of which 3 ms to minimize.
[2025-06-02 22:04:01] [INFO ] Deduced a trap composed of 164 places in 157 ms of which 3 ms to minimize.
[2025-06-02 22:04:02] [INFO ] Deduced a trap composed of 162 places in 161 ms of which 2 ms to minimize.
[2025-06-02 22:04:02] [INFO ] Deduced a trap composed of 166 places in 175 ms of which 2 ms to minimize.
[2025-06-02 22:04:02] [INFO ] Deduced a trap composed of 166 places in 168 ms of which 2 ms to minimize.
[2025-06-02 22:04:02] [INFO ] Deduced a trap composed of 164 places in 164 ms of which 3 ms to minimize.
[2025-06-02 22:04:02] [INFO ] Deduced a trap composed of 168 places in 170 ms of which 2 ms to minimize.
[2025-06-02 22:04:03] [INFO ] Deduced a trap composed of 166 places in 155 ms of which 3 ms to minimize.
[2025-06-02 22:04:03] [INFO ] Deduced a trap composed of 164 places in 173 ms of which 2 ms to minimize.
[2025-06-02 22:04:03] [INFO ] Deduced a trap composed of 116 places in 153 ms of which 2 ms to minimize.
[2025-06-02 22:04:03] [INFO ] Deduced a trap composed of 162 places in 166 ms of which 2 ms to minimize.
[2025-06-02 22:04:03] [INFO ] Deduced a trap composed of 162 places in 159 ms of which 3 ms to minimize.
[2025-06-02 22:04:03] [INFO ] Deduced a trap composed of 160 places in 160 ms of which 2 ms to minimize.
[2025-06-02 22:04:04] [INFO ] Deduced a trap composed of 121 places in 162 ms of which 3 ms to minimize.
[2025-06-02 22:04:04] [INFO ] Deduced a trap composed of 160 places in 149 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2025-06-02 22:04:06] [INFO ] Deduced a trap composed of 58 places in 158 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 400/1382 variables, and 113 constraints, problems are : Problem set: 0 solved, 970 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 46/55 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 970/970 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 970 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 970 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 970 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 61/113 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2025-06-02 22:04:11] [INFO ] Deduced a trap composed of 111 places in 174 ms of which 2 ms to minimize.
[2025-06-02 22:04:12] [INFO ] Deduced a trap composed of 171 places in 174 ms of which 2 ms to minimize.
[2025-06-02 22:04:12] [INFO ] Deduced a trap composed of 183 places in 160 ms of which 3 ms to minimize.
[2025-06-02 22:04:12] [INFO ] Deduced a trap composed of 123 places in 161 ms of which 2 ms to minimize.
[2025-06-02 22:04:12] [INFO ] Deduced a trap composed of 141 places in 169 ms of which 2 ms to minimize.
[2025-06-02 22:04:12] [INFO ] Deduced a trap composed of 171 places in 159 ms of which 3 ms to minimize.
[2025-06-02 22:04:12] [INFO ] Deduced a trap composed of 171 places in 161 ms of which 2 ms to minimize.
[2025-06-02 22:04:13] [INFO ] Deduced a trap composed of 174 places in 169 ms of which 2 ms to minimize.
[2025-06-02 22:04:13] [INFO ] Deduced a trap composed of 177 places in 160 ms of which 3 ms to minimize.
[2025-06-02 22:04:13] [INFO ] Deduced a trap composed of 174 places in 167 ms of which 3 ms to minimize.
[2025-06-02 22:04:13] [INFO ] Deduced a trap composed of 171 places in 166 ms of which 3 ms to minimize.
[2025-06-02 22:04:13] [INFO ] Deduced a trap composed of 162 places in 156 ms of which 2 ms to minimize.
[2025-06-02 22:04:14] [INFO ] Deduced a trap composed of 171 places in 168 ms of which 2 ms to minimize.
[2025-06-02 22:04:14] [INFO ] Deduced a trap composed of 174 places in 146 ms of which 2 ms to minimize.
[2025-06-02 22:04:14] [INFO ] Deduced a trap composed of 174 places in 239 ms of which 2 ms to minimize.
[2025-06-02 22:04:14] [INFO ] Deduced a trap composed of 174 places in 225 ms of which 3 ms to minimize.
[2025-06-02 22:04:15] [INFO ] Deduced a trap composed of 180 places in 236 ms of which 2 ms to minimize.
[2025-06-02 22:04:15] [INFO ] Deduced a trap composed of 180 places in 247 ms of which 2 ms to minimize.
[2025-06-02 22:04:15] [INFO ] Deduced a trap composed of 186 places in 251 ms of which 3 ms to minimize.
[2025-06-02 22:04:15] [INFO ] Deduced a trap composed of 174 places in 240 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 20/133 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2025-06-02 22:04:17] [INFO ] Deduced a trap composed of 18 places in 158 ms of which 1 ms to minimize.
[2025-06-02 22:04:17] [INFO ] Deduced a trap composed of 132 places in 249 ms of which 2 ms to minimize.
[2025-06-02 22:04:18] [INFO ] Deduced a trap composed of 116 places in 232 ms of which 2 ms to minimize.
[2025-06-02 22:04:18] [INFO ] Deduced a trap composed of 116 places in 245 ms of which 2 ms to minimize.
[2025-06-02 22:04:18] [INFO ] Deduced a trap composed of 116 places in 248 ms of which 2 ms to minimize.
[2025-06-02 22:04:19] [INFO ] Deduced a trap composed of 130 places in 269 ms of which 2 ms to minimize.
[2025-06-02 22:04:24] [INFO ] Deduced a trap composed of 171 places in 223 ms of which 2 ms to minimize.
[2025-06-02 22:04:24] [INFO ] Deduced a trap composed of 156 places in 237 ms of which 2 ms to minimize.
[2025-06-02 22:04:24] [INFO ] Deduced a trap composed of 162 places in 247 ms of which 2 ms to minimize.
[2025-06-02 22:04:25] [INFO ] Deduced a trap composed of 173 places in 245 ms of which 3 ms to minimize.
[2025-06-02 22:04:25] [INFO ] Deduced a trap composed of 162 places in 232 ms of which 3 ms to minimize.
[2025-06-02 22:04:25] [INFO ] Deduced a trap composed of 164 places in 269 ms of which 3 ms to minimize.
[2025-06-02 22:04:25] [INFO ] Deduced a trap composed of 162 places in 255 ms of which 2 ms to minimize.
[2025-06-02 22:04:26] [INFO ] Deduced a trap composed of 160 places in 230 ms of which 2 ms to minimize.
[2025-06-02 22:04:26] [INFO ] Deduced a trap composed of 164 places in 277 ms of which 2 ms to minimize.
[2025-06-02 22:04:26] [INFO ] Deduced a trap composed of 164 places in 235 ms of which 2 ms to minimize.
[2025-06-02 22:04:27] [INFO ] Deduced a trap composed of 164 places in 247 ms of which 2 ms to minimize.
[2025-06-02 22:04:27] [INFO ] Deduced a trap composed of 162 places in 237 ms of which 3 ms to minimize.
[2025-06-02 22:04:27] [INFO ] Deduced a trap composed of 162 places in 245 ms of which 2 ms to minimize.
[2025-06-02 22:04:28] [INFO ] Deduced a trap composed of 169 places in 235 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2025-06-02 22:04:38] [INFO ] Deduced a trap composed of 164 places in 176 ms of which 2 ms to minimize.
[2025-06-02 22:04:38] [INFO ] Deduced a trap composed of 168 places in 184 ms of which 2 ms to minimize.
[2025-06-02 22:04:38] [INFO ] Deduced a trap composed of 164 places in 186 ms of which 2 ms to minimize.
[2025-06-02 22:04:38] [INFO ] Deduced a trap composed of 164 places in 181 ms of which 2 ms to minimize.
[2025-06-02 22:04:38] [INFO ] Deduced a trap composed of 166 places in 175 ms of which 2 ms to minimize.
[2025-06-02 22:04:39] [INFO ] Deduced a trap composed of 162 places in 193 ms of which 2 ms to minimize.
[2025-06-02 22:04:39] [INFO ] Deduced a trap composed of 164 places in 189 ms of which 2 ms to minimize.
[2025-06-02 22:04:39] [INFO ] Deduced a trap composed of 162 places in 178 ms of which 2 ms to minimize.
[2025-06-02 22:04:39] [INFO ] Deduced a trap composed of 166 places in 174 ms of which 2 ms to minimize.
[2025-06-02 22:04:40] [INFO ] Deduced a trap composed of 162 places in 183 ms of which 3 ms to minimize.
[2025-06-02 22:04:40] [INFO ] Deduced a trap composed of 166 places in 187 ms of which 3 ms to minimize.
[2025-06-02 22:04:40] [INFO ] Deduced a trap composed of 160 places in 176 ms of which 3 ms to minimize.
SMT process timed out in 64314ms, After SMT, problems are : Problem set: 0 solved, 970 unsolved
Search for dead transitions found 0 dead transitions in 64331ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66451 ms. Remains : 410/410 places, 981/981 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 410 transition count 972
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 410 transition count 971
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 409 transition count 971
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 409 transition count 970
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 408 transition count 970
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 408 transition count 960
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 398 transition count 960
Applied a total of 33 rules in 132 ms. Remains 398 /410 variables (removed 12) and now considering 960/981 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 960 rows 398 cols
[2025-06-02 22:04:40] [INFO ] Computed 62 invariants in 9 ms
[2025-06-02 22:04:40] [INFO ] [Real]Absence check using 55 positive place invariants in 12 ms returned sat
[2025-06-02 22:04:40] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2025-06-02 22:04:40] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-02 22:04:40] [INFO ] [Nat]Absence check using 55 positive place invariants in 10 ms returned sat
[2025-06-02 22:04:40] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 17 ms returned sat
[2025-06-02 22:04:41] [INFO ] After 259ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-02 22:04:41] [INFO ] Deduced a trap composed of 164 places in 257 ms of which 2 ms to minimize.
[2025-06-02 22:04:41] [INFO ] Deduced a trap composed of 160 places in 210 ms of which 3 ms to minimize.
[2025-06-02 22:04:41] [INFO ] Deduced a trap composed of 158 places in 215 ms of which 3 ms to minimize.
[2025-06-02 22:04:42] [INFO ] Deduced a trap composed of 162 places in 224 ms of which 3 ms to minimize.
[2025-06-02 22:04:42] [INFO ] Deduced a trap composed of 162 places in 242 ms of which 3 ms to minimize.
[2025-06-02 22:04:42] [INFO ] Deduced a trap composed of 160 places in 217 ms of which 2 ms to minimize.
[2025-06-02 22:04:42] [INFO ] Deduced a trap composed of 160 places in 217 ms of which 2 ms to minimize.
[2025-06-02 22:04:43] [INFO ] Deduced a trap composed of 156 places in 206 ms of which 2 ms to minimize.
[2025-06-02 22:04:43] [INFO ] Deduced a trap composed of 154 places in 210 ms of which 2 ms to minimize.
[2025-06-02 22:04:43] [INFO ] Deduced a trap composed of 160 places in 222 ms of which 2 ms to minimize.
[2025-06-02 22:04:43] [INFO ] Deduced a trap composed of 162 places in 216 ms of which 3 ms to minimize.
[2025-06-02 22:04:44] [INFO ] Deduced a trap composed of 158 places in 216 ms of which 2 ms to minimize.
[2025-06-02 22:04:44] [INFO ] Deduced a trap composed of 168 places in 243 ms of which 2 ms to minimize.
[2025-06-02 22:04:44] [INFO ] Deduced a trap composed of 162 places in 219 ms of which 2 ms to minimize.
[2025-06-02 22:04:44] [INFO ] Deduced a trap composed of 158 places in 208 ms of which 3 ms to minimize.
[2025-06-02 22:04:45] [INFO ] Deduced a trap composed of 160 places in 222 ms of which 2 ms to minimize.
[2025-06-02 22:04:45] [INFO ] Deduced a trap composed of 160 places in 219 ms of which 3 ms to minimize.
[2025-06-02 22:04:45] [INFO ] Deduced a trap composed of 166 places in 218 ms of which 3 ms to minimize.
[2025-06-02 22:04:45] [INFO ] Deduced a trap composed of 164 places in 212 ms of which 2 ms to minimize.
[2025-06-02 22:04:46] [INFO ] Deduced a trap composed of 160 places in 208 ms of which 3 ms to minimize.
[2025-06-02 22:04:46] [INFO ] Deduced a trap composed of 156 places in 213 ms of which 2 ms to minimize.
[2025-06-02 22:04:46] [INFO ] Deduced a trap composed of 164 places in 227 ms of which 2 ms to minimize.
[2025-06-02 22:04:46] [INFO ] Deduced a trap composed of 158 places in 203 ms of which 2 ms to minimize.
[2025-06-02 22:04:47] [INFO ] Deduced a trap composed of 160 places in 217 ms of which 2 ms to minimize.
[2025-06-02 22:04:47] [INFO ] Deduced a trap composed of 162 places in 217 ms of which 2 ms to minimize.
[2025-06-02 22:04:47] [INFO ] Deduced a trap composed of 158 places in 247 ms of which 3 ms to minimize.
[2025-06-02 22:04:47] [INFO ] Deduced a trap composed of 160 places in 219 ms of which 2 ms to minimize.
[2025-06-02 22:04:48] [INFO ] Deduced a trap composed of 162 places in 255 ms of which 2 ms to minimize.
[2025-06-02 22:04:48] [INFO ] Deduced a trap composed of 156 places in 232 ms of which 3 ms to minimize.
[2025-06-02 22:04:48] [INFO ] Deduced a trap composed of 160 places in 256 ms of which 3 ms to minimize.
[2025-06-02 22:04:49] [INFO ] Deduced a trap composed of 164 places in 224 ms of which 2 ms to minimize.
[2025-06-02 22:04:49] [INFO ] Deduced a trap composed of 154 places in 221 ms of which 2 ms to minimize.
[2025-06-02 22:04:49] [INFO ] Deduced a trap composed of 162 places in 214 ms of which 3 ms to minimize.
[2025-06-02 22:04:49] [INFO ] Deduced a trap composed of 156 places in 217 ms of which 2 ms to minimize.
[2025-06-02 22:04:49] [INFO ] Deduced a trap composed of 160 places in 209 ms of which 2 ms to minimize.
[2025-06-02 22:04:50] [INFO ] Deduced a trap composed of 162 places in 211 ms of which 2 ms to minimize.
[2025-06-02 22:04:50] [INFO ] Deduced a trap composed of 156 places in 206 ms of which 3 ms to minimize.
[2025-06-02 22:04:50] [INFO ] Deduced a trap composed of 156 places in 223 ms of which 2 ms to minimize.
[2025-06-02 22:04:51] [INFO ] Deduced a trap composed of 160 places in 227 ms of which 2 ms to minimize.
[2025-06-02 22:04:51] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 2 ms to minimize.
[2025-06-02 22:04:52] [INFO ] Deduced a trap composed of 164 places in 217 ms of which 3 ms to minimize.
[2025-06-02 22:04:52] [INFO ] Deduced a trap composed of 156 places in 218 ms of which 2 ms to minimize.
[2025-06-02 22:04:52] [INFO ] Deduced a trap composed of 162 places in 232 ms of which 2 ms to minimize.
[2025-06-02 22:04:52] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 2 ms to minimize.
[2025-06-02 22:04:53] [INFO ] Deduced a trap composed of 160 places in 238 ms of which 3 ms to minimize.
[2025-06-02 22:04:53] [INFO ] Deduced a trap composed of 162 places in 217 ms of which 2 ms to minimize.
[2025-06-02 22:04:53] [INFO ] Deduced a trap composed of 160 places in 252 ms of which 2 ms to minimize.
[2025-06-02 22:04:53] [INFO ] Deduced a trap composed of 154 places in 211 ms of which 2 ms to minimize.
[2025-06-02 22:04:54] [INFO ] Deduced a trap composed of 156 places in 231 ms of which 3 ms to minimize.
[2025-06-02 22:04:54] [INFO ] Deduced a trap composed of 160 places in 211 ms of which 2 ms to minimize.
[2025-06-02 22:04:54] [INFO ] Deduced a trap composed of 156 places in 211 ms of which 3 ms to minimize.
[2025-06-02 22:04:54] [INFO ] Deduced a trap composed of 154 places in 226 ms of which 3 ms to minimize.
[2025-06-02 22:04:55] [INFO ] Deduced a trap composed of 164 places in 220 ms of which 3 ms to minimize.
[2025-06-02 22:04:55] [INFO ] Deduced a trap composed of 164 places in 225 ms of which 3 ms to minimize.
[2025-06-02 22:04:55] [INFO ] Deduced a trap composed of 158 places in 231 ms of which 3 ms to minimize.
[2025-06-02 22:04:55] [INFO ] Deduced a trap composed of 166 places in 230 ms of which 3 ms to minimize.
[2025-06-02 22:04:56] [INFO ] Deduced a trap composed of 160 places in 200 ms of which 3 ms to minimize.
[2025-06-02 22:04:56] [INFO ] Deduced a trap composed of 154 places in 225 ms of which 2 ms to minimize.
[2025-06-02 22:04:57] [INFO ] Deduced a trap composed of 170 places in 210 ms of which 2 ms to minimize.
[2025-06-02 22:04:57] [INFO ] Deduced a trap composed of 168 places in 253 ms of which 2 ms to minimize.
[2025-06-02 22:04:58] [INFO ] Deduced a trap composed of 170 places in 215 ms of which 2 ms to minimize.
[2025-06-02 22:04:58] [INFO ] Deduced a trap composed of 168 places in 232 ms of which 3 ms to minimize.
[2025-06-02 22:04:58] [INFO ] Deduced a trap composed of 170 places in 229 ms of which 2 ms to minimize.
[2025-06-02 22:04:58] [INFO ] Deduced a trap composed of 168 places in 217 ms of which 2 ms to minimize.
[2025-06-02 22:04:59] [INFO ] Deduced a trap composed of 166 places in 221 ms of which 2 ms to minimize.
[2025-06-02 22:04:59] [INFO ] Deduced a trap composed of 162 places in 256 ms of which 3 ms to minimize.
[2025-06-02 22:04:59] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 2 ms to minimize.
[2025-06-02 22:04:59] [INFO ] Deduced a trap composed of 160 places in 223 ms of which 3 ms to minimize.
[2025-06-02 22:05:00] [INFO ] Deduced a trap composed of 160 places in 225 ms of which 2 ms to minimize.
[2025-06-02 22:05:00] [INFO ] Deduced a trap composed of 168 places in 231 ms of which 3 ms to minimize.
[2025-06-02 22:05:00] [INFO ] Deduced a trap composed of 168 places in 200 ms of which 3 ms to minimize.
[2025-06-02 22:05:00] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 2 ms to minimize.
[2025-06-02 22:06:51] [INFO ] Trap strengthening (SAT) tested/added 72/72 trap constraints in 130299 ms
TRAPS : Iteration 1
[2025-06-02 22:06:51] [INFO ] After 130806ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2025-06-02 22:06:51] [INFO ] After 130913ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Over-approximation ignoring read arcs solved 0 properties in 131178 ms.
Unable to solve all queries for examination QuasiLiveness. Remains :1 assertions to prove.
No /home/mcc/execution/QuasiLiveness.xml examination file found. Proceeding without properties.
Parsed 38 properties from file /home/mcc/execution/QuasiLiveness.xml in 5 ms.
Working with output stream class java.io.PrintStream
Total runtime 1040304 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBNT-COL-S10J20

IS_COLORED=1
IS_NUPN=

LOADING model.pnml ...
MODEL CLASS: SYMMETRIC NET
PLACES: 48
TRANSITIONS: 38
CONSTANTS: 0
TEMPLATE VARS: 0
COLOR CLASSES: 8
COLOR VARS: 26
ARCS: 140
LOADING TIME: 0.286

UNFOLDING COLORS...
MODEL CLASS: P/T NET
PLACES: 494
TRANSITIONS: 11780
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 111159
UNFOLDING TIME: 1.851

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.606
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING UNFOLDING MAP FILE /home/mcc/execution/model.unfmap ...
TOTAL TIME: 3.105
OK.
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 4648
MODEL NAME: /home/mcc/execution/model
494 places, 11780 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -timeout 180 -rebuildPNML

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="PolyORBNT-COL-S10J20"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 gold2024"
echo " Input is PolyORBNT-COL-S10J20, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r168-tall-174881266900372"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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