Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r516-tajo-171654447000413.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBNT-COL-S10J30, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654447000413
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 7.9K Apr 12 11:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 12 11:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 11:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 11:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.5K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 14:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 12 14:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 12 13:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 12 13:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 93K May 18 16:43 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717259031679

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S10J30
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:23:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 16:23:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:23:53] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 16:23:54] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 16:23:54] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 741 ms
[2024-06-01 16:23:54] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 694 PT places and 12142.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2024-06-01 16:23:54] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 6 ms.
[2024-06-01 16:23:54] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2024-06-01 16:23:54] [INFO ] Computed 13 invariants in 7 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 10, 0, 0, 0, 0, 0, 0, 0, 0, 10] Max Struct:[+inf, 2, 4, 1, 1, +inf, +inf, +inf, 1, +inf, 10, 1, 3, +inf, +inf, 10]
FORMULA PolyORBNT-COL-S10J30-UpperBounds-15 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-06-01 16:23:54] [INFO ] Invariant cache hit.
[2024-06-01 16:23:54] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-06-01 16:23:54] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 12 ms returned sat
[2024-06-01 16:23:54] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-06-01 16:23:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:23:54] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 16:23:54] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 21 ms to minimize.
[2024-06-01 16:23:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:23:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 16:23:54] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-06-01 16:23:54] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-06-01 16:23:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 16:23:55] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-06-01 16:23:55] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-06-01 16:23:55] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-06-01 16:23:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 109 ms
[2024-06-01 16:23:55] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 16:23:55] [INFO ] Added : 36 causal constraints over 8 iterations in 59 ms. Result :sat
Minimization took 28 ms.
[2024-06-01 16:23:55] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-06-01 16:23:55] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-06-01 16:23:55] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-06-01 16:23:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:23:55] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 16:23:55] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-06-01 16:23:55] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-06-01 16:23:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 16:23:55] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 16:23:55] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-06-01 16:23:55] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-06-01 16:23:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 114 ms
[2024-06-01 16:23:55] [INFO ] Added : 20 causal constraints over 4 iterations in 237 ms. Result :sat
Minimization took 148 ms.
[2024-06-01 16:23:55] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-06-01 16:23:55] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-06-01 16:23:55] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-06-01 16:23:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:23:55] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 16:23:55] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-06-01 16:23:55] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-06-01 16:23:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 16:23:55] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-06-01 16:23:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2024-06-01 16:23:55] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 16:23:56] [INFO ] Added : 22 causal constraints over 5 iterations in 101 ms. Result :sat
Minimization took 126 ms.
[2024-06-01 16:23:56] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-06-01 16:23:56] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-06-01 16:23:56] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-06-01 16:23:56] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 16:23:56] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-06-01 16:23:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:23:56] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 16:23:56] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-06-01 16:23:56] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-06-01 16:23:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2024-06-01 16:23:56] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-06-01 16:23:56] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 16:23:56] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-06-01 16:23:56] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 16:23:56] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 16:23:56] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 177 ms
[2024-06-01 16:23:56] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 16:23:56] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-06-01 16:23:56] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-06-01 16:23:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 71 ms
[2024-06-01 16:23:56] [INFO ] Added : 36 causal constraints over 8 iterations in 123 ms. Result :sat
Minimization took 30 ms.
[2024-06-01 16:23:56] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 16:23:56] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-06-01 16:23:56] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-06-01 16:23:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:23:56] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 16:23:56] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-06-01 16:23:56] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 16:23:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 16:23:56] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-06-01 16:23:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2024-06-01 16:23:56] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 16:23:56] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-06-01 16:23:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2024-06-01 16:23:56] [INFO ] Added : 36 causal constraints over 8 iterations in 98 ms. Result :sat
Minimization took 28 ms.
[2024-06-01 16:23:56] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 16:23:56] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-06-01 16:23:56] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-06-01 16:23:56] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 16:23:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:23:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 16:23:57] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-06-01 16:23:57] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-06-01 16:23:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 16:23:57] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-06-01 16:23:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2024-06-01 16:23:57] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 16:23:57] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-06-01 16:23:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2024-06-01 16:23:57] [INFO ] Added : 36 causal constraints over 8 iterations in 168 ms. Result :sat
Minimization took 26 ms.
[2024-06-01 16:23:57] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 16:23:57] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-06-01 16:23:57] [INFO ] [Real]Absence check using state equation in 12 ms returned unsat
[2024-06-01 16:23:57] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-06-01 16:23:57] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-06-01 16:23:57] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-06-01 16:23:57] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 16:23:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:23:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 16:23:57] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-06-01 16:23:57] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-06-01 16:23:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 16:23:57] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-06-01 16:23:57] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2024-06-01 16:23:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 59 ms
[2024-06-01 16:23:57] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 16:23:57] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-06-01 16:23:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2024-06-01 16:23:57] [INFO ] Added : 36 causal constraints over 8 iterations in 150 ms. Result :sat
Minimization took 22 ms.
[2024-06-01 16:23:57] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 16:23:57] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-06-01 16:23:57] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-06-01 16:23:57] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 16:23:57] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-01 16:23:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:23:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 16:23:57] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-06-01 16:23:57] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-06-01 16:23:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 16:23:57] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-01 16:23:57] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-06-01 16:23:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 89 ms
[2024-06-01 16:23:57] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 16:23:57] [INFO ] Added : 12 causal constraints over 3 iterations in 29 ms. Result :sat
Minimization took 33 ms.
[2024-06-01 16:23:58] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-06-01 16:23:58] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-06-01 16:23:58] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-06-01 16:23:58] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 16:23:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:23:58] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-06-01 16:23:58] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-06-01 16:23:58] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-06-01 16:23:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 16:23:58] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 16:23:58] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 21 ms.
[2024-06-01 16:23:58] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-06-01 16:23:58] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-06-01 16:23:58] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-06-01 16:23:58] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 16:23:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:23:58] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-06-01 16:23:58] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-06-01 16:23:58] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-06-01 16:23:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 16:23:58] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-06-01 16:23:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2024-06-01 16:23:58] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 16:23:58] [INFO ] Added : 15 causal constraints over 3 iterations in 537 ms. Result :sat
Minimization took 125 ms.
[2024-06-01 16:23:59] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 16:23:59] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-06-01 16:23:59] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-06-01 16:23:59] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 16:23:59] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-06-01 16:23:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:23:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-06-01 16:23:59] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-06-01 16:23:59] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-06-01 16:23:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 16:23:59] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 5 ms to minimize.
[2024-06-01 16:23:59] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-06-01 16:23:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 78 ms
[2024-06-01 16:23:59] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 16:23:59] [INFO ] Added : 11 causal constraints over 3 iterations in 22 ms. Result :sat
Minimization took 24 ms.
[2024-06-01 16:23:59] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 16:23:59] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-06-01 16:23:59] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-06-01 16:23:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:23:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 16:23:59] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-06-01 16:23:59] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 16:23:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 90 ms returned sat
[2024-06-01 16:23:59] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-06-01 16:23:59] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-06-01 16:23:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 91 ms
[2024-06-01 16:23:59] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 16:23:59] [INFO ] Added : 21 causal constraints over 5 iterations in 32 ms. Result :sat
Minimization took 111 ms.
[2024-06-01 16:23:59] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-06-01 16:23:59] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-06-01 16:23:59] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-06-01 16:23:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:23:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 16:23:59] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-06-01 16:23:59] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-06-01 16:23:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 16:23:59] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-06-01 16:23:59] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 16:23:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 74 ms
[2024-06-01 16:23:59] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 16:24:00] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 2 ms to minimize.
[2024-06-01 16:24:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2024-06-01 16:24:00] [INFO ] Added : 36 causal constraints over 8 iterations in 122 ms. Result :sat
Minimization took 48 ms.
[2024-06-01 16:24:00] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 16:24:00] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2024-06-01 16:24:00] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-06-01 16:24:00] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 16:24:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:24:00] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 16:24:00] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-06-01 16:24:00] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-06-01 16:24:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 16:24:00] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 16:24:00] [INFO ] Added : 3 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 10, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 2, 4, 1, 1, +inf, 10, +inf, 1, +inf, 10, 1, 3, +inf, +inf]
FORMULA PolyORBNT-COL-S10J30-UpperBounds-06 10 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-06-01 16:24:00] [INFO ] Unfolded HLPN to a Petri net with 694 places and 12080 transitions 112619 arcs in 309 ms.
[2024-06-01 16:24:00] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Deduced a syphon composed of 30 places in 30 ms
Reduce places removed 30 places and 30 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 2, 4, 1, 1, +inf, +inf, 1, +inf, 10, 1, 3, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 2, 4, 1, 1, +inf, +inf, 1, +inf, 10, 1, 3, +inf, +inf]
[2024-06-01 16:24:00] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
// Phase 1: matrix 1931 rows 664 cols
[2024-06-01 16:24:00] [INFO ] Computed 92 invariants in 150 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[11, 2, 4, 1, 1, 31, 32, 1, 11, 10, 1, 3, 32, 31]
RANDOM walk for 10000 steps (560 resets) in 357 ms. (27 steps per ms)
BEST_FIRST walk for 140012 steps (1472 resets) in 553 ms. (252 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0] Max Struct:[11, 2, 4, 1, 1, 31, 32, 1, 11, 10, 1, 3, 32, 31]
[2024-06-01 16:24:01] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
[2024-06-01 16:24:01] [INFO ] Invariant cache hit.
[2024-06-01 16:24:01] [INFO ] [Real]Absence check using 85 positive place invariants in 27 ms returned sat
[2024-06-01 16:24:01] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 15 ms returned sat
[2024-06-01 16:24:02] [INFO ] [Real]Absence check using state equation in 498 ms returned sat
[2024-06-01 16:24:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:24:02] [INFO ] [Nat]Absence check using 85 positive place invariants in 24 ms returned sat
[2024-06-01 16:24:02] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 10 ms returned sat
[2024-06-01 16:24:03] [INFO ] [Nat]Absence check using state equation in 463 ms returned sat
[2024-06-01 16:24:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:24:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 227 ms returned sat
[2024-06-01 16:24:03] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 289 ms.
[2024-06-01 16:24:05] [INFO ] Deduced a trap composed of 19 places in 1176 ms of which 4 ms to minimize.
[2024-06-01 16:24:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1441 ms
[2024-06-01 16:24:06] [INFO ] Added : 27 causal constraints over 6 iterations in 2748 ms. Result :sat
Minimization took 734 ms.
[2024-06-01 16:24:07] [INFO ] [Real]Absence check using 85 positive place invariants in 29 ms returned sat
[2024-06-01 16:24:07] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 13 ms returned sat
[2024-06-01 16:24:07] [INFO ] [Real]Absence check using state equation in 609 ms returned sat
[2024-06-01 16:24:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:24:07] [INFO ] [Nat]Absence check using 85 positive place invariants in 43 ms returned sat
[2024-06-01 16:24:07] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 14 ms returned sat
[2024-06-01 16:24:08] [INFO ] [Nat]Absence check using state equation in 830 ms returned sat
[2024-06-01 16:24:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 98 ms returned sat
[2024-06-01 16:24:09] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 349 ms.
[2024-06-01 16:24:10] [INFO ] Added : 10 causal constraints over 2 iterations in 1310 ms. Result :sat
Minimization took 643 ms.
[2024-06-01 16:24:11] [INFO ] [Real]Absence check using 85 positive place invariants in 29 ms returned sat
[2024-06-01 16:24:11] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 15 ms returned sat
[2024-06-01 16:24:11] [INFO ] [Real]Absence check using state equation in 492 ms returned sat
[2024-06-01 16:24:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:24:11] [INFO ] [Nat]Absence check using 85 positive place invariants in 48 ms returned sat
[2024-06-01 16:24:11] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 20 ms returned sat
[2024-06-01 16:24:12] [INFO ] [Nat]Absence check using state equation in 914 ms returned sat
[2024-06-01 16:24:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 103 ms returned sat
[2024-06-01 16:24:13] [INFO ] Deduced a trap composed of 282 places in 502 ms of which 4 ms to minimize.
[2024-06-01 16:24:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 913 ms
[2024-06-01 16:24:13] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 163 ms.
[2024-06-01 16:24:14] [INFO ] Added : 11 causal constraints over 3 iterations in 526 ms. Result :sat
Minimization took 689 ms.
[2024-06-01 16:24:15] [INFO ] [Real]Absence check using 85 positive place invariants in 26 ms returned sat
[2024-06-01 16:24:15] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 13 ms returned sat
[2024-06-01 16:24:15] [INFO ] [Real]Absence check using state equation in 665 ms returned sat
[2024-06-01 16:24:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:24:16] [INFO ] [Nat]Absence check using 85 positive place invariants in 29 ms returned sat
[2024-06-01 16:24:16] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 20 ms returned sat
[2024-06-01 16:24:16] [INFO ] [Nat]Absence check using state equation in 458 ms returned sat
[2024-06-01 16:24:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 330 ms returned sat
[2024-06-01 16:24:17] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 150 ms.
[2024-06-01 16:24:18] [INFO ] Deduced a trap composed of 89 places in 666 ms of which 5 ms to minimize.
[2024-06-01 16:24:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1016 ms
[2024-06-01 16:24:19] [INFO ] Deduced a trap composed of 311 places in 572 ms of which 5 ms to minimize.
[2024-06-01 16:24:20] [INFO ] Deduced a trap composed of 82 places in 640 ms of which 4 ms to minimize.
[2024-06-01 16:24:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1502 ms
Maximisation of solution failed !
Minimization took 1 ms.
[2024-06-01 16:24:21] [INFO ] [Real]Absence check using 85 positive place invariants in 27 ms returned sat
[2024-06-01 16:24:21] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 12 ms returned sat
[2024-06-01 16:24:21] [INFO ] [Real]Absence check using state equation in 585 ms returned sat
[2024-06-01 16:24:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:24:21] [INFO ] [Nat]Absence check using 85 positive place invariants in 26 ms returned sat
[2024-06-01 16:24:21] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 20 ms returned sat
[2024-06-01 16:24:23] [INFO ] [Nat]Absence check using state equation in 1348 ms returned sat
[2024-06-01 16:24:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 131 ms returned sat
[2024-06-01 16:24:23] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 199 ms.
[2024-06-01 16:24:24] [INFO ] Deduced a trap composed of 19 places in 419 ms of which 2 ms to minimize.
[2024-06-01 16:24:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 797 ms
[2024-06-01 16:24:25] [INFO ] Added : 27 causal constraints over 6 iterations in 1701 ms. Result :sat
Minimization took 634 ms.
[2024-06-01 16:24:25] [INFO ] [Real]Absence check using 85 positive place invariants in 22 ms returned sat
[2024-06-01 16:24:25] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 10 ms returned sat
[2024-06-01 16:24:26] [INFO ] [Real]Absence check using state equation in 600 ms returned sat
[2024-06-01 16:24:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:24:26] [INFO ] [Nat]Absence check using 85 positive place invariants in 25 ms returned sat
[2024-06-01 16:24:26] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 9 ms returned sat
[2024-06-01 16:24:27] [INFO ] [Nat]Absence check using state equation in 754 ms returned sat
[2024-06-01 16:24:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 255 ms returned sat
[2024-06-01 16:24:28] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 199 ms.
[2024-06-01 16:24:29] [INFO ] Deduced a trap composed of 19 places in 464 ms of which 2 ms to minimize.
[2024-06-01 16:24:29] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 1027 ms
Maximisation of solution failed !
Minimization took 1 ms.
[2024-06-01 16:24:31] [INFO ] [Real]Absence check using 85 positive place invariants in 28 ms returned sat
[2024-06-01 16:24:31] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 14 ms returned sat
[2024-06-01 16:24:32] [INFO ] [Real]Absence check using state equation in 657 ms returned sat
[2024-06-01 16:24:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:24:32] [INFO ] [Nat]Absence check using 85 positive place invariants in 20 ms returned sat
[2024-06-01 16:24:32] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 9 ms returned sat
[2024-06-01 16:24:33] [INFO ] [Nat]Absence check using state equation in 641 ms returned sat
[2024-06-01 16:24:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 115 ms returned sat
[2024-06-01 16:24:33] [INFO ] Deduced a trap composed of 154 places in 464 ms of which 6 ms to minimize.
[2024-06-01 16:24:34] [INFO ] Deduced a trap composed of 323 places in 414 ms of which 3 ms to minimize.
[2024-06-01 16:24:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1069 ms
[2024-06-01 16:24:34] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 154 ms.
[2024-06-01 16:24:36] [INFO ] Deduced a trap composed of 12 places in 593 ms of which 3 ms to minimize.
[2024-06-01 16:24:37] [INFO ] Deduced a trap composed of 19 places in 565 ms of which 4 ms to minimize.
[2024-06-01 16:24:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1393 ms
[2024-06-01 16:24:37] [INFO ] Added : 27 causal constraints over 6 iterations in 2879 ms. Result :sat
Minimization took 174 ms.
[2024-06-01 16:24:37] [INFO ] [Real]Absence check using 85 positive place invariants in 28 ms returned sat
[2024-06-01 16:24:37] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 15 ms returned sat
[2024-06-01 16:24:38] [INFO ] [Real]Absence check using state equation in 618 ms returned sat
[2024-06-01 16:24:38] [INFO ] [Real]Added 1 Read/Feed constraints in 39 ms returned sat
[2024-06-01 16:24:38] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 174 ms.
[2024-06-01 16:24:39] [INFO ] Added : 7 causal constraints over 2 iterations in 575 ms. Result :sat
Minimization took 683 ms.
[2024-06-01 16:24:39] [INFO ] [Real]Absence check using 85 positive place invariants in 21 ms returned sat
[2024-06-01 16:24:39] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 11 ms returned unsat
[2024-06-01 16:24:40] [INFO ] [Real]Absence check using 85 positive place invariants in 24 ms returned sat
[2024-06-01 16:24:40] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 12 ms returned sat
[2024-06-01 16:24:40] [INFO ] [Real]Absence check using state equation in 509 ms returned sat
[2024-06-01 16:24:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:24:40] [INFO ] [Nat]Absence check using 85 positive place invariants in 20 ms returned sat
[2024-06-01 16:24:40] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 9 ms returned sat
[2024-06-01 16:24:41] [INFO ] [Nat]Absence check using state equation in 571 ms returned sat
[2024-06-01 16:24:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 142 ms returned sat
[2024-06-01 16:24:41] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 148 ms.
[2024-06-01 16:24:42] [INFO ] Added : 6 causal constraints over 2 iterations in 474 ms. Result :sat
Minimization took 649 ms.
[2024-06-01 16:24:42] [INFO ] [Real]Absence check using 85 positive place invariants in 24 ms returned sat
[2024-06-01 16:24:42] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 13 ms returned sat
[2024-06-01 16:24:43] [INFO ] [Real]Absence check using state equation in 485 ms returned sat
[2024-06-01 16:24:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:24:43] [INFO ] [Nat]Absence check using 85 positive place invariants in 19 ms returned sat
[2024-06-01 16:24:43] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 11 ms returned sat
[2024-06-01 16:24:43] [INFO ] [Nat]Absence check using state equation in 504 ms returned sat
[2024-06-01 16:24:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 9 ms returned sat
[2024-06-01 16:24:44] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 226 ms.
[2024-06-01 16:24:44] [INFO ] Added : 6 causal constraints over 2 iterations in 494 ms. Result :sat
Minimization took 654 ms.
[2024-06-01 16:24:45] [INFO ] [Real]Absence check using 85 positive place invariants in 23 ms returned sat
[2024-06-01 16:24:45] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 14 ms returned sat
[2024-06-01 16:24:46] [INFO ] [Real]Absence check using state equation in 696 ms returned sat
[2024-06-01 16:24:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:24:46] [INFO ] [Nat]Absence check using 85 positive place invariants in 25 ms returned sat
[2024-06-01 16:24:46] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 11 ms returned sat
[2024-06-01 16:24:46] [INFO ] [Nat]Absence check using state equation in 531 ms returned sat
[2024-06-01 16:24:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 209 ms returned sat
[2024-06-01 16:24:47] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 158 ms.
[2024-06-01 16:24:48] [INFO ] Deduced a trap composed of 292 places in 568 ms of which 5 ms to minimize.
[2024-06-01 16:24:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 857 ms
[2024-06-01 16:24:48] [INFO ] Added : 11 causal constraints over 3 iterations in 1635 ms. Result :sat
Minimization took 641 ms.
[2024-06-01 16:24:49] [INFO ] [Real]Absence check using 85 positive place invariants in 26 ms returned sat
[2024-06-01 16:24:49] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 9 ms returned sat
[2024-06-01 16:24:50] [INFO ] [Real]Absence check using state equation in 556 ms returned sat
[2024-06-01 16:24:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:24:50] [INFO ] [Nat]Absence check using 85 positive place invariants in 30 ms returned sat
[2024-06-01 16:24:50] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 12 ms returned sat
[2024-06-01 16:24:50] [INFO ] [Nat]Absence check using state equation in 485 ms returned sat
[2024-06-01 16:24:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 231 ms returned sat
[2024-06-01 16:24:51] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 166 ms.
[2024-06-01 16:24:52] [INFO ] Deduced a trap composed of 19 places in 406 ms of which 2 ms to minimize.
[2024-06-01 16:24:52] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 975 ms
Maximisation of solution failed !
Minimization took 1 ms.
[2024-06-01 16:24:55] [INFO ] [Real]Absence check using 85 positive place invariants in 27 ms returned sat
[2024-06-01 16:24:55] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 13 ms returned sat
[2024-06-01 16:24:55] [INFO ] [Real]Absence check using state equation in 602 ms returned sat
[2024-06-01 16:24:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:24:56] [INFO ] [Nat]Absence check using 85 positive place invariants in 24 ms returned sat
[2024-06-01 16:24:56] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 12 ms returned sat
[2024-06-01 16:24:56] [INFO ] [Nat]Absence check using state equation in 473 ms returned sat
[2024-06-01 16:24:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 203 ms returned sat
[2024-06-01 16:24:57] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 192 ms.
[2024-06-01 16:24:58] [INFO ] Deduced a trap composed of 19 places in 425 ms of which 2 ms to minimize.
[2024-06-01 16:24:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 773 ms
[2024-06-01 16:24:58] [INFO ] Added : 32 causal constraints over 7 iterations in 1989 ms. Result :sat
Minimization took 637 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0] Max Struct:[11, 2, 4, 1, 1, 31, 32, 1, 1, 10, 1, 3, 32, 31]
FORMULA PolyORBNT-COL-S10J30-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[11, 2, 4, 1, 1, 31, 32, 1, 10, 1, 3, 32, 31]
Support contains 103 out of 664 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 654 transition count 1938
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 15 place count 652 transition count 1937
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 651 transition count 1937
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 16 place count 651 transition count 1902
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 86 place count 616 transition count 1902
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 88 place count 615 transition count 1901
Applied a total of 88 rules in 483 ms. Remains 615 /664 variables (removed 49) and now considering 1901/1940 (removed 39) transitions.
Running 1890 sub problems to find dead transitions.
[2024-06-01 16:25:00] [INFO ] Flow matrix only has 1892 transitions (discarded 9 similar events)
// Phase 1: matrix 1892 rows 615 cols
[2024-06-01 16:25:00] [INFO ] Computed 82 invariants in 108 ms
[2024-06-01 16:25:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 67/67 constraints. Problems are: Problem set: 0 solved, 1890 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 5/72 constraints. Problems are: Problem set: 0 solved, 1890 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 605/2507 variables, and 72 constraints, problems are : Problem set: 0 solved, 1890 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 67/76 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/615 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1890/890 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1890 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 67/67 constraints. Problems are: Problem set: 0 solved, 1890 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 5/72 constraints. Problems are: Problem set: 0 solved, 1890 unsolved
[2024-06-01 16:25:41] [INFO ] Deduced a trap composed of 19 places in 316 ms of which 3 ms to minimize.
[2024-06-01 16:25:44] [INFO ] Deduced a trap composed of 11 places in 446 ms of which 3 ms to minimize.
[2024-06-01 16:25:57] [INFO ] Deduced a trap composed of 20 places in 231 ms of which 3 ms to minimize.
[2024-06-01 16:25:58] [INFO ] Deduced a trap composed of 20 places in 247 ms of which 3 ms to minimize.
[2024-06-01 16:25:58] [INFO ] Deduced a trap composed of 20 places in 248 ms of which 3 ms to minimize.
[2024-06-01 16:25:58] [INFO ] Deduced a trap composed of 20 places in 261 ms of which 3 ms to minimize.
[2024-06-01 16:25:58] [INFO ] Deduced a trap composed of 20 places in 252 ms of which 12 ms to minimize.
[2024-06-01 16:25:59] [INFO ] Deduced a trap composed of 20 places in 245 ms of which 3 ms to minimize.
[2024-06-01 16:25:59] [INFO ] Deduced a trap composed of 20 places in 245 ms of which 3 ms to minimize.
SMT process timed out in 59252ms, After SMT, problems are : Problem set: 0 solved, 1890 unsolved
Search for dead transitions found 0 dead transitions in 59369ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59919 ms. Remains : 615/664 places, 1901/1940 transitions.
[2024-06-01 16:25:59] [INFO ] Flow matrix only has 1892 transitions (discarded 9 similar events)
[2024-06-01 16:25:59] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[11, 2, 4, 1, 1, 31, 32, 1, 10, 1, 3, 32, 31]
RANDOM walk for 1000000 steps (70346 resets) in 14169 ms. (70 steps per ms)
FORMULA PolyORBNT-COL-S10J30-UpperBounds-12 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 7000005 steps (62440 resets) in 17980 ms. (389 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 3, 1, 1, 4, 1, 1] Max Struct:[11, 4, 31, 32, 10, 32, 31]
[2024-06-01 16:26:31] [INFO ] Flow matrix only has 1892 transitions (discarded 9 similar events)
[2024-06-01 16:26:31] [INFO ] Invariant cache hit.
[2024-06-01 16:26:31] [INFO ] [Real]Absence check using 76 positive place invariants in 22 ms returned sat
[2024-06-01 16:26:31] [INFO ] [Real]Absence check using 76 positive and 6 generalized place invariants in 6 ms returned unsat
[2024-06-01 16:26:31] [INFO ] [Real]Absence check using 76 positive place invariants in 20 ms returned sat
[2024-06-01 16:26:31] [INFO ] [Real]Absence check using 76 positive and 6 generalized place invariants in 13 ms returned sat
[2024-06-01 16:26:32] [INFO ] [Real]Absence check using state equation in 451 ms returned sat
[2024-06-01 16:26:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:26:32] [INFO ] [Nat]Absence check using 76 positive place invariants in 19 ms returned sat
[2024-06-01 16:26:32] [INFO ] [Nat]Absence check using 76 positive and 6 generalized place invariants in 11 ms returned sat
[2024-06-01 16:26:32] [INFO ] [Nat]Absence check using state equation in 385 ms returned sat
[2024-06-01 16:26:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:26:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 179 ms returned sat
[2024-06-01 16:26:33] [INFO ] Computed and/alt/rep : 1410/4676/1410 causal constraints (skipped 471 transitions) in 138 ms.
[2024-06-01 16:26:33] [INFO ] Added : 6 causal constraints over 2 iterations in 411 ms. Result :sat
Minimization took 1824 ms.
[2024-06-01 16:26:35] [INFO ] [Real]Absence check using 76 positive place invariants in 17 ms returned sat
[2024-06-01 16:26:35] [INFO ] [Real]Absence check using 76 positive and 6 generalized place invariants in 4 ms returned unsat
[2024-06-01 16:26:35] [INFO ] [Real]Absence check using 76 positive place invariants in 17 ms returned sat
[2024-06-01 16:26:35] [INFO ] [Real]Absence check using 76 positive and 6 generalized place invariants in 8 ms returned unsat
[2024-06-01 16:26:35] [INFO ] [Real]Absence check using 76 positive place invariants in 17 ms returned sat
[2024-06-01 16:26:35] [INFO ] [Real]Absence check using 76 positive and 6 generalized place invariants in 8 ms returned unsat
[2024-06-01 16:26:35] [INFO ] [Real]Absence check using 76 positive place invariants in 17 ms returned sat
[2024-06-01 16:26:35] [INFO ] [Real]Absence check using 76 positive and 6 generalized place invariants in 8 ms returned unsat
[2024-06-01 16:26:36] [INFO ] [Real]Absence check using 76 positive place invariants in 31 ms returned sat
[2024-06-01 16:26:36] [INFO ] [Real]Absence check using 76 positive and 6 generalized place invariants in 17 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 3, 1, 1, 4, 1, 1] Max Struct:[1, 4, 1, 1, 4, 1, 1]
FORMULA PolyORBNT-COL-S10J30-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-10 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[4]
Support contains 1 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1901/1901 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 615 transition count 1899
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 613 transition count 1899
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 4 place count 613 transition count 1868
Deduced a syphon composed of 31 places in 3 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 66 place count 582 transition count 1868
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 70 place count 580 transition count 1866
Applied a total of 70 rules in 160 ms. Remains 580 /615 variables (removed 35) and now considering 1866/1901 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161 ms. Remains : 580/615 places, 1866/1901 transitions.
[2024-06-01 16:26:36] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
// Phase 1: matrix 1857 rows 580 cols
[2024-06-01 16:26:36] [INFO ] Computed 82 invariants in 45 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[4]
RANDOM walk for 1000000 steps (72677 resets) in 13439 ms. (74 steps per ms)
BEST_FIRST walk for 1000001 steps (8993 resets) in 2082 ms. (480 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[4]
[2024-06-01 16:26:51] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-06-01 16:26:51] [INFO ] Invariant cache hit.
[2024-06-01 16:26:52] [INFO ] [Real]Absence check using 75 positive place invariants in 18 ms returned sat
[2024-06-01 16:26:52] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 12 ms returned sat
[2024-06-01 16:26:52] [INFO ] [Real]Absence check using state equation in 472 ms returned sat
[2024-06-01 16:26:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:26:52] [INFO ] [Nat]Absence check using 75 positive place invariants in 17 ms returned sat
[2024-06-01 16:26:52] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 10 ms returned sat
[2024-06-01 16:26:53] [INFO ] [Nat]Absence check using state equation in 587 ms returned sat
[2024-06-01 16:26:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:26:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 139 ms returned sat
[2024-06-01 16:26:53] [INFO ] Computed and/alt/rep : 1375/5196/1375 causal constraints (skipped 471 transitions) in 170 ms.
[2024-06-01 16:26:54] [INFO ] Added : 9 causal constraints over 3 iterations in 653 ms. Result :sat
Minimization took 2483 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[4]
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1866/1866 transitions.
Applied a total of 0 rules in 47 ms. Remains 580 /580 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 580/580 places, 1866/1866 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1866/1866 transitions.
Applied a total of 0 rules in 71 ms. Remains 580 /580 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
[2024-06-01 16:26:56] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-06-01 16:26:56] [INFO ] Invariant cache hit.
[2024-06-01 16:26:57] [INFO ] Implicit Places using invariants in 725 ms returned []
[2024-06-01 16:26:57] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-06-01 16:26:57] [INFO ] Invariant cache hit.
[2024-06-01 16:26:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:27:00] [INFO ] Implicit Places using invariants and state equation in 3213 ms returned []
Implicit Place search using SMT with State Equation took 3950 ms to find 0 implicit places.
[2024-06-01 16:27:01] [INFO ] Redundant transitions in 119 ms returned []
Running 1855 sub problems to find dead transitions.
[2024-06-01 16:27:01] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-06-01 16:27:01] [INFO ] Invariant cache hit.
[2024-06-01 16:27:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD947 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1007 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1019 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1148 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1218 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1304 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1306 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1313 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1334 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1366 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1369 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1371 is UNSAT
Problem TDEAD1372 is UNSAT
Problem TDEAD1373 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1380 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1395 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1410 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1414 is UNSAT
Problem TDEAD1415 is UNSAT
Problem TDEAD1416 is UNSAT
Problem TDEAD1417 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1422 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1429 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1440 is UNSAT
Problem TDEAD1447 is UNSAT
Problem TDEAD1455 is UNSAT
Problem TDEAD1464 is UNSAT
Problem TDEAD1465 is UNSAT
Problem TDEAD1466 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1469 is UNSAT
Problem TDEAD1470 is UNSAT
Problem TDEAD1471 is UNSAT
Problem TDEAD1472 is UNSAT
Problem TDEAD1473 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1477 is UNSAT
Problem TDEAD1480 is UNSAT
Problem TDEAD1484 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1502 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1529 is UNSAT
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 9/579 variables, 9/81 constraints. Problems are: Problem set: 558 solved, 1297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 579/2437 variables, and 81 constraints, problems are : Problem set: 558 solved, 1297 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1855/855 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 558 solved, 1297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 558 solved, 1297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 558 solved, 1297 unsolved
[2024-06-01 16:27:59] [INFO ] Deduced a trap composed of 18 places in 249 ms of which 1 ms to minimize.
[2024-06-01 16:28:00] [INFO ] Deduced a trap composed of 13 places in 411 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 2/74 constraints. Problems are: Problem set: 558 solved, 1297 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 0/74 constraints. Problems are: Problem set: 558 solved, 1297 unsolved
At refinement iteration 4 (OVERLAPS) 9/579 variables, 9/83 constraints. Problems are: Problem set: 558 solved, 1297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 579/2437 variables, and 83 constraints, problems are : Problem set: 558 solved, 1297 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 442/855 constraints, Known Traps: 2/2 constraints]
After SMT, in 78231ms problems are : Problem set: 558 solved, 1297 unsolved
Search for dead transitions found 558 dead transitions in 78257ms
Found 558 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 558 transitions
Dead transitions reduction (with SMT) removed 558 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 580/580 places, 1308/1866 transitions.
Applied a total of 0 rules in 55 ms. Remains 580 /580 variables (removed 0) and now considering 1308/1308 (removed 0) transitions.
[2024-06-01 16:28:19] [INFO ] Redundant transitions in 89 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 82595 ms. Remains : 580/580 places, 1308/1866 transitions.
[2024-06-01 16:28:19] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
// Phase 1: matrix 1299 rows 580 cols
[2024-06-01 16:28:19] [INFO ] Computed 82 invariants in 42 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[4]
RANDOM walk for 1000000 steps (72527 resets) in 8694 ms. (115 steps per ms)
BEST_FIRST walk for 1000001 steps (8848 resets) in 1688 ms. (592 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[4]
[2024-06-01 16:28:29] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-06-01 16:28:29] [INFO ] Invariant cache hit.
[2024-06-01 16:28:30] [INFO ] [Real]Absence check using 75 positive place invariants in 20 ms returned sat
[2024-06-01 16:28:30] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 13 ms returned sat
[2024-06-01 16:28:30] [INFO ] [Real]Absence check using state equation in 317 ms returned sat
[2024-06-01 16:28:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:28:30] [INFO ] [Nat]Absence check using 75 positive place invariants in 19 ms returned sat
[2024-06-01 16:28:30] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 12 ms returned sat
[2024-06-01 16:28:30] [INFO ] [Nat]Absence check using state equation in 350 ms returned sat
[2024-06-01 16:28:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:28:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 93 ms returned sat
[2024-06-01 16:28:31] [INFO ] Computed and/alt/rep : 817/3225/817 causal constraints (skipped 471 transitions) in 103 ms.
[2024-06-01 16:28:31] [INFO ] Deduced a trap composed of 106 places in 428 ms of which 4 ms to minimize.
[2024-06-01 16:28:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 578 ms
[2024-06-01 16:28:32] [INFO ] Added : 7 causal constraints over 2 iterations in 1036 ms. Result :sat
Minimization took 1169 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[4]
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1308/1308 transitions.
Applied a total of 0 rules in 33 ms. Remains 580 /580 variables (removed 0) and now considering 1308/1308 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 580/580 places, 1308/1308 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1308/1308 transitions.
Applied a total of 0 rules in 29 ms. Remains 580 /580 variables (removed 0) and now considering 1308/1308 (removed 0) transitions.
[2024-06-01 16:28:33] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-06-01 16:28:33] [INFO ] Invariant cache hit.
[2024-06-01 16:28:34] [INFO ] Implicit Places using invariants in 645 ms returned []
[2024-06-01 16:28:34] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-06-01 16:28:34] [INFO ] Invariant cache hit.
[2024-06-01 16:28:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:28:36] [INFO ] Implicit Places using invariants and state equation in 2803 ms returned []
Implicit Place search using SMT with State Equation took 3473 ms to find 0 implicit places.
[2024-06-01 16:28:36] [INFO ] Redundant transitions in 40 ms returned []
Running 1297 sub problems to find dead transitions.
[2024-06-01 16:28:36] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-06-01 16:28:36] [INFO ] Invariant cache hit.
[2024-06-01 16:28:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-06-01 16:28:51] [INFO ] Deduced a trap composed of 151 places in 156 ms of which 2 ms to minimize.
[2024-06-01 16:28:52] [INFO ] Deduced a trap composed of 146 places in 175 ms of which 3 ms to minimize.
[2024-06-01 16:28:52] [INFO ] Deduced a trap composed of 146 places in 253 ms of which 4 ms to minimize.
[2024-06-01 16:28:52] [INFO ] Deduced a trap composed of 151 places in 177 ms of which 3 ms to minimize.
[2024-06-01 16:28:52] [INFO ] Deduced a trap composed of 151 places in 272 ms of which 4 ms to minimize.
[2024-06-01 16:28:53] [INFO ] Deduced a trap composed of 151 places in 242 ms of which 4 ms to minimize.
[2024-06-01 16:28:53] [INFO ] Deduced a trap composed of 156 places in 229 ms of which 4 ms to minimize.
[2024-06-01 16:28:53] [INFO ] Deduced a trap composed of 156 places in 218 ms of which 4 ms to minimize.
[2024-06-01 16:28:53] [INFO ] Deduced a trap composed of 156 places in 223 ms of which 3 ms to minimize.
[2024-06-01 16:28:54] [INFO ] Deduced a trap composed of 161 places in 219 ms of which 3 ms to minimize.
[2024-06-01 16:28:54] [INFO ] Deduced a trap composed of 156 places in 198 ms of which 3 ms to minimize.
[2024-06-01 16:28:54] [INFO ] Deduced a trap composed of 151 places in 199 ms of which 4 ms to minimize.
[2024-06-01 16:28:54] [INFO ] Deduced a trap composed of 151 places in 195 ms of which 3 ms to minimize.
[2024-06-01 16:28:54] [INFO ] Deduced a trap composed of 161 places in 254 ms of which 13 ms to minimize.
[2024-06-01 16:28:55] [INFO ] Deduced a trap composed of 156 places in 231 ms of which 4 ms to minimize.
[2024-06-01 16:28:55] [INFO ] Deduced a trap composed of 156 places in 250 ms of which 4 ms to minimize.
[2024-06-01 16:28:55] [INFO ] Deduced a trap composed of 151 places in 234 ms of which 4 ms to minimize.
[2024-06-01 16:28:55] [INFO ] Deduced a trap composed of 156 places in 231 ms of which 4 ms to minimize.
[2024-06-01 16:28:56] [INFO ] Deduced a trap composed of 161 places in 241 ms of which 4 ms to minimize.
[2024-06-01 16:28:56] [INFO ] Deduced a trap composed of 161 places in 250 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-06-01 16:29:05] [INFO ] Deduced a trap composed of 13 places in 288 ms of which 4 ms to minimize.
[2024-06-01 16:29:07] [INFO ] Deduced a trap composed of 232 places in 191 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1879 variables, and 94 constraints, problems are : Problem set: 0 solved, 1297 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1297/1297 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 22/94 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-06-01 16:29:15] [INFO ] Deduced a trap composed of 171 places in 219 ms of which 4 ms to minimize.
[2024-06-01 16:29:15] [INFO ] Deduced a trap composed of 176 places in 229 ms of which 4 ms to minimize.
[2024-06-01 16:29:15] [INFO ] Deduced a trap composed of 236 places in 205 ms of which 3 ms to minimize.
[2024-06-01 16:29:15] [INFO ] Deduced a trap composed of 171 places in 196 ms of which 3 ms to minimize.
[2024-06-01 16:29:16] [INFO ] Deduced a trap composed of 171 places in 196 ms of which 3 ms to minimize.
[2024-06-01 16:29:16] [INFO ] Deduced a trap composed of 176 places in 181 ms of which 3 ms to minimize.
[2024-06-01 16:29:16] [INFO ] Deduced a trap composed of 141 places in 254 ms of which 3 ms to minimize.
[2024-06-01 16:29:16] [INFO ] Deduced a trap composed of 151 places in 276 ms of which 4 ms to minimize.
[2024-06-01 16:29:17] [INFO ] Deduced a trap composed of 156 places in 248 ms of which 4 ms to minimize.
[2024-06-01 16:29:17] [INFO ] Deduced a trap composed of 156 places in 246 ms of which 4 ms to minimize.
[2024-06-01 16:29:17] [INFO ] Deduced a trap composed of 151 places in 231 ms of which 3 ms to minimize.
[2024-06-01 16:29:17] [INFO ] Deduced a trap composed of 151 places in 222 ms of which 3 ms to minimize.
[2024-06-01 16:29:18] [INFO ] Deduced a trap composed of 176 places in 209 ms of which 3 ms to minimize.
[2024-06-01 16:29:18] [INFO ] Deduced a trap composed of 171 places in 209 ms of which 3 ms to minimize.
[2024-06-01 16:29:18] [INFO ] Deduced a trap composed of 240 places in 205 ms of which 3 ms to minimize.
[2024-06-01 16:29:18] [INFO ] Deduced a trap composed of 171 places in 203 ms of which 2 ms to minimize.
[2024-06-01 16:29:19] [INFO ] Deduced a trap composed of 156 places in 198 ms of which 3 ms to minimize.
[2024-06-01 16:29:19] [INFO ] Deduced a trap composed of 238 places in 187 ms of which 3 ms to minimize.
[2024-06-01 16:29:19] [INFO ] Deduced a trap composed of 151 places in 225 ms of which 4 ms to minimize.
[2024-06-01 16:29:19] [INFO ] Deduced a trap composed of 161 places in 193 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-06-01 16:29:21] [INFO ] Deduced a trap composed of 238 places in 378 ms of which 4 ms to minimize.
[2024-06-01 16:29:21] [INFO ] Deduced a trap composed of 170 places in 369 ms of which 4 ms to minimize.
[2024-06-01 16:29:22] [INFO ] Deduced a trap composed of 161 places in 383 ms of which 4 ms to minimize.
[2024-06-01 16:29:22] [INFO ] Deduced a trap composed of 228 places in 375 ms of which 4 ms to minimize.
[2024-06-01 16:29:23] [INFO ] Deduced a trap composed of 18 places in 233 ms of which 1 ms to minimize.
[2024-06-01 16:29:25] [INFO ] Deduced a trap composed of 175 places in 341 ms of which 3 ms to minimize.
[2024-06-01 16:29:25] [INFO ] Deduced a trap composed of 156 places in 369 ms of which 3 ms to minimize.
[2024-06-01 16:29:25] [INFO ] Deduced a trap composed of 161 places in 371 ms of which 3 ms to minimize.
[2024-06-01 16:29:26] [INFO ] Deduced a trap composed of 180 places in 372 ms of which 4 ms to minimize.
[2024-06-01 16:29:26] [INFO ] Deduced a trap composed of 190 places in 353 ms of which 3 ms to minimize.
[2024-06-01 16:29:27] [INFO ] Deduced a trap composed of 186 places in 325 ms of which 3 ms to minimize.
[2024-06-01 16:29:27] [INFO ] Deduced a trap composed of 166 places in 298 ms of which 3 ms to minimize.
[2024-06-01 16:29:27] [INFO ] Deduced a trap composed of 156 places in 337 ms of which 3 ms to minimize.
[2024-06-01 16:29:28] [INFO ] Deduced a trap composed of 170 places in 337 ms of which 4 ms to minimize.
[2024-06-01 16:29:28] [INFO ] Deduced a trap composed of 161 places in 367 ms of which 4 ms to minimize.
[2024-06-01 16:29:28] [INFO ] Deduced a trap composed of 185 places in 332 ms of which 4 ms to minimize.
[2024-06-01 16:29:29] [INFO ] Deduced a trap composed of 171 places in 387 ms of which 5 ms to minimize.
[2024-06-01 16:29:29] [INFO ] Deduced a trap composed of 180 places in 255 ms of which 3 ms to minimize.
[2024-06-01 16:29:29] [INFO ] Deduced a trap composed of 170 places in 363 ms of which 4 ms to minimize.
[2024-06-01 16:29:30] [INFO ] Deduced a trap composed of 185 places in 275 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-06-01 16:29:32] [INFO ] Deduced a trap composed of 233 places in 270 ms of which 3 ms to minimize.
[2024-06-01 16:29:33] [INFO ] Deduced a trap composed of 176 places in 355 ms of which 5 ms to minimize.
[2024-06-01 16:29:33] [INFO ] Deduced a trap composed of 251 places in 317 ms of which 3 ms to minimize.
[2024-06-01 16:29:33] [INFO ] Deduced a trap composed of 247 places in 333 ms of which 5 ms to minimize.
[2024-06-01 16:29:34] [INFO ] Deduced a trap composed of 251 places in 404 ms of which 4 ms to minimize.
[2024-06-01 16:29:34] [INFO ] Deduced a trap composed of 240 places in 337 ms of which 4 ms to minimize.
[2024-06-01 16:29:35] [INFO ] Deduced a trap composed of 170 places in 373 ms of which 4 ms to minimize.
[2024-06-01 16:29:35] [INFO ] Deduced a trap composed of 180 places in 345 ms of which 4 ms to minimize.
[2024-06-01 16:29:35] [INFO ] Deduced a trap composed of 195 places in 392 ms of which 4 ms to minimize.
[2024-06-01 16:29:36] [INFO ] Deduced a trap composed of 243 places in 391 ms of which 4 ms to minimize.
[2024-06-01 16:29:36] [INFO ] Deduced a trap composed of 170 places in 340 ms of which 4 ms to minimize.
[2024-06-01 16:29:37] [INFO ] Deduced a trap composed of 175 places in 333 ms of which 3 ms to minimize.
[2024-06-01 16:29:37] [INFO ] Deduced a trap composed of 245 places in 299 ms of which 3 ms to minimize.
[2024-06-01 16:29:37] [INFO ] Deduced a trap composed of 180 places in 365 ms of which 5 ms to minimize.
[2024-06-01 16:29:38] [INFO ] Deduced a trap composed of 242 places in 347 ms of which 4 ms to minimize.
[2024-06-01 16:29:38] [INFO ] Deduced a trap composed of 234 places in 351 ms of which 3 ms to minimize.
[2024-06-01 16:29:38] [INFO ] Deduced a trap composed of 175 places in 379 ms of which 4 ms to minimize.
[2024-06-01 16:29:39] [INFO ] Deduced a trap composed of 161 places in 368 ms of which 4 ms to minimize.
[2024-06-01 16:29:39] [INFO ] Deduced a trap composed of 232 places in 382 ms of which 5 ms to minimize.
[2024-06-01 16:29:40] [INFO ] Deduced a trap composed of 171 places in 346 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/1879 variables, and 154 constraints, problems are : Problem set: 0 solved, 1297 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1297 constraints, Known Traps: 82/82 constraints]
After SMT, in 66421ms problems are : Problem set: 0 solved, 1297 unsolved
Search for dead transitions found 0 dead transitions in 66443ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70000 ms. Remains : 580/580 places, 1308/1308 transitions.
RANDOM walk for 40000 steps (2900 resets) in 1284 ms. (31 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (371 resets) in 211 ms. (188 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (359 resets) in 249 ms. (160 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 364870 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :0 out of 2
Probabilistic random walk after 364870 steps, saw 58829 distinct states, run finished after 3004 ms. (steps per millisecond=121 ) properties seen :0
[2024-06-01 16:29:47] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-06-01 16:29:47] [INFO ] Invariant cache hit.
[2024-06-01 16:29:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 107/116 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 453/569 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/570 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/578 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/579 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1299/1878 variables, 579/661 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1878 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1878 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/1879 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1879 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1879 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1879/1879 variables, and 663 constraints, problems are : Problem set: 0 solved, 2 unsolved in 684 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 107/116 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 453/569 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/570 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/578 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 16:29:48] [INFO ] Deduced a trap composed of 226 places in 323 ms of which 5 ms to minimize.
[2024-06-01 16:29:49] [INFO ] Deduced a trap composed of 228 places in 245 ms of which 3 ms to minimize.
[2024-06-01 16:29:49] [INFO ] Deduced a trap composed of 230 places in 225 ms of which 3 ms to minimize.
[2024-06-01 16:29:49] [INFO ] Deduced a trap composed of 226 places in 323 ms of which 3 ms to minimize.
[2024-06-01 16:29:50] [INFO ] Deduced a trap composed of 230 places in 252 ms of which 3 ms to minimize.
[2024-06-01 16:29:50] [INFO ] Deduced a trap composed of 228 places in 260 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 6/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/578 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/579 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/579 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1299/1878 variables, 579/667 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1878 variables, 1/668 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1878 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/1879 variables, 1/669 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1879 variables, 2/671 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1879 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1879 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1879/1879 variables, and 671 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3185 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 3892ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 84 ms.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1308/1308 transitions.
Applied a total of 0 rules in 34 ms. Remains 580 /580 variables (removed 0) and now considering 1308/1308 (removed 0) transitions.
Running 1297 sub problems to find dead transitions.
[2024-06-01 16:29:51] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-06-01 16:29:51] [INFO ] Invariant cache hit.
[2024-06-01 16:29:51] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-06-01 16:30:07] [INFO ] Deduced a trap composed of 151 places in 271 ms of which 4 ms to minimize.
[2024-06-01 16:30:07] [INFO ] Deduced a trap composed of 146 places in 197 ms of which 3 ms to minimize.
[2024-06-01 16:30:07] [INFO ] Deduced a trap composed of 146 places in 193 ms of which 2 ms to minimize.
[2024-06-01 16:30:08] [INFO ] Deduced a trap composed of 151 places in 186 ms of which 3 ms to minimize.
[2024-06-01 16:30:08] [INFO ] Deduced a trap composed of 151 places in 236 ms of which 3 ms to minimize.
[2024-06-01 16:30:08] [INFO ] Deduced a trap composed of 151 places in 200 ms of which 3 ms to minimize.
[2024-06-01 16:30:08] [INFO ] Deduced a trap composed of 156 places in 270 ms of which 3 ms to minimize.
[2024-06-01 16:30:09] [INFO ] Deduced a trap composed of 156 places in 178 ms of which 3 ms to minimize.
[2024-06-01 16:30:09] [INFO ] Deduced a trap composed of 156 places in 254 ms of which 4 ms to minimize.
[2024-06-01 16:30:09] [INFO ] Deduced a trap composed of 161 places in 285 ms of which 4 ms to minimize.
[2024-06-01 16:30:09] [INFO ] Deduced a trap composed of 156 places in 243 ms of which 3 ms to minimize.
[2024-06-01 16:30:10] [INFO ] Deduced a trap composed of 151 places in 282 ms of which 4 ms to minimize.
[2024-06-01 16:30:10] [INFO ] Deduced a trap composed of 151 places in 233 ms of which 3 ms to minimize.
[2024-06-01 16:30:10] [INFO ] Deduced a trap composed of 161 places in 266 ms of which 4 ms to minimize.
[2024-06-01 16:30:10] [INFO ] Deduced a trap composed of 156 places in 257 ms of which 3 ms to minimize.
[2024-06-01 16:30:11] [INFO ] Deduced a trap composed of 156 places in 189 ms of which 2 ms to minimize.
[2024-06-01 16:30:11] [INFO ] Deduced a trap composed of 151 places in 261 ms of which 4 ms to minimize.
[2024-06-01 16:30:11] [INFO ] Deduced a trap composed of 156 places in 241 ms of which 4 ms to minimize.
[2024-06-01 16:30:11] [INFO ] Deduced a trap composed of 161 places in 222 ms of which 2 ms to minimize.
[2024-06-01 16:30:12] [INFO ] Deduced a trap composed of 161 places in 208 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1879 variables, and 92 constraints, problems are : Problem set: 0 solved, 1297 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1297/1297 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-06-01 16:30:20] [INFO ] Deduced a trap composed of 224 places in 173 ms of which 2 ms to minimize.
[2024-06-01 16:30:20] [INFO ] Deduced a trap composed of 224 places in 230 ms of which 3 ms to minimize.
[2024-06-01 16:30:20] [INFO ] Deduced a trap composed of 224 places in 231 ms of which 3 ms to minimize.
[2024-06-01 16:30:20] [INFO ] Deduced a trap composed of 224 places in 213 ms of which 3 ms to minimize.
[2024-06-01 16:30:20] [INFO ] Deduced a trap composed of 226 places in 218 ms of which 3 ms to minimize.
[2024-06-01 16:30:21] [INFO ] Deduced a trap composed of 228 places in 227 ms of which 3 ms to minimize.
[2024-06-01 16:30:21] [INFO ] Deduced a trap composed of 146 places in 196 ms of which 3 ms to minimize.
[2024-06-01 16:30:21] [INFO ] Deduced a trap composed of 141 places in 194 ms of which 3 ms to minimize.
[2024-06-01 16:30:21] [INFO ] Deduced a trap composed of 141 places in 193 ms of which 3 ms to minimize.
[2024-06-01 16:30:22] [INFO ] Deduced a trap composed of 150 places in 273 ms of which 3 ms to minimize.
[2024-06-01 16:30:22] [INFO ] Deduced a trap composed of 240 places in 352 ms of which 3 ms to minimize.
[2024-06-01 16:30:22] [INFO ] Deduced a trap composed of 190 places in 272 ms of which 3 ms to minimize.
[2024-06-01 16:30:23] [INFO ] Deduced a trap composed of 156 places in 274 ms of which 3 ms to minimize.
[2024-06-01 16:30:23] [INFO ] Deduced a trap composed of 185 places in 281 ms of which 3 ms to minimize.
[2024-06-01 16:30:23] [INFO ] Deduced a trap composed of 151 places in 274 ms of which 3 ms to minimize.
[2024-06-01 16:30:24] [INFO ] Deduced a trap composed of 170 places in 273 ms of which 3 ms to minimize.
[2024-06-01 16:30:24] [INFO ] Deduced a trap composed of 166 places in 269 ms of which 3 ms to minimize.
[2024-06-01 16:30:24] [INFO ] Deduced a trap composed of 165 places in 274 ms of which 3 ms to minimize.
[2024-06-01 16:30:24] [INFO ] Deduced a trap composed of 161 places in 374 ms of which 3 ms to minimize.
[2024-06-01 16:30:25] [INFO ] Deduced a trap composed of 146 places in 286 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-06-01 16:30:26] [INFO ] Deduced a trap composed of 230 places in 210 ms of which 2 ms to minimize.
[2024-06-01 16:30:26] [INFO ] Deduced a trap composed of 238 places in 194 ms of which 3 ms to minimize.
[2024-06-01 16:30:26] [INFO ] Deduced a trap composed of 236 places in 186 ms of which 3 ms to minimize.
[2024-06-01 16:30:27] [INFO ] Deduced a trap composed of 238 places in 199 ms of which 3 ms to minimize.
[2024-06-01 16:30:27] [INFO ] Deduced a trap composed of 236 places in 210 ms of which 3 ms to minimize.
[2024-06-01 16:30:27] [INFO ] Deduced a trap composed of 236 places in 192 ms of which 3 ms to minimize.
[2024-06-01 16:30:27] [INFO ] Deduced a trap composed of 244 places in 193 ms of which 3 ms to minimize.
[2024-06-01 16:30:28] [INFO ] Deduced a trap composed of 238 places in 197 ms of which 3 ms to minimize.
[2024-06-01 16:30:28] [INFO ] Deduced a trap composed of 238 places in 201 ms of which 3 ms to minimize.
[2024-06-01 16:30:28] [INFO ] Deduced a trap composed of 228 places in 185 ms of which 3 ms to minimize.
[2024-06-01 16:30:28] [INFO ] Deduced a trap composed of 232 places in 191 ms of which 3 ms to minimize.
[2024-06-01 16:30:28] [INFO ] Deduced a trap composed of 236 places in 198 ms of which 3 ms to minimize.
[2024-06-01 16:30:29] [INFO ] Deduced a trap composed of 176 places in 201 ms of which 3 ms to minimize.
[2024-06-01 16:30:29] [INFO ] Deduced a trap composed of 171 places in 220 ms of which 2 ms to minimize.
[2024-06-01 16:30:29] [INFO ] Deduced a trap composed of 156 places in 203 ms of which 3 ms to minimize.
[2024-06-01 16:30:31] [INFO ] Deduced a trap composed of 253 places in 318 ms of which 2 ms to minimize.
[2024-06-01 16:30:31] [INFO ] Deduced a trap composed of 170 places in 244 ms of which 3 ms to minimize.
[2024-06-01 16:30:31] [INFO ] Deduced a trap composed of 175 places in 261 ms of which 3 ms to minimize.
[2024-06-01 16:30:31] [INFO ] Deduced a trap composed of 156 places in 249 ms of which 3 ms to minimize.
[2024-06-01 16:30:32] [INFO ] Deduced a trap composed of 161 places in 250 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-06-01 16:30:34] [INFO ] Deduced a trap composed of 156 places in 172 ms of which 3 ms to minimize.
[2024-06-01 16:30:34] [INFO ] Deduced a trap composed of 151 places in 208 ms of which 2 ms to minimize.
[2024-06-01 16:30:34] [INFO ] Deduced a trap composed of 151 places in 275 ms of which 3 ms to minimize.
[2024-06-01 16:30:34] [INFO ] Deduced a trap composed of 146 places in 278 ms of which 3 ms to minimize.
[2024-06-01 16:30:35] [INFO ] Deduced a trap composed of 160 places in 276 ms of which 3 ms to minimize.
[2024-06-01 16:30:35] [INFO ] Deduced a trap composed of 146 places in 285 ms of which 3 ms to minimize.
[2024-06-01 16:30:35] [INFO ] Deduced a trap composed of 141 places in 257 ms of which 3 ms to minimize.
[2024-06-01 16:30:36] [INFO ] Deduced a trap composed of 150 places in 272 ms of which 2 ms to minimize.
[2024-06-01 16:30:36] [INFO ] Deduced a trap composed of 161 places in 260 ms of which 3 ms to minimize.
[2024-06-01 16:30:36] [INFO ] Deduced a trap composed of 161 places in 266 ms of which 3 ms to minimize.
[2024-06-01 16:30:36] [INFO ] Deduced a trap composed of 156 places in 259 ms of which 3 ms to minimize.
[2024-06-01 16:30:37] [INFO ] Deduced a trap composed of 161 places in 275 ms of which 3 ms to minimize.
[2024-06-01 16:30:37] [INFO ] Deduced a trap composed of 151 places in 267 ms of which 2 ms to minimize.
[2024-06-01 16:30:37] [INFO ] Deduced a trap composed of 175 places in 355 ms of which 3 ms to minimize.
[2024-06-01 16:30:38] [INFO ] Deduced a trap composed of 171 places in 266 ms of which 3 ms to minimize.
[2024-06-01 16:30:38] [INFO ] Deduced a trap composed of 171 places in 273 ms of which 3 ms to minimize.
SMT process timed out in 47283ms, After SMT, problems are : Problem set: 0 solved, 1297 unsolved
Search for dead transitions found 0 dead transitions in 47303ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47349 ms. Remains : 580/580 places, 1308/1308 transitions.
RANDOM walk for 40000 steps (2969 resets) in 932 ms. (42 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (349 resets) in 130 ms. (305 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (353 resets) in 161 ms. (246 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 434749 steps, run timeout after 3001 ms. (steps per millisecond=144 ) properties seen :0 out of 2
Probabilistic random walk after 434749 steps, saw 70194 distinct states, run finished after 3001 ms. (steps per millisecond=144 ) properties seen :0
[2024-06-01 16:30:41] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-06-01 16:30:41] [INFO ] Invariant cache hit.
[2024-06-01 16:30:41] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 107/116 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 453/569 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/570 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/578 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/579 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1299/1878 variables, 579/661 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1878 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1878 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/1879 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1879 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1879 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1879/1879 variables, and 663 constraints, problems are : Problem set: 0 solved, 2 unsolved in 942 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 107/116 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 453/569 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/570 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/578 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 16:30:43] [INFO ] Deduced a trap composed of 226 places in 384 ms of which 3 ms to minimize.
[2024-06-01 16:30:43] [INFO ] Deduced a trap composed of 228 places in 344 ms of which 5 ms to minimize.
[2024-06-01 16:30:44] [INFO ] Deduced a trap composed of 230 places in 227 ms of which 4 ms to minimize.
[2024-06-01 16:30:44] [INFO ] Deduced a trap composed of 226 places in 211 ms of which 3 ms to minimize.
[2024-06-01 16:30:44] [INFO ] Deduced a trap composed of 230 places in 221 ms of which 2 ms to minimize.
[2024-06-01 16:30:44] [INFO ] Deduced a trap composed of 228 places in 216 ms of which 16 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 6/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/578 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/579 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/579 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1299/1878 variables, 579/667 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1878 variables, 1/668 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1878 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/1879 variables, 1/669 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1879 variables, 2/671 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1879 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1879 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1879/1879 variables, and 671 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2609 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 3583ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 51 ms.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1308/1308 transitions.
Applied a total of 0 rules in 26 ms. Remains 580 /580 variables (removed 0) and now considering 1308/1308 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 580/580 places, 1308/1308 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1308/1308 transitions.
Applied a total of 0 rules in 20 ms. Remains 580 /580 variables (removed 0) and now considering 1308/1308 (removed 0) transitions.
[2024-06-01 16:30:45] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-06-01 16:30:45] [INFO ] Invariant cache hit.
[2024-06-01 16:30:46] [INFO ] Implicit Places using invariants in 675 ms returned []
[2024-06-01 16:30:46] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-06-01 16:30:46] [INFO ] Invariant cache hit.
[2024-06-01 16:30:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:30:49] [INFO ] Implicit Places using invariants and state equation in 3412 ms returned []
Implicit Place search using SMT with State Equation took 4114 ms to find 0 implicit places.
[2024-06-01 16:30:49] [INFO ] Redundant transitions in 11 ms returned []
Running 1297 sub problems to find dead transitions.
[2024-06-01 16:30:49] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-06-01 16:30:49] [INFO ] Invariant cache hit.
[2024-06-01 16:30:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-06-01 16:31:05] [INFO ] Deduced a trap composed of 151 places in 207 ms of which 3 ms to minimize.
[2024-06-01 16:31:06] [INFO ] Deduced a trap composed of 146 places in 210 ms of which 3 ms to minimize.
[2024-06-01 16:31:06] [INFO ] Deduced a trap composed of 146 places in 211 ms of which 3 ms to minimize.
[2024-06-01 16:31:06] [INFO ] Deduced a trap composed of 151 places in 214 ms of which 3 ms to minimize.
[2024-06-01 16:31:06] [INFO ] Deduced a trap composed of 151 places in 193 ms of which 3 ms to minimize.
[2024-06-01 16:31:06] [INFO ] Deduced a trap composed of 151 places in 219 ms of which 3 ms to minimize.
[2024-06-01 16:31:07] [INFO ] Deduced a trap composed of 156 places in 199 ms of which 3 ms to minimize.
[2024-06-01 16:31:07] [INFO ] Deduced a trap composed of 156 places in 205 ms of which 3 ms to minimize.
[2024-06-01 16:31:07] [INFO ] Deduced a trap composed of 156 places in 206 ms of which 3 ms to minimize.
[2024-06-01 16:31:07] [INFO ] Deduced a trap composed of 161 places in 198 ms of which 3 ms to minimize.
[2024-06-01 16:31:08] [INFO ] Deduced a trap composed of 156 places in 204 ms of which 3 ms to minimize.
[2024-06-01 16:31:08] [INFO ] Deduced a trap composed of 151 places in 211 ms of which 3 ms to minimize.
[2024-06-01 16:31:08] [INFO ] Deduced a trap composed of 151 places in 242 ms of which 4 ms to minimize.
[2024-06-01 16:31:08] [INFO ] Deduced a trap composed of 161 places in 211 ms of which 3 ms to minimize.
[2024-06-01 16:31:08] [INFO ] Deduced a trap composed of 156 places in 199 ms of which 3 ms to minimize.
[2024-06-01 16:31:09] [INFO ] Deduced a trap composed of 156 places in 186 ms of which 15 ms to minimize.
[2024-06-01 16:31:09] [INFO ] Deduced a trap composed of 151 places in 190 ms of which 4 ms to minimize.
[2024-06-01 16:31:09] [INFO ] Deduced a trap composed of 156 places in 192 ms of which 3 ms to minimize.
[2024-06-01 16:31:09] [INFO ] Deduced a trap composed of 161 places in 193 ms of which 3 ms to minimize.
[2024-06-01 16:31:10] [INFO ] Deduced a trap composed of 161 places in 193 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-06-01 16:31:17] [INFO ] Deduced a trap composed of 13 places in 180 ms of which 3 ms to minimize.
[2024-06-01 16:31:18] [INFO ] Deduced a trap composed of 232 places in 159 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1879 variables, and 94 constraints, problems are : Problem set: 0 solved, 1297 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1297/1297 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 22/94 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-06-01 16:31:29] [INFO ] Deduced a trap composed of 171 places in 184 ms of which 3 ms to minimize.
[2024-06-01 16:31:29] [INFO ] Deduced a trap composed of 176 places in 209 ms of which 4 ms to minimize.
[2024-06-01 16:31:29] [INFO ] Deduced a trap composed of 236 places in 190 ms of which 3 ms to minimize.
[2024-06-01 16:31:29] [INFO ] Deduced a trap composed of 171 places in 212 ms of which 5 ms to minimize.
[2024-06-01 16:31:29] [INFO ] Deduced a trap composed of 171 places in 191 ms of which 3 ms to minimize.
[2024-06-01 16:31:30] [INFO ] Deduced a trap composed of 176 places in 194 ms of which 3 ms to minimize.
[2024-06-01 16:31:30] [INFO ] Deduced a trap composed of 141 places in 196 ms of which 2 ms to minimize.
[2024-06-01 16:31:30] [INFO ] Deduced a trap composed of 151 places in 189 ms of which 3 ms to minimize.
[2024-06-01 16:31:30] [INFO ] Deduced a trap composed of 156 places in 200 ms of which 2 ms to minimize.
[2024-06-01 16:31:31] [INFO ] Deduced a trap composed of 156 places in 203 ms of which 3 ms to minimize.
[2024-06-01 16:31:31] [INFO ] Deduced a trap composed of 151 places in 200 ms of which 3 ms to minimize.
[2024-06-01 16:31:31] [INFO ] Deduced a trap composed of 151 places in 185 ms of which 3 ms to minimize.
[2024-06-01 16:31:31] [INFO ] Deduced a trap composed of 176 places in 180 ms of which 3 ms to minimize.
[2024-06-01 16:31:31] [INFO ] Deduced a trap composed of 171 places in 188 ms of which 3 ms to minimize.
[2024-06-01 16:31:32] [INFO ] Deduced a trap composed of 240 places in 198 ms of which 3 ms to minimize.
[2024-06-01 16:31:32] [INFO ] Deduced a trap composed of 171 places in 179 ms of which 3 ms to minimize.
[2024-06-01 16:31:32] [INFO ] Deduced a trap composed of 156 places in 188 ms of which 2 ms to minimize.
[2024-06-01 16:31:32] [INFO ] Deduced a trap composed of 238 places in 177 ms of which 3 ms to minimize.
[2024-06-01 16:31:32] [INFO ] Deduced a trap composed of 151 places in 191 ms of which 3 ms to minimize.
[2024-06-01 16:31:33] [INFO ] Deduced a trap composed of 161 places in 202 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-06-01 16:31:34] [INFO ] Deduced a trap composed of 238 places in 360 ms of which 4 ms to minimize.
[2024-06-01 16:31:35] [INFO ] Deduced a trap composed of 170 places in 333 ms of which 3 ms to minimize.
[2024-06-01 16:31:35] [INFO ] Deduced a trap composed of 161 places in 300 ms of which 3 ms to minimize.
[2024-06-01 16:31:35] [INFO ] Deduced a trap composed of 228 places in 293 ms of which 3 ms to minimize.
[2024-06-01 16:31:36] [INFO ] Deduced a trap composed of 18 places in 167 ms of which 1 ms to minimize.
[2024-06-01 16:31:37] [INFO ] Deduced a trap composed of 175 places in 240 ms of which 3 ms to minimize.
[2024-06-01 16:31:38] [INFO ] Deduced a trap composed of 156 places in 275 ms of which 3 ms to minimize.
[2024-06-01 16:31:38] [INFO ] Deduced a trap composed of 161 places in 298 ms of which 3 ms to minimize.
[2024-06-01 16:31:38] [INFO ] Deduced a trap composed of 180 places in 281 ms of which 3 ms to minimize.
[2024-06-01 16:31:39] [INFO ] Deduced a trap composed of 190 places in 261 ms of which 3 ms to minimize.
[2024-06-01 16:31:39] [INFO ] Deduced a trap composed of 186 places in 263 ms of which 3 ms to minimize.
[2024-06-01 16:31:39] [INFO ] Deduced a trap composed of 166 places in 268 ms of which 3 ms to minimize.
[2024-06-01 16:31:40] [INFO ] Deduced a trap composed of 156 places in 293 ms of which 3 ms to minimize.
[2024-06-01 16:31:40] [INFO ] Deduced a trap composed of 170 places in 272 ms of which 2 ms to minimize.
[2024-06-01 16:31:40] [INFO ] Deduced a trap composed of 161 places in 273 ms of which 3 ms to minimize.
[2024-06-01 16:31:40] [INFO ] Deduced a trap composed of 185 places in 270 ms of which 2 ms to minimize.
[2024-06-01 16:31:41] [INFO ] Deduced a trap composed of 171 places in 271 ms of which 3 ms to minimize.
[2024-06-01 16:31:41] [INFO ] Deduced a trap composed of 180 places in 271 ms of which 3 ms to minimize.
[2024-06-01 16:31:41] [INFO ] Deduced a trap composed of 170 places in 265 ms of which 3 ms to minimize.
[2024-06-01 16:31:42] [INFO ] Deduced a trap composed of 185 places in 258 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-06-01 16:31:44] [INFO ] Deduced a trap composed of 233 places in 350 ms of which 4 ms to minimize.
[2024-06-01 16:31:44] [INFO ] Deduced a trap composed of 176 places in 328 ms of which 3 ms to minimize.
[2024-06-01 16:31:45] [INFO ] Deduced a trap composed of 251 places in 296 ms of which 3 ms to minimize.
[2024-06-01 16:31:45] [INFO ] Deduced a trap composed of 247 places in 308 ms of which 3 ms to minimize.
[2024-06-01 16:31:45] [INFO ] Deduced a trap composed of 251 places in 325 ms of which 4 ms to minimize.
[2024-06-01 16:31:46] [INFO ] Deduced a trap composed of 240 places in 295 ms of which 3 ms to minimize.
[2024-06-01 16:31:46] [INFO ] Deduced a trap composed of 170 places in 300 ms of which 4 ms to minimize.
[2024-06-01 16:31:46] [INFO ] Deduced a trap composed of 180 places in 294 ms of which 3 ms to minimize.
[2024-06-01 16:31:47] [INFO ] Deduced a trap composed of 195 places in 405 ms of which 3 ms to minimize.
[2024-06-01 16:31:47] [INFO ] Deduced a trap composed of 243 places in 294 ms of which 3 ms to minimize.
[2024-06-01 16:31:47] [INFO ] Deduced a trap composed of 170 places in 277 ms of which 3 ms to minimize.
[2024-06-01 16:31:48] [INFO ] Deduced a trap composed of 175 places in 277 ms of which 3 ms to minimize.
[2024-06-01 16:31:48] [INFO ] Deduced a trap composed of 245 places in 291 ms of which 3 ms to minimize.
[2024-06-01 16:31:48] [INFO ] Deduced a trap composed of 180 places in 268 ms of which 3 ms to minimize.
[2024-06-01 16:31:49] [INFO ] Deduced a trap composed of 242 places in 348 ms of which 4 ms to minimize.
[2024-06-01 16:31:49] [INFO ] Deduced a trap composed of 234 places in 284 ms of which 3 ms to minimize.
[2024-06-01 16:31:49] [INFO ] Deduced a trap composed of 175 places in 308 ms of which 3 ms to minimize.
[2024-06-01 16:31:50] [INFO ] Deduced a trap composed of 161 places in 259 ms of which 3 ms to minimize.
[2024-06-01 16:31:50] [INFO ] Deduced a trap composed of 232 places in 373 ms of which 4 ms to minimize.
[2024-06-01 16:31:50] [INFO ] Deduced a trap composed of 171 places in 304 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-06-01 16:31:54] [INFO ] Deduced a trap composed of 185 places in 283 ms of which 3 ms to minimize.
[2024-06-01 16:31:54] [INFO ] Deduced a trap composed of 180 places in 295 ms of which 3 ms to minimize.
[2024-06-01 16:31:55] [INFO ] Deduced a trap composed of 170 places in 340 ms of which 3 ms to minimize.
[2024-06-01 16:31:55] [INFO ] Deduced a trap composed of 155 places in 296 ms of which 3 ms to minimize.
[2024-06-01 16:31:55] [INFO ] Deduced a trap composed of 165 places in 290 ms of which 3 ms to minimize.
[2024-06-01 16:31:55] [INFO ] Deduced a trap composed of 160 places in 288 ms of which 3 ms to minimize.
[2024-06-01 16:31:56] [INFO ] Deduced a trap composed of 160 places in 286 ms of which 3 ms to minimize.
[2024-06-01 16:31:56] [INFO ] Deduced a trap composed of 185 places in 283 ms of which 3 ms to minimize.
[2024-06-01 16:31:56] [INFO ] Deduced a trap composed of 170 places in 264 ms of which 2 ms to minimize.
[2024-06-01 16:31:57] [INFO ] Deduced a trap composed of 156 places in 276 ms of which 3 ms to minimize.
SMT process timed out in 67658ms, After SMT, problems are : Problem set: 0 solved, 1297 unsolved
Search for dead transitions found 0 dead transitions in 67671ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71828 ms. Remains : 580/580 places, 1308/1308 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[4]
Starting property specific reduction for PolyORBNT-COL-S10J30-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[4]
[2024-06-01 16:31:57] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-06-01 16:31:57] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 10000 steps (706 resets) in 111 ms. (89 steps per ms)
BEST_FIRST walk for 10001 steps (79 resets) in 25 ms. (384 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[4]
[2024-06-01 16:31:57] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-06-01 16:31:57] [INFO ] Invariant cache hit.
[2024-06-01 16:31:57] [INFO ] [Real]Absence check using 75 positive place invariants in 13 ms returned sat
[2024-06-01 16:31:57] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 9 ms returned sat
[2024-06-01 16:31:57] [INFO ] [Real]Absence check using state equation in 242 ms returned sat
[2024-06-01 16:31:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:31:57] [INFO ] [Nat]Absence check using 75 positive place invariants in 12 ms returned sat
[2024-06-01 16:31:57] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 8 ms returned sat
[2024-06-01 16:31:58] [INFO ] [Nat]Absence check using state equation in 238 ms returned sat
[2024-06-01 16:31:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:31:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 69 ms returned sat
[2024-06-01 16:31:58] [INFO ] Computed and/alt/rep : 817/3225/817 causal constraints (skipped 471 transitions) in 72 ms.
[2024-06-01 16:31:58] [INFO ] Deduced a trap composed of 106 places in 261 ms of which 3 ms to minimize.
[2024-06-01 16:31:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 350 ms
[2024-06-01 16:31:58] [INFO ] Added : 7 causal constraints over 2 iterations in 642 ms. Result :sat
Minimization took 597 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[4]
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1308/1308 transitions.
Applied a total of 0 rules in 45 ms. Remains 580 /580 variables (removed 0) and now considering 1308/1308 (removed 0) transitions.
Running 1297 sub problems to find dead transitions.
[2024-06-01 16:31:59] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-06-01 16:31:59] [INFO ] Invariant cache hit.
[2024-06-01 16:31:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-06-01 16:32:14] [INFO ] Deduced a trap composed of 151 places in 175 ms of which 4 ms to minimize.
[2024-06-01 16:32:15] [INFO ] Deduced a trap composed of 146 places in 205 ms of which 3 ms to minimize.
[2024-06-01 16:32:15] [INFO ] Deduced a trap composed of 146 places in 189 ms of which 2 ms to minimize.
[2024-06-01 16:32:15] [INFO ] Deduced a trap composed of 151 places in 193 ms of which 2 ms to minimize.
[2024-06-01 16:32:15] [INFO ] Deduced a trap composed of 151 places in 186 ms of which 2 ms to minimize.
[2024-06-01 16:32:15] [INFO ] Deduced a trap composed of 151 places in 200 ms of which 3 ms to minimize.
[2024-06-01 16:32:16] [INFO ] Deduced a trap composed of 156 places in 178 ms of which 3 ms to minimize.
[2024-06-01 16:32:16] [INFO ] Deduced a trap composed of 156 places in 195 ms of which 2 ms to minimize.
[2024-06-01 16:32:16] [INFO ] Deduced a trap composed of 156 places in 192 ms of which 3 ms to minimize.
[2024-06-01 16:32:16] [INFO ] Deduced a trap composed of 161 places in 187 ms of which 3 ms to minimize.
[2024-06-01 16:32:16] [INFO ] Deduced a trap composed of 156 places in 190 ms of which 3 ms to minimize.
[2024-06-01 16:32:17] [INFO ] Deduced a trap composed of 151 places in 186 ms of which 3 ms to minimize.
[2024-06-01 16:32:17] [INFO ] Deduced a trap composed of 151 places in 192 ms of which 3 ms to minimize.
[2024-06-01 16:32:17] [INFO ] Deduced a trap composed of 161 places in 210 ms of which 3 ms to minimize.
[2024-06-01 16:32:17] [INFO ] Deduced a trap composed of 156 places in 188 ms of which 3 ms to minimize.
[2024-06-01 16:32:17] [INFO ] Deduced a trap composed of 156 places in 209 ms of which 3 ms to minimize.
[2024-06-01 16:32:18] [INFO ] Deduced a trap composed of 151 places in 194 ms of which 3 ms to minimize.
[2024-06-01 16:32:18] [INFO ] Deduced a trap composed of 156 places in 211 ms of which 3 ms to minimize.
[2024-06-01 16:32:18] [INFO ] Deduced a trap composed of 161 places in 198 ms of which 2 ms to minimize.
[2024-06-01 16:32:18] [INFO ] Deduced a trap composed of 161 places in 215 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
(s189 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1879 variables, and 92 constraints, problems are : Problem set: 0 solved, 1297 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1297/1297 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-06-01 16:32:27] [INFO ] Deduced a trap composed of 224 places in 208 ms of which 3 ms to minimize.
[2024-06-01 16:32:28] [INFO ] Deduced a trap composed of 224 places in 276 ms of which 3 ms to minimize.
[2024-06-01 16:32:28] [INFO ] Deduced a trap composed of 224 places in 202 ms of which 3 ms to minimize.
[2024-06-01 16:32:28] [INFO ] Deduced a trap composed of 224 places in 195 ms of which 3 ms to minimize.
[2024-06-01 16:32:28] [INFO ] Deduced a trap composed of 226 places in 193 ms of which 3 ms to minimize.
[2024-06-01 16:32:29] [INFO ] Deduced a trap composed of 228 places in 192 ms of which 3 ms to minimize.
[2024-06-01 16:32:29] [INFO ] Deduced a trap composed of 146 places in 203 ms of which 3 ms to minimize.
[2024-06-01 16:32:29] [INFO ] Deduced a trap composed of 141 places in 203 ms of which 3 ms to minimize.
[2024-06-01 16:32:29] [INFO ] Deduced a trap composed of 141 places in 217 ms of which 3 ms to minimize.
[2024-06-01 16:32:30] [INFO ] Deduced a trap composed of 150 places in 281 ms of which 3 ms to minimize.
[2024-06-01 16:32:30] [INFO ] Deduced a trap composed of 240 places in 283 ms of which 2 ms to minimize.
[2024-06-01 16:32:30] [INFO ] Deduced a trap composed of 190 places in 296 ms of which 3 ms to minimize.
[2024-06-01 16:32:30] [INFO ] Deduced a trap composed of 156 places in 271 ms of which 3 ms to minimize.
[2024-06-01 16:32:31] [INFO ] Deduced a trap composed of 185 places in 285 ms of which 3 ms to minimize.
[2024-06-01 16:32:31] [INFO ] Deduced a trap composed of 151 places in 298 ms of which 3 ms to minimize.
[2024-06-01 16:32:31] [INFO ] Deduced a trap composed of 170 places in 350 ms of which 3 ms to minimize.
[2024-06-01 16:32:32] [INFO ] Deduced a trap composed of 166 places in 345 ms of which 3 ms to minimize.
[2024-06-01 16:32:32] [INFO ] Deduced a trap composed of 165 places in 390 ms of which 4 ms to minimize.
[2024-06-01 16:32:33] [INFO ] Deduced a trap composed of 161 places in 290 ms of which 3 ms to minimize.
[2024-06-01 16:32:33] [INFO ] Deduced a trap composed of 146 places in 272 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-06-01 16:32:34] [INFO ] Deduced a trap composed of 230 places in 243 ms of which 4 ms to minimize.
[2024-06-01 16:32:34] [INFO ] Deduced a trap composed of 238 places in 233 ms of which 4 ms to minimize.
[2024-06-01 16:32:35] [INFO ] Deduced a trap composed of 236 places in 225 ms of which 4 ms to minimize.
[2024-06-01 16:32:35] [INFO ] Deduced a trap composed of 238 places in 200 ms of which 4 ms to minimize.
[2024-06-01 16:32:35] [INFO ] Deduced a trap composed of 236 places in 200 ms of which 3 ms to minimize.
[2024-06-01 16:32:35] [INFO ] Deduced a trap composed of 236 places in 213 ms of which 3 ms to minimize.
[2024-06-01 16:32:36] [INFO ] Deduced a trap composed of 244 places in 207 ms of which 3 ms to minimize.
[2024-06-01 16:32:36] [INFO ] Deduced a trap composed of 238 places in 197 ms of which 3 ms to minimize.
[2024-06-01 16:32:36] [INFO ] Deduced a trap composed of 238 places in 200 ms of which 3 ms to minimize.
[2024-06-01 16:32:36] [INFO ] Deduced a trap composed of 228 places in 185 ms of which 3 ms to minimize.
[2024-06-01 16:32:37] [INFO ] Deduced a trap composed of 232 places in 259 ms of which 4 ms to minimize.
[2024-06-01 16:32:37] [INFO ] Deduced a trap composed of 236 places in 296 ms of which 4 ms to minimize.
[2024-06-01 16:32:37] [INFO ] Deduced a trap composed of 176 places in 268 ms of which 4 ms to minimize.
[2024-06-01 16:32:38] [INFO ] Deduced a trap composed of 171 places in 228 ms of which 3 ms to minimize.
[2024-06-01 16:32:38] [INFO ] Deduced a trap composed of 156 places in 257 ms of which 3 ms to minimize.
[2024-06-01 16:32:39] [INFO ] Deduced a trap composed of 253 places in 330 ms of which 2 ms to minimize.
[2024-06-01 16:32:40] [INFO ] Deduced a trap composed of 170 places in 303 ms of which 3 ms to minimize.
[2024-06-01 16:32:40] [INFO ] Deduced a trap composed of 175 places in 302 ms of which 3 ms to minimize.
[2024-06-01 16:32:40] [INFO ] Deduced a trap composed of 156 places in 272 ms of which 3 ms to minimize.
[2024-06-01 16:32:41] [INFO ] Deduced a trap composed of 161 places in 277 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-06-01 16:32:43] [INFO ] Deduced a trap composed of 156 places in 305 ms of which 4 ms to minimize.
[2024-06-01 16:32:43] [INFO ] Deduced a trap composed of 151 places in 246 ms of which 3 ms to minimize.
[2024-06-01 16:32:44] [INFO ] Deduced a trap composed of 151 places in 357 ms of which 3 ms to minimize.
[2024-06-01 16:32:44] [INFO ] Deduced a trap composed of 146 places in 383 ms of which 4 ms to minimize.
[2024-06-01 16:32:45] [INFO ] Deduced a trap composed of 160 places in 336 ms of which 3 ms to minimize.
[2024-06-01 16:32:45] [INFO ] Deduced a trap composed of 146 places in 399 ms of which 4 ms to minimize.
[2024-06-01 16:32:45] [INFO ] Deduced a trap composed of 141 places in 364 ms of which 3 ms to minimize.
[2024-06-01 16:32:46] [INFO ] Deduced a trap composed of 150 places in 281 ms of which 3 ms to minimize.
SMT process timed out in 46662ms, After SMT, problems are : Problem set: 0 solved, 1297 unsolved
Search for dead transitions found 0 dead transitions in 46684ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46735 ms. Remains : 580/580 places, 1308/1308 transitions.
[2024-06-01 16:32:46] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-06-01 16:32:46] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[4]
RANDOM walk for 1000000 steps (72589 resets) in 8934 ms. (111 steps per ms)
BEST_FIRST walk for 1000001 steps (8958 resets) in 1603 ms. (623 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[4]
[2024-06-01 16:32:56] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-06-01 16:32:56] [INFO ] Invariant cache hit.
[2024-06-01 16:32:56] [INFO ] [Real]Absence check using 75 positive place invariants in 17 ms returned sat
[2024-06-01 16:32:56] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 10 ms returned sat
[2024-06-01 16:32:57] [INFO ] [Real]Absence check using state equation in 299 ms returned sat
[2024-06-01 16:32:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:32:57] [INFO ] [Nat]Absence check using 75 positive place invariants in 19 ms returned sat
[2024-06-01 16:32:57] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 11 ms returned sat
[2024-06-01 16:32:57] [INFO ] [Nat]Absence check using state equation in 322 ms returned sat
[2024-06-01 16:32:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:32:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 71 ms returned sat
[2024-06-01 16:32:57] [INFO ] Computed and/alt/rep : 817/3225/817 causal constraints (skipped 471 transitions) in 131 ms.
[2024-06-01 16:32:58] [INFO ] Deduced a trap composed of 106 places in 440 ms of which 4 ms to minimize.
[2024-06-01 16:32:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 569 ms
[2024-06-01 16:32:58] [INFO ] Added : 7 causal constraints over 2 iterations in 1110 ms. Result :sat
Minimization took 1183 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[4]
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1308/1308 transitions.
Applied a total of 0 rules in 35 ms. Remains 580 /580 variables (removed 0) and now considering 1308/1308 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 580/580 places, 1308/1308 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1308/1308 transitions.
Applied a total of 0 rules in 31 ms. Remains 580 /580 variables (removed 0) and now considering 1308/1308 (removed 0) transitions.
[2024-06-01 16:33:00] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-06-01 16:33:00] [INFO ] Invariant cache hit.
[2024-06-01 16:33:00] [INFO ] Implicit Places using invariants in 576 ms returned []
[2024-06-01 16:33:00] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-06-01 16:33:00] [INFO ] Invariant cache hit.
[2024-06-01 16:33:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:33:03] [INFO ] Implicit Places using invariants and state equation in 2946 ms returned []
Implicit Place search using SMT with State Equation took 3524 ms to find 0 implicit places.
[2024-06-01 16:33:03] [INFO ] Redundant transitions in 32 ms returned []
Running 1297 sub problems to find dead transitions.
[2024-06-01 16:33:03] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-06-01 16:33:03] [INFO ] Invariant cache hit.
[2024-06-01 16:33:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-06-01 16:33:21] [INFO ] Deduced a trap composed of 151 places in 185 ms of which 3 ms to minimize.
[2024-06-01 16:33:21] [INFO ] Deduced a trap composed of 146 places in 223 ms of which 3 ms to minimize.
[2024-06-01 16:33:21] [INFO ] Deduced a trap composed of 146 places in 200 ms of which 3 ms to minimize.
[2024-06-01 16:33:21] [INFO ] Deduced a trap composed of 151 places in 218 ms of which 3 ms to minimize.
[2024-06-01 16:33:22] [INFO ] Deduced a trap composed of 151 places in 210 ms of which 3 ms to minimize.
[2024-06-01 16:33:22] [INFO ] Deduced a trap composed of 151 places in 183 ms of which 3 ms to minimize.
[2024-06-01 16:33:22] [INFO ] Deduced a trap composed of 156 places in 190 ms of which 3 ms to minimize.
[2024-06-01 16:33:22] [INFO ] Deduced a trap composed of 156 places in 196 ms of which 3 ms to minimize.
[2024-06-01 16:33:22] [INFO ] Deduced a trap composed of 156 places in 208 ms of which 2 ms to minimize.
[2024-06-01 16:33:23] [INFO ] Deduced a trap composed of 161 places in 190 ms of which 2 ms to minimize.
[2024-06-01 16:33:23] [INFO ] Deduced a trap composed of 156 places in 185 ms of which 3 ms to minimize.
[2024-06-01 16:33:23] [INFO ] Deduced a trap composed of 151 places in 199 ms of which 3 ms to minimize.
[2024-06-01 16:33:23] [INFO ] Deduced a trap composed of 151 places in 203 ms of which 3 ms to minimize.
[2024-06-01 16:33:23] [INFO ] Deduced a trap composed of 161 places in 218 ms of which 3 ms to minimize.
[2024-06-01 16:33:24] [INFO ] Deduced a trap composed of 156 places in 211 ms of which 3 ms to minimize.
[2024-06-01 16:33:24] [INFO ] Deduced a trap composed of 156 places in 210 ms of which 3 ms to minimize.
[2024-06-01 16:33:24] [INFO ] Deduced a trap composed of 151 places in 227 ms of which 4 ms to minimize.
[2024-06-01 16:33:24] [INFO ] Deduced a trap composed of 156 places in 211 ms of which 3 ms to minimize.
[2024-06-01 16:33:25] [INFO ] Deduced a trap composed of 161 places in 200 ms of which 3 ms to minimize.
[2024-06-01 16:33:25] [INFO ] Deduced a trap composed of 161 places in 228 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-06-01 16:33:33] [INFO ] Deduced a trap composed of 13 places in 226 ms of which 3 ms to minimize.
[2024-06-01 16:33:35] [INFO ] Deduced a trap composed of 232 places in 186 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1879 variables, and 94 constraints, problems are : Problem set: 0 solved, 1297 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1297/1297 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 22/94 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-06-01 16:33:43] [INFO ] Deduced a trap composed of 171 places in 168 ms of which 3 ms to minimize.
[2024-06-01 16:33:44] [INFO ] Deduced a trap composed of 176 places in 241 ms of which 4 ms to minimize.
[2024-06-01 16:33:44] [INFO ] Deduced a trap composed of 236 places in 205 ms of which 3 ms to minimize.
[2024-06-01 16:33:44] [INFO ] Deduced a trap composed of 171 places in 210 ms of which 3 ms to minimize.
[2024-06-01 16:33:44] [INFO ] Deduced a trap composed of 171 places in 213 ms of which 3 ms to minimize.
[2024-06-01 16:33:45] [INFO ] Deduced a trap composed of 176 places in 210 ms of which 4 ms to minimize.
[2024-06-01 16:33:45] [INFO ] Deduced a trap composed of 141 places in 211 ms of which 3 ms to minimize.
[2024-06-01 16:33:45] [INFO ] Deduced a trap composed of 151 places in 233 ms of which 3 ms to minimize.
[2024-06-01 16:33:45] [INFO ] Deduced a trap composed of 156 places in 197 ms of which 3 ms to minimize.
[2024-06-01 16:33:45] [INFO ] Deduced a trap composed of 156 places in 201 ms of which 3 ms to minimize.
[2024-06-01 16:33:46] [INFO ] Deduced a trap composed of 151 places in 199 ms of which 3 ms to minimize.
[2024-06-01 16:33:46] [INFO ] Deduced a trap composed of 151 places in 188 ms of which 3 ms to minimize.
[2024-06-01 16:33:46] [INFO ] Deduced a trap composed of 176 places in 199 ms of which 3 ms to minimize.
[2024-06-01 16:33:46] [INFO ] Deduced a trap composed of 171 places in 202 ms of which 3 ms to minimize.
[2024-06-01 16:33:47] [INFO ] Deduced a trap composed of 240 places in 205 ms of which 3 ms to minimize.
[2024-06-01 16:33:47] [INFO ] Deduced a trap composed of 171 places in 184 ms of which 3 ms to minimize.
[2024-06-01 16:33:47] [INFO ] Deduced a trap composed of 156 places in 203 ms of which 3 ms to minimize.
[2024-06-01 16:33:47] [INFO ] Deduced a trap composed of 238 places in 167 ms of which 2 ms to minimize.
[2024-06-01 16:33:47] [INFO ] Deduced a trap composed of 151 places in 183 ms of which 3 ms to minimize.
[2024-06-01 16:33:48] [INFO ] Deduced a trap composed of 161 places in 175 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-06-01 16:33:50] [INFO ] Deduced a trap composed of 238 places in 383 ms of which 3 ms to minimize.
[2024-06-01 16:33:50] [INFO ] Deduced a trap composed of 170 places in 321 ms of which 3 ms to minimize.
[2024-06-01 16:33:50] [INFO ] Deduced a trap composed of 161 places in 298 ms of which 3 ms to minimize.
[2024-06-01 16:33:51] [INFO ] Deduced a trap composed of 228 places in 301 ms of which 4 ms to minimize.
[2024-06-01 16:33:51] [INFO ] Deduced a trap composed of 18 places in 239 ms of which 1 ms to minimize.
[2024-06-01 16:33:53] [INFO ] Deduced a trap composed of 175 places in 382 ms of which 4 ms to minimize.
[2024-06-01 16:33:54] [INFO ] Deduced a trap composed of 156 places in 347 ms of which 4 ms to minimize.
[2024-06-01 16:33:54] [INFO ] Deduced a trap composed of 161 places in 274 ms of which 3 ms to minimize.
[2024-06-01 16:33:54] [INFO ] Deduced a trap composed of 180 places in 252 ms of which 3 ms to minimize.
[2024-06-01 16:33:55] [INFO ] Deduced a trap composed of 190 places in 242 ms of which 2 ms to minimize.
[2024-06-01 16:33:55] [INFO ] Deduced a trap composed of 186 places in 357 ms of which 4 ms to minimize.
[2024-06-01 16:33:55] [INFO ] Deduced a trap composed of 166 places in 326 ms of which 3 ms to minimize.
[2024-06-01 16:33:56] [INFO ] Deduced a trap composed of 156 places in 327 ms of which 3 ms to minimize.
[2024-06-01 16:33:56] [INFO ] Deduced a trap composed of 170 places in 360 ms of which 4 ms to minimize.
[2024-06-01 16:33:57] [INFO ] Deduced a trap composed of 161 places in 335 ms of which 4 ms to minimize.
[2024-06-01 16:33:57] [INFO ] Deduced a trap composed of 185 places in 340 ms of which 4 ms to minimize.
[2024-06-01 16:33:57] [INFO ] Deduced a trap composed of 171 places in 339 ms of which 4 ms to minimize.
[2024-06-01 16:33:58] [INFO ] Deduced a trap composed of 180 places in 307 ms of which 4 ms to minimize.
[2024-06-01 16:33:58] [INFO ] Deduced a trap composed of 170 places in 315 ms of which 3 ms to minimize.
[2024-06-01 16:33:58] [INFO ] Deduced a trap composed of 185 places in 259 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-06-01 16:34:01] [INFO ] Deduced a trap composed of 233 places in 320 ms of which 4 ms to minimize.
[2024-06-01 16:34:01] [INFO ] Deduced a trap composed of 176 places in 309 ms of which 3 ms to minimize.
[2024-06-01 16:34:01] [INFO ] Deduced a trap composed of 251 places in 262 ms of which 2 ms to minimize.
[2024-06-01 16:34:01] [INFO ] Deduced a trap composed of 247 places in 237 ms of which 2 ms to minimize.
[2024-06-01 16:34:02] [INFO ] Deduced a trap composed of 251 places in 269 ms of which 3 ms to minimize.
[2024-06-01 16:34:02] [INFO ] Deduced a trap composed of 240 places in 260 ms of which 2 ms to minimize.
[2024-06-01 16:34:02] [INFO ] Deduced a trap composed of 170 places in 259 ms of which 3 ms to minimize.
[2024-06-01 16:34:03] [INFO ] Deduced a trap composed of 180 places in 255 ms of which 3 ms to minimize.
[2024-06-01 16:34:03] [INFO ] Deduced a trap composed of 195 places in 260 ms of which 2 ms to minimize.
[2024-06-01 16:34:03] [INFO ] Deduced a trap composed of 243 places in 263 ms of which 3 ms to minimize.
[2024-06-01 16:34:03] [INFO ] Deduced a trap composed of 170 places in 260 ms of which 3 ms to minimize.
[2024-06-01 16:34:04] [INFO ] Deduced a trap composed of 175 places in 258 ms of which 2 ms to minimize.
[2024-06-01 16:34:04] [INFO ] Deduced a trap composed of 245 places in 252 ms of which 3 ms to minimize.
[2024-06-01 16:34:04] [INFO ] Deduced a trap composed of 180 places in 264 ms of which 3 ms to minimize.
[2024-06-01 16:34:05] [INFO ] Deduced a trap composed of 242 places in 269 ms of which 3 ms to minimize.
[2024-06-01 16:34:05] [INFO ] Deduced a trap composed of 234 places in 264 ms of which 3 ms to minimize.
[2024-06-01 16:34:05] [INFO ] Deduced a trap composed of 175 places in 326 ms of which 3 ms to minimize.
[2024-06-01 16:34:06] [INFO ] Deduced a trap composed of 161 places in 260 ms of which 2 ms to minimize.
[2024-06-01 16:34:06] [INFO ] Deduced a trap composed of 232 places in 288 ms of which 3 ms to minimize.
[2024-06-01 16:34:06] [INFO ] Deduced a trap composed of 171 places in 272 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-06-01 16:34:09] [INFO ] Deduced a trap composed of 185 places in 314 ms of which 4 ms to minimize.
[2024-06-01 16:34:10] [INFO ] Deduced a trap composed of 180 places in 316 ms of which 4 ms to minimize.
[2024-06-01 16:34:10] [INFO ] Deduced a trap composed of 170 places in 274 ms of which 3 ms to minimize.
[2024-06-01 16:34:10] [INFO ] Deduced a trap composed of 155 places in 262 ms of which 3 ms to minimize.
[2024-06-01 16:34:11] [INFO ] Deduced a trap composed of 165 places in 273 ms of which 2 ms to minimize.
[2024-06-01 16:34:11] [INFO ] Deduced a trap composed of 160 places in 276 ms of which 3 ms to minimize.
[2024-06-01 16:34:11] [INFO ] Deduced a trap composed of 160 places in 268 ms of which 2 ms to minimize.
[2024-06-01 16:34:12] [INFO ] Deduced a trap composed of 185 places in 262 ms of which 3 ms to minimize.
SMT process timed out in 68268ms, After SMT, problems are : Problem set: 0 solved, 1297 unsolved
Search for dead transitions found 0 dead transitions in 68295ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71896 ms. Remains : 580/580 places, 1308/1308 transitions.
RANDOM walk for 40000 steps (2888 resets) in 681 ms. (58 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (365 resets) in 100 ms. (396 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (329 resets) in 107 ms. (370 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 346215 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :0 out of 2
Probabilistic random walk after 346215 steps, saw 56014 distinct states, run finished after 3002 ms. (steps per millisecond=115 ) properties seen :0
[2024-06-01 16:34:15] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-06-01 16:34:15] [INFO ] Invariant cache hit.
[2024-06-01 16:34:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 107/116 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 453/569 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/570 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/578 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/579 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1299/1878 variables, 579/661 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1878 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1878 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/1879 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1879 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1879 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1879/1879 variables, and 663 constraints, problems are : Problem set: 0 solved, 2 unsolved in 618 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 107/116 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 453/569 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/570 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/578 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 16:34:16] [INFO ] Deduced a trap composed of 226 places in 233 ms of which 2 ms to minimize.
[2024-06-01 16:34:16] [INFO ] Deduced a trap composed of 228 places in 228 ms of which 3 ms to minimize.
[2024-06-01 16:34:16] [INFO ] Deduced a trap composed of 230 places in 249 ms of which 3 ms to minimize.
[2024-06-01 16:34:17] [INFO ] Deduced a trap composed of 226 places in 224 ms of which 3 ms to minimize.
[2024-06-01 16:34:17] [INFO ] Deduced a trap composed of 230 places in 218 ms of which 3 ms to minimize.
[2024-06-01 16:34:17] [INFO ] Deduced a trap composed of 228 places in 221 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 6/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/578 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/579 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/579 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1299/1878 variables, 579/667 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1878 variables, 1/668 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1878 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/1879 variables, 1/669 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1879 variables, 2/671 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1879 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1879 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1879/1879 variables, and 671 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2145 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 2797ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 62 ms.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1308/1308 transitions.
Applied a total of 0 rules in 24 ms. Remains 580 /580 variables (removed 0) and now considering 1308/1308 (removed 0) transitions.
Running 1297 sub problems to find dead transitions.
[2024-06-01 16:34:18] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-06-01 16:34:18] [INFO ] Invariant cache hit.
[2024-06-01 16:34:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-06-01 16:34:34] [INFO ] Deduced a trap composed of 151 places in 166 ms of which 3 ms to minimize.
[2024-06-01 16:34:34] [INFO ] Deduced a trap composed of 146 places in 174 ms of which 3 ms to minimize.
[2024-06-01 16:34:34] [INFO ] Deduced a trap composed of 146 places in 199 ms of which 3 ms to minimize.
[2024-06-01 16:34:35] [INFO ] Deduced a trap composed of 151 places in 222 ms of which 3 ms to minimize.
[2024-06-01 16:34:35] [INFO ] Deduced a trap composed of 151 places in 220 ms of which 3 ms to minimize.
[2024-06-01 16:34:35] [INFO ] Deduced a trap composed of 151 places in 283 ms of which 3 ms to minimize.
[2024-06-01 16:34:36] [INFO ] Deduced a trap composed of 156 places in 280 ms of which 4 ms to minimize.
[2024-06-01 16:34:36] [INFO ] Deduced a trap composed of 156 places in 246 ms of which 3 ms to minimize.
[2024-06-01 16:34:36] [INFO ] Deduced a trap composed of 156 places in 275 ms of which 4 ms to minimize.
[2024-06-01 16:34:36] [INFO ] Deduced a trap composed of 161 places in 240 ms of which 2 ms to minimize.
[2024-06-01 16:34:37] [INFO ] Deduced a trap composed of 156 places in 179 ms of which 3 ms to minimize.
[2024-06-01 16:34:37] [INFO ] Deduced a trap composed of 151 places in 177 ms of which 3 ms to minimize.
[2024-06-01 16:34:37] [INFO ] Deduced a trap composed of 151 places in 177 ms of which 3 ms to minimize.
[2024-06-01 16:34:37] [INFO ] Deduced a trap composed of 161 places in 175 ms of which 3 ms to minimize.
[2024-06-01 16:34:37] [INFO ] Deduced a trap composed of 156 places in 174 ms of which 3 ms to minimize.
[2024-06-01 16:34:37] [INFO ] Deduced a trap composed of 156 places in 174 ms of which 2 ms to minimize.
[2024-06-01 16:34:38] [INFO ] Deduced a trap composed of 151 places in 173 ms of which 3 ms to minimize.
[2024-06-01 16:34:38] [INFO ] Deduced a trap composed of 156 places in 172 ms of which 2 ms to minimize.
[2024-06-01 16:34:38] [INFO ] Deduced a trap composed of 161 places in 175 ms of which 3 ms to minimize.
[2024-06-01 16:34:38] [INFO ] Deduced a trap composed of 161 places in 176 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-06-01 16:34:45] [INFO ] Deduced a trap composed of 13 places in 300 ms of which 5 ms to minimize.
SMT process timed out in 27198ms, After SMT, problems are : Problem set: 0 solved, 1297 unsolved
Search for dead transitions found 0 dead transitions in 27211ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27238 ms. Remains : 580/580 places, 1308/1308 transitions.
RANDOM walk for 40000 steps (2889 resets) in 681 ms. (58 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (358 resets) in 98 ms. (404 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (374 resets) in 104 ms. (380 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 413601 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :0 out of 2
Probabilistic random walk after 413601 steps, saw 66357 distinct states, run finished after 3001 ms. (steps per millisecond=137 ) properties seen :0
[2024-06-01 16:34:48] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-06-01 16:34:48] [INFO ] Invariant cache hit.
[2024-06-01 16:34:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 107/116 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 453/569 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/570 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/578 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/579 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1299/1878 variables, 579/661 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1878 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1878 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/1879 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1879 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1879 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1879/1879 variables, and 663 constraints, problems are : Problem set: 0 solved, 2 unsolved in 677 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 107/116 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 453/569 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/570 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/578 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 16:34:49] [INFO ] Deduced a trap composed of 226 places in 225 ms of which 15 ms to minimize.
[2024-06-01 16:34:50] [INFO ] Deduced a trap composed of 228 places in 219 ms of which 3 ms to minimize.
[2024-06-01 16:34:50] [INFO ] Deduced a trap composed of 230 places in 220 ms of which 3 ms to minimize.
[2024-06-01 16:34:50] [INFO ] Deduced a trap composed of 226 places in 211 ms of which 3 ms to minimize.
[2024-06-01 16:34:50] [INFO ] Deduced a trap composed of 230 places in 220 ms of which 3 ms to minimize.
[2024-06-01 16:34:51] [INFO ] Deduced a trap composed of 228 places in 218 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 6/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/578 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/579 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/579 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1299/1878 variables, 579/667 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1878 variables, 1/668 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1878 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/1879 variables, 1/669 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1879 variables, 2/671 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1879 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1879 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1879/1879 variables, and 671 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2057 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 2745ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 68 ms.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1308/1308 transitions.
Applied a total of 0 rules in 30 ms. Remains 580 /580 variables (removed 0) and now considering 1308/1308 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 580/580 places, 1308/1308 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1308/1308 transitions.
Applied a total of 0 rules in 26 ms. Remains 580 /580 variables (removed 0) and now considering 1308/1308 (removed 0) transitions.
[2024-06-01 16:34:51] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-06-01 16:34:51] [INFO ] Invariant cache hit.
[2024-06-01 16:34:52] [INFO ] Implicit Places using invariants in 489 ms returned []
[2024-06-01 16:34:52] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-06-01 16:34:52] [INFO ] Invariant cache hit.
[2024-06-01 16:34:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:34:55] [INFO ] Implicit Places using invariants and state equation in 3160 ms returned []
Implicit Place search using SMT with State Equation took 3664 ms to find 0 implicit places.
[2024-06-01 16:34:55] [INFO ] Redundant transitions in 31 ms returned []
Running 1297 sub problems to find dead transitions.
[2024-06-01 16:34:55] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
[2024-06-01 16:34:55] [INFO ] Invariant cache hit.
[2024-06-01 16:34:55] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-06-01 16:35:10] [INFO ] Deduced a trap composed of 151 places in 163 ms of which 2 ms to minimize.
[2024-06-01 16:35:10] [INFO ] Deduced a trap composed of 146 places in 176 ms of which 3 ms to minimize.
[2024-06-01 16:35:10] [INFO ] Deduced a trap composed of 146 places in 248 ms of which 4 ms to minimize.
[2024-06-01 16:35:11] [INFO ] Deduced a trap composed of 151 places in 256 ms of which 3 ms to minimize.
[2024-06-01 16:35:11] [INFO ] Deduced a trap composed of 151 places in 178 ms of which 2 ms to minimize.
[2024-06-01 16:35:11] [INFO ] Deduced a trap composed of 151 places in 177 ms of which 3 ms to minimize.
[2024-06-01 16:35:11] [INFO ] Deduced a trap composed of 156 places in 251 ms of which 4 ms to minimize.
[2024-06-01 16:35:11] [INFO ] Deduced a trap composed of 156 places in 187 ms of which 2 ms to minimize.
[2024-06-01 16:35:12] [INFO ] Deduced a trap composed of 156 places in 245 ms of which 4 ms to minimize.
[2024-06-01 16:35:12] [INFO ] Deduced a trap composed of 161 places in 201 ms of which 3 ms to minimize.
[2024-06-01 16:35:12] [INFO ] Deduced a trap composed of 156 places in 174 ms of which 3 ms to minimize.
[2024-06-01 16:35:12] [INFO ] Deduced a trap composed of 151 places in 196 ms of which 3 ms to minimize.
[2024-06-01 16:35:12] [INFO ] Deduced a trap composed of 151 places in 182 ms of which 2 ms to minimize.
[2024-06-01 16:35:13] [INFO ] Deduced a trap composed of 161 places in 186 ms of which 3 ms to minimize.
[2024-06-01 16:35:13] [INFO ] Deduced a trap composed of 156 places in 207 ms of which 3 ms to minimize.
[2024-06-01 16:35:13] [INFO ] Deduced a trap composed of 156 places in 264 ms of which 5 ms to minimize.
[2024-06-01 16:35:13] [INFO ] Deduced a trap composed of 151 places in 207 ms of which 2 ms to minimize.
[2024-06-01 16:35:14] [INFO ] Deduced a trap composed of 156 places in 246 ms of which 4 ms to minimize.
[2024-06-01 16:35:14] [INFO ] Deduced a trap composed of 161 places in 257 ms of which 3 ms to minimize.
[2024-06-01 16:35:14] [INFO ] Deduced a trap composed of 161 places in 234 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-06-01 16:35:21] [INFO ] Deduced a trap composed of 13 places in 184 ms of which 3 ms to minimize.
[2024-06-01 16:35:23] [INFO ] Deduced a trap composed of 232 places in 253 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-06-01 16:35:31] [INFO ] Deduced a trap composed of 176 places in 252 ms of which 4 ms to minimize.
[2024-06-01 16:35:31] [INFO ] Deduced a trap composed of 146 places in 201 ms of which 2 ms to minimize.
[2024-06-01 16:35:31] [INFO ] Deduced a trap composed of 166 places in 182 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1879 variables, and 97 constraints, problems are : Problem set: 0 solved, 1297 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1297/1297 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 25/97 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-06-01 16:35:33] [INFO ] Deduced a trap composed of 180 places in 285 ms of which 3 ms to minimize.
[2024-06-01 16:35:34] [INFO ] Deduced a trap composed of 171 places in 262 ms of which 3 ms to minimize.
[2024-06-01 16:35:34] [INFO ] Deduced a trap composed of 180 places in 245 ms of which 2 ms to minimize.
[2024-06-01 16:35:34] [INFO ] Deduced a trap composed of 170 places in 355 ms of which 4 ms to minimize.
[2024-06-01 16:35:35] [INFO ] Deduced a trap composed of 233 places in 331 ms of which 4 ms to minimize.
[2024-06-01 16:35:35] [INFO ] Deduced a trap composed of 180 places in 365 ms of which 4 ms to minimize.
[2024-06-01 16:35:35] [INFO ] Deduced a trap composed of 180 places in 310 ms of which 3 ms to minimize.
[2024-06-01 16:35:36] [INFO ] Deduced a trap composed of 166 places in 281 ms of which 2 ms to minimize.
[2024-06-01 16:35:36] [INFO ] Deduced a trap composed of 180 places in 306 ms of which 3 ms to minimize.
[2024-06-01 16:35:36] [INFO ] Deduced a trap composed of 176 places in 259 ms of which 3 ms to minimize.
[2024-06-01 16:35:37] [INFO ] Deduced a trap composed of 170 places in 360 ms of which 3 ms to minimize.
[2024-06-01 16:35:37] [INFO ] Deduced a trap composed of 185 places in 336 ms of which 3 ms to minimize.
[2024-06-01 16:35:37] [INFO ] Deduced a trap composed of 165 places in 398 ms of which 4 ms to minimize.
[2024-06-01 16:35:38] [INFO ] Deduced a trap composed of 171 places in 343 ms of which 4 ms to minimize.
[2024-06-01 16:35:38] [INFO ] Deduced a trap composed of 170 places in 359 ms of which 4 ms to minimize.
[2024-06-01 16:35:39] [INFO ] Deduced a trap composed of 171 places in 354 ms of which 4 ms to minimize.
[2024-06-01 16:35:39] [INFO ] Deduced a trap composed of 185 places in 379 ms of which 3 ms to minimize.
[2024-06-01 16:35:39] [INFO ] Deduced a trap composed of 170 places in 320 ms of which 4 ms to minimize.
[2024-06-01 16:35:40] [INFO ] Deduced a trap composed of 180 places in 309 ms of which 3 ms to minimize.
[2024-06-01 16:35:40] [INFO ] Deduced a trap composed of 240 places in 257 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-06-01 16:35:42] [INFO ] Deduced a trap composed of 165 places in 276 ms of which 3 ms to minimize.
[2024-06-01 16:35:42] [INFO ] Deduced a trap composed of 165 places in 287 ms of which 3 ms to minimize.
[2024-06-01 16:35:42] [INFO ] Deduced a trap composed of 151 places in 275 ms of which 3 ms to minimize.
[2024-06-01 16:35:42] [INFO ] Deduced a trap composed of 146 places in 299 ms of which 3 ms to minimize.
[2024-06-01 16:35:43] [INFO ] Deduced a trap composed of 151 places in 254 ms of which 3 ms to minimize.
[2024-06-01 16:35:43] [INFO ] Deduced a trap composed of 146 places in 264 ms of which 3 ms to minimize.
[2024-06-01 16:35:43] [INFO ] Deduced a trap composed of 238 places in 289 ms of which 2 ms to minimize.
[2024-06-01 16:35:44] [INFO ] Deduced a trap composed of 166 places in 287 ms of which 2 ms to minimize.
[2024-06-01 16:35:44] [INFO ] Deduced a trap composed of 171 places in 280 ms of which 3 ms to minimize.
[2024-06-01 16:35:45] [INFO ] Deduced a trap composed of 161 places in 269 ms of which 3 ms to minimize.
[2024-06-01 16:35:45] [INFO ] Deduced a trap composed of 156 places in 308 ms of which 3 ms to minimize.
[2024-06-01 16:35:45] [INFO ] Deduced a trap composed of 18 places in 204 ms of which 1 ms to minimize.
[2024-06-01 16:35:46] [INFO ] Deduced a trap composed of 136 places in 274 ms of which 3 ms to minimize.
[2024-06-01 16:35:47] [INFO ] Deduced a trap composed of 161 places in 270 ms of which 3 ms to minimize.
[2024-06-01 16:35:48] [INFO ] Deduced a trap composed of 150 places in 307 ms of which 3 ms to minimize.
[2024-06-01 16:35:48] [INFO ] Deduced a trap composed of 155 places in 304 ms of which 3 ms to minimize.
[2024-06-01 16:35:48] [INFO ] Deduced a trap composed of 141 places in 305 ms of which 3 ms to minimize.
[2024-06-01 16:35:49] [INFO ] Deduced a trap composed of 155 places in 299 ms of which 3 ms to minimize.
[2024-06-01 16:35:49] [INFO ] Deduced a trap composed of 131 places in 370 ms of which 4 ms to minimize.
[2024-06-01 16:35:49] [INFO ] Deduced a trap composed of 171 places in 297 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-06-01 16:35:51] [INFO ] Deduced a trap composed of 232 places in 308 ms of which 3 ms to minimize.
[2024-06-01 16:35:52] [INFO ] Deduced a trap composed of 161 places in 314 ms of which 3 ms to minimize.
[2024-06-01 16:35:52] [INFO ] Deduced a trap composed of 175 places in 295 ms of which 3 ms to minimize.
[2024-06-01 16:35:53] [INFO ] Deduced a trap composed of 170 places in 310 ms of which 2 ms to minimize.
[2024-06-01 16:35:53] [INFO ] Deduced a trap composed of 165 places in 287 ms of which 3 ms to minimize.
[2024-06-01 16:35:53] [INFO ] Deduced a trap composed of 165 places in 265 ms of which 3 ms to minimize.
[2024-06-01 16:35:53] [INFO ] Deduced a trap composed of 195 places in 295 ms of which 3 ms to minimize.
[2024-06-01 16:35:54] [INFO ] Deduced a trap composed of 185 places in 269 ms of which 3 ms to minimize.
[2024-06-01 16:35:54] [INFO ] Deduced a trap composed of 175 places in 264 ms of which 3 ms to minimize.
[2024-06-01 16:35:55] [INFO ] Deduced a trap composed of 240 places in 373 ms of which 3 ms to minimize.
[2024-06-01 16:35:55] [INFO ] Deduced a trap composed of 161 places in 400 ms of which 4 ms to minimize.
[2024-06-01 16:35:55] [INFO ] Deduced a trap composed of 170 places in 352 ms of which 4 ms to minimize.
[2024-06-01 16:35:56] [INFO ] Deduced a trap composed of 180 places in 295 ms of which 3 ms to minimize.
[2024-06-01 16:35:56] [INFO ] Deduced a trap composed of 166 places in 286 ms of which 3 ms to minimize.
[2024-06-01 16:35:56] [INFO ] Deduced a trap composed of 165 places in 302 ms of which 3 ms to minimize.
[2024-06-01 16:35:57] [INFO ] Deduced a trap composed of 170 places in 289 ms of which 3 ms to minimize.
[2024-06-01 16:35:57] [INFO ] Deduced a trap composed of 185 places in 302 ms of which 4 ms to minimize.
[2024-06-01 16:35:57] [INFO ] Deduced a trap composed of 185 places in 295 ms of which 3 ms to minimize.
[2024-06-01 16:35:59] [INFO ] Deduced a trap composed of 166 places in 247 ms of which 3 ms to minimize.
[2024-06-01 16:35:59] [INFO ] Deduced a trap composed of 161 places in 265 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-06-01 16:36:01] [INFO ] Deduced a trap composed of 165 places in 338 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/1879 variables, and 158 constraints, problems are : Problem set: 0 solved, 1297 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1297 constraints, Known Traps: 86/86 constraints]
After SMT, in 66591ms problems are : Problem set: 0 solved, 1297 unsolved
Search for dead transitions found 0 dead transitions in 66613ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70344 ms. Remains : 580/580 places, 1308/1308 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[4]
Ending property specific reduction for PolyORBNT-COL-S10J30-UpperBounds-02 in 244700 ms.
[2024-06-01 16:36:02] [INFO ] Flatten gal took : 323 ms
[2024-06-01 16:36:02] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-06-01 16:36:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 580 places, 1308 transitions and 8384 arcs took 25 ms.
Total runtime 728963 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : PolyORBNT-COL-S10J30-UpperBounds-02

BK_STOP 1717259762837

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name PolyORBNT-COL-S10J30-UpperBounds-02
ub formula formula --maxsum=/tmp/2720/ub_0_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-COL-S10J30"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is PolyORBNT-COL-S10J30, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r516-tajo-171654447000413"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J30.tgz
mv PolyORBNT-COL-S10J30 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;