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.r154-tall-174876825600384.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 Peterson-PT-4, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r154-tall-174876825600384
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 66K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 289K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 234K 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 38K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 122K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 98K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 102K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 469K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 61K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 284K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 298K 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 Liveness

=== Now, execution of the tool begins

BK_START 1748844766102

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Peterson-PT-4
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-02 06:12:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2025-06-02 06:12:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 06:12:47] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2025-06-02 06:12:47] [INFO ] Transformed 480 places.
[2025-06-02 06:12:47] [INFO ] Transformed 690 transitions.
[2025-06-02 06:12:47] [INFO ] Found NUPN structural information;
[2025-06-02 06:12:47] [INFO ] Parsed PT model containing 480 places and 690 transitions and 2120 arcs in 208 ms.
Built sparse matrix representations for Structural reductions in 8 ms.19306KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 480/480 places, 690/690 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 44 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 57 ms. Remains : 480/480 places, 690/690 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 480/480 places, 690/690 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 26 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2025-06-02 06:12:47] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2025-06-02 06:12:47] [INFO ] Computed 19 invariants in 22 ms
[2025-06-02 06:12:48] [INFO ] Implicit Places using invariants in 291 ms returned []
[2025-06-02 06:12:48] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2025-06-02 06:12:48] [INFO ] Invariant cache hit.
[2025-06-02 06:12:48] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-06-02 06:12:48] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 592 ms to find 0 implicit places.
[2025-06-02 06:12:48] [INFO ] Redundant transitions in 33 ms returned []
Running 685 sub problems to find dead transitions.
[2025-06-02 06:12:48] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2025-06-02 06:12:48] [INFO ] Invariant cache hit.
[2025-06-02 06:12:48] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 475/475 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 4/479 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 3 (OVERLAPS) 5/480 variables, 10/489 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 5/494 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 5/499 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2025-06-02 06:13:03] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 22 ms to minimize.
[2025-06-02 06:13:03] [INFO ] Deduced a trap composed of 35 places in 142 ms of which 3 ms to minimize.
[2025-06-02 06:13:03] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 3 ms to minimize.
[2025-06-02 06:13:04] [INFO ] Deduced a trap composed of 36 places in 129 ms of which 3 ms to minimize.
[2025-06-02 06:13:04] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 2 ms to minimize.
[2025-06-02 06:13:04] [INFO ] Deduced a trap composed of 45 places in 130 ms of which 3 ms to minimize.
[2025-06-02 06:13:04] [INFO ] Deduced a trap composed of 54 places in 128 ms of which 3 ms to minimize.
[2025-06-02 06:13:04] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 3 ms to minimize.
[2025-06-02 06:13:04] [INFO ] Deduced a trap composed of 58 places in 101 ms of which 2 ms to minimize.
[2025-06-02 06:13:04] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 2 ms to minimize.
[2025-06-02 06:13:04] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 3 ms to minimize.
[2025-06-02 06:13:05] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 2 ms to minimize.
[2025-06-02 06:13:05] [INFO ] Deduced a trap composed of 18 places in 137 ms of which 3 ms to minimize.
[2025-06-02 06:13:05] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 2 ms to minimize.
[2025-06-02 06:13:05] [INFO ] Deduced a trap composed of 54 places in 125 ms of which 2 ms to minimize.
[2025-06-02 06:13:05] [INFO ] Deduced a trap composed of 60 places in 91 ms of which 2 ms to minimize.
[2025-06-02 06:13:05] [INFO ] Deduced a trap composed of 64 places in 92 ms of which 2 ms to minimize.
[2025-06-02 06:13:05] [INFO ] Deduced a trap composed of 39 places in 145 ms of which 2 ms to minimize.
[2025-06-02 06:13:06] [INFO ] Deduced a trap composed of 40 places in 135 ms of which 3 ms to minimize.
[2025-06-02 06:13:06] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 20/519 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2025-06-02 06:13:11] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 2 ms to minimize.
[2025-06-02 06:13:11] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 3 ms to minimize.
[2025-06-02 06:13:11] [INFO ] Deduced a trap composed of 65 places in 104 ms of which 3 ms to minimize.
[2025-06-02 06:13:11] [INFO ] Deduced a trap composed of 61 places in 99 ms of which 2 ms to minimize.
[2025-06-02 06:13:11] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 2 ms to minimize.
[2025-06-02 06:13:12] [INFO ] Deduced a trap composed of 84 places in 111 ms of which 2 ms to minimize.
[2025-06-02 06:13:12] [INFO ] Deduced a trap composed of 62 places in 96 ms of which 2 ms to minimize.
[2025-06-02 06:13:12] [INFO ] Deduced a trap composed of 62 places in 102 ms of which 2 ms to minimize.
[2025-06-02 06:13:12] [INFO ] Deduced a trap composed of 96 places in 81 ms of which 2 ms to minimize.
[2025-06-02 06:13:12] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 2 ms to minimize.
[2025-06-02 06:13:12] [INFO ] Deduced a trap composed of 61 places in 94 ms of which 2 ms to minimize.
[2025-06-02 06:13:12] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 2 ms to minimize.
[2025-06-02 06:13:12] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 3 ms to minimize.
[2025-06-02 06:13:13] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 3 ms to minimize.
[2025-06-02 06:13:13] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 5 ms to minimize.
[2025-06-02 06:13:13] [INFO ] Deduced a trap composed of 87 places in 66 ms of which 1 ms to minimize.
[2025-06-02 06:13:13] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 3 ms to minimize.
[2025-06-02 06:13:13] [INFO ] Deduced a trap composed of 79 places in 72 ms of which 2 ms to minimize.
[2025-06-02 06:13:13] [INFO ] Deduced a trap composed of 80 places in 73 ms of which 1 ms to minimize.
[2025-06-02 06:13:13] [INFO ] Deduced a trap composed of 91 places in 68 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 20/539 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2025-06-02 06:13:14] [INFO ] Deduced a trap composed of 54 places in 109 ms of which 3 ms to minimize.
[2025-06-02 06:13:14] [INFO ] Deduced a trap composed of 62 places in 100 ms of which 2 ms to minimize.
[2025-06-02 06:13:14] [INFO ] Deduced a trap composed of 54 places in 105 ms of which 2 ms to minimize.
[2025-06-02 06:13:14] [INFO ] Deduced a trap composed of 36 places in 124 ms of which 2 ms to minimize.
[2025-06-02 06:13:15] [INFO ] Deduced a trap composed of 47 places in 94 ms of which 2 ms to minimize.
[2025-06-02 06:13:15] [INFO ] Deduced a trap composed of 58 places in 105 ms of which 2 ms to minimize.
[2025-06-02 06:13:15] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 1 ms to minimize.
[2025-06-02 06:13:15] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 1 ms to minimize.
[2025-06-02 06:13:15] [INFO ] Deduced a trap composed of 57 places in 105 ms of which 2 ms to minimize.
[2025-06-02 06:13:15] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 2 ms to minimize.
[2025-06-02 06:13:16] [INFO ] Deduced a trap composed of 83 places in 121 ms of which 3 ms to minimize.
[2025-06-02 06:13:16] [INFO ] Deduced a trap composed of 40 places in 105 ms of which 2 ms to minimize.
[2025-06-02 06:13:16] [INFO ] Deduced a trap composed of 47 places in 105 ms of which 2 ms to minimize.
[2025-06-02 06:13:16] [INFO ] Deduced a trap composed of 84 places in 76 ms of which 2 ms to minimize.
[2025-06-02 06:13:16] [INFO ] Deduced a trap composed of 87 places in 83 ms of which 2 ms to minimize.
[2025-06-02 06:13:16] [INFO ] Deduced a trap composed of 83 places in 89 ms of which 2 ms to minimize.
[2025-06-02 06:13:16] [INFO ] Deduced a trap composed of 84 places in 93 ms of which 4 ms to minimize.
[2025-06-02 06:13:16] [INFO ] Deduced a trap composed of 128 places in 89 ms of which 2 ms to minimize.
[2025-06-02 06:13:16] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 1 ms to minimize.
[2025-06-02 06:13:17] [INFO ] Deduced a trap composed of 76 places in 84 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/480 variables, 20/559 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2025-06-02 06:13:18] [INFO ] Deduced a trap composed of 57 places in 108 ms of which 2 ms to minimize.
[2025-06-02 06:13:18] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 480/1110 variables, and 561 constraints, problems are : Problem set: 0 solved, 685 unsolved in 30029 ms.
Refiners :[Domain max(s): 480/480 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/480 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 685/685 constraints, Known Traps: 62/62 constraints]
Escalating to Integer solving :Problem set: 0 solved, 685 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 475/475 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 4/479 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 62/541 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 4 (OVERLAPS) 5/480 variables, 10/551 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 5/556 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 5/561 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2025-06-02 06:13:26] [INFO ] Deduced a trap composed of 62 places in 114 ms of which 2 ms to minimize.
[2025-06-02 06:13:27] [INFO ] Deduced a trap composed of 80 places in 70 ms of which 1 ms to minimize.
[2025-06-02 06:13:27] [INFO ] Deduced a trap composed of 80 places in 59 ms of which 1 ms to minimize.
[2025-06-02 06:13:27] [INFO ] Deduced a trap composed of 69 places in 66 ms of which 2 ms to minimize.
[2025-06-02 06:13:27] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 2 ms to minimize.
[2025-06-02 06:13:27] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 2 ms to minimize.
[2025-06-02 06:13:27] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 1 ms to minimize.
[2025-06-02 06:13:27] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
[2025-06-02 06:13:28] [INFO ] Deduced a trap composed of 76 places in 100 ms of which 2 ms to minimize.
[2025-06-02 06:13:28] [INFO ] Deduced a trap composed of 80 places in 92 ms of which 2 ms to minimize.
[2025-06-02 06:13:28] [INFO ] Deduced a trap composed of 76 places in 109 ms of which 2 ms to minimize.
[2025-06-02 06:13:28] [INFO ] Deduced a trap composed of 46 places in 59 ms of which 1 ms to minimize.
[2025-06-02 06:13:28] [INFO ] Deduced a trap composed of 58 places in 58 ms of which 1 ms to minimize.
[2025-06-02 06:13:28] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 1 ms to minimize.
[2025-06-02 06:13:28] [INFO ] Deduced a trap composed of 69 places in 64 ms of which 2 ms to minimize.
[2025-06-02 06:13:28] [INFO ] Deduced a trap composed of 88 places in 97 ms of which 2 ms to minimize.
[2025-06-02 06:13:28] [INFO ] Deduced a trap composed of 169 places in 111 ms of which 2 ms to minimize.
[2025-06-02 06:13:29] [INFO ] Deduced a trap composed of 65 places in 84 ms of which 2 ms to minimize.
[2025-06-02 06:13:29] [INFO ] Deduced a trap composed of 66 places in 76 ms of which 2 ms to minimize.
[2025-06-02 06:13:29] [INFO ] Deduced a trap composed of 70 places in 75 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 20/581 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2025-06-02 06:13:31] [INFO ] Deduced a trap composed of 43 places in 99 ms of which 1 ms to minimize.
[2025-06-02 06:13:32] [INFO ] Deduced a trap composed of 87 places in 100 ms of which 2 ms to minimize.
[2025-06-02 06:13:32] [INFO ] Deduced a trap composed of 91 places in 95 ms of which 1 ms to minimize.
[2025-06-02 06:13:32] [INFO ] Deduced a trap composed of 95 places in 89 ms of which 2 ms to minimize.
[2025-06-02 06:13:33] [INFO ] Deduced a trap composed of 62 places in 108 ms of which 2 ms to minimize.
[2025-06-02 06:13:33] [INFO ] Deduced a trap composed of 47 places in 114 ms of which 2 ms to minimize.
[2025-06-02 06:13:33] [INFO ] Deduced a trap composed of 69 places in 100 ms of which 2 ms to minimize.
[2025-06-02 06:13:34] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 3 ms to minimize.
[2025-06-02 06:13:34] [INFO ] Deduced a trap composed of 69 places in 116 ms of which 2 ms to minimize.
[2025-06-02 06:13:34] [INFO ] Deduced a trap composed of 38 places in 119 ms of which 3 ms to minimize.
[2025-06-02 06:13:34] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 1 ms to minimize.
[2025-06-02 06:13:35] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 2 ms to minimize.
[2025-06-02 06:13:35] [INFO ] Deduced a trap composed of 91 places in 86 ms of which 1 ms to minimize.
[2025-06-02 06:13:36] [INFO ] Deduced a trap composed of 68 places in 111 ms of which 2 ms to minimize.
[2025-06-02 06:13:36] [INFO ] Deduced a trap composed of 63 places in 110 ms of which 3 ms to minimize.
[2025-06-02 06:13:36] [INFO ] Deduced a trap composed of 70 places in 70 ms of which 1 ms to minimize.
[2025-06-02 06:13:36] [INFO ] Deduced a trap composed of 160 places in 90 ms of which 2 ms to minimize.
[2025-06-02 06:13:36] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 2 ms to minimize.
[2025-06-02 06:13:36] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 2 ms to minimize.
[2025-06-02 06:13:36] [INFO ] Deduced a trap composed of 112 places in 80 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/480 variables, 20/601 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2025-06-02 06:13:40] [INFO ] Deduced a trap composed of 92 places in 74 ms of which 2 ms to minimize.
[2025-06-02 06:13:40] [INFO ] Deduced a trap composed of 97 places in 72 ms of which 1 ms to minimize.
[2025-06-02 06:13:40] [INFO ] Deduced a trap composed of 54 places in 87 ms of which 1 ms to minimize.
[2025-06-02 06:13:41] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 2 ms to minimize.
[2025-06-02 06:13:41] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 3 ms to minimize.
[2025-06-02 06:13:42] [INFO ] Deduced a trap composed of 47 places in 104 ms of which 2 ms to minimize.
[2025-06-02 06:13:42] [INFO ] Deduced a trap composed of 112 places in 111 ms of which 3 ms to minimize.
[2025-06-02 06:13:43] [INFO ] Deduced a trap composed of 54 places in 117 ms of which 3 ms to minimize.
[2025-06-02 06:13:43] [INFO ] Deduced a trap composed of 144 places in 85 ms of which 2 ms to minimize.
[2025-06-02 06:13:43] [INFO ] Deduced a trap composed of 122 places in 80 ms of which 2 ms to minimize.
[2025-06-02 06:13:43] [INFO ] Deduced a trap composed of 128 places in 92 ms of which 2 ms to minimize.
[2025-06-02 06:13:44] [INFO ] Deduced a trap composed of 70 places in 112 ms of which 2 ms to minimize.
[2025-06-02 06:13:45] [INFO ] Deduced a trap composed of 39 places in 129 ms of which 3 ms to minimize.
[2025-06-02 06:13:45] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 2 ms to minimize.
[2025-06-02 06:13:45] [INFO ] Deduced a trap composed of 79 places in 119 ms of which 3 ms to minimize.
[2025-06-02 06:13:45] [INFO ] Deduced a trap composed of 79 places in 127 ms of which 2 ms to minimize.
[2025-06-02 06:13:46] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 3 ms to minimize.
[2025-06-02 06:13:46] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 3 ms to minimize.
[2025-06-02 06:13:46] [INFO ] Deduced a trap composed of 58 places in 95 ms of which 3 ms to minimize.
[2025-06-02 06:13:47] [INFO ] Deduced a trap composed of 60 places in 118 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/480 variables, 20/621 constraints. Problems are: Problem set: 0 solved, 685 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 480/1110 variables, and 621 constraints, problems are : Problem set: 0 solved, 685 unsolved in 30019 ms.
Refiners :[Domain max(s): 480/480 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/480 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/685 constraints, Known Traps: 122/122 constraints]
After SMT, in 60261ms problems are : Problem set: 0 solved, 685 unsolved
Search for dead transitions found 0 dead transitions in 60289ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 60965 ms. Remains : 480/480 places, 690/690 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1493 ms (no deadlock found). (steps per millisecond=837 )
Random directed walk for 1250000 steps, including 0 resets, run took 1655 ms (no deadlock found). (steps per millisecond=755 )
[2025-06-02 06:13:51] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2025-06-02 06:13:51] [INFO ] Invariant cache hit.
[2025-06-02 06:13:52] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2025-06-02 06:13:52] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 11 ms returned unsat
Starting structural reductions in LIVENESS mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 480 transition count 490
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 280 transition count 490
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 400 place count 280 transition count 390
Deduced a syphon composed of 100 places in 3 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 600 place count 180 transition count 390
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 640 place count 160 transition count 370
Applied a total of 640 rules in 61 ms. Remains 160 /480 variables (removed 320) and now considering 370/690 (removed 320) transitions.
[2025-06-02 06:13:52] [INFO ] Flow matrix only has 310 transitions (discarded 60 similar events)
// Phase 1: matrix 310 rows 160 cols
[2025-06-02 06:13:52] [INFO ] Computed 19 invariants in 1 ms
[2025-06-02 06:13:52] [INFO ] Implicit Places using invariants in 131 ms returned [150, 151, 152, 153, 154]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 132 ms to find 5 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 155/480 places, 370/690 transitions.
Applied a total of 0 rules in 3 ms. Remains 155 /155 variables (removed 0) and now considering 370/370 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 196 ms. Remains : 155/480 places, 370/690 transitions.
Discarding 5 transitions out of 370. Remains 365
RANDOM walk for 40000 steps (8 resets) in 2443 ms. (16 steps per ms) remains 116/365 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 116/116 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 115/116 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 115/115 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 114/115 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 113/114 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 113/113 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 113/113 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 113/113 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 113/113 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 113/113 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 113/113 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 113/113 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 113/113 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 113/113 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 113/113 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 113/113 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 112/113 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 112/112 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 112/112 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 112/112 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 112/112 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 110/112 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (8 resets) in 18 ms. (21 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 109/110 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 109/109 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 109/109 properties
[2025-06-02 06:13:53] [INFO ] Flow matrix only has 310 transitions (discarded 60 similar events)
// Phase 1: matrix 310 rows 155 cols
[2025-06-02 06:13:53] [INFO ] Computed 14 invariants in 1 ms
[2025-06-02 06:13:53] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 94/94 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 3/97 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (OVERLAPS) 60/154 variables, 10/107 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 60/167 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2025-06-02 06:13:54] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2025-06-02 06:13:54] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2025-06-02 06:13:54] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2025-06-02 06:13:54] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2025-06-02 06:13:54] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2025-06-02 06:13:54] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 1 ms to minimize.
[2025-06-02 06:13:54] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2025-06-02 06:13:54] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 2 ms to minimize.
[2025-06-02 06:13:54] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2025-06-02 06:13:54] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2025-06-02 06:13:54] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2025-06-02 06:13:54] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2025-06-02 06:13:54] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2025-06-02 06:13:54] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2025-06-02 06:13:54] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
[2025-06-02 06:13:54] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2025-06-02 06:13:55] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2025-06-02 06:13:55] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2025-06-02 06:13:55] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2025-06-02 06:13:55] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2025-06-02 06:13:55] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2025-06-02 06:13:55] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2025-06-02 06:13:55] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2025-06-02 06:13:55] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2025-06-02 06:13:55] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2025-06-02 06:13:55] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2025-06-02 06:13:55] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2025-06-02 06:13:55] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 2 ms to minimize.
[2025-06-02 06:13:55] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2025-06-02 06:13:55] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2025-06-02 06:13:55] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2025-06-02 06:13:55] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2025-06-02 06:13:55] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2025-06-02 06:13:56] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2025-06-02 06:13:56] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2025-06-02 06:13:56] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2025-06-02 06:13:56] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2025-06-02 06:13:56] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 0 ms to minimize.
[2025-06-02 06:13:56] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2025-06-02 06:13:56] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 20/207 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2025-06-02 06:13:56] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2025-06-02 06:13:56] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2025-06-02 06:13:56] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2025-06-02 06:13:57] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2025-06-02 06:13:57] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2025-06-02 06:13:57] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2025-06-02 06:13:57] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 2 ms to minimize.
[2025-06-02 06:13:57] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2025-06-02 06:13:57] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2025-06-02 06:13:57] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 2 ms to minimize.
[2025-06-02 06:13:57] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2025-06-02 06:13:57] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2025-06-02 06:13:57] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2025-06-02 06:13:57] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2025-06-02 06:13:57] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2025-06-02 06:13:57] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2025-06-02 06:13:57] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2025-06-02 06:13:57] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2025-06-02 06:13:57] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2025-06-02 06:13:58] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 20/227 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2025-06-02 06:13:58] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2025-06-02 06:13:58] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 154/465 variables, and 229 constraints, problems are : Problem set: 0 solved, 109 unsolved in 5008 ms.
Refiners :[Domain max(s): 154/155 constraints, Positive P Invariants (semi-flows): 13/14 constraints, State Equation: 0/155 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 62/62 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 94/94 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 3/97 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (OVERLAPS) 60/154 variables, 10/107 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 60/167 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 62/229 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2025-06-02 06:13:58] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2025-06-02 06:13:58] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2025-06-02 06:13:59] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2025-06-02 06:13:59] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2025-06-02 06:13:59] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 0 ms to minimize.
[2025-06-02 06:13:59] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2025-06-02 06:13:59] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2025-06-02 06:13:59] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2025-06-02 06:13:59] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
[2025-06-02 06:13:59] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2025-06-02 06:13:59] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2025-06-02 06:13:59] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2025-06-02 06:13:59] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2025-06-02 06:13:59] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2025-06-02 06:13:59] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2025-06-02 06:13:59] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2025-06-02 06:13:59] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2025-06-02 06:13:59] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2025-06-02 06:13:59] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2025-06-02 06:13:59] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 20/249 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2025-06-02 06:14:00] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2025-06-02 06:14:00] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2025-06-02 06:14:00] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2025-06-02 06:14:00] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2025-06-02 06:14:00] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2025-06-02 06:14:00] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2025-06-02 06:14:00] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2025-06-02 06:14:00] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2025-06-02 06:14:00] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2025-06-02 06:14:00] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2025-06-02 06:14:00] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2025-06-02 06:14:00] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2025-06-02 06:14:01] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 1 ms to minimize.
[2025-06-02 06:14:01] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2025-06-02 06:14:01] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2025-06-02 06:14:01] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 1 ms to minimize.
[2025-06-02 06:14:01] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 0 ms to minimize.
[2025-06-02 06:14:01] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2025-06-02 06:14:01] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2025-06-02 06:14:01] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 20/269 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2025-06-02 06:14:02] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2025-06-02 06:14:02] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2025-06-02 06:14:02] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 0 ms to minimize.
[2025-06-02 06:14:02] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 0 ms to minimize.
[2025-06-02 06:14:02] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2025-06-02 06:14:02] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2025-06-02 06:14:02] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2025-06-02 06:14:02] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 2 ms to minimize.
[2025-06-02 06:14:02] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2025-06-02 06:14:02] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 10/279 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 154/465 variables, and 279 constraints, problems are : Problem set: 0 solved, 109 unsolved in 5007 ms.
Refiners :[Domain max(s): 154/155 constraints, Positive P Invariants (semi-flows): 13/14 constraints, State Equation: 0/155 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/109 constraints, Known Traps: 112/112 constraints]
After SMT, in 10035ms problems are : Problem set: 0 solved, 109 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 94 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 370/370 transitions.
Applied a total of 0 rules in 11 ms. Remains 155 /155 variables (removed 0) and now considering 370/370 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 155/155 places, 370/370 transitions.
RANDOM walk for 4000000 steps (8 resets) in 29649 ms. (134 steps per ms) remains 105/109 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 104/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 103/104 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 101/103 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 101/101 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 100/101 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 98/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 96/98 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 96/96 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 96/96 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 96/96 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 96/96 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 96/96 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 96/96 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 96/96 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 96/96 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 96/96 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 96/96 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 96/96 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 96/96 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 96/96 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 96/96 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 96/96 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 96/96 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 94/96 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 93/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 93/93 properties
[2025-06-02 06:14:12] [INFO ] Flow matrix only has 310 transitions (discarded 60 similar events)
[2025-06-02 06:14:12] [INFO ] Invariant cache hit.
[2025-06-02 06:14:12] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 67/154 variables, 10/100 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 67/167 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2025-06-02 06:14:13] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2025-06-02 06:14:13] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2025-06-02 06:14:13] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2025-06-02 06:14:13] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2025-06-02 06:14:13] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2025-06-02 06:14:13] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2025-06-02 06:14:13] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2025-06-02 06:14:13] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2025-06-02 06:14:14] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2025-06-02 06:14:14] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2025-06-02 06:14:14] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2025-06-02 06:14:14] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 1 ms to minimize.
[2025-06-02 06:14:14] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2025-06-02 06:14:14] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2025-06-02 06:14:14] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 1 ms to minimize.
[2025-06-02 06:14:14] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2025-06-02 06:14:14] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2025-06-02 06:14:14] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2025-06-02 06:14:14] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2025-06-02 06:14:14] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2025-06-02 06:14:14] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 2 ms to minimize.
[2025-06-02 06:14:14] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 4 ms to minimize.
[2025-06-02 06:14:14] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2025-06-02 06:14:15] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2025-06-02 06:14:15] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2025-06-02 06:14:15] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2025-06-02 06:14:15] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2025-06-02 06:14:15] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2025-06-02 06:14:15] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2025-06-02 06:14:15] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 0 ms to minimize.
[2025-06-02 06:14:15] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2025-06-02 06:14:15] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2025-06-02 06:14:15] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2025-06-02 06:14:15] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2025-06-02 06:14:15] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2025-06-02 06:14:15] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2025-06-02 06:14:15] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2025-06-02 06:14:15] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2025-06-02 06:14:15] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2025-06-02 06:14:15] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 20/207 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2025-06-02 06:14:16] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2025-06-02 06:14:16] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2025-06-02 06:14:16] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2025-06-02 06:14:16] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2025-06-02 06:14:16] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2025-06-02 06:14:16] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2025-06-02 06:14:16] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 0 ms to minimize.
[2025-06-02 06:14:16] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2025-06-02 06:14:16] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2025-06-02 06:14:16] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2025-06-02 06:14:16] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2025-06-02 06:14:16] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2025-06-02 06:14:16] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2025-06-02 06:14:17] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2025-06-02 06:14:17] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2025-06-02 06:14:17] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2025-06-02 06:14:17] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2025-06-02 06:14:17] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2025-06-02 06:14:17] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2025-06-02 06:14:17] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 20/227 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2025-06-02 06:14:17] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 0 ms to minimize.
[2025-06-02 06:14:17] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 0 ms to minimize.
[2025-06-02 06:14:17] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2025-06-02 06:14:17] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2025-06-02 06:14:17] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2025-06-02 06:14:17] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2025-06-02 06:14:17] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2025-06-02 06:14:17] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2025-06-02 06:14:17] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2025-06-02 06:14:18] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 4 ms to minimize.
[2025-06-02 06:14:18] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2025-06-02 06:14:18] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2025-06-02 06:14:18] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 0 ms to minimize.
[2025-06-02 06:14:18] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2025-06-02 06:14:18] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2025-06-02 06:14:18] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2025-06-02 06:14:18] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2025-06-02 06:14:18] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
[2025-06-02 06:14:18] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2025-06-02 06:14:18] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 20/247 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2025-06-02 06:14:19] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2025-06-02 06:14:19] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2025-06-02 06:14:19] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2025-06-02 06:14:19] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2025-06-02 06:14:19] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2025-06-02 06:14:19] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2025-06-02 06:14:19] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2025-06-02 06:14:19] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 0 ms to minimize.
[2025-06-02 06:14:19] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2025-06-02 06:14:19] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2025-06-02 06:14:19] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2025-06-02 06:14:19] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
[2025-06-02 06:14:19] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2025-06-02 06:14:19] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
[2025-06-02 06:14:19] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2025-06-02 06:14:20] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 0 ms to minimize.
[2025-06-02 06:14:20] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 17/264 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2025-06-02 06:14:21] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2025-06-02 06:14:21] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
[2025-06-02 06:14:21] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2025-06-02 06:14:21] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2025-06-02 06:14:21] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2025-06-02 06:14:21] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2025-06-02 06:14:21] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 7/271 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2025-06-02 06:14:22] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2025-06-02 06:14:22] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 0 ms to minimize.
[2025-06-02 06:14:22] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2025-06-02 06:14:22] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2025-06-02 06:14:22] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 0 ms to minimize.
[2025-06-02 06:14:22] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/154 variables, 6/277 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2025-06-02 06:14:23] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/154 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2025-06-02 06:14:25] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2025-06-02 06:14:25] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2025-06-02 06:14:25] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/154 variables, 3/281 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2025-06-02 06:14:26] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/154 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2025-06-02 06:14:27] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2025-06-02 06:14:27] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2025-06-02 06:14:27] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/154 variables, 3/285 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/154 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 17 (OVERLAPS) 1/155 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/155 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2025-06-02 06:14:30] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2025-06-02 06:14:30] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 0 ms to minimize.
[2025-06-02 06:14:30] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/155 variables, 3/290 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2025-06-02 06:14:31] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2025-06-02 06:14:31] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/155 variables, 2/292 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2025-06-02 06:14:32] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2025-06-02 06:14:32] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/155 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/155 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 23 (OVERLAPS) 310/465 variables, 155/449 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/465 variables, 116/565 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/465 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 26 (OVERLAPS) 0/465 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 465/465 variables, and 565 constraints, problems are : Problem set: 0 solved, 93 unsolved in 30874 ms.
Refiners :[Domain max(s): 155/155 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 125/125 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 67/154 variables, 10/100 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 67/167 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 125/292 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 1/155 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2025-06-02 06:14:45] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2025-06-02 06:14:45] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2025-06-02 06:14:46] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2025-06-02 06:14:46] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/155 variables, 4/298 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/155 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 11 (OVERLAPS) 310/465 variables, 155/453 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/465 variables, 116/569 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/465 variables, 93/662 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2025-06-02 06:14:54] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/465 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/465 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 16 (OVERLAPS) 0/465 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 465/465 variables, and 663 constraints, problems are : Problem set: 0 solved, 93 unsolved in 32100 ms.
Refiners :[Domain max(s): 155/155 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 130/130 constraints]
After SMT, in 63010ms problems are : Problem set: 0 solved, 93 unsolved
Parikh walk visited 13 properties in 5893 ms.
Support contains 79 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 370/370 transitions.
Applied a total of 0 rules in 9 ms. Remains 155 /155 variables (removed 0) and now considering 370/370 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 155/155 places, 370/370 transitions.
RANDOM walk for 4000000 steps (8 resets) in 25295 ms. (158 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 538 ms. (742 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 485 ms. (823 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 487 ms. (819 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 491 ms. (813 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 505 ms. (790 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 500 ms. (798 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 492 ms. (811 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 499 ms. (800 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 496 ms. (804 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 496 ms. (804 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 532 ms. (750 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 525 ms. (760 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 489 ms. (816 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 494 ms. (808 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 528 ms. (756 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 507 ms. (787 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 542 ms. (736 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 494 ms. (808 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 493 ms. (809 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 485 ms. (823 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 488 ms. (818 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 493 ms. (809 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 497 ms. (803 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 491 ms. (813 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 519 ms. (769 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 746 ms. (535 steps per ms) remains 79/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 716 ms. (557 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (8 resets) in 723 ms. (552 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (8 resets) in 735 ms. (543 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (8 resets) in 733 ms. (544 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (8 resets) in 730 ms. (547 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (8 resets) in 744 ms. (536 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (8 resets) in 711 ms. (561 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (8 resets) in 604 ms. (661 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (8 resets) in 715 ms. (558 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (8 resets) in 799 ms. (500 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (8 resets) in 733 ms. (544 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (8 resets) in 696 ms. (573 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (8 resets) in 743 ms. (537 steps per ms) remains 77/79 properties
BEST_FIRST walk for 400004 steps (8 resets) in 763 ms. (523 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1075 ms. (371 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (8 resets) in 832 ms. (480 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (8 resets) in 714 ms. (559 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (8 resets) in 727 ms. (549 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (8 resets) in 694 ms. (575 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (8 resets) in 707 ms. (564 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (8 resets) in 739 ms. (540 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (8 resets) in 745 ms. (536 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1035 ms. (386 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (8 resets) in 748 ms. (534 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (8 resets) in 711 ms. (561 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (8 resets) in 724 ms. (551 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (8 resets) in 718 ms. (556 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (8 resets) in 688 ms. (580 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (8 resets) in 720 ms. (554 steps per ms) remains 76/77 properties
BEST_FIRST walk for 400004 steps (8 resets) in 702 ms. (568 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400004 steps (8 resets) in 719 ms. (555 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400004 steps (8 resets) in 681 ms. (586 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400004 steps (8 resets) in 746 ms. (535 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1087 ms. (367 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400004 steps (8 resets) in 771 ms. (518 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1089 ms. (366 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400004 steps (8 resets) in 851 ms. (469 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400004 steps (8 resets) in 976 ms. (409 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400004 steps (8 resets) in 894 ms. (446 steps per ms) remains 75/76 properties
BEST_FIRST walk for 400004 steps (8 resets) in 825 ms. (484 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400004 steps (8 resets) in 893 ms. (447 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400004 steps (8 resets) in 874 ms. (457 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400004 steps (8 resets) in 959 ms. (416 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400004 steps (8 resets) in 901 ms. (443 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400004 steps (8 resets) in 972 ms. (411 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400004 steps (8 resets) in 813 ms. (491 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400004 steps (8 resets) in 927 ms. (431 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400004 steps (8 resets) in 992 ms. (402 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400004 steps (8 resets) in 855 ms. (467 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1097 ms. (364 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400004 steps (8 resets) in 884 ms. (451 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400004 steps (8 resets) in 811 ms. (492 steps per ms) remains 74/75 properties
Finished probabilistic random walk after 12099549 steps, run visited all 74 properties in 63389 ms. (steps per millisecond=190 )
Probabilistic random walk after 12099549 steps, saw 2017270 distinct states, run finished after 63398 ms. (steps per millisecond=190 ) properties seen :74
Able to resolve query QuasiLiveness after proving 365 properties.
Starting structural reductions in LIVENESS mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 480 transition count 490
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 280 transition count 490
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 400 place count 280 transition count 390
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 600 place count 180 transition count 390
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 640 place count 160 transition count 370
Applied a total of 640 rules in 24 ms. Remains 160 /480 variables (removed 320) and now considering 370/690 (removed 320) transitions.
[2025-06-02 06:16:52] [INFO ] Flow matrix only has 310 transitions (discarded 60 similar events)
// Phase 1: matrix 310 rows 160 cols
[2025-06-02 06:16:52] [INFO ] Computed 19 invariants in 3 ms
[2025-06-02 06:16:52] [INFO ] Implicit Places using invariants in 147 ms returned [150, 151, 152, 153, 154]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 148 ms to find 5 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 155/480 places, 370/690 transitions.
Applied a total of 0 rules in 2 ms. Remains 155 /155 variables (removed 0) and now considering 370/370 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 175 ms. Remains : 155/480 places, 370/690 transitions.
Discarding 5 transitions out of 370. Remains 365
Net is quasi-live, checking if it is reversible to establish liveness.
Unable to solve all queries for examination Liveness. Remains :1 assertions to prove.
Unable to solve all queries for examination Liveness. Remains :365 assertions to prove.
No /home/mcc/execution/Liveness.xml examination file found. Proceeding without properties.
Parsed 365 properties from file /home/mcc/execution/Liveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 245155 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Peterson-PT-4

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 480
TRANSITIONS: 690
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 2120
NUPN UNITS: 16
LOADING TIME: 0.661

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.035
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 0.928
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: 1673
MODEL NAME: /home/mcc/execution/model
480 places, 690 transitions.

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.
Building monolithic NSF...

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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination Liveness -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="Peterson-PT-4"
export BK_EXAMINATION="Liveness"
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 Peterson-PT-4, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r154-tall-174876825600384"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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