About the Execution of GreatSPN+red for PolyORBLF-COL-S02J04T08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 9953.388 | 1638776.00 | 3865184.00 | 258.30 | 1 1 0 1 0 1 2 1 1 1 0 1 2 1 1 1 | normal |
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.r289-tajo-171654445100085.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 greatspnxred
Input is PolyORBLF-COL-S02J04T08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445100085
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 7.4K Apr 11 16:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 11 16:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 11 16:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 11 16:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.6K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 11 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 11 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 11 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 113K Apr 11 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K 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 PolyORBLF-COL-S02J04T08-UpperBounds-00
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-01
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-02
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-03
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-04
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-05
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-06
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-07
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-08
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-09
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-10
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-11
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-12
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-13
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-14
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716845033072
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J04T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 21:23:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-27 21:23:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 21:23:54] [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-05-27 21:23:55] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 21:23:55] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 968 ms
[2024-05-27 21:23:55] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 614 PT places and 1300.0 transition bindings in 33 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
[2024-05-27 21:23:55] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 6 ms.
[2024-05-27 21:23:56] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Normalized transition count is 64 out of 65 initially.
// Phase 1: matrix 64 rows 81 cols
[2024-05-27 21:23:56] [INFO ] Computed 26 invariants in 12 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0] Max Struct:[1, 1, 3, 1, 3, 2, 140, 21, 8, 2, 4, 1, 20, 1, 2, 1]
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-27 21:23:56] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-27 21:23:56] [INFO ] Computed 26 invariants in 4 ms
[2024-05-27 21:23:56] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-27 21:23:56] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 8 ms returned sat
[2024-05-27 21:23:56] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2024-05-27 21:23:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:23:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-27 21:23:56] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 17 ms returned sat
[2024-05-27 21:23:56] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-05-27 21:23:56] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-27 21:23:56] [INFO ] [Nat]Added 8 Read/Feed constraints in 12 ms returned sat
[2024-05-27 21:23:56] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-27 21:23:56] [INFO ] Added : 2 causal constraints over 1 iterations in 49 ms. Result :sat
Minimization took 31 ms.
[2024-05-27 21:23:56] [INFO ] [Real]Absence check using 11 positive place invariants in 75 ms returned sat
[2024-05-27 21:23:56] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 27 ms returned sat
[2024-05-27 21:23:56] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-05-27 21:23:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:23:57] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2024-05-27 21:23:57] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 23 ms returned sat
[2024-05-27 21:23:57] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2024-05-27 21:23:57] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2024-05-27 21:23:57] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 17 ms.
[2024-05-27 21:23:57] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 20 ms to minimize.
[2024-05-27 21:23:57] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 2 ms to minimize.
[2024-05-27 21:23:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 196 ms
[2024-05-27 21:23:57] [INFO ] Added : 54 causal constraints over 11 iterations in 342 ms. Result :sat
Minimization took 21 ms.
[2024-05-27 21:23:57] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 21:23:57] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 21:23:57] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-05-27 21:23:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:23:57] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 21:23:57] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-27 21:23:57] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-27 21:23:57] [INFO ] [Nat]Added 8 Read/Feed constraints in 24 ms returned sat
[2024-05-27 21:23:57] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 13 ms.
[2024-05-27 21:23:58] [INFO ] Added : 54 causal constraints over 12 iterations in 213 ms. Result :sat
Minimization took 48 ms.
[2024-05-27 21:23:58] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-27 21:23:58] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 21:23:58] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-27 21:23:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:23:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-27 21:23:58] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 21:23:58] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-05-27 21:23:58] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-27 21:23:58] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2024-05-27 21:23:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2024-05-27 21:23:58] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-27 21:23:58] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2024-05-27 21:23:58] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-27 21:23:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 107 ms
[2024-05-27 21:23:58] [INFO ] Added : 54 causal constraints over 11 iterations in 189 ms. Result :sat
Minimization took 21 ms.
[2024-05-27 21:23:58] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2024-05-27 21:23:58] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 7 ms returned sat
[2024-05-27 21:23:58] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-27 21:23:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:23:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2024-05-27 21:23:58] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 21:23:58] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-27 21:23:58] [INFO ] [Nat]Added 8 Read/Feed constraints in 41 ms returned sat
[2024-05-27 21:23:58] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-27 21:23:58] [INFO ] Added : 57 causal constraints over 12 iterations in 115 ms. Result :sat
Minimization took 168 ms.
[2024-05-27 21:23:59] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2024-05-27 21:23:59] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 8 ms returned sat
[2024-05-27 21:23:59] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-05-27 21:23:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:23:59] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 21:23:59] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-27 21:23:59] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-27 21:23:59] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2024-05-27 21:23:59] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-27 21:23:59] [INFO ] Added : 28 causal constraints over 6 iterations in 62 ms. Result :sat
Minimization took 19 ms.
[2024-05-27 21:23:59] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 21:23:59] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 21:23:59] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-05-27 21:23:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:23:59] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 21:23:59] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 21:23:59] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-27 21:23:59] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-27 21:23:59] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-27 21:23:59] [INFO ] Added : 6 causal constraints over 2 iterations in 61 ms. Result :sat
Minimization took 22 ms.
[2024-05-27 21:23:59] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 21:23:59] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned unsat
[2024-05-27 21:23:59] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 21:23:59] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 21:23:59] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-27 21:23:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:23:59] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 21:23:59] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 21:23:59] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-27 21:23:59] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-27 21:23:59] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 21 ms.
[2024-05-27 21:23:59] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-27 21:23:59] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 0 ms to minimize.
[2024-05-27 21:23:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 106 ms
[2024-05-27 21:23:59] [INFO ] Added : 58 causal constraints over 12 iterations in 199 ms. Result :sat
Minimization took 24 ms.
[2024-05-27 21:23:59] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-27 21:23:59] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 21:24:00] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-27 21:24:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:24:00] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 21:24:00] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-27 21:24:00] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-27 21:24:00] [INFO ] [Nat]Added 8 Read/Feed constraints in 15 ms returned sat
[2024-05-27 21:24:00] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-27 21:24:00] [INFO ] Added : 34 causal constraints over 7 iterations in 41 ms. Result :sat
Minimization took 26 ms.
[2024-05-27 21:24:00] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 21:24:00] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 21:24:00] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-27 21:24:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:24:00] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 21:24:00] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 21:24:00] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-05-27 21:24:00] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-27 21:24:00] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-27 21:24:00] [INFO ] Added : 44 causal constraints over 10 iterations in 79 ms. Result :sat
Minimization took 25 ms.
[2024-05-27 21:24:00] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 21:24:00] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 21:24:00] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-27 21:24:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:24:00] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 21:24:00] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 21:24:00] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-27 21:24:00] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-27 21:24:00] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-27 21:24:00] [INFO ] Added : 54 causal constraints over 11 iterations in 63 ms. Result :sat
Minimization took 22 ms.
[2024-05-27 21:24:00] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-27 21:24:00] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 21:24:00] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-27 21:24:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:24:00] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 21:24:00] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 21:24:00] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-27 21:24:00] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-27 21:24:00] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-27 21:24:00] [INFO ] Added : 7 causal constraints over 2 iterations in 17 ms. Result :sat
Minimization took 19 ms.
[2024-05-27 21:24:00] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-27 21:24:00] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 21:24:00] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-27 21:24:00] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-27 21:24:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:24:00] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 21:24:00] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2024-05-27 21:24:01] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-27 21:24:01] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-27 21:24:01] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-27 21:24:01] [INFO ] Added : 9 causal constraints over 3 iterations in 28 ms. Result :sat
Minimization took 18 ms.
[2024-05-27 21:24:01] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 21:24:01] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-27 21:24:01] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-27 21:24:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:24:01] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 21:24:01] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-27 21:24:01] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-27 21:24:01] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-27 21:24:01] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-27 21:24:01] [INFO ] Added : 3 causal constraints over 1 iterations in 37 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 3, 1, 3, 2, 140, 1, 8, 2, 4, 1, 20, 2, 1]
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-05-27 21:24:01] [INFO ] Unfolded HLPN to a Petri net with 614 places and 1242 transitions 5732 arcs in 37 ms.
[2024-05-27 21:24:01] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 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:[1, 1, 3, 1, 3, 2, 140, 8, 2, 4, 1, 20, 2, 1]
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:[1, 1, 3, 1, 3, 2, 140, 8, 2, 4, 1, 20, 2, 1]
[2024-05-27 21:24:01] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
// Phase 1: matrix 1098 rows 614 cols
[2024-05-27 21:24:01] [INFO ] Computed 50 invariants in 77 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:[1, 1, 3, 1, 3, 2, 8, 8, 2, 4, 1, 20, 2, 1]
RANDOM walk for 10000 steps (7 resets) in 124 ms. (80 steps per ms)
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90003 steps (20 resets) in 395 ms. (227 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 1, 2, 1, 1, 0, 2, 1] Max Struct:[3, 3, 2, 8, 8, 2, 4, 20, 2]
[2024-05-27 21:24:02] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2024-05-27 21:24:02] [INFO ] Invariant cache hit.
[2024-05-27 21:24:02] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2024-05-27 21:24:02] [INFO ] [Real]Absence check using 14 positive and 36 generalized place invariants in 28 ms returned sat
[2024-05-27 21:24:02] [INFO ] [Real]Absence check using state equation in 370 ms returned sat
[2024-05-27 21:24:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:24:02] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2024-05-27 21:24:02] [INFO ] [Nat]Absence check using 14 positive and 36 generalized place invariants in 17 ms returned sat
[2024-05-27 21:24:03] [INFO ] [Nat]Absence check using state equation in 477 ms returned sat
[2024-05-27 21:24:03] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 21:24:03] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 21:24:04] [INFO ] [Nat]Added 96 Read/Feed constraints in 1018 ms returned unknown
[2024-05-27 21:24:04] [INFO ] [Real]Absence check using 14 positive place invariants in 13 ms returned sat
[2024-05-27 21:24:04] [INFO ] [Real]Absence check using 14 positive and 36 generalized place invariants in 23 ms returned sat
[2024-05-27 21:24:04] [INFO ] [Real]Absence check using state equation in 446 ms returned sat
[2024-05-27 21:24:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:24:04] [INFO ] [Nat]Absence check using 14 positive place invariants in 18 ms returned sat
[2024-05-27 21:24:05] [INFO ] [Nat]Absence check using 14 positive and 36 generalized place invariants in 38 ms returned sat
[2024-05-27 21:24:05] [INFO ] [Nat]Absence check using state equation in 678 ms returned sat
[2024-05-27 21:24:06] [INFO ] [Nat]Added 96 Read/Feed constraints in 315 ms returned sat
[2024-05-27 21:24:06] [INFO ] Computed and/alt/rep : 728/2582/720 causal constraints (skipped 376 transitions) in 113 ms.
[2024-05-27 21:24:07] [INFO ] Added : 50 causal constraints over 10 iterations in 1883 ms. Result :sat
Minimization took 598 ms.
[2024-05-27 21:24:08] [INFO ] [Real]Absence check using 14 positive place invariants in 12 ms returned sat
[2024-05-27 21:24:08] [INFO ] [Real]Absence check using 14 positive and 36 generalized place invariants in 6 ms returned unsat
[2024-05-27 21:24:08] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2024-05-27 21:24:08] [INFO ] [Real]Absence check using 14 positive and 36 generalized place invariants in 9 ms returned unsat
[2024-05-27 21:24:08] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2024-05-27 21:24:08] [INFO ] [Real]Absence check using 14 positive and 36 generalized place invariants in 5 ms returned unsat
[2024-05-27 21:24:08] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2024-05-27 21:24:08] [INFO ] [Real]Absence check using 14 positive and 36 generalized place invariants in 5 ms returned unsat
[2024-05-27 21:24:09] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2024-05-27 21:24:09] [INFO ] [Real]Absence check using 14 positive and 36 generalized place invariants in 17 ms returned sat
[2024-05-27 21:24:09] [INFO ] [Real]Absence check using state equation in 395 ms returned sat
[2024-05-27 21:24:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:24:09] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2024-05-27 21:24:09] [INFO ] [Nat]Absence check using 14 positive and 36 generalized place invariants in 17 ms returned sat
[2024-05-27 21:24:10] [INFO ] [Nat]Absence check using state equation in 680 ms returned sat
[2024-05-27 21:24:10] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 21:24:11] [INFO ] [Nat]Added 96 Read/Feed constraints in 794 ms returned sat
[2024-05-27 21:24:11] [INFO ] Computed and/alt/rep : 728/2582/720 causal constraints (skipped 376 transitions) in 103 ms.
[2024-05-27 21:24:12] [INFO ] Added : 68 causal constraints over 14 iterations in 1664 ms. Result :sat
Minimization took 629 ms.
[2024-05-27 21:24:13] [INFO ] [Real]Absence check using 14 positive place invariants in 14 ms returned sat
[2024-05-27 21:24:13] [INFO ] [Real]Absence check using 14 positive and 36 generalized place invariants in 24 ms returned sat
[2024-05-27 21:24:14] [INFO ] [Real]Absence check using state equation in 377 ms returned sat
[2024-05-27 21:24:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:24:14] [INFO ] [Nat]Absence check using 14 positive place invariants in 12 ms returned sat
[2024-05-27 21:24:14] [INFO ] [Nat]Absence check using 14 positive and 36 generalized place invariants in 20 ms returned sat
[2024-05-27 21:24:14] [INFO ] [Nat]Absence check using state equation in 477 ms returned sat
[2024-05-27 21:24:15] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 21:24:15] [INFO ] [Nat]Added 96 Read/Feed constraints in 748 ms returned sat
[2024-05-27 21:24:15] [INFO ] Computed and/alt/rep : 728/2582/720 causal constraints (skipped 376 transitions) in 228 ms.
[2024-05-27 21:24:18] [INFO ] Added : 154 causal constraints over 32 iterations in 2677 ms. Result :sat
Minimization took 613 ms.
[2024-05-27 21:24:18] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2024-05-27 21:24:18] [INFO ] [Real]Absence check using 14 positive and 36 generalized place invariants in 17 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 1, 2, 1, 1, 0, 2, 1] Max Struct:[3, 3, 1, 2, 1, 1, 4, 20, 1]
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 2] Max Struct:[3, 3, 4, 20]
Support contains 18 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1114/1114 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 74 rules applied. Total rules applied 74 place count 612 transition count 1042
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 540 transition count 1042
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 146 place count 540 transition count 978
Deduced a syphon composed of 64 places in 2 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 274 place count 476 transition count 978
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 14 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 386 place count 420 transition count 922
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 402 place count 420 transition count 906
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 418 place count 404 transition count 906
Applied a total of 418 rules in 301 ms. Remains 404 /614 variables (removed 210) and now considering 906/1114 (removed 208) transitions.
Running 904 sub problems to find dead transitions.
[2024-05-27 21:24:19] [INFO ] Flow matrix only has 890 transitions (discarded 16 similar events)
// Phase 1: matrix 890 rows 404 cols
[2024-05-27 21:24:19] [INFO ] Computed 48 invariants in 30 ms
[2024-05-27 21:24:19] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 904 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 904 unsolved
[2024-05-27 21:24:27] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 14 ms to minimize.
[2024-05-27 21:24:27] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
[2024-05-27 21:24:28] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 3 ms to minimize.
[2024-05-27 21:24:28] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 1 ms to minimize.
[2024-05-27 21:24:28] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-05-27 21:24:28] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 1 ms to minimize.
[2024-05-27 21:24:28] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 15 ms to minimize.
[2024-05-27 21:24:28] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 0 ms to minimize.
[2024-05-27 21:24:28] [INFO ] Deduced a trap composed of 149 places in 259 ms of which 11 ms to minimize.
[2024-05-27 21:24:28] [INFO ] Deduced a trap composed of 151 places in 161 ms of which 2 ms to minimize.
[2024-05-27 21:24:29] [INFO ] Deduced a trap composed of 147 places in 211 ms of which 2 ms to minimize.
[2024-05-27 21:24:31] [INFO ] Deduced a trap composed of 147 places in 119 ms of which 2 ms to minimize.
[2024-05-27 21:24:31] [INFO ] Deduced a trap composed of 70 places in 163 ms of which 2 ms to minimize.
[2024-05-27 21:24:31] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 2 ms to minimize.
[2024-05-27 21:24:34] [INFO ] Deduced a trap composed of 132 places in 176 ms of which 3 ms to minimize.
[2024-05-27 21:24:34] [INFO ] Deduced a trap composed of 135 places in 171 ms of which 2 ms to minimize.
[2024-05-27 21:24:35] [INFO ] Deduced a trap composed of 152 places in 173 ms of which 2 ms to minimize.
[2024-05-27 21:24:35] [INFO ] Deduced a trap composed of 152 places in 191 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 18/64 constraints. Problems are: Problem set: 0 solved, 904 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 402/1294 variables, and 64 constraints, problems are : Problem set: 0 solved, 904 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 34/35 constraints, State Equation: 0/404 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 904/904 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 904 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 904 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 904 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 18/64 constraints. Problems are: Problem set: 0 solved, 904 unsolved
[2024-05-27 21:24:48] [INFO ] Deduced a trap composed of 65 places in 208 ms of which 3 ms to minimize.
[2024-05-27 21:24:50] [INFO ] Deduced a trap composed of 226 places in 189 ms of which 2 ms to minimize.
[2024-05-27 21:24:51] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 1 ms to minimize.
[2024-05-27 21:24:54] [INFO ] Deduced a trap composed of 134 places in 197 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 904 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 402/1294 variables, and 68 constraints, problems are : Problem set: 0 solved, 904 unsolved in 20048 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 34/35 constraints, State Equation: 0/404 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/904 constraints, Known Traps: 22/22 constraints]
After SMT, in 42349ms problems are : Problem set: 0 solved, 904 unsolved
Search for dead transitions found 0 dead transitions in 42391ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42734 ms. Remains : 404/614 places, 906/1114 transitions.
[2024-05-27 21:25:01] [INFO ] Flow matrix only has 890 transitions (discarded 16 similar events)
[2024-05-27 21:25:01] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 2] Max Struct:[3, 3, 4, 20]
RANDOM walk for 1000000 steps (442 resets) in 4065 ms. (245 steps per ms)
BEST_FIRST walk for 4000001 steps (709 resets) in 6986 ms. (572 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 2] Max Struct:[3, 3, 4, 20]
[2024-05-27 21:25:12] [INFO ] Flow matrix only has 890 transitions (discarded 16 similar events)
[2024-05-27 21:25:12] [INFO ] Invariant cache hit.
[2024-05-27 21:25:12] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-05-27 21:25:12] [INFO ] [Real]Absence check using 13 positive and 35 generalized place invariants in 22 ms returned sat
[2024-05-27 21:25:13] [INFO ] [Real]Absence check using state equation in 343 ms returned sat
[2024-05-27 21:25:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:25:13] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 21:25:13] [INFO ] [Nat]Absence check using 13 positive and 35 generalized place invariants in 15 ms returned sat
[2024-05-27 21:25:14] [INFO ] [Nat]Absence check using state equation in 1370 ms returned sat
[2024-05-27 21:25:14] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 21:25:19] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 21:25:23] [INFO ] [Nat]Added 96 Read/Feed constraints in 9038 ms returned unknown
[2024-05-27 21:25:23] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-27 21:25:23] [INFO ] [Real]Absence check using 13 positive and 35 generalized place invariants in 14 ms returned sat
[2024-05-27 21:25:24] [INFO ] [Real]Absence check using state equation in 302 ms returned sat
[2024-05-27 21:25:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:25:24] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 21:25:24] [INFO ] [Nat]Absence check using 13 positive and 35 generalized place invariants in 15 ms returned sat
[2024-05-27 21:25:24] [INFO ] [Nat]Absence check using state equation in 323 ms returned sat
[2024-05-27 21:25:27] [INFO ] [Nat]Added 96 Read/Feed constraints in 2546 ms returned sat
[2024-05-27 21:25:27] [INFO ] Deduced a trap composed of 36 places in 138 ms of which 3 ms to minimize.
[2024-05-27 21:25:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 368 ms
[2024-05-27 21:25:27] [INFO ] Computed and/alt/rep : 432/1438/424 causal constraints (skipped 464 transitions) in 75 ms.
[2024-05-27 21:25:28] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 1 ms to minimize.
[2024-05-27 21:25:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2024-05-27 21:25:28] [INFO ] Added : 39 causal constraints over 9 iterations in 951 ms. Result :sat
Minimization took 4502 ms.
[2024-05-27 21:25:33] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-27 21:25:33] [INFO ] [Real]Absence check using 13 positive and 35 generalized place invariants in 13 ms returned sat
[2024-05-27 21:25:33] [INFO ] [Real]Absence check using state equation in 330 ms returned sat
[2024-05-27 21:25:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:25:33] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 21:25:33] [INFO ] [Nat]Absence check using 13 positive and 35 generalized place invariants in 21 ms returned sat
[2024-05-27 21:25:33] [INFO ] [Nat]Absence check using state equation in 424 ms returned sat
[2024-05-27 21:25:35] [INFO ] [Nat]Added 96 Read/Feed constraints in 1091 ms returned sat
[2024-05-27 21:25:35] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 1 ms to minimize.
[2024-05-27 21:25:35] [INFO ] Deduced a trap composed of 154 places in 229 ms of which 3 ms to minimize.
[2024-05-27 21:25:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 816 ms
[2024-05-27 21:25:35] [INFO ] Computed and/alt/rep : 432/1438/424 causal constraints (skipped 464 transitions) in 52 ms.
[2024-05-27 21:25:37] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 2 ms to minimize.
[2024-05-27 21:25:37] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 5 ms to minimize.
[2024-05-27 21:25:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 329 ms
[2024-05-27 21:25:38] [INFO ] Added : 62 causal constraints over 13 iterations in 2188 ms. Result :sat
Minimization took 3746 ms.
[2024-05-27 21:25:41] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-27 21:25:41] [INFO ] [Real]Absence check using 13 positive and 35 generalized place invariants in 17 ms returned sat
[2024-05-27 21:25:42] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2024-05-27 21:25:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:25:42] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-27 21:25:42] [INFO ] [Nat]Absence check using 13 positive and 35 generalized place invariants in 17 ms returned sat
[2024-05-27 21:25:42] [INFO ] [Nat]Absence check using state equation in 242 ms returned sat
[2024-05-27 21:25:42] [INFO ] [Nat]Added 96 Read/Feed constraints in 331 ms returned sat
[2024-05-27 21:25:43] [INFO ] Computed and/alt/rep : 432/1438/424 causal constraints (skipped 464 transitions) in 85 ms.
[2024-05-27 21:25:43] [INFO ] Added : 29 causal constraints over 6 iterations in 454 ms. Result :sat
Minimization took 2719 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 2] Max Struct:[3, 3, 4, 20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 2] Max Struct:[3, 3, 4, 20]
Support contains 18 out of 404 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 404/404 places, 906/906 transitions.
Applied a total of 0 rules in 39 ms. Remains 404 /404 variables (removed 0) and now considering 906/906 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 404/404 places, 906/906 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 404/404 places, 906/906 transitions.
Applied a total of 0 rules in 24 ms. Remains 404 /404 variables (removed 0) and now considering 906/906 (removed 0) transitions.
[2024-05-27 21:25:47] [INFO ] Flow matrix only has 890 transitions (discarded 16 similar events)
[2024-05-27 21:25:47] [INFO ] Invariant cache hit.
[2024-05-27 21:25:47] [INFO ] Implicit Places using invariants in 555 ms returned [358, 359, 360, 361, 362, 363, 364, 365]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 561 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 396/404 places, 906/906 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 388 transition count 898
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 388 transition count 898
Applied a total of 16 rules in 40 ms. Remains 388 /396 variables (removed 8) and now considering 898/906 (removed 8) transitions.
[2024-05-27 21:25:47] [INFO ] Flow matrix only has 882 transitions (discarded 16 similar events)
// Phase 1: matrix 882 rows 388 cols
[2024-05-27 21:25:47] [INFO ] Computed 40 invariants in 14 ms
[2024-05-27 21:25:48] [INFO ] Implicit Places using invariants in 747 ms returned []
[2024-05-27 21:25:48] [INFO ] Flow matrix only has 882 transitions (discarded 16 similar events)
[2024-05-27 21:25:48] [INFO ] Invariant cache hit.
[2024-05-27 21:25:48] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 21:25:52] [INFO ] Implicit Places using invariants and state equation in 3838 ms returned []
Implicit Place search using SMT with State Equation took 4600 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 388/404 places, 898/906 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5227 ms. Remains : 388/404 places, 898/906 transitions.
[2024-05-27 21:25:52] [INFO ] Flow matrix only has 882 transitions (discarded 16 similar events)
[2024-05-27 21:25:52] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 2] Max Struct:[3, 3, 4, 20]
RANDOM walk for 1000000 steps (438 resets) in 3869 ms. (258 steps per ms)
BEST_FIRST walk for 4000003 steps (680 resets) in 6887 ms. (580 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 2] Max Struct:[3, 3, 4, 20]
[2024-05-27 21:26:03] [INFO ] Flow matrix only has 882 transitions (discarded 16 similar events)
[2024-05-27 21:26:03] [INFO ] Invariant cache hit.
[2024-05-27 21:26:03] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2024-05-27 21:26:03] [INFO ] [Real]Absence check using 15 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-27 21:26:03] [INFO ] [Real]Absence check using state equation in 297 ms returned sat
[2024-05-27 21:26:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:26:03] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2024-05-27 21:26:03] [INFO ] [Nat]Absence check using 15 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-27 21:26:04] [INFO ] [Nat]Absence check using state equation in 442 ms returned sat
[2024-05-27 21:26:04] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 21:26:04] [INFO ] [Nat]Added 96 Read/Feed constraints in 496 ms returned sat
[2024-05-27 21:26:04] [INFO ] Deduced a trap composed of 19 places in 238 ms of which 3 ms to minimize.
[2024-05-27 21:26:05] [INFO ] Deduced a trap composed of 168 places in 273 ms of which 3 ms to minimize.
[2024-05-27 21:26:05] [INFO ] Deduced a trap composed of 153 places in 266 ms of which 3 ms to minimize.
[2024-05-27 21:26:05] [INFO ] Deduced a trap composed of 154 places in 218 ms of which 3 ms to minimize.
[2024-05-27 21:26:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1343 ms
[2024-05-27 21:26:05] [INFO ] Computed and/alt/rep : 416/1357/408 causal constraints (skipped 472 transitions) in 56 ms.
[2024-05-27 21:26:06] [INFO ] Added : 31 causal constraints over 7 iterations in 538 ms. Result :sat
Minimization took 4177 ms.
[2024-05-27 21:26:10] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2024-05-27 21:26:10] [INFO ] [Real]Absence check using 15 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-27 21:26:10] [INFO ] [Real]Absence check using state equation in 246 ms returned sat
[2024-05-27 21:26:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:26:11] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-05-27 21:26:11] [INFO ] [Nat]Absence check using 15 positive and 25 generalized place invariants in 17 ms returned sat
[2024-05-27 21:26:11] [INFO ] [Nat]Absence check using state equation in 438 ms returned sat
[2024-05-27 21:26:12] [INFO ] [Nat]Added 96 Read/Feed constraints in 1454 ms returned sat
[2024-05-27 21:26:13] [INFO ] Deduced a trap composed of 19 places in 248 ms of which 2 ms to minimize.
[2024-05-27 21:26:13] [INFO ] Deduced a trap composed of 155 places in 221 ms of which 12 ms to minimize.
[2024-05-27 21:26:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 632 ms
[2024-05-27 21:26:13] [INFO ] Computed and/alt/rep : 416/1357/408 causal constraints (skipped 472 transitions) in 65 ms.
[2024-05-27 21:26:14] [INFO ] Added : 37 causal constraints over 8 iterations in 1050 ms. Result :sat
Minimization took 4504 ms.
[2024-05-27 21:26:19] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2024-05-27 21:26:19] [INFO ] [Real]Absence check using 15 positive and 25 generalized place invariants in 28 ms returned sat
[2024-05-27 21:26:19] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2024-05-27 21:26:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:26:19] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2024-05-27 21:26:19] [INFO ] [Nat]Absence check using 15 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-27 21:26:20] [INFO ] [Nat]Absence check using state equation in 411 ms returned sat
[2024-05-27 21:26:24] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 21:26:28] [INFO ] [Nat]Added 96 Read/Feed constraints in 8237 ms returned sat
[2024-05-27 21:26:28] [INFO ] Deduced a trap composed of 19 places in 152 ms of which 2 ms to minimize.
[2024-05-27 21:26:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 433 ms
[2024-05-27 21:26:28] [INFO ] Computed and/alt/rep : 416/1357/408 causal constraints (skipped 472 transitions) in 70 ms.
[2024-05-27 21:26:29] [INFO ] Added : 38 causal constraints over 8 iterations in 716 ms. Result :sat
Minimization took 3570 ms.
[2024-05-27 21:26:33] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-05-27 21:26:33] [INFO ] [Real]Absence check using 15 positive and 25 generalized place invariants in 11 ms returned sat
[2024-05-27 21:26:33] [INFO ] [Real]Absence check using state equation in 277 ms returned sat
[2024-05-27 21:26:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:26:33] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-05-27 21:26:33] [INFO ] [Nat]Absence check using 15 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-27 21:26:33] [INFO ] [Nat]Absence check using state equation in 318 ms returned sat
[2024-05-27 21:26:34] [INFO ] [Nat]Added 96 Read/Feed constraints in 258 ms returned sat
[2024-05-27 21:26:34] [INFO ] Computed and/alt/rep : 416/1357/408 causal constraints (skipped 472 transitions) in 45 ms.
[2024-05-27 21:26:34] [INFO ] Added : 19 causal constraints over 4 iterations in 262 ms. Result :sat
Minimization took 3356 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 2] Max Struct:[3, 3, 4, 20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 2] Max Struct:[3, 3, 4, 20]
Support contains 18 out of 388 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 388/388 places, 898/898 transitions.
Applied a total of 0 rules in 56 ms. Remains 388 /388 variables (removed 0) and now considering 898/898 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 388/388 places, 898/898 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 388/388 places, 898/898 transitions.
Applied a total of 0 rules in 46 ms. Remains 388 /388 variables (removed 0) and now considering 898/898 (removed 0) transitions.
[2024-05-27 21:26:38] [INFO ] Flow matrix only has 882 transitions (discarded 16 similar events)
[2024-05-27 21:26:38] [INFO ] Invariant cache hit.
[2024-05-27 21:26:39] [INFO ] Implicit Places using invariants in 431 ms returned []
[2024-05-27 21:26:39] [INFO ] Flow matrix only has 882 transitions (discarded 16 similar events)
[2024-05-27 21:26:39] [INFO ] Invariant cache hit.
[2024-05-27 21:26:39] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 21:26:43] [INFO ] Implicit Places using invariants and state equation in 4242 ms returned []
Implicit Place search using SMT with State Equation took 4691 ms to find 0 implicit places.
[2024-05-27 21:26:43] [INFO ] Redundant transitions in 50 ms returned []
Running 896 sub problems to find dead transitions.
[2024-05-27 21:26:43] [INFO ] Flow matrix only has 882 transitions (discarded 16 similar events)
[2024-05-27 21:26:43] [INFO ] Invariant cache hit.
[2024-05-27 21:26:43] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 896 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/386 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 896 unsolved
[2024-05-27 21:26:51] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 1 ms to minimize.
[2024-05-27 21:26:51] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 1 ms to minimize.
[2024-05-27 21:26:51] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 0 ms to minimize.
[2024-05-27 21:26:51] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-05-27 21:26:51] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 1 ms to minimize.
[2024-05-27 21:26:51] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2024-05-27 21:26:51] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-27 21:26:51] [INFO ] Deduced a trap composed of 147 places in 200 ms of which 3 ms to minimize.
[2024-05-27 21:26:52] [INFO ] Deduced a trap composed of 187 places in 210 ms of which 3 ms to minimize.
[2024-05-27 21:26:52] [INFO ] Deduced a trap composed of 132 places in 202 ms of which 2 ms to minimize.
[2024-05-27 21:26:52] [INFO ] Deduced a trap composed of 158 places in 206 ms of which 2 ms to minimize.
[2024-05-27 21:26:52] [INFO ] Deduced a trap composed of 166 places in 218 ms of which 2 ms to minimize.
[2024-05-27 21:26:52] [INFO ] Deduced a trap composed of 54 places in 208 ms of which 2 ms to minimize.
[2024-05-27 21:26:53] [INFO ] Deduced a trap composed of 54 places in 196 ms of which 16 ms to minimize.
[2024-05-27 21:26:53] [INFO ] Deduced a trap composed of 54 places in 216 ms of which 3 ms to minimize.
[2024-05-27 21:26:53] [INFO ] Deduced a trap composed of 39 places in 204 ms of which 3 ms to minimize.
[2024-05-27 21:26:53] [INFO ] Deduced a trap composed of 54 places in 185 ms of which 2 ms to minimize.
[2024-05-27 21:26:54] [INFO ] Deduced a trap composed of 164 places in 190 ms of which 2 ms to minimize.
[2024-05-27 21:26:54] [INFO ] Deduced a trap composed of 162 places in 196 ms of which 3 ms to minimize.
[2024-05-27 21:26:54] [INFO ] Deduced a trap composed of 19 places in 206 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 896 unsolved
[2024-05-27 21:26:57] [INFO ] Deduced a trap composed of 149 places in 137 ms of which 2 ms to minimize.
[2024-05-27 21:26:57] [INFO ] Deduced a trap composed of 31 places in 152 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/386 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 896 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/386 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 896 unsolved
Problem TDEAD790 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD897 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/387 variables, 1/61 constraints. Problems are: Problem set: 48 solved, 848 unsolved
[2024-05-27 21:27:15] [INFO ] Deduced a trap composed of 128 places in 166 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")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 387/1270 variables, and 62 constraints, problems are : Problem set: 48 solved, 848 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/388 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 896/896 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 48 solved, 848 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 14/14 constraints. Problems are: Problem set: 48 solved, 848 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/386 variables, 24/38 constraints. Problems are: Problem set: 48 solved, 848 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 23/61 constraints. Problems are: Problem set: 48 solved, 848 unsolved
[2024-05-27 21:27:24] [INFO ] Deduced a trap composed of 134 places in 178 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/386 variables, 1/62 constraints. Problems are: Problem set: 48 solved, 848 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/386 variables, 0/62 constraints. Problems are: Problem set: 48 solved, 848 unsolved
At refinement iteration 5 (OVERLAPS) 1/387 variables, 1/63 constraints. Problems are: Problem set: 48 solved, 848 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 387/1270 variables, and 63 constraints, problems are : Problem set: 48 solved, 848 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/388 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/896 constraints, Known Traps: 24/24 constraints]
After SMT, in 61762ms problems are : Problem set: 48 solved, 848 unsolved
Search for dead transitions found 48 dead transitions in 61798ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 388/388 places, 850/898 transitions.
Applied a total of 0 rules in 13 ms. Remains 388 /388 variables (removed 0) and now considering 850/850 (removed 0) transitions.
[2024-05-27 21:27:45] [INFO ] Redundant transitions in 22 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 66677 ms. Remains : 388/388 places, 850/898 transitions.
[2024-05-27 21:27:45] [INFO ] Flow matrix only has 834 transitions (discarded 16 similar events)
// Phase 1: matrix 834 rows 388 cols
[2024-05-27 21:27:45] [INFO ] Computed 40 invariants in 14 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 2] Max Struct:[3, 3, 4, 20]
RANDOM walk for 1000000 steps (414 resets) in 3586 ms. (278 steps per ms)
BEST_FIRST walk for 4000002 steps (667 resets) in 6247 ms. (640 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 2] Max Struct:[3, 3, 4, 20]
[2024-05-27 21:27:55] [INFO ] Flow matrix only has 834 transitions (discarded 16 similar events)
[2024-05-27 21:27:55] [INFO ] Invariant cache hit.
[2024-05-27 21:27:55] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-27 21:27:55] [INFO ] [Real]Absence check using 14 positive and 26 generalized place invariants in 26 ms returned sat
[2024-05-27 21:27:55] [INFO ] [Real]Absence check using state equation in 278 ms returned sat
[2024-05-27 21:27:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:27:55] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-27 21:27:55] [INFO ] [Nat]Absence check using 14 positive and 26 generalized place invariants in 12 ms returned sat
[2024-05-27 21:27:57] [INFO ] [Nat]Absence check using state equation in 1192 ms returned sat
[2024-05-27 21:27:57] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 21:28:01] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 21:28:06] [INFO ] [Nat]Added 96 Read/Feed constraints in 9012 ms returned unknown
[2024-05-27 21:28:06] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-27 21:28:06] [INFO ] [Real]Absence check using 14 positive and 26 generalized place invariants in 12 ms returned sat
[2024-05-27 21:28:06] [INFO ] [Real]Absence check using state equation in 249 ms returned sat
[2024-05-27 21:28:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:28:06] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-27 21:28:06] [INFO ] [Nat]Absence check using 14 positive and 26 generalized place invariants in 13 ms returned sat
[2024-05-27 21:28:06] [INFO ] [Nat]Absence check using state equation in 329 ms returned sat
[2024-05-27 21:28:07] [INFO ] [Nat]Added 96 Read/Feed constraints in 288 ms returned sat
[2024-05-27 21:28:07] [INFO ] Deduced a trap composed of 19 places in 223 ms of which 2 ms to minimize.
[2024-05-27 21:28:07] [INFO ] Deduced a trap composed of 153 places in 251 ms of which 2 ms to minimize.
[2024-05-27 21:28:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 679 ms
[2024-05-27 21:28:07] [INFO ] Computed and/alt/rep : 448/1677/440 causal constraints (skipped 392 transitions) in 38 ms.
[2024-05-27 21:28:08] [INFO ] Added : 40 causal constraints over 8 iterations in 503 ms. Result :sat
Minimization took 2716 ms.
[2024-05-27 21:28:11] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-27 21:28:11] [INFO ] [Real]Absence check using 14 positive and 26 generalized place invariants in 12 ms returned sat
[2024-05-27 21:28:11] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2024-05-27 21:28:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:28:11] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-05-27 21:28:11] [INFO ] [Nat]Absence check using 14 positive and 26 generalized place invariants in 12 ms returned sat
[2024-05-27 21:28:12] [INFO ] [Nat]Absence check using state equation in 367 ms returned sat
[2024-05-27 21:28:16] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 21:28:16] [INFO ] [Nat]Added 96 Read/Feed constraints in 4522 ms returned sat
[2024-05-27 21:28:16] [INFO ] Deduced a trap composed of 74 places in 222 ms of which 3 ms to minimize.
[2024-05-27 21:28:17] [INFO ] Deduced a trap composed of 19 places in 240 ms of which 2 ms to minimize.
[2024-05-27 21:28:17] [INFO ] Deduced a trap composed of 175 places in 203 ms of which 3 ms to minimize.
[2024-05-27 21:28:17] [INFO ] Deduced a trap composed of 120 places in 203 ms of which 3 ms to minimize.
[2024-05-27 21:28:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1145 ms
[2024-05-27 21:28:17] [INFO ] Computed and/alt/rep : 448/1677/440 causal constraints (skipped 392 transitions) in 61 ms.
[2024-05-27 21:28:19] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 1 ms to minimize.
[2024-05-27 21:28:19] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
[2024-05-27 21:28:19] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-05-27 21:28:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 333 ms
[2024-05-27 21:28:19] [INFO ] Added : 198 causal constraints over 40 iterations in 2182 ms. Result :sat
Minimization took 2888 ms.
[2024-05-27 21:28:22] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-27 21:28:22] [INFO ] [Real]Absence check using 14 positive and 26 generalized place invariants in 13 ms returned sat
[2024-05-27 21:28:23] [INFO ] [Real]Absence check using state equation in 311 ms returned sat
[2024-05-27 21:28:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:28:23] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-27 21:28:23] [INFO ] [Nat]Absence check using 14 positive and 26 generalized place invariants in 12 ms returned sat
[2024-05-27 21:28:23] [INFO ] [Nat]Absence check using state equation in 337 ms returned sat
[2024-05-27 21:28:23] [INFO ] [Nat]Added 96 Read/Feed constraints in 278 ms returned sat
[2024-05-27 21:28:24] [INFO ] Computed and/alt/rep : 448/1677/440 causal constraints (skipped 392 transitions) in 63 ms.
[2024-05-27 21:28:24] [INFO ] Added : 46 causal constraints over 10 iterations in 827 ms. Result :sat
Minimization took 2653 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 2] Max Struct:[3, 3, 4, 20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 2] Max Struct:[3, 3, 4, 20]
Support contains 18 out of 388 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 388/388 places, 850/850 transitions.
Applied a total of 0 rules in 12 ms. Remains 388 /388 variables (removed 0) and now considering 850/850 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 388/388 places, 850/850 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 388/388 places, 850/850 transitions.
Applied a total of 0 rules in 12 ms. Remains 388 /388 variables (removed 0) and now considering 850/850 (removed 0) transitions.
[2024-05-27 21:28:29] [INFO ] Flow matrix only has 834 transitions (discarded 16 similar events)
[2024-05-27 21:28:29] [INFO ] Invariant cache hit.
[2024-05-27 21:28:29] [INFO ] Implicit Places using invariants in 425 ms returned []
[2024-05-27 21:28:29] [INFO ] Flow matrix only has 834 transitions (discarded 16 similar events)
[2024-05-27 21:28:29] [INFO ] Invariant cache hit.
[2024-05-27 21:28:30] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 21:28:37] [INFO ] Implicit Places using invariants and state equation in 7742 ms returned []
Implicit Place search using SMT with State Equation took 8168 ms to find 0 implicit places.
[2024-05-27 21:28:37] [INFO ] Redundant transitions in 9 ms returned []
Running 848 sub problems to find dead transitions.
[2024-05-27 21:28:37] [INFO ] Flow matrix only has 834 transitions (discarded 16 similar events)
[2024-05-27 21:28:37] [INFO ] Invariant cache hit.
[2024-05-27 21:28:37] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 848 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/386 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 848 unsolved
[2024-05-27 21:28:44] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
[2024-05-27 21:28:44] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 0 ms to minimize.
[2024-05-27 21:28:44] [INFO ] Deduced a trap composed of 39 places in 28 ms of which 0 ms to minimize.
[2024-05-27 21:28:44] [INFO ] Deduced a trap composed of 39 places in 28 ms of which 0 ms to minimize.
[2024-05-27 21:28:44] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2024-05-27 21:28:44] [INFO ] Deduced a trap composed of 39 places in 30 ms of which 1 ms to minimize.
[2024-05-27 21:28:44] [INFO ] Deduced a trap composed of 39 places in 29 ms of which 1 ms to minimize.
[2024-05-27 21:28:44] [INFO ] Deduced a trap composed of 128 places in 176 ms of which 3 ms to minimize.
[2024-05-27 21:28:47] [INFO ] Deduced a trap composed of 39 places in 31 ms of which 1 ms to minimize.
[2024-05-27 21:28:48] [INFO ] Deduced a trap composed of 135 places in 212 ms of which 3 ms to minimize.
[2024-05-27 21:28:49] [INFO ] Deduced a trap composed of 145 places in 220 ms of which 3 ms to minimize.
[2024-05-27 21:28:50] [INFO ] Deduced a trap composed of 134 places in 224 ms of which 3 ms to minimize.
[2024-05-27 21:28:50] [INFO ] Deduced a trap composed of 126 places in 214 ms of which 3 ms to minimize.
[2024-05-27 21:28:51] [INFO ] Deduced a trap composed of 135 places in 228 ms of which 3 ms to minimize.
[2024-05-27 21:28:51] [INFO ] Deduced a trap composed of 159 places in 244 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 848 unsolved
[2024-05-27 21:28:54] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 2 ms to minimize.
[2024-05-27 21:28:55] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 2 ms to minimize.
[2024-05-27 21:28:59] [INFO ] Deduced a trap composed of 153 places in 187 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/386 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 848 unsolved
[2024-05-27 21:29:07] [INFO ] Deduced a trap composed of 144 places in 200 ms of which 3 ms to minimize.
[2024-05-27 21:29:08] [INFO ] Deduced a trap composed of 152 places in 176 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/386 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 848 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 386/1222 variables, and 58 constraints, problems are : Problem set: 0 solved, 848 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/388 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 848/848 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 848 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 848 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/386 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 848 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 848 unsolved
[2024-05-27 21:29:18] [INFO ] Deduced a trap composed of 158 places in 178 ms of which 3 ms to minimize.
[2024-05-27 21:29:19] [INFO ] Deduced a trap composed of 152 places in 160 ms of which 2 ms to minimize.
[2024-05-27 21:29:19] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 1 ms to minimize.
[2024-05-27 21:29:19] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 1 ms to minimize.
[2024-05-27 21:29:19] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/386 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 848 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/386 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 848 unsolved
At refinement iteration 5 (OVERLAPS) 1/387 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 848 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 387/1222 variables, and 64 constraints, problems are : Problem set: 0 solved, 848 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/388 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/848 constraints, Known Traps: 25/25 constraints]
After SMT, in 61352ms problems are : Problem set: 0 solved, 848 unsolved
Search for dead transitions found 0 dead transitions in 61362ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69572 ms. Remains : 388/388 places, 850/850 transitions.
RANDOM walk for 40000 steps (14 resets) in 1257 ms. (31 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (11 resets) in 213 ms. (186 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (11 resets) in 189 ms. (210 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (11 resets) in 254 ms. (156 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (11 resets) in 287 ms. (138 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (9 resets) in 198 ms. (201 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (14 resets) in 196 ms. (203 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (10 resets) in 260 ms. (153 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (11 resets) in 204 ms. (195 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 124291 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :0 out of 8
Probabilistic random walk after 124291 steps, saw 70005 distinct states, run finished after 3006 ms. (steps per millisecond=41 ) properties seen :0
[2024-05-27 21:29:43] [INFO ] Flow matrix only has 834 transitions (discarded 16 similar events)
[2024-05-27 21:29:43] [INFO ] Invariant cache hit.
[2024-05-27 21:29:43] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem MAX3 is UNSAT
At refinement iteration 1 (OVERLAPS) 134/152 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 35/187 variables, 2/5 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 9/196 variables, 5/10 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 183/379 variables, 22/32 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-27 21:29:43] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 2 ms to minimize.
[2024-05-27 21:29:43] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 1 ms to minimize.
[2024-05-27 21:29:43] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 2 ms to minimize.
[2024-05-27 21:29:43] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
[2024-05-27 21:29:43] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-05-27 21:29:43] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/379 variables, 6/38 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/379 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 4/383 variables, 4/42 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/383 variables, 0/42 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 3/386 variables, 3/45 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/386 variables, 0/45 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 834/1220 variables, 386/431 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1220 variables, 96/527 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1220 variables, 0/527 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 2/1222 variables, 2/529 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1222 variables, 1/530 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1222 variables, 0/530 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 21 (OVERLAPS) 0/1222 variables, 0/530 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1222/1222 variables, and 530 constraints, problems are : Problem set: 1 solved, 7 unsolved in 3035 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 388/388 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 1 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 134/152 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 35/187 variables, 2/5 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 9/196 variables, 5/10 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 183/379 variables, 22/32 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/379 variables, 6/38 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-27 21:29:46] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 2 ms to minimize.
[2024-05-27 21:29:46] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/379 variables, 2/40 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-27 21:29:47] [INFO ] Deduced a trap composed of 133 places in 182 ms of which 3 ms to minimize.
[2024-05-27 21:29:47] [INFO ] Deduced a trap composed of 171 places in 178 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/379 variables, 2/42 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-27 21:29:47] [INFO ] Deduced a trap composed of 153 places in 199 ms of which 3 ms to minimize.
[2024-05-27 21:29:47] [INFO ] Deduced a trap composed of 189 places in 171 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 2/44 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-27 21:29:47] [INFO ] Deduced a trap composed of 171 places in 182 ms of which 3 ms to minimize.
[2024-05-27 21:29:48] [INFO ] Deduced a trap composed of 121 places in 177 ms of which 3 ms to minimize.
[2024-05-27 21:29:48] [INFO ] Deduced a trap composed of 159 places in 176 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/379 variables, 3/47 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-27 21:29:48] [INFO ] Deduced a trap composed of 130 places in 162 ms of which 2 ms to minimize.
[2024-05-27 21:29:48] [INFO ] Deduced a trap composed of 155 places in 178 ms of which 3 ms to minimize.
[2024-05-27 21:29:48] [INFO ] Deduced a trap composed of 159 places in 169 ms of which 2 ms to minimize.
[2024-05-27 21:29:49] [INFO ] Deduced a trap composed of 155 places in 167 ms of which 3 ms to minimize.
[2024-05-27 21:29:49] [INFO ] Deduced a trap composed of 155 places in 172 ms of which 2 ms to minimize.
[2024-05-27 21:29:49] [INFO ] Deduced a trap composed of 152 places in 170 ms of which 3 ms to minimize.
[2024-05-27 21:29:49] [INFO ] Deduced a trap composed of 153 places in 166 ms of which 2 ms to minimize.
[2024-05-27 21:29:49] [INFO ] Deduced a trap composed of 153 places in 164 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/379 variables, 8/55 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/379 variables, 0/55 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 4/383 variables, 4/59 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/383 variables, 0/59 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 3/386 variables, 3/62 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/386 variables, 0/62 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 834/1220 variables, 386/448 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1220 variables, 96/544 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1220/1222 variables, and 551 constraints, problems are : Problem set: 1 solved, 7 unsolved in 5018 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 386/388 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 7/8 constraints, Known Traps: 23/23 constraints]
After SMT, in 8081ms problems are : Problem set: 1 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 18 out of 388 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 388/388 places, 850/850 transitions.
Applied a total of 0 rules in 15 ms. Remains 388 /388 variables (removed 0) and now considering 850/850 (removed 0) transitions.
Running 848 sub problems to find dead transitions.
[2024-05-27 21:29:51] [INFO ] Flow matrix only has 834 transitions (discarded 16 similar events)
[2024-05-27 21:29:51] [INFO ] Invariant cache hit.
[2024-05-27 21:29:51] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 848 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/386 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 848 unsolved
[2024-05-27 21:29:58] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 2 ms to minimize.
[2024-05-27 21:29:58] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
[2024-05-27 21:29:58] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2024-05-27 21:29:58] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-05-27 21:29:58] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 0 ms to minimize.
[2024-05-27 21:29:58] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 1 ms to minimize.
[2024-05-27 21:29:58] [INFO ] Deduced a trap composed of 39 places in 31 ms of which 0 ms to minimize.
[2024-05-27 21:29:58] [INFO ] Deduced a trap composed of 128 places in 181 ms of which 2 ms to minimize.
[2024-05-27 21:30:01] [INFO ] Deduced a trap composed of 39 places in 30 ms of which 1 ms to minimize.
[2024-05-27 21:30:02] [INFO ] Deduced a trap composed of 135 places in 162 ms of which 3 ms to minimize.
[2024-05-27 21:30:04] [INFO ] Deduced a trap composed of 145 places in 187 ms of which 2 ms to minimize.
[2024-05-27 21:30:04] [INFO ] Deduced a trap composed of 134 places in 175 ms of which 2 ms to minimize.
[2024-05-27 21:30:04] [INFO ] Deduced a trap composed of 126 places in 176 ms of which 2 ms to minimize.
[2024-05-27 21:30:05] [INFO ] Deduced a trap composed of 135 places in 179 ms of which 2 ms to minimize.
[2024-05-27 21:30:05] [INFO ] Deduced a trap composed of 159 places in 179 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 848 unsolved
[2024-05-27 21:30:09] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 2 ms to minimize.
[2024-05-27 21:30:09] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 386/1222 variables, and 55 constraints, problems are : Problem set: 0 solved, 848 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/388 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 848/848 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 848 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 848 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/386 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 848 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 17/55 constraints. Problems are: Problem set: 0 solved, 848 unsolved
[2024-05-27 21:30:18] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 1 ms to minimize.
[2024-05-27 21:30:24] [INFO ] Deduced a trap composed of 66 places in 197 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/386 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 848 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 386/1222 variables, and 57 constraints, problems are : Problem set: 0 solved, 848 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/388 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/848 constraints, Known Traps: 19/19 constraints]
After SMT, in 41345ms problems are : Problem set: 0 solved, 848 unsolved
Search for dead transitions found 0 dead transitions in 41357ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41377 ms. Remains : 388/388 places, 850/850 transitions.
RANDOM walk for 40000 steps (20 resets) in 438 ms. (91 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (11 resets) in 218 ms. (182 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (12 resets) in 217 ms. (183 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (9 resets) in 198 ms. (201 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (10 resets) in 191 ms. (208 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (11 resets) in 193 ms. (206 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (11 resets) in 170 ms. (233 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (10 resets) in 143 ms. (277 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 155506 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :0 out of 7
Probabilistic random walk after 155506 steps, saw 86518 distinct states, run finished after 3002 ms. (steps per millisecond=51 ) properties seen :0
[2024-05-27 21:30:36] [INFO ] Flow matrix only has 834 transitions (discarded 16 similar events)
[2024-05-27 21:30:36] [INFO ] Invariant cache hit.
[2024-05-27 21:30:36] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 134/152 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 35/187 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 9/196 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 183/379 variables, 22/32 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-27 21:30:36] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 2 ms to minimize.
[2024-05-27 21:30:36] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 1 ms to minimize.
[2024-05-27 21:30:36] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 2 ms to minimize.
[2024-05-27 21:30:37] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 1 ms to minimize.
[2024-05-27 21:30:37] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
[2024-05-27 21:30:37] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/379 variables, 6/38 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/379 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 4/383 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/383 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 3/386 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/386 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 834/1220 variables, 386/431 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1220 variables, 96/527 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1220 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 2/1222 variables, 2/529 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1222 variables, 1/530 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1222 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (OVERLAPS) 0/1222 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1222/1222 variables, and 530 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2846 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 388/388 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 134/152 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 35/187 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 9/196 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 183/379 variables, 22/32 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/379 variables, 6/38 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-27 21:30:39] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/379 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/379 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 4/383 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/383 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 3/386 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/386 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 834/1220 variables, 386/432 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1220 variables, 96/528 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem MAX0 is UNSAT
Problem MIN0 is UNSAT
Problem MAX2 is UNSAT
Problem MIN2 is UNSAT
At refinement iteration 18 (INCLUDED_ONLY) 0/1220 variables, 7/535 constraints. Problems are: Problem set: 4 solved, 3 unsolved
[2024-05-27 21:30:41] [INFO ] Deduced a trap composed of 132 places in 219 ms of which 3 ms to minimize.
[2024-05-27 21:30:42] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1220 variables, 2/537 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1220 variables, 0/537 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 2/1222 variables, 2/539 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1222 variables, 1/540 constraints. Problems are: Problem set: 4 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1222/1222 variables, and 540 constraints, problems are : Problem set: 4 solved, 3 unsolved in 45020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 388/388 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 9/9 constraints]
After SMT, in 47883ms problems are : Problem set: 4 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 16 out of 388 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 388/388 places, 850/850 transitions.
Applied a total of 0 rules in 16 ms. Remains 388 /388 variables (removed 0) and now considering 850/850 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 388/388 places, 850/850 transitions.
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-10 0 TECHNIQUES REACHABILITY_MIN
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-02 0 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[0, 2] Max Struct:[3, 20]
Starting property specific reduction for PolyORBLF-COL-S02J04T08-UpperBounds-04
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:[3]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[3]
[2024-05-27 21:31:24] [INFO ] Flow matrix only has 834 transitions (discarded 16 similar events)
[2024-05-27 21:31:24] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[3]
RANDOM walk for 10000 steps (3 resets) in 34 ms. (285 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 18 ms. (526 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[3]
[2024-05-27 21:31:24] [INFO ] Flow matrix only has 834 transitions (discarded 16 similar events)
[2024-05-27 21:31:24] [INFO ] Invariant cache hit.
[2024-05-27 21:31:24] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2024-05-27 21:31:24] [INFO ] [Real]Absence check using 14 positive and 26 generalized place invariants in 17 ms returned sat
[2024-05-27 21:31:24] [INFO ] [Real]Absence check using state equation in 301 ms returned sat
[2024-05-27 21:31:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:31:24] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2024-05-27 21:31:24] [INFO ] [Nat]Absence check using 14 positive and 26 generalized place invariants in 19 ms returned sat
[2024-05-27 21:31:25] [INFO ] [Nat]Absence check using state equation in 419 ms returned sat
[2024-05-27 21:31:25] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 21:31:25] [INFO ] [Nat]Added 96 Read/Feed constraints in 368 ms returned sat
[2024-05-27 21:31:25] [INFO ] Deduced a trap composed of 19 places in 256 ms of which 3 ms to minimize.
[2024-05-27 21:31:26] [INFO ] Deduced a trap composed of 153 places in 243 ms of which 3 ms to minimize.
[2024-05-27 21:31:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 800 ms
[2024-05-27 21:31:26] [INFO ] Computed and/alt/rep : 448/1677/440 causal constraints (skipped 392 transitions) in 76 ms.
[2024-05-27 21:31:27] [INFO ] Added : 40 causal constraints over 8 iterations in 693 ms. Result :sat
Minimization took 612 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[3]
Support contains 8 out of 388 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 388/388 places, 850/850 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 380 transition count 842
Applied a total of 16 rules in 45 ms. Remains 380 /388 variables (removed 8) and now considering 842/850 (removed 8) transitions.
Running 840 sub problems to find dead transitions.
[2024-05-27 21:31:27] [INFO ] Flow matrix only has 826 transitions (discarded 16 similar events)
// Phase 1: matrix 826 rows 380 cols
[2024-05-27 21:31:27] [INFO ] Computed 40 invariants in 21 ms
[2024-05-27 21:31:27] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 840 unsolved
[2024-05-27 21:31:35] [INFO ] Deduced a trap composed of 132 places in 171 ms of which 6 ms to minimize.
[2024-05-27 21:31:35] [INFO ] Deduced a trap composed of 171 places in 234 ms of which 3 ms to minimize.
[2024-05-27 21:31:35] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2024-05-27 21:31:35] [INFO ] Deduced a trap composed of 55 places in 128 ms of which 2 ms to minimize.
[2024-05-27 21:31:35] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-05-27 21:31:35] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 0 ms to minimize.
[2024-05-27 21:31:35] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 0 ms to minimize.
[2024-05-27 21:31:36] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 0 ms to minimize.
[2024-05-27 21:31:36] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 0 ms to minimize.
[2024-05-27 21:31:36] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 1 ms to minimize.
[2024-05-27 21:31:37] [INFO ] Deduced a trap composed of 130 places in 215 ms of which 3 ms to minimize.
[2024-05-27 21:31:38] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2024-05-27 21:31:40] [INFO ] Deduced a trap composed of 161 places in 166 ms of which 2 ms to minimize.
[2024-05-27 21:31:40] [INFO ] Deduced a trap composed of 19 places in 190 ms of which 3 ms to minimize.
[2024-05-27 21:31:40] [INFO ] Deduced a trap composed of 141 places in 234 ms of which 3 ms to minimize.
[2024-05-27 21:31:40] [INFO ] Deduced a trap composed of 179 places in 212 ms of which 3 ms to minimize.
[2024-05-27 21:31:41] [INFO ] Deduced a trap composed of 140 places in 206 ms of which 3 ms to minimize.
[2024-05-27 21:31:42] [INFO ] Deduced a trap composed of 139 places in 236 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 840 unsolved
[2024-05-27 21:31:45] [INFO ] Deduced a trap composed of 218 places in 221 ms of which 4 ms to minimize.
[2024-05-27 21:31:47] [INFO ] Deduced a trap composed of 142 places in 212 ms of which 3 ms to minimize.
[2024-05-27 21:31:47] [INFO ] Deduced a trap composed of 134 places in 240 ms of which 3 ms to minimize.
[2024-05-27 21:31:48] [INFO ] Deduced a trap composed of 126 places in 239 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 378/1206 variables, and 60 constraints, problems are : Problem set: 0 solved, 840 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/380 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 840/840 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 840 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 22/60 constraints. Problems are: Problem set: 0 solved, 840 unsolved
[2024-05-27 21:31:53] [INFO ] Deduced a trap composed of 137 places in 223 ms of which 3 ms to minimize.
[2024-05-27 21:31:59] [INFO ] Deduced a trap composed of 139 places in 207 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 840 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/1206 variables, and 62 constraints, problems are : Problem set: 0 solved, 840 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/380 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/840 constraints, Known Traps: 24/24 constraints]
After SMT, in 41527ms problems are : Problem set: 0 solved, 840 unsolved
Search for dead transitions found 0 dead transitions in 41545ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41595 ms. Remains : 380/388 places, 842/850 transitions.
[2024-05-27 21:32:09] [INFO ] Flow matrix only has 826 transitions (discarded 16 similar events)
[2024-05-27 21:32:09] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[3]
RANDOM walk for 1000000 steps (437 resets) in 3147 ms. (317 steps per ms)
BEST_FIRST walk for 1000001 steps (145 resets) in 1559 ms. (641 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[3]
[2024-05-27 21:32:14] [INFO ] Flow matrix only has 826 transitions (discarded 16 similar events)
[2024-05-27 21:32:14] [INFO ] Invariant cache hit.
[2024-05-27 21:32:14] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-27 21:32:14] [INFO ] [Real]Absence check using 13 positive and 27 generalized place invariants in 12 ms returned sat
[2024-05-27 21:32:14] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2024-05-27 21:32:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:32:14] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-27 21:32:14] [INFO ] [Nat]Absence check using 13 positive and 27 generalized place invariants in 15 ms returned sat
[2024-05-27 21:32:16] [INFO ] [Nat]Absence check using state equation in 1537 ms returned sat
[2024-05-27 21:32:16] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 21:32:16] [INFO ] [Nat]Added 96 Read/Feed constraints in 318 ms returned sat
[2024-05-27 21:32:16] [INFO ] Deduced a trap composed of 36 places in 278 ms of which 4 ms to minimize.
[2024-05-27 21:32:17] [INFO ] Deduced a trap composed of 135 places in 257 ms of which 3 ms to minimize.
[2024-05-27 21:32:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 668 ms
[2024-05-27 21:32:17] [INFO ] Computed and/alt/rep : 384/1541/376 causal constraints (skipped 448 transitions) in 46 ms.
[2024-05-27 21:32:17] [INFO ] Added : 54 causal constraints over 11 iterations in 817 ms. Result :sat
Minimization took 2785 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[3]
Support contains 8 out of 380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 842/842 transitions.
Applied a total of 0 rules in 15 ms. Remains 380 /380 variables (removed 0) and now considering 842/842 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 380/380 places, 842/842 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 842/842 transitions.
Applied a total of 0 rules in 15 ms. Remains 380 /380 variables (removed 0) and now considering 842/842 (removed 0) transitions.
[2024-05-27 21:32:21] [INFO ] Flow matrix only has 826 transitions (discarded 16 similar events)
[2024-05-27 21:32:21] [INFO ] Invariant cache hit.
[2024-05-27 21:32:22] [INFO ] Implicit Places using invariants in 399 ms returned []
[2024-05-27 21:32:22] [INFO ] Flow matrix only has 826 transitions (discarded 16 similar events)
[2024-05-27 21:32:22] [INFO ] Invariant cache hit.
[2024-05-27 21:32:22] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 21:32:28] [INFO ] Implicit Places using invariants and state equation in 5926 ms returned []
Implicit Place search using SMT with State Equation took 6329 ms to find 0 implicit places.
[2024-05-27 21:32:28] [INFO ] Redundant transitions in 13 ms returned []
Running 840 sub problems to find dead transitions.
[2024-05-27 21:32:28] [INFO ] Flow matrix only has 826 transitions (discarded 16 similar events)
[2024-05-27 21:32:28] [INFO ] Invariant cache hit.
[2024-05-27 21:32:28] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 840 unsolved
[2024-05-27 21:32:34] [INFO ] Deduced a trap composed of 38 places in 102 ms of which 2 ms to minimize.
[2024-05-27 21:32:34] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 2 ms to minimize.
[2024-05-27 21:32:34] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 1 ms to minimize.
[2024-05-27 21:32:34] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 2 ms to minimize.
[2024-05-27 21:32:34] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 2 ms to minimize.
[2024-05-27 21:32:34] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2024-05-27 21:32:34] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2024-05-27 21:32:35] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 0 ms to minimize.
[2024-05-27 21:32:35] [INFO ] Deduced a trap composed of 147 places in 217 ms of which 3 ms to minimize.
[2024-05-27 21:32:35] [INFO ] Deduced a trap composed of 135 places in 218 ms of which 3 ms to minimize.
[2024-05-27 21:32:39] [INFO ] Deduced a trap composed of 134 places in 233 ms of which 6 ms to minimize.
[2024-05-27 21:32:40] [INFO ] Deduced a trap composed of 139 places in 173 ms of which 2 ms to minimize.
[2024-05-27 21:32:41] [INFO ] Deduced a trap composed of 152 places in 197 ms of which 3 ms to minimize.
[2024-05-27 21:32:41] [INFO ] Deduced a trap composed of 65 places in 164 ms of which 2 ms to minimize.
[2024-05-27 21:32:41] [INFO ] Deduced a trap composed of 19 places in 218 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 840 unsolved
[2024-05-27 21:32:45] [INFO ] Deduced a trap composed of 218 places in 203 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 840 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 378/1206 variables, and 54 constraints, problems are : Problem set: 0 solved, 840 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/380 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 840/840 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 840 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 840 unsolved
[2024-05-27 21:33:18] [INFO ] Deduced a trap composed of 171 places in 234 ms of which 4 ms to minimize.
[2024-05-27 21:33:18] [INFO ] Deduced a trap composed of 197 places in 178 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 840 unsolved
[2024-05-27 21:33:24] [INFO ] Deduced a trap composed of 32 places in 218 ms of which 3 ms to minimize.
[2024-05-27 21:33:24] [INFO ] Deduced a trap composed of 32 places in 192 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/1206 variables, and 58 constraints, problems are : Problem set: 0 solved, 840 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/380 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/840 constraints, Known Traps: 20/20 constraints]
After SMT, in 61479ms problems are : Problem set: 0 solved, 840 unsolved
Search for dead transitions found 0 dead transitions in 61495ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67869 ms. Remains : 380/380 places, 842/842 transitions.
RANDOM walk for 40000 steps (21 resets) in 417 ms. (95 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (9 resets) in 164 ms. (242 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (11 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 255579 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :0 out of 2
Probabilistic random walk after 255579 steps, saw 139334 distinct states, run finished after 3003 ms. (steps per millisecond=85 ) properties seen :0
[2024-05-27 21:33:32] [INFO ] Flow matrix only has 826 transitions (discarded 16 similar events)
[2024-05-27 21:33:32] [INFO ] Invariant cache hit.
[2024-05-27 21:33:32] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 135/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 23/166 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/176 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 195/371 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-27 21:33:33] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 2 ms to minimize.
[2024-05-27 21:33:33] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 2 ms to minimize.
[2024-05-27 21:33:33] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 1 ms to minimize.
[2024-05-27 21:33:33] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
[2024-05-27 21:33:33] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 5/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/375 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/375 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/378 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 826/1204 variables, 378/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1204 variables, 96/518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1204 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/1206 variables, 2/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1206 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1206 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1206 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1206/1206 variables, and 521 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1246 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 380/380 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 135/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 23/166 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/176 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 195/371 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 5/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/375 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/375 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/378 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 826/1204 variables, 378/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1204 variables, 96/518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1204 variables, 2/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1204 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/1206 variables, 2/522 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1206 variables, 1/523 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-27 21:33:35] [INFO ] Deduced a trap composed of 19 places in 201 ms of which 2 ms to minimize.
[2024-05-27 21:33:35] [INFO ] Deduced a trap composed of 133 places in 202 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1206 variables, 2/525 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1206 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/1206 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1206/1206 variables, and 525 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1800 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 380/380 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 3057ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 377 ms.
Support contains 8 out of 380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 842/842 transitions.
Applied a total of 0 rules in 14 ms. Remains 380 /380 variables (removed 0) and now considering 842/842 (removed 0) transitions.
Running 840 sub problems to find dead transitions.
[2024-05-27 21:33:36] [INFO ] Flow matrix only has 826 transitions (discarded 16 similar events)
[2024-05-27 21:33:36] [INFO ] Invariant cache hit.
[2024-05-27 21:33:36] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 840 unsolved
[2024-05-27 21:33:42] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 2 ms to minimize.
[2024-05-27 21:33:42] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
[2024-05-27 21:33:42] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-27 21:33:42] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 2 ms to minimize.
[2024-05-27 21:33:43] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2024-05-27 21:33:43] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2024-05-27 21:33:43] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2024-05-27 21:33:43] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 0 ms to minimize.
[2024-05-27 21:33:43] [INFO ] Deduced a trap composed of 147 places in 228 ms of which 3 ms to minimize.
[2024-05-27 21:33:43] [INFO ] Deduced a trap composed of 135 places in 180 ms of which 3 ms to minimize.
[2024-05-27 21:33:48] [INFO ] Deduced a trap composed of 134 places in 219 ms of which 3 ms to minimize.
[2024-05-27 21:33:48] [INFO ] Deduced a trap composed of 139 places in 216 ms of which 3 ms to minimize.
[2024-05-27 21:33:49] [INFO ] Deduced a trap composed of 152 places in 175 ms of which 2 ms to minimize.
[2024-05-27 21:33:49] [INFO ] Deduced a trap composed of 65 places in 172 ms of which 2 ms to minimize.
[2024-05-27 21:33:50] [INFO ] Deduced a trap composed of 19 places in 194 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 840 unsolved
[2024-05-27 21:33:54] [INFO ] Deduced a trap composed of 218 places in 174 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")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 378/1206 variables, and 54 constraints, problems are : Problem set: 0 solved, 840 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/380 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 840/840 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 840 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 840 unsolved
[2024-05-27 21:34:15] [INFO ] Deduced a trap composed of 171 places in 238 ms of which 3 ms to minimize.
[2024-05-27 21:34:15] [INFO ] Deduced a trap composed of 197 places in 206 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/1206 variables, and 56 constraints, problems are : Problem set: 0 solved, 840 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/380 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/840 constraints, Known Traps: 18/18 constraints]
After SMT, in 41183ms problems are : Problem set: 0 solved, 840 unsolved
Search for dead transitions found 0 dead transitions in 41194ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41210 ms. Remains : 380/380 places, 842/842 transitions.
RANDOM walk for 40000 steps (27 resets) in 337 ms. (118 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (9 resets) in 140 ms. (283 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (9 resets) in 186 ms. (213 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 242416 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :0 out of 2
Probabilistic random walk after 242416 steps, saw 132660 distinct states, run finished after 3002 ms. (steps per millisecond=80 ) properties seen :0
[2024-05-27 21:34:20] [INFO ] Flow matrix only has 826 transitions (discarded 16 similar events)
[2024-05-27 21:34:20] [INFO ] Invariant cache hit.
[2024-05-27 21:34:20] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 135/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 23/166 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/176 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 195/371 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-27 21:34:21] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 2 ms to minimize.
[2024-05-27 21:34:21] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 2 ms to minimize.
[2024-05-27 21:34:21] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 2 ms to minimize.
[2024-05-27 21:34:21] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2024-05-27 21:34:21] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 5/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/375 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/375 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/378 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 826/1204 variables, 378/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1204 variables, 96/518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1204 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/1206 variables, 2/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1206 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1206 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1206 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1206/1206 variables, and 521 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1182 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 380/380 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 135/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 23/166 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/176 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 195/371 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 5/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/375 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/375 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/378 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 826/1204 variables, 378/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1204 variables, 96/518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1204 variables, 2/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1204 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/1206 variables, 2/522 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1206 variables, 1/523 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-27 21:34:23] [INFO ] Deduced a trap composed of 19 places in 161 ms of which 2 ms to minimize.
[2024-05-27 21:34:23] [INFO ] Deduced a trap composed of 133 places in 255 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1206 variables, 2/525 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1206 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/1206 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1206/1206 variables, and 525 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1955 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 380/380 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 3151ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 450 ms.
Support contains 8 out of 380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 842/842 transitions.
Applied a total of 0 rules in 27 ms. Remains 380 /380 variables (removed 0) and now considering 842/842 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 380/380 places, 842/842 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 842/842 transitions.
Applied a total of 0 rules in 24 ms. Remains 380 /380 variables (removed 0) and now considering 842/842 (removed 0) transitions.
[2024-05-27 21:34:24] [INFO ] Flow matrix only has 826 transitions (discarded 16 similar events)
[2024-05-27 21:34:24] [INFO ] Invariant cache hit.
[2024-05-27 21:34:24] [INFO ] Implicit Places using invariants in 501 ms returned []
[2024-05-27 21:34:24] [INFO ] Flow matrix only has 826 transitions (discarded 16 similar events)
[2024-05-27 21:34:24] [INFO ] Invariant cache hit.
[2024-05-27 21:34:25] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 21:34:30] [INFO ] Implicit Places using invariants and state equation in 5923 ms returned []
Implicit Place search using SMT with State Equation took 6427 ms to find 0 implicit places.
[2024-05-27 21:34:30] [INFO ] Redundant transitions in 12 ms returned []
Running 840 sub problems to find dead transitions.
[2024-05-27 21:34:30] [INFO ] Flow matrix only has 826 transitions (discarded 16 similar events)
[2024-05-27 21:34:30] [INFO ] Invariant cache hit.
[2024-05-27 21:34:30] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 840 unsolved
[2024-05-27 21:34:37] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 3 ms to minimize.
[2024-05-27 21:34:37] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 2 ms to minimize.
[2024-05-27 21:34:37] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-27 21:34:37] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 1 ms to minimize.
[2024-05-27 21:34:37] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 2 ms to minimize.
[2024-05-27 21:34:37] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-05-27 21:34:38] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 0 ms to minimize.
[2024-05-27 21:34:38] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2024-05-27 21:34:38] [INFO ] Deduced a trap composed of 147 places in 146 ms of which 3 ms to minimize.
[2024-05-27 21:34:38] [INFO ] Deduced a trap composed of 135 places in 231 ms of which 3 ms to minimize.
[2024-05-27 21:34:43] [INFO ] Deduced a trap composed of 134 places in 217 ms of which 3 ms to minimize.
[2024-05-27 21:34:43] [INFO ] Deduced a trap composed of 139 places in 208 ms of which 3 ms to minimize.
[2024-05-27 21:34:44] [INFO ] Deduced a trap composed of 152 places in 201 ms of which 3 ms to minimize.
[2024-05-27 21:34:44] [INFO ] Deduced a trap composed of 65 places in 228 ms of which 3 ms to minimize.
[2024-05-27 21:34:45] [INFO ] Deduced a trap composed of 19 places in 230 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 840 unsolved
[2024-05-27 21:34:49] [INFO ] Deduced a trap composed of 218 places in 206 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 840 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 378/1206 variables, and 54 constraints, problems are : Problem set: 0 solved, 840 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/380 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 840/840 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 840 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 840 unsolved
[2024-05-27 21:35:21] [INFO ] Deduced a trap composed of 171 places in 258 ms of which 3 ms to minimize.
[2024-05-27 21:35:21] [INFO ] Deduced a trap composed of 197 places in 216 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 840 unsolved
[2024-05-27 21:35:27] [INFO ] Deduced a trap composed of 32 places in 232 ms of which 3 ms to minimize.
[2024-05-27 21:35:28] [INFO ] Deduced a trap composed of 32 places in 220 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/1206 variables, and 58 constraints, problems are : Problem set: 0 solved, 840 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/380 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/840 constraints, Known Traps: 20/20 constraints]
After SMT, in 61625ms problems are : Problem set: 0 solved, 840 unsolved
Search for dead transitions found 0 dead transitions in 61640ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68116 ms. Remains : 380/380 places, 842/842 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[3]
Ending property specific reduction for PolyORBLF-COL-S02J04T08-UpperBounds-04 in 248256 ms.
Starting property specific reduction for PolyORBLF-COL-S02J04T08-UpperBounds-12
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:[20]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[20]
[2024-05-27 21:35:32] [INFO ] Flow matrix only has 834 transitions (discarded 16 similar events)
// Phase 1: matrix 834 rows 388 cols
[2024-05-27 21:35:32] [INFO ] Computed 40 invariants in 21 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[20]
RANDOM walk for 10000 steps (3 resets) in 64 ms. (153 steps per ms)
BEST_FIRST walk for 10000 steps (3 resets) in 26 ms. (370 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[20]
[2024-05-27 21:35:32] [INFO ] Flow matrix only has 834 transitions (discarded 16 similar events)
[2024-05-27 21:35:32] [INFO ] Invariant cache hit.
[2024-05-27 21:35:32] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2024-05-27 21:35:32] [INFO ] [Real]Absence check using 14 positive and 26 generalized place invariants in 16 ms returned sat
[2024-05-27 21:35:33] [INFO ] [Real]Absence check using state equation in 381 ms returned sat
[2024-05-27 21:35:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:35:33] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2024-05-27 21:35:33] [INFO ] [Nat]Absence check using 14 positive and 26 generalized place invariants in 15 ms returned sat
[2024-05-27 21:35:33] [INFO ] [Nat]Absence check using state equation in 328 ms returned sat
[2024-05-27 21:35:33] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 21:35:33] [INFO ] [Nat]Added 96 Read/Feed constraints in 280 ms returned sat
[2024-05-27 21:35:34] [INFO ] Computed and/alt/rep : 448/1677/440 causal constraints (skipped 392 transitions) in 67 ms.
[2024-05-27 21:35:35] [INFO ] Added : 46 causal constraints over 10 iterations in 1040 ms. Result :sat
Minimization took 660 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[20]
Support contains 8 out of 388 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 388/388 places, 850/850 transitions.
Applied a total of 0 rules in 24 ms. Remains 388 /388 variables (removed 0) and now considering 850/850 (removed 0) transitions.
Running 848 sub problems to find dead transitions.
[2024-05-27 21:35:35] [INFO ] Flow matrix only has 834 transitions (discarded 16 similar events)
[2024-05-27 21:35:35] [INFO ] Invariant cache hit.
[2024-05-27 21:35:35] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 848 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/386 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 848 unsolved
[2024-05-27 21:35:42] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 2 ms to minimize.
[2024-05-27 21:35:42] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-05-27 21:35:42] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 0 ms to minimize.
[2024-05-27 21:35:42] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 2 ms to minimize.
[2024-05-27 21:35:42] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 4 ms to minimize.
[2024-05-27 21:35:42] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 0 ms to minimize.
[2024-05-27 21:35:42] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
[2024-05-27 21:35:43] [INFO ] Deduced a trap composed of 128 places in 247 ms of which 3 ms to minimize.
[2024-05-27 21:35:45] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
[2024-05-27 21:35:46] [INFO ] Deduced a trap composed of 135 places in 233 ms of which 3 ms to minimize.
[2024-05-27 21:35:48] [INFO ] Deduced a trap composed of 145 places in 171 ms of which 3 ms to minimize.
[2024-05-27 21:35:48] [INFO ] Deduced a trap composed of 134 places in 160 ms of which 2 ms to minimize.
[2024-05-27 21:35:49] [INFO ] Deduced a trap composed of 126 places in 178 ms of which 2 ms to minimize.
[2024-05-27 21:35:49] [INFO ] Deduced a trap composed of 135 places in 210 ms of which 2 ms to minimize.
[2024-05-27 21:35:50] [INFO ] Deduced a trap composed of 159 places in 238 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 848 unsolved
[2024-05-27 21:35:53] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 2 ms to minimize.
[2024-05-27 21:35:53] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 386/1222 variables, and 55 constraints, problems are : Problem set: 0 solved, 848 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/388 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 848/848 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 848 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 848 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/386 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 848 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 17/55 constraints. Problems are: Problem set: 0 solved, 848 unsolved
[2024-05-27 21:36:02] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 2 ms to minimize.
[2024-05-27 21:36:09] [INFO ] Deduced a trap composed of 66 places in 232 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/386 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 848 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 386/1222 variables, and 57 constraints, problems are : Problem set: 0 solved, 848 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/388 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/848 constraints, Known Traps: 19/19 constraints]
After SMT, in 41402ms problems are : Problem set: 0 solved, 848 unsolved
Search for dead transitions found 0 dead transitions in 41417ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41446 ms. Remains : 388/388 places, 850/850 transitions.
[2024-05-27 21:36:17] [INFO ] Flow matrix only has 834 transitions (discarded 16 similar events)
[2024-05-27 21:36:17] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[20]
RANDOM walk for 1000000 steps (412 resets) in 3147 ms. (317 steps per ms)
BEST_FIRST walk for 1000001 steps (197 resets) in 1511 ms. (661 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[20]
[2024-05-27 21:36:21] [INFO ] Flow matrix only has 834 transitions (discarded 16 similar events)
[2024-05-27 21:36:21] [INFO ] Invariant cache hit.
[2024-05-27 21:36:21] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2024-05-27 21:36:21] [INFO ] [Real]Absence check using 14 positive and 26 generalized place invariants in 17 ms returned sat
[2024-05-27 21:36:22] [INFO ] [Real]Absence check using state equation in 320 ms returned sat
[2024-05-27 21:36:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:36:22] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-27 21:36:22] [INFO ] [Nat]Absence check using 14 positive and 26 generalized place invariants in 14 ms returned sat
[2024-05-27 21:36:22] [INFO ] [Nat]Absence check using state equation in 286 ms returned sat
[2024-05-27 21:36:22] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 21:36:22] [INFO ] [Nat]Added 96 Read/Feed constraints in 219 ms returned sat
[2024-05-27 21:36:22] [INFO ] Computed and/alt/rep : 448/1677/440 causal constraints (skipped 392 transitions) in 71 ms.
[2024-05-27 21:36:23] [INFO ] Added : 46 causal constraints over 10 iterations in 977 ms. Result :sat
Minimization took 3234 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[20]
Support contains 8 out of 388 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 388/388 places, 850/850 transitions.
Applied a total of 0 rules in 14 ms. Remains 388 /388 variables (removed 0) and now considering 850/850 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 388/388 places, 850/850 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 388/388 places, 850/850 transitions.
Applied a total of 0 rules in 15 ms. Remains 388 /388 variables (removed 0) and now considering 850/850 (removed 0) transitions.
[2024-05-27 21:36:27] [INFO ] Flow matrix only has 834 transitions (discarded 16 similar events)
[2024-05-27 21:36:27] [INFO ] Invariant cache hit.
[2024-05-27 21:36:28] [INFO ] Implicit Places using invariants in 454 ms returned []
[2024-05-27 21:36:28] [INFO ] Flow matrix only has 834 transitions (discarded 16 similar events)
[2024-05-27 21:36:28] [INFO ] Invariant cache hit.
[2024-05-27 21:36:28] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 21:36:35] [INFO ] Implicit Places using invariants and state equation in 7038 ms returned []
Implicit Place search using SMT with State Equation took 7496 ms to find 0 implicit places.
[2024-05-27 21:36:35] [INFO ] Redundant transitions in 12 ms returned []
Running 848 sub problems to find dead transitions.
[2024-05-27 21:36:35] [INFO ] Flow matrix only has 834 transitions (discarded 16 similar events)
[2024-05-27 21:36:35] [INFO ] Invariant cache hit.
[2024-05-27 21:36:35] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 848 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/386 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 848 unsolved
[2024-05-27 21:36:41] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 1 ms to minimize.
[2024-05-27 21:36:41] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2024-05-27 21:36:41] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 0 ms to minimize.
[2024-05-27 21:36:41] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-27 21:36:41] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 0 ms to minimize.
[2024-05-27 21:36:41] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-05-27 21:36:42] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2024-05-27 21:36:42] [INFO ] Deduced a trap composed of 128 places in 238 ms of which 3 ms to minimize.
[2024-05-27 21:36:44] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-05-27 21:36:45] [INFO ] Deduced a trap composed of 135 places in 230 ms of which 3 ms to minimize.
[2024-05-27 21:36:47] [INFO ] Deduced a trap composed of 145 places in 213 ms of which 3 ms to minimize.
[2024-05-27 21:36:47] [INFO ] Deduced a trap composed of 134 places in 195 ms of which 3 ms to minimize.
[2024-05-27 21:36:48] [INFO ] Deduced a trap composed of 126 places in 202 ms of which 3 ms to minimize.
[2024-05-27 21:36:48] [INFO ] Deduced a trap composed of 135 places in 228 ms of which 3 ms to minimize.
[2024-05-27 21:36:49] [INFO ] Deduced a trap composed of 159 places in 237 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 848 unsolved
[2024-05-27 21:36:52] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 2 ms to minimize.
[2024-05-27 21:36:52] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 2 ms to minimize.
[2024-05-27 21:36:57] [INFO ] Deduced a trap composed of 153 places in 211 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/386 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 848 unsolved
[2024-05-27 21:37:05] [INFO ] Deduced a trap composed of 144 places in 212 ms of which 2 ms to minimize.
[2024-05-27 21:37:05] [INFO ] Deduced a trap composed of 152 places in 199 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 386/1222 variables, and 58 constraints, problems are : Problem set: 0 solved, 848 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/388 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 848/848 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 848 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 848 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/386 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 848 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 848 unsolved
[2024-05-27 21:37:16] [INFO ] Deduced a trap composed of 158 places in 212 ms of which 3 ms to minimize.
[2024-05-27 21:37:16] [INFO ] Deduced a trap composed of 152 places in 225 ms of which 3 ms to minimize.
[2024-05-27 21:37:17] [INFO ] Deduced a trap composed of 36 places in 132 ms of which 2 ms to minimize.
[2024-05-27 21:37:17] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 2 ms to minimize.
[2024-05-27 21:37:17] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/386 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 848 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/386 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 848 unsolved
At refinement iteration 5 (OVERLAPS) 1/387 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 848 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 387/1222 variables, and 64 constraints, problems are : Problem set: 0 solved, 848 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/388 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/848 constraints, Known Traps: 25/25 constraints]
After SMT, in 61443ms problems are : Problem set: 0 solved, 848 unsolved
Search for dead transitions found 0 dead transitions in 61459ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68997 ms. Remains : 388/388 places, 850/850 transitions.
RANDOM walk for 40000 steps (22 resets) in 310 ms. (128 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 142 ms. (279 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (11 resets) in 106 ms. (373 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 213936 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 2
Probabilistic random walk after 213936 steps, saw 117442 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
[2024-05-27 21:37:39] [INFO ] Flow matrix only has 834 transitions (discarded 16 similar events)
[2024-05-27 21:37:39] [INFO ] Invariant cache hit.
[2024-05-27 21:37:39] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 1 (OVERLAPS) 143/151 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/186 variables, 2/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/195 variables, 5/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 184/379 variables, 23/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 4/383 variables, 4/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/386 variables, 3/39 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/386 variables, 0/39 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 834/1220 variables, 386/425 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1220 variables, 96/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1220 variables, 0/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1222 variables, 2/523 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1222 variables, 1/524 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1222 variables, 0/524 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1222 variables, 0/524 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1222/1222 variables, and 524 constraints, problems are : Problem set: 1 solved, 1 unsolved in 525 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 388/388 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 143/151 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/186 variables, 2/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/195 variables, 5/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 184/379 variables, 23/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-27 21:37:40] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 2 ms to minimize.
[2024-05-27 21:37:40] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 1 ms to minimize.
[2024-05-27 21:37:40] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 2 ms to minimize.
[2024-05-27 21:37:40] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 4/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/379 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/383 variables, 4/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 0/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/386 variables, 3/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/386 variables, 0/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 834/1220 variables, 386/429 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1220/1222 variables, and 525 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1673 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 386/388 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 2211ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 8 out of 388 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 388/388 places, 850/850 transitions.
Applied a total of 0 rules in 21 ms. Remains 388 /388 variables (removed 0) and now considering 850/850 (removed 0) transitions.
Running 848 sub problems to find dead transitions.
[2024-05-27 21:37:42] [INFO ] Flow matrix only has 834 transitions (discarded 16 similar events)
[2024-05-27 21:37:42] [INFO ] Invariant cache hit.
[2024-05-27 21:37:42] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 848 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/386 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 848 unsolved
[2024-05-27 21:37:48] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 2 ms to minimize.
[2024-05-27 21:37:48] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2024-05-27 21:37:48] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
[2024-05-27 21:37:48] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 0 ms to minimize.
[2024-05-27 21:37:48] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 1 ms to minimize.
[2024-05-27 21:37:48] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
[2024-05-27 21:37:49] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 0 ms to minimize.
[2024-05-27 21:37:49] [INFO ] Deduced a trap composed of 128 places in 163 ms of which 2 ms to minimize.
[2024-05-27 21:37:52] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-05-27 21:37:53] [INFO ] Deduced a trap composed of 135 places in 278 ms of which 4 ms to minimize.
[2024-05-27 21:37:55] [INFO ] Deduced a trap composed of 145 places in 236 ms of which 4 ms to minimize.
[2024-05-27 21:37:55] [INFO ] Deduced a trap composed of 134 places in 203 ms of which 2 ms to minimize.
[2024-05-27 21:37:56] [INFO ] Deduced a trap composed of 126 places in 233 ms of which 3 ms to minimize.
[2024-05-27 21:37:56] [INFO ] Deduced a trap composed of 135 places in 235 ms of which 3 ms to minimize.
[2024-05-27 21:37:57] [INFO ] Deduced a trap composed of 159 places in 281 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 848 unsolved
[2024-05-27 21:38:00] [INFO ] Deduced a trap composed of 37 places in 143 ms of which 2 ms to minimize.
[2024-05-27 21:38:00] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 386/1222 variables, and 55 constraints, problems are : Problem set: 0 solved, 848 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/388 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 848/848 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 848 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 848 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/386 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 848 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 17/55 constraints. Problems are: Problem set: 0 solved, 848 unsolved
[2024-05-27 21:38:08] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 2 ms to minimize.
[2024-05-27 21:38:16] [INFO ] Deduced a trap composed of 66 places in 219 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/386 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 848 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 386/1222 variables, and 57 constraints, problems are : Problem set: 0 solved, 848 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/388 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/848 constraints, Known Traps: 19/19 constraints]
After SMT, in 41376ms problems are : Problem set: 0 solved, 848 unsolved
Search for dead transitions found 0 dead transitions in 41391ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41415 ms. Remains : 388/388 places, 850/850 transitions.
RANDOM walk for 40000 steps (15 resets) in 254 ms. (156 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (9 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 355135 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :0 out of 1
Probabilistic random walk after 355135 steps, saw 189137 distinct states, run finished after 3001 ms. (steps per millisecond=118 ) properties seen :0
[2024-05-27 21:38:26] [INFO ] Flow matrix only has 834 transitions (discarded 16 similar events)
[2024-05-27 21:38:26] [INFO ] Invariant cache hit.
[2024-05-27 21:38:26] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 143/151 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 35/186 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/195 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 184/379 variables, 23/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/383 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/386 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/386 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 834/1220 variables, 386/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1220 variables, 96/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1220 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1222 variables, 2/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1222 variables, 1/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1222 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1222 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1222/1222 variables, and 524 constraints, problems are : Problem set: 0 solved, 1 unsolved in 598 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 388/388 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 143/151 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/186 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/195 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 184/379 variables, 23/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 21:38:27] [INFO ] Deduced a trap composed of 40 places in 126 ms of which 2 ms to minimize.
[2024-05-27 21:38:27] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 2 ms to minimize.
[2024-05-27 21:38:27] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 1 ms to minimize.
[2024-05-27 21:38:27] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/379 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/383 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/386 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/386 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 834/1220 variables, 386/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1220 variables, 96/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1220 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1220 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/1222 variables, 2/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1222 variables, 1/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1222 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1222 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1222/1222 variables, and 529 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2125 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 388/388 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 2745ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 8 out of 388 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 388/388 places, 850/850 transitions.
Applied a total of 0 rules in 18 ms. Remains 388 /388 variables (removed 0) and now considering 850/850 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 388/388 places, 850/850 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 388/388 places, 850/850 transitions.
Applied a total of 0 rules in 17 ms. Remains 388 /388 variables (removed 0) and now considering 850/850 (removed 0) transitions.
[2024-05-27 21:38:29] [INFO ] Flow matrix only has 834 transitions (discarded 16 similar events)
[2024-05-27 21:38:29] [INFO ] Invariant cache hit.
[2024-05-27 21:38:29] [INFO ] Implicit Places using invariants in 419 ms returned []
[2024-05-27 21:38:29] [INFO ] Flow matrix only has 834 transitions (discarded 16 similar events)
[2024-05-27 21:38:29] [INFO ] Invariant cache hit.
[2024-05-27 21:38:30] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 21:38:36] [INFO ] Implicit Places using invariants and state equation in 6410 ms returned []
Implicit Place search using SMT with State Equation took 6831 ms to find 0 implicit places.
[2024-05-27 21:38:36] [INFO ] Redundant transitions in 7 ms returned []
Running 848 sub problems to find dead transitions.
[2024-05-27 21:38:36] [INFO ] Flow matrix only has 834 transitions (discarded 16 similar events)
[2024-05-27 21:38:36] [INFO ] Invariant cache hit.
[2024-05-27 21:38:36] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 848 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/386 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 848 unsolved
[2024-05-27 21:38:42] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2024-05-27 21:38:42] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-05-27 21:38:42] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 1 ms to minimize.
[2024-05-27 21:38:42] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 1 ms to minimize.
[2024-05-27 21:38:42] [INFO ] Deduced a trap composed of 39 places in 29 ms of which 1 ms to minimize.
[2024-05-27 21:38:42] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-05-27 21:38:42] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2024-05-27 21:38:43] [INFO ] Deduced a trap composed of 128 places in 257 ms of which 3 ms to minimize.
[2024-05-27 21:38:46] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-27 21:38:47] [INFO ] Deduced a trap composed of 135 places in 203 ms of which 3 ms to minimize.
[2024-05-27 21:38:49] [INFO ] Deduced a trap composed of 145 places in 219 ms of which 3 ms to minimize.
[2024-05-27 21:38:49] [INFO ] Deduced a trap composed of 134 places in 215 ms of which 3 ms to minimize.
[2024-05-27 21:38:49] [INFO ] Deduced a trap composed of 126 places in 196 ms of which 3 ms to minimize.
[2024-05-27 21:38:50] [INFO ] Deduced a trap composed of 135 places in 206 ms of which 3 ms to minimize.
[2024-05-27 21:38:51] [INFO ] Deduced a trap composed of 159 places in 224 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 848 unsolved
[2024-05-27 21:38:53] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 2 ms to minimize.
[2024-05-27 21:38:54] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 1 ms to minimize.
[2024-05-27 21:38:58] [INFO ] Deduced a trap composed of 153 places in 216 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/386 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 848 unsolved
[2024-05-27 21:39:06] [INFO ] Deduced a trap composed of 144 places in 165 ms of which 2 ms to minimize.
[2024-05-27 21:39:06] [INFO ] Deduced a trap composed of 152 places in 202 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/386 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 848 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 386/1222 variables, and 58 constraints, problems are : Problem set: 0 solved, 848 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/388 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 848/848 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 848 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 848 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/386 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 848 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 848 unsolved
[2024-05-27 21:39:17] [INFO ] Deduced a trap composed of 158 places in 202 ms of which 3 ms to minimize.
[2024-05-27 21:39:17] [INFO ] Deduced a trap composed of 152 places in 200 ms of which 2 ms to minimize.
[2024-05-27 21:39:18] [INFO ] Deduced a trap composed of 36 places in 115 ms of which 2 ms to minimize.
[2024-05-27 21:39:18] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 2 ms to minimize.
[2024-05-27 21:39:18] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/386 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 848 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/386 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 848 unsolved
At refinement iteration 5 (OVERLAPS) 1/387 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 848 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 387/1222 variables, and 64 constraints, problems are : Problem set: 0 solved, 848 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/388 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/848 constraints, Known Traps: 25/25 constraints]
After SMT, in 61304ms problems are : Problem set: 0 solved, 848 unsolved
Search for dead transitions found 0 dead transitions in 61314ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68178 ms. Remains : 388/388 places, 850/850 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2] Max Struct:[20]
Ending property specific reduction for PolyORBLF-COL-S02J04T08-UpperBounds-12 in 245000 ms.
[2024-05-27 21:39:37] [INFO ] Flatten gal took : 106 ms
[2024-05-27 21:39:37] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2024-05-27 21:39:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 388 places, 850 transitions and 4218 arcs took 8 ms.
Total runtime 942961 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running PolyORBLF-COL-S02J04T08
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/417/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 388
TRANSITIONS: 850
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.019s, Sys 0.008s]
SAVING FILE /home/mcc/execution/417/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.003s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 2070
MODEL NAME: /home/mcc/execution/417/model
388 places, 850 transitions.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-12 2 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-04 0 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716846671848
--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-COL-S02J04T08"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is PolyORBLF-COL-S02J04T08, 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 r289-tajo-171654445100085"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J04T08.tgz
mv PolyORBLF-COL-S02J04T08 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 '
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 ;