About the Execution of GreatSPN+red for PolyORBLF-COL-S02J04T10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 8978.399 | 3600000.00 | 11424687.00 | 220.70 | 1 1 1 1 1 ? ? 1 2 0 1 1 2 10 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-171654445200093.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-S02J04T10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445200093
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 688K
-rw-r--r-- 1 mcc users 8.8K Apr 11 16:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 11 16:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 11 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 11 16:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.7K 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.5K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 11 16:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Apr 11 16:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 16:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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-S02J04T10-UpperBounds-00
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-01
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-02
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-03
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-04
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-05
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-06
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-07
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-08
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-09
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-10
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-11
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-12
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-13
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-14
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716845608426
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-S02J04T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 21:33:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-27 21:33:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 21:33:29] [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:33:29] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 21:33:30] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 585 ms
[2024-05-27 21:33:30] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 752 PT places and 1664.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2024-05-27 21:33:30] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 4 ms.
[2024-05-27 21:33:30] [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:33:30] [INFO ] Computed 26 invariants in 18 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[10, 2, 2, 1, 2, 20, 20, 1, 2, 4, 1, 1, 172, 10, 10, 20]
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-27 21:33:30] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-27 21:33:30] [INFO ] Computed 26 invariants in 9 ms
[2024-05-27 21:33:30] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-27 21:33:30] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2024-05-27 21:33:30] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-05-27 21:33:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:33:30] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2024-05-27 21:33:30] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 9 ms returned sat
[2024-05-27 21:33:30] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-27 21:33:30] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-27 21:33:30] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-27 21:33:30] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-27 21:33:30] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 12 ms to minimize.
[2024-05-27 21:33:30] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2024-05-27 21:33:30] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-27 21:33:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 155 ms
[2024-05-27 21:33:30] [INFO ] Added : 58 causal constraints over 12 iterations in 260 ms. Result :sat
Minimization took 26 ms.
[2024-05-27 21:33:30] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 21:33:30] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 21:33:30] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-27 21:33:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:33:30] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 21:33:30] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-27 21:33:30] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-27 21:33:30] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-27 21:33:30] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-27 21:33:31] [INFO ] Added : 58 causal constraints over 12 iterations in 78 ms. Result :sat
Minimization took 22 ms.
[2024-05-27 21:33:31] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 21:33:31] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 21:33:31] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-27 21:33:31] [INFO ] [Real]Added 8 Read/Feed constraints in 12 ms returned sat
[2024-05-27 21:33:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:33:31] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 21:33:31] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-27 21:33:31] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-27 21:33:31] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-27 21:33:31] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-27 21:33:31] [INFO ] Added : 9 causal constraints over 3 iterations in 23 ms. Result :sat
Minimization took 15 ms.
[2024-05-27 21:33:31] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 21:33:31] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-27 21:33:31] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-27 21:33:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:33:31] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 21:33:31] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 8 ms returned sat
[2024-05-27 21:33:31] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-27 21:33:31] [INFO ] [Nat]Added 8 Read/Feed constraints in 22 ms returned sat
[2024-05-27 21:33:31] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-27 21:33:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2024-05-27 21:33:31] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-27 21:33:31] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 0 ms to minimize.
[2024-05-27 21:33:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2024-05-27 21:33:31] [INFO ] Added : 61 causal constraints over 13 iterations in 143 ms. Result :sat
Minimization took 26 ms.
[2024-05-27 21:33:31] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 21:33:31] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 21:33:31] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-27 21:33:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:33:31] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 21:33:31] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-27 21:33:31] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-27 21:33:31] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-27 21:33:31] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-27 21:33:31] [INFO ] Added : 27 causal constraints over 6 iterations in 38 ms. Result :sat
Minimization took 18 ms.
[2024-05-27 21:33:31] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 21:33:31] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 21:33:31] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-27 21:33:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:33:31] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 21:33:31] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 21:33:31] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-27 21:33:31] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-27 21:33:31] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-27 21:33:31] [INFO ] Added : 9 causal constraints over 3 iterations in 27 ms. Result :sat
Minimization took 19 ms.
[2024-05-27 21:33:31] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 21:33:31] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-27 21:33:31] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-27 21:33:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:33:31] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 21:33:31] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-27 21:33:31] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-27 21:33:31] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-27 21:33:31] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-27 21:33:32] [INFO ] Added : 54 causal constraints over 11 iterations in 61 ms. Result :sat
Minimization took 21 ms.
[2024-05-27 21:33:32] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 21:33:32] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 21:33:32] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-27 21:33:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:33:32] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 21:33:32] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-27 21:33:32] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-27 21:33:32] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-27 21:33:32] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-27 21:33:32] [INFO ] Added : 3 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 16 ms.
[2024-05-27 21:33:32] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 21:33:32] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 21:33:32] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-27 21:33:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:33:32] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 21:33:32] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 21:33:32] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2024-05-27 21:33:32] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-27 21:33:32] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-27 21:33:32] [INFO ] Added : 44 causal constraints over 10 iterations in 71 ms. Result :sat
Minimization took 27 ms.
[2024-05-27 21:33:32] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 21:33:32] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 21:33:32] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-27 21:33:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:33:32] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 21:33:32] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 21:33:32] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-27 21:33:32] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-27 21:33:32] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-27 21:33:32] [INFO ] Added : 54 causal constraints over 11 iterations in 60 ms. Result :sat
Minimization took 27 ms.
[2024-05-27 21:33:32] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 21:33:32] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 21:33:32] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-27 21:33:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:33:32] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 21:33:32] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 21:33:32] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-27 21:33:32] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-27 21:33:32] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-27 21:33:32] [INFO ] Added : 2 causal constraints over 1 iterations in 19 ms. Result :sat
Minimization took 12 ms.
[2024-05-27 21:33:32] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 21:33:32] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-27 21:33:32] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-27 21:33:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:33:32] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-27 21:33:32] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-27 21:33:32] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-27 21:33:32] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-27 21:33:32] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-27 21:33:32] [INFO ] Added : 6 causal constraints over 2 iterations in 18 ms. Result :sat
Minimization took 18 ms.
[2024-05-27 21:33:32] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 21:33:32] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-27 21:33:32] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-27 21:33:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:33:32] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 21:33:32] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-27 21:33:33] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-27 21:33:33] [INFO ] [Nat]Added 8 Read/Feed constraints in 27 ms returned sat
[2024-05-27 21:33:33] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-27 21:33:33] [INFO ] Added : 60 causal constraints over 12 iterations in 76 ms. Result :sat
Minimization took 71 ms.
[2024-05-27 21:33:33] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 21:33:33] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-27 21:33:33] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-27 21:33:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:33:33] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 21:33:33] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 21:33:33] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-27 21:33:33] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2024-05-27 21:33:33] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-27 21:33:33] [INFO ] Added : 27 causal constraints over 6 iterations in 48 ms. Result :sat
Minimization took 29 ms.
[2024-05-27 21:33:33] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-27 21:33:33] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-27 21:33:33] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-27 21:33:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:33:33] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 21:33:33] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-27 21:33:33] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-27 21:33:33] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2024-05-27 21:33:33] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-27 21:33:33] [INFO ] Added : 27 causal constraints over 6 iterations in 46 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[10, 2, 2, 2, 20, 20, 1, 2, 4, 1, 1, 172, 10, 10, 20]
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:33:33] [INFO ] Unfolded HLPN to a Petri net with 752 places and 1572 transitions 7262 arcs in 38 ms.
[2024-05-27 21:33:33] [INFO ] Unfolded 15 HLPN properties in 0 ms.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 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, +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, 0] Max Struct:[10, 2, 2, 2, 20, 20, 1, 2, 4, 1, 1, 172, 10, 10, 20]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[10, 2, 2, 2, 20, 20, 1, 2, 4, 1, 1, 172, 10, 10, 20]
[2024-05-27 21:33:33] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
// Phase 1: matrix 1392 rows 752 cols
[2024-05-27 21:33:33] [INFO ] Computed 54 invariants in 66 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[10, 2, 2, 2, 20, 20, 1, 2, 4, 1, 1, 9, 10, 10, 20]
RANDOM walk for 10000 steps (2 resets) in 121 ms. (81 steps per ms)
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-08 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-13 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100005 steps (22 resets) in 373 ms. (267 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 2, 2, 0, 2, 1, 2] Max Struct:[10, 2, 2, 2, 20, 20, 4, 9, 10, 20]
[2024-05-27 21:33:34] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-05-27 21:33:34] [INFO ] Invariant cache hit.
[2024-05-27 21:33:34] [INFO ] [Real]Absence check using 15 positive place invariants in 12 ms returned sat
[2024-05-27 21:33:34] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 19 ms returned unsat
[2024-05-27 21:33:34] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2024-05-27 21:33:34] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 18 ms returned unsat
[2024-05-27 21:33:34] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2024-05-27 21:33:34] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 16 ms returned unsat
[2024-05-27 21:33:34] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-05-27 21:33:34] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 18 ms returned unsat
[2024-05-27 21:33:34] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2024-05-27 21:33:34] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 19 ms returned sat
[2024-05-27 21:33:35] [INFO ] [Real]Absence check using state equation in 779 ms returned sat
[2024-05-27 21:33:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:33:35] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2024-05-27 21:33:35] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 24 ms returned sat
[2024-05-27 21:33:36] [INFO ] [Nat]Absence check using state equation in 716 ms returned sat
[2024-05-27 21:33:36] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 21:33:36] [INFO ] [Nat]Added 120 Read/Feed constraints in 362 ms returned sat
[2024-05-27 21:33:37] [INFO ] Computed and/alt/rep : 720/1388/710 causal constraints (skipped 680 transitions) in 137 ms.
[2024-05-27 21:33:38] [INFO ] Added : 65 causal constraints over 14 iterations in 1674 ms. Result :sat
Minimization took 564 ms.
[2024-05-27 21:33:39] [INFO ] [Real]Absence check using 15 positive place invariants in 12 ms returned sat
[2024-05-27 21:33:39] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 25 ms returned sat
[2024-05-27 21:33:39] [INFO ] [Real]Absence check using state equation in 525 ms returned sat
[2024-05-27 21:33:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:33:39] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2024-05-27 21:33:39] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 19 ms returned sat
[2024-05-27 21:33:41] [INFO ] [Nat]Absence check using state equation in 1144 ms returned sat
[2024-05-27 21:33:41] [INFO ] [Nat]Added 120 Read/Feed constraints in 201 ms returned sat
[2024-05-27 21:33:41] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 2 ms to minimize.
[2024-05-27 21:33:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2024-05-27 21:33:41] [INFO ] Computed and/alt/rep : 720/1388/710 causal constraints (skipped 680 transitions) in 85 ms.
[2024-05-27 21:33:42] [INFO ] Deduced a trap composed of 65 places in 41 ms of which 1 ms to minimize.
[2024-05-27 21:33:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2024-05-27 21:33:42] [INFO ] Added : 69 causal constraints over 17 iterations in 1523 ms. Result :sat
Minimization took 559 ms.
[2024-05-27 21:33:43] [INFO ] [Real]Absence check using 15 positive place invariants in 14 ms returned sat
[2024-05-27 21:33:43] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 25 ms returned sat
[2024-05-27 21:33:44] [INFO ] [Real]Absence check using state equation in 1031 ms returned sat
[2024-05-27 21:33:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:33:44] [INFO ] [Nat]Absence check using 15 positive place invariants in 15 ms returned sat
[2024-05-27 21:33:44] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 24 ms returned sat
[2024-05-27 21:33:46] [INFO ] [Nat]Absence check using state equation in 1261 ms returned sat
[2024-05-27 21:33:46] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 21:33:47] [INFO ] [Nat]Added 120 Read/Feed constraints in 1014 ms returned unknown
[2024-05-27 21:33:47] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2024-05-27 21:33:47] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 18 ms returned unsat
[2024-05-27 21:33:47] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-05-27 21:33:47] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 44 ms returned unsat
[2024-05-27 21:33:47] [INFO ] [Real]Absence check using 15 positive place invariants in 15 ms returned sat
[2024-05-27 21:33:47] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 25 ms returned sat
[2024-05-27 21:33:48] [INFO ] [Real]Absence check using state equation in 613 ms returned sat
[2024-05-27 21:33:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:33:48] [INFO ] [Nat]Absence check using 15 positive place invariants in 15 ms returned sat
[2024-05-27 21:33:48] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 26 ms returned sat
[2024-05-27 21:33:49] [INFO ] [Nat]Absence check using state equation in 818 ms returned sat
[2024-05-27 21:33:49] [INFO ] [Nat]Added 120 Read/Feed constraints in 480 ms returned sat
[2024-05-27 21:33:49] [INFO ] Computed and/alt/rep : 720/1388/710 causal constraints (skipped 680 transitions) in 88 ms.
[2024-05-27 21:33:51] [INFO ] Deduced a trap composed of 428 places in 415 ms of which 5 ms to minimize.
[2024-05-27 21:33:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 620 ms
[2024-05-27 21:33:52] [INFO ] Added : 80 causal constraints over 17 iterations in 2260 ms. Result :sat
Minimization took 562 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 2, 2, 0, 2, 1, 2] Max Struct:[1, 1, 1, 1, 20, 20, 4, 2, 1, 20]
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-12 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2, 0, 2] Max Struct:[20, 20, 4, 20]
Support contains 31 out of 752 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 750 transition count 1342
Reduce places removed 70 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 80 rules applied. Total rules applied 152 place count 680 transition count 1332
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 162 place count 670 transition count 1332
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 162 place count 670 transition count 1252
Deduced a syphon composed of 80 places in 3 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 322 place count 590 transition count 1252
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 3 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 462 place count 520 transition count 1182
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 3 with 10 rules applied. Total rules applied 472 place count 520 transition count 1172
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 482 place count 510 transition count 1172
Applied a total of 482 rules in 265 ms. Remains 510 /752 variables (removed 242) and now considering 1172/1412 (removed 240) transitions.
Running 1170 sub problems to find dead transitions.
[2024-05-27 21:33:52] [INFO ] Flow matrix only has 1152 transitions (discarded 20 similar events)
// Phase 1: matrix 1152 rows 510 cols
[2024-05-27 21:33:52] [INFO ] Computed 52 invariants in 28 ms
[2024-05-27 21:33:52] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
[2024-05-27 21:34:04] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 2 ms to minimize.
[2024-05-27 21:34:04] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 1 ms to minimize.
[2024-05-27 21:34:04] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 0 ms to minimize.
[2024-05-27 21:34:04] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
[2024-05-27 21:34:04] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-05-27 21:34:04] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
[2024-05-27 21:34:05] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 1 ms to minimize.
[2024-05-27 21:34:05] [INFO ] Deduced a trap composed of 41 places in 32 ms of which 1 ms to minimize.
[2024-05-27 21:34:05] [INFO ] Deduced a trap composed of 41 places in 32 ms of which 0 ms to minimize.
[2024-05-27 21:34:05] [INFO ] Deduced a trap composed of 181 places in 258 ms of which 4 ms to minimize.
[2024-05-27 21:34:07] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2024-05-27 21:34:10] [INFO ] Deduced a trap composed of 38 places in 147 ms of which 2 ms to minimize.
[2024-05-27 21:34:11] [INFO ] Deduced a trap composed of 171 places in 270 ms of which 3 ms to minimize.
[2024-05-27 21:34:15] [INFO ] Deduced a trap composed of 166 places in 273 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 508/1662 variables, and 64 constraints, problems are : Problem set: 0 solved, 1170 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 38/39 constraints, State Equation: 0/510 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1170/1170 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/508 variables, 14/64 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
[2024-05-27 21:34:23] [INFO ] Deduced a trap composed of 45 places in 133 ms of which 2 ms to minimize.
[2024-05-27 21:34:28] [INFO ] Deduced a trap composed of 296 places in 242 ms of which 3 ms to minimize.
[2024-05-27 21:34:28] [INFO ] Deduced a trap composed of 281 places in 209 ms of which 4 ms to minimize.
[2024-05-27 21:34:28] [INFO ] Deduced a trap composed of 300 places in 284 ms of which 3 ms to minimize.
[2024-05-27 21:34:29] [INFO ] Deduced a trap composed of 299 places in 261 ms of which 4 ms to minimize.
[2024-05-27 21:34:30] [INFO ] Deduced a trap composed of 236 places in 271 ms of which 4 ms to minimize.
[2024-05-27 21:34:30] [INFO ] Deduced a trap composed of 217 places in 273 ms of which 4 ms to minimize.
[2024-05-27 21:34:30] [INFO ] Deduced a trap composed of 316 places in 266 ms of which 7 ms to minimize.
[2024-05-27 21:34:30] [INFO ] Deduced a trap composed of 321 places in 254 ms of which 4 ms to minimize.
[2024-05-27 21:34:31] [INFO ] Deduced a trap composed of 299 places in 248 ms of which 3 ms to minimize.
[2024-05-27 21:34:31] [INFO ] Deduced a trap composed of 345 places in 223 ms of which 4 ms to minimize.
[2024-05-27 21:34:31] [INFO ] Deduced a trap composed of 336 places in 226 ms of which 4 ms to minimize.
[2024-05-27 21:34:31] [INFO ] Deduced a trap composed of 236 places in 249 ms of which 5 ms to minimize.
[2024-05-27 21:34:32] [INFO ] Deduced a trap composed of 218 places in 274 ms of which 4 ms to minimize.
[2024-05-27 21:34:32] [INFO ] Deduced a trap composed of 309 places in 286 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/508 variables, 15/79 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 508/1662 variables, and 79 constraints, problems are : Problem set: 0 solved, 1170 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 38/39 constraints, State Equation: 0/510 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1170 constraints, Known Traps: 29/29 constraints]
After SMT, in 43024ms problems are : Problem set: 0 solved, 1170 unsolved
Search for dead transitions found 0 dead transitions in 43056ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43355 ms. Remains : 510/752 places, 1172/1412 transitions.
[2024-05-27 21:34:35] [INFO ] Flow matrix only has 1152 transitions (discarded 20 similar events)
[2024-05-27 21:34:35] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2, 0, 2] Max Struct:[20, 20, 4, 20]
RANDOM walk for 1000000 steps (301 resets) in 3736 ms. (267 steps per ms)
BEST_FIRST walk for 4000004 steps (496 resets) in 7332 ms. (545 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 0, 2] Max Struct:[20, 20, 4, 20]
[2024-05-27 21:34:47] [INFO ] Flow matrix only has 1152 transitions (discarded 20 similar events)
[2024-05-27 21:34:47] [INFO ] Invariant cache hit.
[2024-05-27 21:34:47] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-05-27 21:34:47] [INFO ] [Real]Absence check using 13 positive and 39 generalized place invariants in 22 ms returned sat
[2024-05-27 21:34:47] [INFO ] [Real]Absence check using state equation in 615 ms returned sat
[2024-05-27 21:34:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:34:47] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-05-27 21:34:47] [INFO ] [Nat]Absence check using 13 positive and 39 generalized place invariants in 21 ms returned sat
[2024-05-27 21:34:49] [INFO ] [Nat]Absence check using state equation in 1192 ms returned sat
[2024-05-27 21:34:49] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 21:34:49] [INFO ] [Nat]Added 120 Read/Feed constraints in 261 ms returned sat
[2024-05-27 21:34:49] [INFO ] Computed and/alt/rep : 480/1048/470 causal constraints (skipped 680 transitions) in 102 ms.
[2024-05-27 21:34:50] [INFO ] Added : 35 causal constraints over 7 iterations in 701 ms. Result :sat
Minimization took 4530 ms.
[2024-05-27 21:34:54] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-05-27 21:34:54] [INFO ] [Real]Absence check using 13 positive and 39 generalized place invariants in 22 ms returned sat
[2024-05-27 21:34:55] [INFO ] [Real]Absence check using state equation in 356 ms returned sat
[2024-05-27 21:34:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:34:55] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-05-27 21:34:55] [INFO ] [Nat]Absence check using 13 positive and 39 generalized place invariants in 20 ms returned sat
[2024-05-27 21:34:55] [INFO ] [Nat]Absence check using state equation in 426 ms returned sat
[2024-05-27 21:34:56] [INFO ] [Nat]Added 120 Read/Feed constraints in 394 ms returned sat
[2024-05-27 21:34:56] [INFO ] Computed and/alt/rep : 480/1048/470 causal constraints (skipped 680 transitions) in 69 ms.
[2024-05-27 21:34:56] [INFO ] Added : 36 causal constraints over 8 iterations in 600 ms. Result :sat
Minimization took 4501 ms.
[2024-05-27 21:35:01] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-05-27 21:35:01] [INFO ] [Real]Absence check using 13 positive and 39 generalized place invariants in 22 ms returned sat
[2024-05-27 21:35:01] [INFO ] [Real]Absence check using state equation in 349 ms returned sat
[2024-05-27 21:35:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:35:01] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 21:35:01] [INFO ] [Nat]Absence check using 13 positive and 39 generalized place invariants in 27 ms returned sat
[2024-05-27 21:35:02] [INFO ] [Nat]Absence check using state equation in 455 ms returned sat
[2024-05-27 21:35:02] [INFO ] [Nat]Added 120 Read/Feed constraints in 105 ms returned sat
[2024-05-27 21:35:02] [INFO ] Deduced a trap composed of 23 places in 306 ms of which 4 ms to minimize.
[2024-05-27 21:35:03] [INFO ] Deduced a trap composed of 181 places in 315 ms of which 4 ms to minimize.
[2024-05-27 21:35:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 907 ms
[2024-05-27 21:35:03] [INFO ] Computed and/alt/rep : 480/1048/470 causal constraints (skipped 680 transitions) in 89 ms.
[2024-05-27 21:35:04] [INFO ] Added : 28 causal constraints over 6 iterations in 735 ms. Result :sat
Minimization took 4552 ms.
[2024-05-27 21:35:08] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-27 21:35:08] [INFO ] [Real]Absence check using 13 positive and 39 generalized place invariants in 16 ms returned sat
[2024-05-27 21:35:09] [INFO ] [Real]Absence check using state equation in 372 ms returned sat
[2024-05-27 21:35:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:35:09] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 21:35:09] [INFO ] [Nat]Absence check using 13 positive and 39 generalized place invariants in 14 ms returned sat
[2024-05-27 21:35:09] [INFO ] [Nat]Absence check using state equation in 743 ms returned sat
[2024-05-27 21:35:10] [INFO ] [Nat]Added 120 Read/Feed constraints in 265 ms returned sat
[2024-05-27 21:35:10] [INFO ] Computed and/alt/rep : 480/1048/470 causal constraints (skipped 680 transitions) in 74 ms.
[2024-05-27 21:35:10] [INFO ] Added : 32 causal constraints over 7 iterations in 584 ms. Result :sat
Minimization took 4515 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2, 0, 2] Max Struct:[20, 20, 4, 20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2, 0, 2] Max Struct:[20, 20, 4, 20]
Support contains 31 out of 510 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 510/510 places, 1172/1172 transitions.
Applied a total of 0 rules in 50 ms. Remains 510 /510 variables (removed 0) and now considering 1172/1172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 510/510 places, 1172/1172 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 510/510 places, 1172/1172 transitions.
Applied a total of 0 rules in 39 ms. Remains 510 /510 variables (removed 0) and now considering 1172/1172 (removed 0) transitions.
[2024-05-27 21:35:15] [INFO ] Flow matrix only has 1152 transitions (discarded 20 similar events)
[2024-05-27 21:35:15] [INFO ] Invariant cache hit.
[2024-05-27 21:35:15] [INFO ] Implicit Places using invariants in 482 ms returned [454, 455, 456, 457, 458, 459, 460, 461, 462, 463]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 486 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 500/510 places, 1172/1172 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 490 transition count 1162
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 490 transition count 1162
Applied a total of 20 rules in 49 ms. Remains 490 /500 variables (removed 10) and now considering 1162/1172 (removed 10) transitions.
[2024-05-27 21:35:15] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
// Phase 1: matrix 1142 rows 490 cols
[2024-05-27 21:35:15] [INFO ] Computed 42 invariants in 44 ms
[2024-05-27 21:35:16] [INFO ] Implicit Places using invariants in 467 ms returned []
[2024-05-27 21:35:16] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
[2024-05-27 21:35:16] [INFO ] Invariant cache hit.
[2024-05-27 21:35:16] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 21:35:22] [INFO ] Implicit Places using invariants and state equation in 5922 ms returned []
Implicit Place search using SMT with State Equation took 6394 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 490/510 places, 1162/1172 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6969 ms. Remains : 490/510 places, 1162/1172 transitions.
[2024-05-27 21:35:22] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
[2024-05-27 21:35:22] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2, 0, 2] Max Struct:[20, 20, 4, 20]
RANDOM walk for 1000000 steps (297 resets) in 3853 ms. (259 steps per ms)
BEST_FIRST walk for 4000002 steps (474 resets) in 6711 ms. (595 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 0, 2] Max Struct:[20, 20, 4, 20]
[2024-05-27 21:35:32] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
[2024-05-27 21:35:32] [INFO ] Invariant cache hit.
[2024-05-27 21:35:33] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-05-27 21:35:33] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 22 ms returned sat
[2024-05-27 21:35:33] [INFO ] [Real]Absence check using state equation in 308 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 13 positive place invariants in 9 ms returned sat
[2024-05-27 21:35:33] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 20 ms returned sat
[2024-05-27 21:35:33] [INFO ] [Nat]Absence check using state equation in 418 ms returned sat
[2024-05-27 21:35:33] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 21:35:34] [INFO ] [Nat]Added 120 Read/Feed constraints in 245 ms returned sat
[2024-05-27 21:35:34] [INFO ] Deduced a trap composed of 23 places in 300 ms of which 4 ms to minimize.
[2024-05-27 21:35:34] [INFO ] Deduced a trap composed of 204 places in 284 ms of which 3 ms to minimize.
[2024-05-27 21:35:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 747 ms
[2024-05-27 21:35:34] [INFO ] Computed and/alt/rep : 470/1028/460 causal constraints (skipped 680 transitions) in 83 ms.
[2024-05-27 21:35:35] [INFO ] Added : 27 causal constraints over 6 iterations in 489 ms. Result :sat
Minimization took 3890 ms.
[2024-05-27 21:35:39] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-05-27 21:35:39] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 23 ms returned sat
[2024-05-27 21:35:39] [INFO ] [Real]Absence check using state equation in 377 ms returned sat
[2024-05-27 21:35:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:35:39] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-05-27 21:35:39] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 20 ms returned sat
[2024-05-27 21:35:40] [INFO ] [Nat]Absence check using state equation in 450 ms returned sat
[2024-05-27 21:35:40] [INFO ] [Nat]Added 120 Read/Feed constraints in 188 ms returned sat
[2024-05-27 21:35:40] [INFO ] Computed and/alt/rep : 470/1028/460 causal constraints (skipped 680 transitions) in 93 ms.
[2024-05-27 21:35:41] [INFO ] Deduced a trap composed of 207 places in 313 ms of which 5 ms to minimize.
[2024-05-27 21:35:42] [INFO ] Deduced a trap composed of 199 places in 288 ms of which 3 ms to minimize.
[2024-05-27 21:35:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 777 ms
[2024-05-27 21:35:42] [INFO ] Added : 28 causal constraints over 6 iterations in 1540 ms. Result :sat
Minimization took 3856 ms.
[2024-05-27 21:35:46] [INFO ] [Real]Absence check using 13 positive place invariants in 14 ms returned sat
[2024-05-27 21:35:46] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 23 ms returned sat
[2024-05-27 21:35:46] [INFO ] [Real]Absence check using state equation in 457 ms returned sat
[2024-05-27 21:35:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:35:46] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-05-27 21:35:46] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 22 ms returned sat
[2024-05-27 21:35:48] [INFO ] [Nat]Absence check using state equation in 1558 ms returned sat
[2024-05-27 21:35:52] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 21:35:57] [INFO ] [Nat]Added 120 Read/Feed constraints in 9008 ms returned unknown
[2024-05-27 21:35:57] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2024-05-27 21:35:57] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 24 ms returned sat
[2024-05-27 21:35:57] [INFO ] [Real]Absence check using state equation in 409 ms returned sat
[2024-05-27 21:35:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:35:58] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-05-27 21:35:58] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 20 ms returned sat
[2024-05-27 21:35:58] [INFO ] [Nat]Absence check using state equation in 505 ms returned sat
[2024-05-27 21:35:58] [INFO ] [Nat]Added 120 Read/Feed constraints in 214 ms returned sat
[2024-05-27 21:35:58] [INFO ] Computed and/alt/rep : 470/1028/460 causal constraints (skipped 680 transitions) in 100 ms.
[2024-05-27 21:36:00] [INFO ] Deduced a trap composed of 172 places in 280 ms of which 4 ms to minimize.
[2024-05-27 21:36:00] [INFO ] Deduced a trap composed of 23 places in 294 ms of which 3 ms to minimize.
[2024-05-27 21:36:00] [INFO ] Deduced a trap composed of 173 places in 284 ms of which 4 ms to minimize.
[2024-05-27 21:36:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1227 ms
[2024-05-27 21:36:01] [INFO ] Added : 40 causal constraints over 9 iterations in 2314 ms. Result :sat
Minimization took 4219 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2, 0, 2] Max Struct:[20, 20, 4, 20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2, 0, 2] Max Struct:[20, 20, 4, 20]
Support contains 31 out of 490 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 490/490 places, 1162/1162 transitions.
Applied a total of 0 rules in 19 ms. Remains 490 /490 variables (removed 0) and now considering 1162/1162 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 490/490 places, 1162/1162 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 490/490 places, 1162/1162 transitions.
Applied a total of 0 rules in 21 ms. Remains 490 /490 variables (removed 0) and now considering 1162/1162 (removed 0) transitions.
[2024-05-27 21:36:07] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
[2024-05-27 21:36:07] [INFO ] Invariant cache hit.
[2024-05-27 21:36:07] [INFO ] Implicit Places using invariants in 407 ms returned []
[2024-05-27 21:36:07] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
[2024-05-27 21:36:07] [INFO ] Invariant cache hit.
[2024-05-27 21:36:07] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 21:36:13] [INFO ] Implicit Places using invariants and state equation in 5818 ms returned []
Implicit Place search using SMT with State Equation took 6228 ms to find 0 implicit places.
[2024-05-27 21:36:13] [INFO ] Redundant transitions in 100 ms returned []
Running 1160 sub problems to find dead transitions.
[2024-05-27 21:36:13] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
[2024-05-27 21:36:13] [INFO ] Invariant cache hit.
[2024-05-27 21:36:13] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/488 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
[2024-05-27 21:36:24] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 2 ms to minimize.
[2024-05-27 21:36:24] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 2 ms to minimize.
[2024-05-27 21:36:24] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 2 ms to minimize.
[2024-05-27 21:36:24] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 1 ms to minimize.
[2024-05-27 21:36:24] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
[2024-05-27 21:36:24] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2024-05-27 21:36:24] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 0 ms to minimize.
[2024-05-27 21:36:24] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 1 ms to minimize.
[2024-05-27 21:36:24] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-05-27 21:36:25] [INFO ] Deduced a trap composed of 179 places in 284 ms of which 7 ms to minimize.
[2024-05-27 21:36:25] [INFO ] Deduced a trap composed of 204 places in 278 ms of which 4 ms to minimize.
[2024-05-27 21:36:26] [INFO ] Deduced a trap composed of 185 places in 295 ms of which 3 ms to minimize.
[2024-05-27 21:36:26] [INFO ] Deduced a trap composed of 206 places in 257 ms of which 3 ms to minimize.
[2024-05-27 21:36:26] [INFO ] Deduced a trap composed of 200 places in 284 ms of which 3 ms to minimize.
[2024-05-27 21:36:26] [INFO ] Deduced a trap composed of 185 places in 262 ms of which 3 ms to minimize.
[2024-05-27 21:36:27] [INFO ] Deduced a trap composed of 173 places in 277 ms of which 4 ms to minimize.
[2024-05-27 21:36:28] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
[2024-05-27 21:36:29] [INFO ] Deduced a trap composed of 67 places in 103 ms of which 2 ms to minimize.
[2024-05-27 21:36:35] [INFO ] Deduced a trap composed of 166 places in 232 ms of which 3 ms to minimize.
[2024-05-27 21:36:36] [INFO ] Deduced a trap composed of 155 places in 229 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/488 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
[2024-05-27 21:36:44] [INFO ] Deduced a trap composed of 153 places in 244 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 488/1632 variables, and 61 constraints, problems are : Problem set: 0 solved, 1160 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/490 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1160/1160 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/488 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/488 variables, 21/61 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
[2024-05-27 21:36:50] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/488 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/1632 variables, and 62 constraints, problems are : Problem set: 0 solved, 1160 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/490 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1160 constraints, Known Traps: 22/22 constraints]
After SMT, in 62344ms problems are : Problem set: 0 solved, 1160 unsolved
Search for dead transitions found 0 dead transitions in 62360ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68723 ms. Remains : 490/490 places, 1162/1162 transitions.
RANDOM walk for 40000 steps (15 resets) in 1207 ms. (33 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (9 resets) in 277 ms. (143 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (10 resets) in 242 ms. (164 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (12 resets) in 181 ms. (219 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (10 resets) in 179 ms. (222 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 274 ms. (145 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (10 resets) in 249 ms. (160 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (9 resets) in 189 ms. (210 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (10 resets) in 129 ms. (307 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 173196 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :0 out of 8
Probabilistic random walk after 173196 steps, saw 100278 distinct states, run finished after 3003 ms. (steps per millisecond=57 ) properties seen :0
[2024-05-27 21:37:19] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
[2024-05-27 21:37:19] [INFO ] Invariant cache hit.
[2024-05-27 21:37:19] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem MAX0 is UNSAT
Problem MAX1 is UNSAT
Problem MAX3 is UNSAT
At refinement iteration 1 (OVERLAPS) 177/208 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 14/222 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 2/224 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 252/476 variables, 24/29 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/476 variables, 0/29 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 8/484 variables, 8/37 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/484 variables, 0/37 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 4/488 variables, 4/41 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/488 variables, 0/41 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 1142/1630 variables, 488/529 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1630 variables, 120/649 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1630 variables, 0/649 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 2/1632 variables, 2/651 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1632 variables, 1/652 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1632 variables, 0/652 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 0/1632 variables, 0/652 constraints. Problems are: Problem set: 3 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1632/1632 variables, and 652 constraints, problems are : Problem set: 3 solved, 5 unsolved in 1591 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 490/490 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 177/208 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 14/222 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 2/224 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 252/476 variables, 24/29 constraints. Problems are: Problem set: 3 solved, 5 unsolved
[2024-05-27 21:37:21] [INFO ] Deduced a trap composed of 41 places in 151 ms of which 3 ms to minimize.
[2024-05-27 21:37:22] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 2 ms to minimize.
[2024-05-27 21:37:22] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 1 ms to minimize.
[2024-05-27 21:37:22] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 2 ms to minimize.
[2024-05-27 21:37:22] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 2 ms to minimize.
[2024-05-27 21:37:22] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 2 ms to minimize.
[2024-05-27 21:37:22] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 1 ms to minimize.
[2024-05-27 21:37:22] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 2 ms to minimize.
[2024-05-27 21:37:22] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/476 variables, 9/38 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/476 variables, 0/38 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 8/484 variables, 8/46 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/484 variables, 0/46 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 4/488 variables, 4/50 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/488 variables, 0/50 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 1142/1630 variables, 488/538 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1630 variables, 120/658 constraints. Problems are: Problem set: 3 solved, 5 unsolved
Problem MAX2 is UNSAT
Problem MIN2 is UNSAT
At refinement iteration 17 (INCLUDED_ONLY) 0/1630 variables, 5/663 constraints. Problems are: Problem set: 5 solved, 3 unsolved
[2024-05-27 21:37:26] [INFO ] Deduced a trap composed of 172 places in 297 ms of which 4 ms to minimize.
[2024-05-27 21:37:26] [INFO ] Deduced a trap composed of 183 places in 263 ms of which 3 ms to minimize.
SMT process timed out in 6714ms, After SMT, problems are : Problem set: 5 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 30 out of 490 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 490/490 places, 1162/1162 transitions.
Applied a total of 0 rules in 26 ms. Remains 490 /490 variables (removed 0) and now considering 1162/1162 (removed 0) transitions.
Running 1160 sub problems to find dead transitions.
[2024-05-27 21:37:26] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
[2024-05-27 21:37:26] [INFO ] Invariant cache hit.
[2024-05-27 21:37:26] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/488 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
[2024-05-27 21:37:37] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 2 ms to minimize.
[2024-05-27 21:37:37] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 2 ms to minimize.
[2024-05-27 21:37:37] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 2 ms to minimize.
[2024-05-27 21:37:37] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 2 ms to minimize.
[2024-05-27 21:37:37] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2024-05-27 21:37:37] [INFO ] Deduced a trap composed of 41 places in 28 ms of which 1 ms to minimize.
[2024-05-27 21:37:37] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 1 ms to minimize.
[2024-05-27 21:37:37] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
[2024-05-27 21:37:37] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 1 ms to minimize.
[2024-05-27 21:37:38] [INFO ] Deduced a trap composed of 179 places in 250 ms of which 3 ms to minimize.
[2024-05-27 21:37:38] [INFO ] Deduced a trap composed of 204 places in 245 ms of which 4 ms to minimize.
[2024-05-27 21:37:38] [INFO ] Deduced a trap composed of 185 places in 254 ms of which 4 ms to minimize.
[2024-05-27 21:37:39] [INFO ] Deduced a trap composed of 206 places in 239 ms of which 3 ms to minimize.
[2024-05-27 21:37:39] [INFO ] Deduced a trap composed of 200 places in 226 ms of which 4 ms to minimize.
[2024-05-27 21:37:39] [INFO ] Deduced a trap composed of 185 places in 224 ms of which 4 ms to minimize.
[2024-05-27 21:37:39] [INFO ] Deduced a trap composed of 173 places in 203 ms of which 2 ms to minimize.
[2024-05-27 21:37:40] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-05-27 21:37:42] [INFO ] Deduced a trap composed of 67 places in 147 ms of which 2 ms to minimize.
[2024-05-27 21:37:48] [INFO ] Deduced a trap composed of 166 places in 246 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 488/1632 variables, and 59 constraints, problems are : Problem set: 0 solved, 1160 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/490 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1160/1160 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/488 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/488 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
[2024-05-27 21:38:02] [INFO ] Deduced a trap composed of 25 places in 148 ms of which 3 ms to minimize.
[2024-05-27 21:38:05] [INFO ] Deduced a trap composed of 23 places in 171 ms of which 3 ms to minimize.
[2024-05-27 21:38:09] [INFO ] Deduced a trap composed of 156 places in 261 ms of which 4 ms to minimize.
SMT process timed out in 42666ms, After SMT, problems are : Problem set: 0 solved, 1160 unsolved
Search for dead transitions found 0 dead transitions in 42682ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42713 ms. Remains : 490/490 places, 1162/1162 transitions.
RANDOM walk for 40000 steps (14 resets) in 288 ms. (138 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (10 resets) in 144 ms. (275 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (9 resets) in 135 ms. (294 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (11 resets) in 117 ms. (339 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 218938 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :0 out of 3
Probabilistic random walk after 218938 steps, saw 125504 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
[2024-05-27 21:38:12] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
[2024-05-27 21:38:12] [INFO ] Invariant cache hit.
[2024-05-27 21:38:12] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 177/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 14/221 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/223 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 253/476 variables, 25/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 8/484 variables, 8/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/484 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 4/488 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/488 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1142/1630 variables, 488/529 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1630 variables, 120/649 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1630 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 2/1632 variables, 2/651 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1632 variables, 1/652 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1632 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1632 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1632/1632 variables, and 652 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1061 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 490/490 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 177/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 14/221 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/223 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 253/476 variables, 25/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-27 21:38:13] [INFO ] Deduced a trap composed of 41 places in 174 ms of which 3 ms to minimize.
[2024-05-27 21:38:14] [INFO ] Deduced a trap composed of 41 places in 173 ms of which 2 ms to minimize.
[2024-05-27 21:38:14] [INFO ] Deduced a trap composed of 41 places in 153 ms of which 3 ms to minimize.
[2024-05-27 21:38:14] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 3 ms to minimize.
[2024-05-27 21:38:14] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 2 ms to minimize.
[2024-05-27 21:38:14] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 1 ms to minimize.
[2024-05-27 21:38:14] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 1 ms to minimize.
[2024-05-27 21:38:14] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2024-05-27 21:38:14] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 9/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/476 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 8/484 variables, 8/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/484 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 4/488 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/488 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 1142/1630 variables, 488/538 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1630 variables, 120/658 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1630 variables, 3/661 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-27 21:38:16] [INFO ] Deduced a trap composed of 184 places in 239 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1630 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1630 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 2/1632 variables, 2/664 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1632 variables, 1/665 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-27 21:38:17] [INFO ] Deduced a trap composed of 23 places in 298 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1632 variables, 1/666 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1632 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-27 21:38:18] [INFO ] Deduced a trap composed of 181 places in 297 ms of which 4 ms to minimize.
At refinement iteration 23 (OVERLAPS) 0/1632 variables, 1/667 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1632 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 0/1632 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1632/1632 variables, and 667 constraints, problems are : Problem set: 0 solved, 3 unsolved in 12361 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 490/490 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 12/12 constraints]
After SMT, in 13436ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 5213 ms.
Support contains 30 out of 490 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 490/490 places, 1162/1162 transitions.
Applied a total of 0 rules in 17 ms. Remains 490 /490 variables (removed 0) and now considering 1162/1162 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 490/490 places, 1162/1162 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 490/490 places, 1162/1162 transitions.
Applied a total of 0 rules in 17 ms. Remains 490 /490 variables (removed 0) and now considering 1162/1162 (removed 0) transitions.
[2024-05-27 21:38:31] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
[2024-05-27 21:38:31] [INFO ] Invariant cache hit.
[2024-05-27 21:38:31] [INFO ] Implicit Places using invariants in 356 ms returned []
[2024-05-27 21:38:31] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
[2024-05-27 21:38:31] [INFO ] Invariant cache hit.
[2024-05-27 21:38:32] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 21:38:37] [INFO ] Implicit Places using invariants and state equation in 6025 ms returned []
Implicit Place search using SMT with State Equation took 6382 ms to find 0 implicit places.
[2024-05-27 21:38:37] [INFO ] Redundant transitions in 12 ms returned []
Running 1160 sub problems to find dead transitions.
[2024-05-27 21:38:37] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
[2024-05-27 21:38:37] [INFO ] Invariant cache hit.
[2024-05-27 21:38:37] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/488 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
[2024-05-27 21:38:48] [INFO ] Deduced a trap composed of 41 places in 120 ms of which 2 ms to minimize.
[2024-05-27 21:38:48] [INFO ] Deduced a trap composed of 41 places in 137 ms of which 2 ms to minimize.
[2024-05-27 21:38:48] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 2 ms to minimize.
[2024-05-27 21:38:48] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 1 ms to minimize.
[2024-05-27 21:38:48] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-05-27 21:38:48] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2024-05-27 21:38:48] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2024-05-27 21:38:48] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
[2024-05-27 21:38:48] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 1 ms to minimize.
[2024-05-27 21:38:49] [INFO ] Deduced a trap composed of 179 places in 260 ms of which 3 ms to minimize.
[2024-05-27 21:38:49] [INFO ] Deduced a trap composed of 204 places in 263 ms of which 2 ms to minimize.
[2024-05-27 21:38:49] [INFO ] Deduced a trap composed of 185 places in 235 ms of which 3 ms to minimize.
[2024-05-27 21:38:50] [INFO ] Deduced a trap composed of 206 places in 245 ms of which 3 ms to minimize.
[2024-05-27 21:38:50] [INFO ] Deduced a trap composed of 200 places in 238 ms of which 4 ms to minimize.
[2024-05-27 21:38:50] [INFO ] Deduced a trap composed of 185 places in 229 ms of which 3 ms to minimize.
[2024-05-27 21:38:50] [INFO ] Deduced a trap composed of 173 places in 229 ms of which 4 ms to minimize.
[2024-05-27 21:38:51] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2024-05-27 21:38:53] [INFO ] Deduced a trap composed of 67 places in 125 ms of which 3 ms to minimize.
[2024-05-27 21:38:58] [INFO ] Deduced a trap composed of 166 places in 222 ms of which 3 ms to minimize.
[2024-05-27 21:38:59] [INFO ] Deduced a trap composed of 155 places in 219 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/488 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
[2024-05-27 21:39:09] [INFO ] Deduced a trap composed of 153 places in 270 ms of which 4 ms to minimize.
SMT process timed out in 32322ms, After SMT, problems are : Problem set: 0 solved, 1160 unsolved
Search for dead transitions found 0 dead transitions in 32334ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38753 ms. Remains : 490/490 places, 1162/1162 transitions.
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-09 0 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[2, 2, 2] Max Struct:[20, 20, 20]
Starting property specific reduction for PolyORBLF-COL-S02J04T10-UpperBounds-05
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:39:10] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
[2024-05-27 21:39:10] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[20]
RANDOM walk for 10000 steps (2 resets) in 66 ms. (149 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 24 ms. (400 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[20]
[2024-05-27 21:39:10] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
[2024-05-27 21:39:10] [INFO ] Invariant cache hit.
[2024-05-27 21:39:10] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-05-27 21:39:10] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 21 ms returned sat
[2024-05-27 21:39:10] [INFO ] [Real]Absence check using state equation in 339 ms returned sat
[2024-05-27 21:39:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:39:10] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-05-27 21:39:10] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 20 ms returned sat
[2024-05-27 21:39:11] [INFO ] [Nat]Absence check using state equation in 497 ms returned sat
[2024-05-27 21:39:11] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 21:39:11] [INFO ] [Nat]Added 120 Read/Feed constraints in 321 ms returned sat
[2024-05-27 21:39:11] [INFO ] Deduced a trap composed of 23 places in 284 ms of which 4 ms to minimize.
[2024-05-27 21:39:12] [INFO ] Deduced a trap composed of 204 places in 276 ms of which 4 ms to minimize.
[2024-05-27 21:39:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 709 ms
[2024-05-27 21:39:12] [INFO ] Computed and/alt/rep : 470/1028/460 causal constraints (skipped 680 transitions) in 68 ms.
[2024-05-27 21:39:12] [INFO ] Added : 27 causal constraints over 6 iterations in 566 ms. Result :sat
Minimization took 545 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 10 out of 490 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 490/490 places, 1162/1162 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 480 transition count 1152
Applied a total of 20 rules in 41 ms. Remains 480 /490 variables (removed 10) and now considering 1152/1162 (removed 10) transitions.
Running 1150 sub problems to find dead transitions.
[2024-05-27 21:39:13] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
// Phase 1: matrix 1132 rows 480 cols
[2024-05-27 21:39:13] [INFO ] Computed 42 invariants in 46 ms
[2024-05-27 21:39:13] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
[2024-05-27 21:39:24] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-05-27 21:39:24] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-05-27 21:39:24] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-05-27 21:39:25] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-05-27 21:39:25] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 1 ms to minimize.
[2024-05-27 21:39:25] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-05-27 21:39:25] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-05-27 21:39:25] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2024-05-27 21:39:25] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 0 ms to minimize.
[2024-05-27 21:39:25] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 1 ms to minimize.
[2024-05-27 21:39:30] [INFO ] Deduced a trap composed of 166 places in 247 ms of which 4 ms to minimize.
[2024-05-27 21:39:31] [INFO ] Deduced a trap composed of 168 places in 235 ms of which 3 ms to minimize.
[2024-05-27 21:39:31] [INFO ] Deduced a trap composed of 202 places in 292 ms of which 3 ms to minimize.
[2024-05-27 21:39:32] [INFO ] Deduced a trap composed of 170 places in 229 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/1612 variables, and 54 constraints, problems are : Problem set: 0 solved, 1150 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/480 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1150/1150 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
[2024-05-27 21:39:37] [INFO ] Deduced a trap composed of 37 places in 161 ms of which 3 ms to minimize.
[2024-05-27 21:39:45] [INFO ] Deduced a trap composed of 290 places in 205 ms of which 2 ms to minimize.
[2024-05-27 21:39:46] [INFO ] Deduced a trap composed of 154 places in 213 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/478 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/1612 variables, and 57 constraints, problems are : Problem set: 0 solved, 1150 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/480 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1150 constraints, Known Traps: 17/17 constraints]
After SMT, in 42384ms problems are : Problem set: 0 solved, 1150 unsolved
Search for dead transitions found 0 dead transitions in 42398ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42442 ms. Remains : 480/490 places, 1152/1162 transitions.
[2024-05-27 21:39:55] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-05-27 21:39:55] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[20]
RANDOM walk for 1000000 steps (332 resets) in 3493 ms. (286 steps per ms)
BEST_FIRST walk for 1000000 steps (137 resets) in 1674 ms. (597 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[20]
[2024-05-27 21:40:00] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-05-27 21:40:00] [INFO ] Invariant cache hit.
[2024-05-27 21:40:01] [INFO ] [Real]Absence check using 15 positive place invariants in 13 ms returned sat
[2024-05-27 21:40:01] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 18 ms returned sat
[2024-05-27 21:40:01] [INFO ] [Real]Absence check using state equation in 360 ms returned sat
[2024-05-27 21:40:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:40:01] [INFO ] [Nat]Absence check using 15 positive place invariants in 12 ms returned sat
[2024-05-27 21:40:01] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 23 ms returned sat
[2024-05-27 21:40:01] [INFO ] [Nat]Absence check using state equation in 303 ms returned sat
[2024-05-27 21:40:01] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 21:40:02] [INFO ] [Nat]Added 120 Read/Feed constraints in 606 ms returned sat
[2024-05-27 21:40:02] [INFO ] Deduced a trap composed of 204 places in 294 ms of which 4 ms to minimize.
[2024-05-27 21:40:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 437 ms
[2024-05-27 21:40:03] [INFO ] Computed and/alt/rep : 370/818/360 causal constraints (skipped 770 transitions) in 81 ms.
[2024-05-27 21:40:03] [INFO ] Added : 29 causal constraints over 6 iterations in 737 ms. Result :sat
Minimization took 4500 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 10 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 1152/1152 transitions.
Applied a total of 0 rules in 39 ms. Remains 480 /480 variables (removed 0) and now considering 1152/1152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 480/480 places, 1152/1152 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 1152/1152 transitions.
Applied a total of 0 rules in 28 ms. Remains 480 /480 variables (removed 0) and now considering 1152/1152 (removed 0) transitions.
[2024-05-27 21:40:08] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-05-27 21:40:08] [INFO ] Invariant cache hit.
[2024-05-27 21:40:08] [INFO ] Implicit Places using invariants in 493 ms returned []
[2024-05-27 21:40:08] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-05-27 21:40:08] [INFO ] Invariant cache hit.
[2024-05-27 21:40:09] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 21:40:13] [INFO ] Implicit Places using invariants and state equation in 5136 ms returned []
Implicit Place search using SMT with State Equation took 5631 ms to find 0 implicit places.
[2024-05-27 21:40:13] [INFO ] Redundant transitions in 20 ms returned []
Running 1150 sub problems to find dead transitions.
[2024-05-27 21:40:13] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-05-27 21:40:13] [INFO ] Invariant cache hit.
[2024-05-27 21:40:13] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
[2024-05-27 21:40:24] [INFO ] Deduced a trap composed of 40 places in 166 ms of which 3 ms to minimize.
[2024-05-27 21:40:24] [INFO ] Deduced a trap composed of 41 places in 178 ms of which 2 ms to minimize.
[2024-05-27 21:40:24] [INFO ] Deduced a trap composed of 58 places in 143 ms of which 2 ms to minimize.
[2024-05-27 21:40:24] [INFO ] Deduced a trap composed of 40 places in 155 ms of which 2 ms to minimize.
[2024-05-27 21:40:24] [INFO ] Deduced a trap composed of 37 places in 153 ms of which 2 ms to minimize.
[2024-05-27 21:40:24] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-05-27 21:40:25] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-27 21:40:25] [INFO ] Deduced a trap composed of 40 places in 30 ms of which 0 ms to minimize.
[2024-05-27 21:40:25] [INFO ] Deduced a trap composed of 40 places in 28 ms of which 0 ms to minimize.
[2024-05-27 21:40:25] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 1 ms to minimize.
[2024-05-27 21:40:25] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-05-27 21:40:25] [INFO ] Deduced a trap composed of 210 places in 250 ms of which 3 ms to minimize.
[2024-05-27 21:40:25] [INFO ] Deduced a trap composed of 164 places in 263 ms of which 3 ms to minimize.
[2024-05-27 21:40:26] [INFO ] Deduced a trap composed of 188 places in 233 ms of which 3 ms to minimize.
[2024-05-27 21:40:26] [INFO ] Deduced a trap composed of 181 places in 218 ms of which 2 ms to minimize.
[2024-05-27 21:40:26] [INFO ] Deduced a trap composed of 190 places in 244 ms of which 3 ms to minimize.
[2024-05-27 21:40:26] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
[2024-05-27 21:40:42] [INFO ] Deduced a trap composed of 166 places in 276 ms of which 4 ms to minimize.
[2024-05-27 21:40:43] [INFO ] Deduced a trap composed of 198 places in 232 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/1612 variables, and 59 constraints, problems are : Problem set: 0 solved, 1150 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/480 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1150/1150 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
[2024-05-27 21:40:51] [INFO ] Deduced a trap composed of 306 places in 242 ms of which 3 ms to minimize.
[2024-05-27 21:40:51] [INFO ] Deduced a trap composed of 28 places in 141 ms of which 3 ms to minimize.
[2024-05-27 21:40:52] [INFO ] Deduced a trap composed of 43 places in 132 ms of which 3 ms to minimize.
[2024-05-27 21:40:52] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 2 ms to minimize.
[2024-05-27 21:40:52] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 2 ms to minimize.
[2024-05-27 21:40:52] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/478 variables, 6/65 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/1612 variables, and 65 constraints, problems are : Problem set: 0 solved, 1150 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/480 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1150 constraints, Known Traps: 25/25 constraints]
After SMT, in 62388ms problems are : Problem set: 0 solved, 1150 unsolved
Search for dead transitions found 0 dead transitions in 62409ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68100 ms. Remains : 480/480 places, 1152/1152 transitions.
RANDOM walk for 40000 steps (14 resets) in 278 ms. (143 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (9 resets) in 148 ms. (268 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (10 resets) in 113 ms. (350 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 226245 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :0 out of 2
Probabilistic random walk after 226245 steps, saw 128702 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
[2024-05-27 21:41:19] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-05-27 21:41:19] [INFO ] Invariant cache hit.
[2024-05-27 21:41:19] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 1 (OVERLAPS) 187/197 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 41/238 variables, 2/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 160/398 variables, 6/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/401 variables, 3/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 76/477 variables, 27/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-27 21:41:19] [INFO ] Deduced a trap composed of 40 places in 155 ms of which 2 ms to minimize.
[2024-05-27 21:41:19] [INFO ] Deduced a trap composed of 40 places in 109 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/477 variables, 2/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 0/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 1/478 variables, 1/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/478 variables, 0/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1132/1610 variables, 478/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1610 variables, 120/641 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1610 variables, 0/641 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/1612 variables, 2/643 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1612 variables, 1/644 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1612 variables, 0/644 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1612 variables, 0/644 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1612/1612 variables, and 644 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1202 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 480/480 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 187/197 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 41/238 variables, 2/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 160/398 variables, 6/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/401 variables, 3/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 76/477 variables, 27/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/477 variables, 2/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-27 21:41:21] [INFO ] Deduced a trap composed of 40 places in 132 ms of which 2 ms to minimize.
[2024-05-27 21:41:21] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 2 ms to minimize.
[2024-05-27 21:41:21] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 2 ms to minimize.
[2024-05-27 21:41:21] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 4/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/477 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/478 variables, 1/47 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/478 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1132/1610 variables, 478/525 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1610/1612 variables, and 645 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2123 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 478/480 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 3336ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 46 ms.
Support contains 10 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 1152/1152 transitions.
Applied a total of 0 rules in 25 ms. Remains 480 /480 variables (removed 0) and now considering 1152/1152 (removed 0) transitions.
Running 1150 sub problems to find dead transitions.
[2024-05-27 21:41:22] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-05-27 21:41:22] [INFO ] Invariant cache hit.
[2024-05-27 21:41:22] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
[2024-05-27 21:41:33] [INFO ] Deduced a trap composed of 40 places in 191 ms of which 2 ms to minimize.
[2024-05-27 21:41:33] [INFO ] Deduced a trap composed of 41 places in 164 ms of which 3 ms to minimize.
[2024-05-27 21:41:33] [INFO ] Deduced a trap composed of 58 places in 159 ms of which 2 ms to minimize.
[2024-05-27 21:41:33] [INFO ] Deduced a trap composed of 40 places in 142 ms of which 3 ms to minimize.
[2024-05-27 21:41:34] [INFO ] Deduced a trap composed of 37 places in 168 ms of which 2 ms to minimize.
[2024-05-27 21:41:34] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-05-27 21:41:34] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 2 ms to minimize.
[2024-05-27 21:41:34] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-05-27 21:41:34] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-05-27 21:41:34] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-05-27 21:41:34] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-05-27 21:41:34] [INFO ] Deduced a trap composed of 210 places in 281 ms of which 3 ms to minimize.
[2024-05-27 21:41:35] [INFO ] Deduced a trap composed of 164 places in 285 ms of which 4 ms to minimize.
[2024-05-27 21:41:35] [INFO ] Deduced a trap composed of 188 places in 242 ms of which 3 ms to minimize.
[2024-05-27 21:41:35] [INFO ] Deduced a trap composed of 181 places in 230 ms of which 4 ms to minimize.
[2024-05-27 21:41:36] [INFO ] Deduced a trap composed of 190 places in 280 ms of which 4 ms to minimize.
[2024-05-27 21:41:36] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/1612 variables, and 57 constraints, problems are : Problem set: 0 solved, 1150 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/480 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1150/1150 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
[2024-05-27 21:41:50] [INFO ] Deduced a trap composed of 290 places in 243 ms of which 3 ms to minimize.
[2024-05-27 21:41:50] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 2 ms to minimize.
[2024-05-27 21:41:53] [INFO ] Deduced a trap composed of 244 places in 248 ms of which 3 ms to minimize.
[2024-05-27 21:41:54] [INFO ] Deduced a trap composed of 166 places in 212 ms of which 4 ms to minimize.
[2024-05-27 21:41:55] [INFO ] Deduced a trap composed of 193 places in 230 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/478 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/1612 variables, and 62 constraints, problems are : Problem set: 0 solved, 1150 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/480 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1150 constraints, Known Traps: 22/22 constraints]
After SMT, in 42479ms problems are : Problem set: 0 solved, 1150 unsolved
Search for dead transitions found 0 dead transitions in 42495ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42524 ms. Remains : 480/480 places, 1152/1152 transitions.
RANDOM walk for 40000 steps (13 resets) in 223 ms. (178 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (14 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 328037 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :0 out of 1
Probabilistic random walk after 328037 steps, saw 184547 distinct states, run finished after 3001 ms. (steps per millisecond=109 ) properties seen :0
[2024-05-27 21:42:08] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-05-27 21:42:08] [INFO ] Invariant cache hit.
[2024-05-27 21:42:08] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 187/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 41/238 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 160/398 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/401 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 76/477 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/477 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/478 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/478 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1132/1610 variables, 478/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1610 variables, 120/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1610 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1612 variables, 2/641 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1612 variables, 1/642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1612 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1612 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1612/1612 variables, and 642 constraints, problems are : Problem set: 0 solved, 1 unsolved in 904 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 480/480 constraints, ReadFeed: 120/120 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 187/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 41/238 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 160/398 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/401 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 76/477 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 21:42:09] [INFO ] Deduced a trap composed of 40 places in 150 ms of which 2 ms to minimize.
[2024-05-27 21:42:09] [INFO ] Deduced a trap composed of 40 places in 132 ms of which 3 ms to minimize.
[2024-05-27 21:42:10] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 2 ms to minimize.
[2024-05-27 21:42:10] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 2 ms to minimize.
[2024-05-27 21:42:10] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 2 ms to minimize.
[2024-05-27 21:42:10] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 1 ms to minimize.
[2024-05-27 21:42:10] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/477 variables, 7/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/478 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/478 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1132/1610 variables, 478/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1610 variables, 120/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1610 variables, 1/647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1610 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/1612 variables, 2/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1612 variables, 1/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1612 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1612 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1612/1612 variables, and 650 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2403 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 480/480 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 3315ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 64 ms.
Support contains 10 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 1152/1152 transitions.
Applied a total of 0 rules in 18 ms. Remains 480 /480 variables (removed 0) and now considering 1152/1152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 480/480 places, 1152/1152 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 1152/1152 transitions.
Applied a total of 0 rules in 18 ms. Remains 480 /480 variables (removed 0) and now considering 1152/1152 (removed 0) transitions.
[2024-05-27 21:42:11] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-05-27 21:42:11] [INFO ] Invariant cache hit.
[2024-05-27 21:42:12] [INFO ] Implicit Places using invariants in 380 ms returned []
[2024-05-27 21:42:12] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-05-27 21:42:12] [INFO ] Invariant cache hit.
[2024-05-27 21:42:12] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 21:42:17] [INFO ] Implicit Places using invariants and state equation in 4934 ms returned []
Implicit Place search using SMT with State Equation took 5320 ms to find 0 implicit places.
[2024-05-27 21:42:17] [INFO ] Redundant transitions in 18 ms returned []
Running 1150 sub problems to find dead transitions.
[2024-05-27 21:42:17] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-05-27 21:42:17] [INFO ] Invariant cache hit.
[2024-05-27 21:42:17] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
[2024-05-27 21:42:28] [INFO ] Deduced a trap composed of 40 places in 162 ms of which 2 ms to minimize.
[2024-05-27 21:42:28] [INFO ] Deduced a trap composed of 41 places in 138 ms of which 2 ms to minimize.
[2024-05-27 21:42:28] [INFO ] Deduced a trap composed of 58 places in 166 ms of which 2 ms to minimize.
[2024-05-27 21:42:28] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 3 ms to minimize.
[2024-05-27 21:42:28] [INFO ] Deduced a trap composed of 37 places in 150 ms of which 2 ms to minimize.
[2024-05-27 21:42:28] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-05-27 21:42:28] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 0 ms to minimize.
[2024-05-27 21:42:28] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-05-27 21:42:28] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 1 ms to minimize.
[2024-05-27 21:42:28] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 0 ms to minimize.
[2024-05-27 21:42:29] [INFO ] Deduced a trap composed of 40 places in 30 ms of which 0 ms to minimize.
[2024-05-27 21:42:29] [INFO ] Deduced a trap composed of 210 places in 228 ms of which 3 ms to minimize.
[2024-05-27 21:42:29] [INFO ] Deduced a trap composed of 164 places in 260 ms of which 3 ms to minimize.
[2024-05-27 21:42:29] [INFO ] Deduced a trap composed of 188 places in 255 ms of which 4 ms to minimize.
[2024-05-27 21:42:30] [INFO ] Deduced a trap composed of 181 places in 245 ms of which 3 ms to minimize.
[2024-05-27 21:42:30] [INFO ] Deduced a trap composed of 190 places in 246 ms of which 4 ms to minimize.
[2024-05-27 21:42:30] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
[2024-05-27 21:42:46] [INFO ] Deduced a trap composed of 166 places in 243 ms of which 4 ms to minimize.
[2024-05-27 21:42:47] [INFO ] Deduced a trap composed of 198 places in 209 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/1612 variables, and 59 constraints, problems are : Problem set: 0 solved, 1150 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/480 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1150/1150 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
[2024-05-27 21:42:54] [INFO ] Deduced a trap composed of 306 places in 232 ms of which 3 ms to minimize.
[2024-05-27 21:42:55] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 3 ms to minimize.
[2024-05-27 21:42:55] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 3 ms to minimize.
[2024-05-27 21:42:56] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 2 ms to minimize.
[2024-05-27 21:42:56] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 2 ms to minimize.
[2024-05-27 21:42:56] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/478 variables, 6/65 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/1612 variables, and 65 constraints, problems are : Problem set: 0 solved, 1150 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/480 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1150 constraints, Known Traps: 25/25 constraints]
After SMT, in 62491ms problems are : Problem set: 0 solved, 1150 unsolved
Search for dead transitions found 0 dead transitions in 62509ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67876 ms. Remains : 480/480 places, 1152/1152 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2] Max Struct:[20]
Ending property specific reduction for PolyORBLF-COL-S02J04T10-UpperBounds-05 in 249818 ms.
Starting property specific reduction for PolyORBLF-COL-S02J04T10-UpperBounds-06
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:43:19] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
// Phase 1: matrix 1142 rows 490 cols
[2024-05-27 21:43:19] [INFO ] Computed 42 invariants in 15 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[20]
RANDOM walk for 10000 steps (4 resets) in 37 ms. (263 steps per ms)
BEST_FIRST walk for 10000 steps (2 resets) in 18 ms. (526 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[20]
[2024-05-27 21:43:19] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
[2024-05-27 21:43:19] [INFO ] Invariant cache hit.
[2024-05-27 21:43:19] [INFO ] [Real]Absence check using 13 positive place invariants in 18 ms returned sat
[2024-05-27 21:43:20] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 32 ms returned sat
[2024-05-27 21:43:20] [INFO ] [Real]Absence check using state equation in 350 ms returned sat
[2024-05-27 21:43:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:43:20] [INFO ] [Nat]Absence check using 13 positive place invariants in 13 ms returned sat
[2024-05-27 21:43:20] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 26 ms returned sat
[2024-05-27 21:43:21] [INFO ] [Nat]Absence check using state equation in 475 ms returned sat
[2024-05-27 21:43:21] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 21:43:21] [INFO ] [Nat]Added 120 Read/Feed constraints in 309 ms returned sat
[2024-05-27 21:43:21] [INFO ] Computed and/alt/rep : 470/1028/460 causal constraints (skipped 680 transitions) in 61 ms.
[2024-05-27 21:43:22] [INFO ] Deduced a trap composed of 207 places in 260 ms of which 3 ms to minimize.
[2024-05-27 21:43:22] [INFO ] Deduced a trap composed of 199 places in 274 ms of which 4 ms to minimize.
[2024-05-27 21:43:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 727 ms
[2024-05-27 21:43:22] [INFO ] Added : 28 causal constraints over 6 iterations in 1268 ms. Result :sat
Minimization took 544 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 10 out of 490 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 490/490 places, 1162/1162 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 490 transition count 1152
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 480 transition count 1152
Applied a total of 20 rules in 21 ms. Remains 480 /490 variables (removed 10) and now considering 1152/1162 (removed 10) transitions.
Running 1150 sub problems to find dead transitions.
[2024-05-27 21:43:23] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
// Phase 1: matrix 1132 rows 480 cols
[2024-05-27 21:43:23] [INFO ] Computed 42 invariants in 24 ms
[2024-05-27 21:43:23] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
[2024-05-27 21:43:32] [INFO ] Deduced a trap composed of 40 places in 170 ms of which 2 ms to minimize.
[2024-05-27 21:43:33] [INFO ] Deduced a trap composed of 41 places in 163 ms of which 2 ms to minimize.
[2024-05-27 21:43:33] [INFO ] Deduced a trap composed of 40 places in 147 ms of which 2 ms to minimize.
[2024-05-27 21:43:33] [INFO ] Deduced a trap composed of 67 places in 139 ms of which 2 ms to minimize.
[2024-05-27 21:43:33] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2024-05-27 21:43:33] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 1 ms to minimize.
[2024-05-27 21:43:33] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-05-27 21:43:33] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 2 ms to minimize.
[2024-05-27 21:43:33] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 0 ms to minimize.
[2024-05-27 21:43:33] [INFO ] Deduced a trap composed of 40 places in 31 ms of which 1 ms to minimize.
[2024-05-27 21:43:34] [INFO ] Deduced a trap composed of 182 places in 289 ms of which 3 ms to minimize.
[2024-05-27 21:43:34] [INFO ] Deduced a trap composed of 219 places in 257 ms of which 4 ms to minimize.
[2024-05-27 21:43:34] [INFO ] Deduced a trap composed of 166 places in 222 ms of which 2 ms to minimize.
[2024-05-27 21:43:34] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 2 ms to minimize.
[2024-05-27 21:43:35] [INFO ] Deduced a trap composed of 190 places in 260 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 (/ 19.0 2.0))
(s1 (/ 1.0 2.0))
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 9.0)
(s183 0.0)
(s184 1.0)
(s185 1.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 (/ 1.0 2.0))
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 (/ 1.0 2.0))
(s251 (/ 1.0 2.0))
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 1.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 1.0)
(s333 (/ 1.0 2.0))
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 4.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/1612 variables, and 55 constraints, problems are : Problem set: 0 solved, 1150 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 29/30 constraints, State Equation: 0/480 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1150/1150 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
[2024-05-27 21:43:49] [INFO ] Deduced a trap composed of 43 places in 140 ms of which 2 ms to minimize.
[2024-05-27 21:43:49] [INFO ] Deduced a trap composed of 43 places in 127 ms of which 2 ms to minimize.
[2024-05-27 21:44:02] [INFO ] Deduced a trap composed of 177 places in 239 ms of which 3 ms to minimize.
[2024-05-27 21:44:03] [INFO ] Deduced a trap composed of 96 places in 275 ms of which 3 ms to minimize.
[2024-05-27 21:44:03] [INFO ] Deduced a trap composed of 139 places in 255 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/1612 variables, and 60 constraints, problems are : Problem set: 0 solved, 1150 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 29/30 constraints, State Equation: 0/480 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1150 constraints, Known Traps: 20/20 constraints]
After SMT, in 42311ms problems are : Problem set: 0 solved, 1150 unsolved
Search for dead transitions found 0 dead transitions in 42323ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42346 ms. Remains : 480/490 places, 1152/1162 transitions.
[2024-05-27 21:44:05] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-05-27 21:44:05] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[20]
RANDOM walk for 1000000 steps (309 resets) in 3456 ms. (289 steps per ms)
BEST_FIRST walk for 1000000 steps (130 resets) in 1661 ms. (601 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[20]
[2024-05-27 21:44:10] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-05-27 21:44:10] [INFO ] Invariant cache hit.
[2024-05-27 21:44:10] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-05-27 21:44:10] [INFO ] [Real]Absence check using 12 positive and 30 generalized place invariants in 25 ms returned sat
[2024-05-27 21:44:11] [INFO ] [Real]Absence check using state equation in 500 ms returned sat
[2024-05-27 21:44:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:44:11] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2024-05-27 21:44:11] [INFO ] [Nat]Absence check using 12 positive and 30 generalized place invariants in 23 ms returned sat
[2024-05-27 21:44:11] [INFO ] [Nat]Absence check using state equation in 435 ms returned sat
[2024-05-27 21:44:11] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 21:44:12] [INFO ] [Nat]Added 120 Read/Feed constraints in 409 ms returned sat
[2024-05-27 21:44:12] [INFO ] Deduced a trap composed of 186 places in 296 ms of which 4 ms to minimize.
[2024-05-27 21:44:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 515 ms
[2024-05-27 21:44:12] [INFO ] Computed and/alt/rep : 460/1018/450 causal constraints (skipped 680 transitions) in 90 ms.
[2024-05-27 21:44:13] [INFO ] Added : 27 causal constraints over 6 iterations in 575 ms. Result :sat
Minimization took 4030 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 10 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 1152/1152 transitions.
Applied a total of 0 rules in 18 ms. Remains 480 /480 variables (removed 0) and now considering 1152/1152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 480/480 places, 1152/1152 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 1152/1152 transitions.
Applied a total of 0 rules in 17 ms. Remains 480 /480 variables (removed 0) and now considering 1152/1152 (removed 0) transitions.
[2024-05-27 21:44:17] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-05-27 21:44:17] [INFO ] Invariant cache hit.
[2024-05-27 21:44:18] [INFO ] Implicit Places using invariants in 457 ms returned []
[2024-05-27 21:44:18] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-05-27 21:44:18] [INFO ] Invariant cache hit.
[2024-05-27 21:44:18] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 21:44:25] [INFO ] Implicit Places using invariants and state equation in 6806 ms returned []
Implicit Place search using SMT with State Equation took 7264 ms to find 0 implicit places.
[2024-05-27 21:44:25] [INFO ] Redundant transitions in 21 ms returned []
Running 1150 sub problems to find dead transitions.
[2024-05-27 21:44:25] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-05-27 21:44:25] [INFO ] Invariant cache hit.
[2024-05-27 21:44:25] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
[2024-05-27 21:44:35] [INFO ] Deduced a trap composed of 58 places in 175 ms of which 3 ms to minimize.
[2024-05-27 21:44:35] [INFO ] Deduced a trap composed of 68 places in 160 ms of which 3 ms to minimize.
[2024-05-27 21:44:35] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 2 ms to minimize.
[2024-05-27 21:44:35] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 2 ms to minimize.
[2024-05-27 21:44:36] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 2 ms to minimize.
[2024-05-27 21:44:36] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-05-27 21:44:36] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-05-27 21:44:36] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-05-27 21:44:36] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-05-27 21:44:36] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-05-27 21:44:36] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 0 ms to minimize.
[2024-05-27 21:44:36] [INFO ] Deduced a trap composed of 218 places in 286 ms of which 4 ms to minimize.
[2024-05-27 21:44:37] [INFO ] Deduced a trap composed of 181 places in 278 ms of which 3 ms to minimize.
[2024-05-27 21:44:37] [INFO ] Deduced a trap composed of 198 places in 269 ms of which 4 ms to minimize.
[2024-05-27 21:44:38] [INFO ] Deduced a trap composed of 190 places in 220 ms of which 3 ms to minimize.
[2024-05-27 21:44:38] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/478 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
SMT process timed out in 32705ms, After SMT, problems are : Problem set: 0 solved, 1150 unsolved
Search for dead transitions found 0 dead transitions in 32724ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40038 ms. Remains : 480/480 places, 1152/1152 transitions.
RANDOM walk for 40000 steps (12 resets) in 333 ms. (119 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (10 resets) in 98 ms. (404 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (12 resets) in 97 ms. (408 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 225395 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :0 out of 2
Probabilistic random walk after 225395 steps, saw 128920 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
[2024-05-27 21:45:01] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-05-27 21:45:01] [INFO ] Invariant cache hit.
[2024-05-27 21:45:01] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 402/412 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 3 (OVERLAPS) 16/428 variables, 10/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 49/477 variables, 18/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-27 21:45:01] [INFO ] Deduced a trap composed of 40 places in 160 ms of which 2 ms to minimize.
[2024-05-27 21:45:01] [INFO ] Deduced a trap composed of 40 places in 137 ms of which 2 ms to minimize.
[2024-05-27 21:45:01] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 2 ms to minimize.
[2024-05-27 21:45:01] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 2 ms to minimize.
[2024-05-27 21:45:01] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 2 ms to minimize.
[2024-05-27 21:45:01] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 2 ms to minimize.
[2024-05-27 21:45:02] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 7/47 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/477 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/478 variables, 1/48 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/478 variables, 0/48 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1132/1610 variables, 478/526 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1610 variables, 120/646 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1610 variables, 0/646 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/1612 variables, 2/648 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1612 variables, 1/649 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1612 variables, 0/649 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1612 variables, 0/649 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1612/1612 variables, and 649 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1635 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 480/480 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 402/412 variables, 12/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/428 variables, 10/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-27 21:45:03] [INFO ] Deduced a trap composed of 162 places in 224 ms of which 4 ms to minimize.
[2024-05-27 21:45:03] [INFO ] Deduced a trap composed of 177 places in 193 ms of which 4 ms to minimize.
[2024-05-27 21:45:03] [INFO ] Deduced a trap composed of 181 places in 189 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 3/25 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 49/477 variables, 18/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/477 variables, 7/50 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-27 21:45:03] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 1 ms to minimize.
[2024-05-27 21:45:03] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/477 variables, 2/52 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/477 variables, 0/52 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/478 variables, 1/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/478 variables, 0/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1132/1610 variables, 478/531 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1610/1612 variables, and 651 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2177 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 478/480 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 12/12 constraints]
After SMT, in 3822ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 28 ms.
Support contains 10 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 1152/1152 transitions.
Applied a total of 0 rules in 25 ms. Remains 480 /480 variables (removed 0) and now considering 1152/1152 (removed 0) transitions.
Running 1150 sub problems to find dead transitions.
[2024-05-27 21:45:04] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-05-27 21:45:04] [INFO ] Invariant cache hit.
[2024-05-27 21:45:04] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
[2024-05-27 21:45:15] [INFO ] Deduced a trap composed of 58 places in 161 ms of which 2 ms to minimize.
[2024-05-27 21:45:15] [INFO ] Deduced a trap composed of 68 places in 132 ms of which 3 ms to minimize.
[2024-05-27 21:45:15] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 2 ms to minimize.
[2024-05-27 21:45:15] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 2 ms to minimize.
[2024-05-27 21:45:15] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2024-05-27 21:45:15] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-05-27 21:45:15] [INFO ] Deduced a trap composed of 40 places in 30 ms of which 0 ms to minimize.
[2024-05-27 21:45:15] [INFO ] Deduced a trap composed of 40 places in 30 ms of which 1 ms to minimize.
[2024-05-27 21:45:15] [INFO ] Deduced a trap composed of 40 places in 29 ms of which 1 ms to minimize.
[2024-05-27 21:45:15] [INFO ] Deduced a trap composed of 40 places in 28 ms of which 0 ms to minimize.
[2024-05-27 21:45:15] [INFO ] Deduced a trap composed of 40 places in 31 ms of which 1 ms to minimize.
[2024-05-27 21:45:16] [INFO ] Deduced a trap composed of 218 places in 262 ms of which 3 ms to minimize.
[2024-05-27 21:45:16] [INFO ] Deduced a trap composed of 181 places in 220 ms of which 4 ms to minimize.
[2024-05-27 21:45:17] [INFO ] Deduced a trap composed of 198 places in 218 ms of which 2 ms to minimize.
[2024-05-27 21:45:17] [INFO ] Deduced a trap composed of 190 places in 246 ms of which 4 ms to minimize.
[2024-05-27 21:45:17] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/1612 variables, and 56 constraints, problems are : Problem set: 0 solved, 1150 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 29/30 constraints, State Equation: 0/480 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1150/1150 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
[2024-05-27 21:45:29] [INFO ] Deduced a trap composed of 83 places in 152 ms of which 3 ms to minimize.
[2024-05-27 21:45:33] [INFO ] Deduced a trap composed of 67 places in 183 ms of which 3 ms to minimize.
[2024-05-27 21:45:35] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 2 ms to minimize.
[2024-05-27 21:45:39] [INFO ] Deduced a trap composed of 166 places in 200 ms of which 3 ms to minimize.
[2024-05-27 21:45:39] [INFO ] Deduced a trap composed of 171 places in 228 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/478 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/1612 variables, and 61 constraints, problems are : Problem set: 0 solved, 1150 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 29/30 constraints, State Equation: 0/480 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1150 constraints, Known Traps: 21/21 constraints]
After SMT, in 42613ms problems are : Problem set: 0 solved, 1150 unsolved
Search for dead transitions found 0 dead transitions in 42637ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42665 ms. Remains : 480/480 places, 1152/1152 transitions.
RANDOM walk for 40000 steps (12 resets) in 204 ms. (195 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (9 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 304406 steps, run timeout after 3001 ms. (steps per millisecond=101 ) properties seen :0 out of 1
Probabilistic random walk after 304406 steps, saw 171935 distinct states, run finished after 3002 ms. (steps per millisecond=101 ) properties seen :0
[2024-05-27 21:45:50] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-05-27 21:45:50] [INFO ] Invariant cache hit.
[2024-05-27 21:45:50] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 402/412 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 16/428 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 49/477 variables, 18/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/478 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1132/1610 variables, 478/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1610 variables, 120/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1610 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/1612 variables, 2/641 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1612 variables, 1/642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1612 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1612 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1612/1612 variables, and 642 constraints, problems are : Problem set: 0 solved, 1 unsolved in 764 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 480/480 constraints, ReadFeed: 120/120 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 402/412 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/428 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 21:45:51] [INFO ] Deduced a trap composed of 162 places in 203 ms of which 3 ms to minimize.
[2024-05-27 21:45:51] [INFO ] Deduced a trap composed of 177 places in 211 ms of which 3 ms to minimize.
[2024-05-27 21:45:52] [INFO ] Deduced a trap composed of 181 places in 218 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 49/477 variables, 18/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 21:45:52] [INFO ] Deduced a trap composed of 40 places in 152 ms of which 3 ms to minimize.
[2024-05-27 21:45:52] [INFO ] Deduced a trap composed of 40 places in 151 ms of which 3 ms to minimize.
[2024-05-27 21:45:52] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 2 ms to minimize.
[2024-05-27 21:45:52] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 1 ms to minimize.
[2024-05-27 21:45:52] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 2 ms to minimize.
[2024-05-27 21:45:52] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2024-05-27 21:45:53] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/477 variables, 7/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/477 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/478 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/478 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1132/1610 variables, 478/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1610 variables, 120/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1610 variables, 1/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1610 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/1612 variables, 2/652 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1612 variables, 1/653 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1612 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1612 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1612/1612 variables, and 653 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3525 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 480/480 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 4299ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 29 ms.
Support contains 10 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 1152/1152 transitions.
Applied a total of 0 rules in 28 ms. Remains 480 /480 variables (removed 0) and now considering 1152/1152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 480/480 places, 1152/1152 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 1152/1152 transitions.
Applied a total of 0 rules in 20 ms. Remains 480 /480 variables (removed 0) and now considering 1152/1152 (removed 0) transitions.
[2024-05-27 21:45:55] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-05-27 21:45:55] [INFO ] Invariant cache hit.
[2024-05-27 21:45:55] [INFO ] Implicit Places using invariants in 384 ms returned []
[2024-05-27 21:45:55] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-05-27 21:45:55] [INFO ] Invariant cache hit.
[2024-05-27 21:45:56] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 21:46:02] [INFO ] Implicit Places using invariants and state equation in 6764 ms returned []
Implicit Place search using SMT with State Equation took 7150 ms to find 0 implicit places.
[2024-05-27 21:46:02] [INFO ] Redundant transitions in 19 ms returned []
Running 1150 sub problems to find dead transitions.
[2024-05-27 21:46:02] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2024-05-27 21:46:02] [INFO ] Invariant cache hit.
[2024-05-27 21:46:02] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
[2024-05-27 21:46:11] [INFO ] Deduced a trap composed of 58 places in 165 ms of which 3 ms to minimize.
[2024-05-27 21:46:11] [INFO ] Deduced a trap composed of 68 places in 165 ms of which 2 ms to minimize.
[2024-05-27 21:46:12] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 2 ms to minimize.
[2024-05-27 21:46:12] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 2 ms to minimize.
[2024-05-27 21:46:12] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
[2024-05-27 21:46:12] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-05-27 21:46:12] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-05-27 21:46:12] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
[2024-05-27 21:46:12] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 1 ms to minimize.
[2024-05-27 21:46:12] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 1 ms to minimize.
[2024-05-27 21:46:12] [INFO ] Deduced a trap composed of 40 places in 121 ms of which 0 ms to minimize.
[2024-05-27 21:46:13] [INFO ] Deduced a trap composed of 218 places in 281 ms of which 3 ms to minimize.
[2024-05-27 21:46:13] [INFO ] Deduced a trap composed of 181 places in 277 ms of which 4 ms to minimize.
[2024-05-27 21:46:14] [INFO ] Deduced a trap composed of 198 places in 262 ms of which 3 ms to minimize.
[2024-05-27 21:46:14] [INFO ] Deduced a trap composed of 190 places in 228 ms of which 3 ms to minimize.
[2024-05-27 21:46:14] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/478 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1150 unsolved
SMT process timed out in 32401ms, After SMT, problems are : Problem set: 0 solved, 1150 unsolved
Search for dead transitions found 0 dead transitions in 32421ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39620 ms. Remains : 480/480 places, 1152/1152 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 480 transition count 1132
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 40 place count 470 transition count 1172
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 1 with 40 rules applied. Total rules applied 80 place count 470 transition count 1132
Free-agglomeration rule applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 90 place count 470 transition count 1122
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 100 place count 460 transition count 1122
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 110 place count 460 transition count 1112
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 120 place count 450 transition count 1112
Applied a total of 120 rules in 79 ms. Remains 450 /480 variables (removed 30) and now considering 1112/1152 (removed 40) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1112 rows 450 cols
[2024-05-27 21:46:34] [INFO ] Computed 42 invariants in 11 ms
[2024-05-27 21:46:34] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-27 21:46:34] [INFO ] [Real]Absence check using 14 positive and 28 generalized place invariants in 17 ms returned sat
[2024-05-27 21:46:34] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 21:46:34] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-27 21:46:34] [INFO ] [Nat]Absence check using 14 positive and 28 generalized place invariants in 17 ms returned sat
[2024-05-27 21:46:39] [INFO ] After 4914ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-27 21:46:40] [INFO ] Deduced a trap composed of 169 places in 292 ms of which 3 ms to minimize.
[2024-05-27 21:46:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 413 ms
TRAPS : Iteration 1
[2024-05-27 21:46:42] [INFO ] After 7082ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-27 21:46:43] [INFO ] After 8521ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 8723 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2] Max Struct:[20]
Ending property specific reduction for PolyORBLF-COL-S02J04T10-UpperBounds-06 in 203559 ms.
Starting property specific reduction for PolyORBLF-COL-S02J04T10-UpperBounds-15
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:46:43] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
// Phase 1: matrix 1142 rows 490 cols
[2024-05-27 21:46:43] [INFO ] Computed 42 invariants in 27 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[20]
RANDOM walk for 10000 steps (2 resets) in 60 ms. (163 steps per ms)
BEST_FIRST walk for 10000 steps (4 resets) in 25 ms. (384 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[20]
[2024-05-27 21:46:43] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
[2024-05-27 21:46:43] [INFO ] Invariant cache hit.
[2024-05-27 21:46:43] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-05-27 21:46:43] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 23 ms returned sat
[2024-05-27 21:46:43] [INFO ] [Real]Absence check using state equation in 362 ms returned sat
[2024-05-27 21:46:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:46:44] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-05-27 21:46:44] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 22 ms returned sat
[2024-05-27 21:46:44] [INFO ] [Nat]Absence check using state equation in 630 ms returned sat
[2024-05-27 21:46:44] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 21:46:45] [INFO ] [Nat]Added 120 Read/Feed constraints in 230 ms returned sat
[2024-05-27 21:46:45] [INFO ] Computed and/alt/rep : 470/1028/460 causal constraints (skipped 680 transitions) in 74 ms.
[2024-05-27 21:46:45] [INFO ] Deduced a trap composed of 172 places in 227 ms of which 3 ms to minimize.
[2024-05-27 21:46:46] [INFO ] Deduced a trap composed of 23 places in 278 ms of which 3 ms to minimize.
[2024-05-27 21:46:46] [INFO ] Deduced a trap composed of 173 places in 301 ms of which 4 ms to minimize.
[2024-05-27 21:46:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1088 ms
[2024-05-27 21:46:46] [INFO ] Added : 40 causal constraints over 9 iterations in 1914 ms. Result :sat
Minimization took 544 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 10 out of 490 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 490/490 places, 1162/1162 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 480 transition count 1152
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 30 place count 480 transition count 1142
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 40 place count 470 transition count 1142
Applied a total of 40 rules in 79 ms. Remains 470 /490 variables (removed 20) and now considering 1142/1162 (removed 20) transitions.
Running 1140 sub problems to find dead transitions.
[2024-05-27 21:46:47] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
// Phase 1: matrix 1122 rows 470 cols
[2024-05-27 21:46:47] [INFO ] Computed 42 invariants in 28 ms
[2024-05-27 21:46:47] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
[2024-05-27 21:46:57] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 1 ms to minimize.
[2024-05-27 21:46:57] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2024-05-27 21:46:57] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-27 21:46:57] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 0 ms to minimize.
[2024-05-27 21:46:58] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-05-27 21:46:58] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-27 21:46:58] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-27 21:46:58] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-05-27 21:46:58] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
[2024-05-27 21:46:59] [INFO ] Deduced a trap composed of 39 places in 31 ms of which 1 ms to minimize.
[2024-05-27 21:47:00] [INFO ] Deduced a trap composed of 37 places in 145 ms of which 2 ms to minimize.
[2024-05-27 21:47:01] [INFO ] Deduced a trap composed of 280 places in 256 ms of which 4 ms to minimize.
[2024-05-27 21:47:06] [INFO ] Deduced a trap composed of 166 places in 244 ms of which 3 ms to minimize.
[2024-05-27 21:47:06] [INFO ] Deduced a trap composed of 153 places in 259 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 468/1592 variables, and 54 constraints, problems are : Problem set: 0 solved, 1140 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/470 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1140/1140 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/468 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
[2024-05-27 21:47:18] [INFO ] Deduced a trap composed of 59 places in 125 ms of which 3 ms to minimize.
[2024-05-27 21:47:24] [INFO ] Deduced a trap composed of 85 places in 275 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/468 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 468/1592 variables, and 56 constraints, problems are : Problem set: 0 solved, 1140 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/470 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1140 constraints, Known Traps: 16/16 constraints]
After SMT, in 42625ms problems are : Problem set: 0 solved, 1140 unsolved
Search for dead transitions found 0 dead transitions in 42642ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42725 ms. Remains : 470/490 places, 1142/1162 transitions.
[2024-05-27 21:47:30] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
[2024-05-27 21:47:30] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[20]
RANDOM walk for 1000000 steps (338 resets) in 3816 ms. (261 steps per ms)
BEST_FIRST walk for 1000001 steps (141 resets) in 1671 ms. (598 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[20]
[2024-05-27 21:47:35] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
[2024-05-27 21:47:35] [INFO ] Invariant cache hit.
[2024-05-27 21:47:35] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-05-27 21:47:35] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 20 ms returned sat
[2024-05-27 21:47:36] [INFO ] [Real]Absence check using state equation in 571 ms returned sat
[2024-05-27 21:47:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:47:36] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-05-27 21:47:36] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 18 ms returned sat
[2024-05-27 21:47:37] [INFO ] [Nat]Absence check using state equation in 706 ms returned sat
[2024-05-27 21:47:37] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 21:47:37] [INFO ] [Nat]Added 120 Read/Feed constraints in 276 ms returned sat
[2024-05-27 21:47:37] [INFO ] Computed and/alt/rep : 360/808/350 causal constraints (skipped 770 transitions) in 75 ms.
[2024-05-27 21:47:38] [INFO ] Added : 22 causal constraints over 5 iterations in 541 ms. Result :sat
Minimization took 3574 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 10 out of 470 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 470/470 places, 1142/1142 transitions.
Applied a total of 0 rules in 17 ms. Remains 470 /470 variables (removed 0) and now considering 1142/1142 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 470/470 places, 1142/1142 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 470/470 places, 1142/1142 transitions.
Applied a total of 0 rules in 16 ms. Remains 470 /470 variables (removed 0) and now considering 1142/1142 (removed 0) transitions.
[2024-05-27 21:47:42] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
[2024-05-27 21:47:42] [INFO ] Invariant cache hit.
[2024-05-27 21:47:42] [INFO ] Implicit Places using invariants in 442 ms returned []
[2024-05-27 21:47:42] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
[2024-05-27 21:47:42] [INFO ] Invariant cache hit.
[2024-05-27 21:47:43] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 21:47:48] [INFO ] Implicit Places using invariants and state equation in 6255 ms returned []
Implicit Place search using SMT with State Equation took 6699 ms to find 0 implicit places.
[2024-05-27 21:47:48] [INFO ] Redundant transitions in 19 ms returned []
Running 1140 sub problems to find dead transitions.
[2024-05-27 21:47:48] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
[2024-05-27 21:47:48] [INFO ] Invariant cache hit.
[2024-05-27 21:47:48] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
[2024-05-27 21:47:58] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 2 ms to minimize.
[2024-05-27 21:47:58] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2024-05-27 21:47:59] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2024-05-27 21:47:59] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-05-27 21:47:59] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-27 21:47:59] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-05-27 21:47:59] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
[2024-05-27 21:47:59] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 0 ms to minimize.
[2024-05-27 21:47:59] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2024-05-27 21:47:59] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
[2024-05-27 21:47:59] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
[2024-05-27 21:47:59] [INFO ] Deduced a trap composed of 182 places in 255 ms of which 4 ms to minimize.
[2024-05-27 21:48:02] [INFO ] Deduced a trap composed of 280 places in 214 ms of which 3 ms to minimize.
[2024-05-27 21:48:06] [INFO ] Deduced a trap composed of 166 places in 238 ms of which 4 ms to minimize.
[2024-05-27 21:48:07] [INFO ] Deduced a trap composed of 176 places in 250 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/468 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 468/1592 variables, and 55 constraints, problems are : Problem set: 0 solved, 1140 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/470 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1140/1140 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/468 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
[2024-05-27 21:48:26] [INFO ] Deduced a trap composed of 59 places in 138 ms of which 2 ms to minimize.
[2024-05-27 21:48:26] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 3 ms to minimize.
[2024-05-27 21:48:35] [INFO ] Deduced a trap composed of 171 places in 252 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/468 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
[2024-05-27 21:48:45] [INFO ] Deduced a trap composed of 172 places in 244 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/468 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 468/1592 variables, and 59 constraints, problems are : Problem set: 0 solved, 1140 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/470 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1140 constraints, Known Traps: 19/19 constraints]
After SMT, in 62539ms problems are : Problem set: 0 solved, 1140 unsolved
Search for dead transitions found 0 dead transitions in 62558ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69305 ms. Remains : 470/470 places, 1142/1142 transitions.
RANDOM walk for 40000 steps (22 resets) in 307 ms. (129 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 115 ms. (344 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (10 resets) in 100 ms. (396 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 230395 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :0 out of 2
Probabilistic random walk after 230395 steps, saw 130885 distinct states, run finished after 3001 ms. (steps per millisecond=76 ) properties seen :0
[2024-05-27 21:48:54] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
[2024-05-27 21:48:54] [INFO ] Invariant cache hit.
[2024-05-27 21:48:54] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 1 (OVERLAPS) 177/187 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/214 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/224 variables, 5/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 237/461 variables, 26/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 0/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 4/465 variables, 4/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/465 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/468 variables, 3/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/468 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1122/1590 variables, 468/509 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1590 variables, 120/629 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1590 variables, 0/629 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1592 variables, 2/631 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1592 variables, 1/632 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1592 variables, 0/632 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1592 variables, 0/632 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1592/1592 variables, and 632 constraints, problems are : Problem set: 1 solved, 1 unsolved in 955 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 470/470 constraints, ReadFeed: 120/120 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/10 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 177/187 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/214 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/224 variables, 5/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 237/461 variables, 26/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-27 21:48:55] [INFO ] Deduced a trap composed of 40 places in 134 ms of which 2 ms to minimize.
[2024-05-27 21:48:55] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 2 ms to minimize.
[2024-05-27 21:48:56] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 1 ms to minimize.
[2024-05-27 21:48:56] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 1 ms to minimize.
[2024-05-27 21:48:56] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 2 ms to minimize.
[2024-05-27 21:48:56] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 6/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/461 variables, 0/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/465 variables, 4/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/465 variables, 0/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/468 variables, 3/47 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/468 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1590/1592 variables, and 515 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1478 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 468/470 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 2443ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 37 ms.
Support contains 10 out of 470 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 470/470 places, 1142/1142 transitions.
Applied a total of 0 rules in 23 ms. Remains 470 /470 variables (removed 0) and now considering 1142/1142 (removed 0) transitions.
Running 1140 sub problems to find dead transitions.
[2024-05-27 21:48:57] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
[2024-05-27 21:48:57] [INFO ] Invariant cache hit.
[2024-05-27 21:48:57] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
[2024-05-27 21:49:07] [INFO ] Deduced a trap composed of 37 places in 148 ms of which 2 ms to minimize.
[2024-05-27 21:49:07] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
[2024-05-27 21:49:07] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2024-05-27 21:49:07] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 0 ms to minimize.
[2024-05-27 21:49:07] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 1 ms to minimize.
[2024-05-27 21:49:07] [INFO ] Deduced a trap composed of 39 places in 30 ms of which 1 ms to minimize.
[2024-05-27 21:49:07] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
[2024-05-27 21:49:07] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
[2024-05-27 21:49:07] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-05-27 21:49:07] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 0 ms to minimize.
[2024-05-27 21:49:07] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2024-05-27 21:49:08] [INFO ] Deduced a trap composed of 182 places in 268 ms of which 3 ms to minimize.
[2024-05-27 21:49:11] [INFO ] Deduced a trap composed of 280 places in 232 ms of which 4 ms to minimize.
[2024-05-27 21:49:14] [INFO ] Deduced a trap composed of 166 places in 241 ms of which 3 ms to minimize.
[2024-05-27 21:49:15] [INFO ] Deduced a trap composed of 176 places in 256 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/468 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 468/1592 variables, and 55 constraints, problems are : Problem set: 0 solved, 1140 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/470 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1140/1140 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/468 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
[2024-05-27 21:49:24] [INFO ] Deduced a trap composed of 59 places in 123 ms of which 3 ms to minimize.
[2024-05-27 21:49:24] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-05-27 21:49:32] [INFO ] Deduced a trap composed of 171 places in 256 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/468 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 468/1592 variables, and 58 constraints, problems are : Problem set: 0 solved, 1140 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/470 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1140 constraints, Known Traps: 18/18 constraints]
After SMT, in 42635ms problems are : Problem set: 0 solved, 1140 unsolved
Search for dead transitions found 0 dead transitions in 42651ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42678 ms. Remains : 470/470 places, 1142/1142 transitions.
RANDOM walk for 40000 steps (18 resets) in 265 ms. (150 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (9 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 309305 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :0 out of 1
Probabilistic random walk after 309305 steps, saw 173484 distinct states, run finished after 3001 ms. (steps per millisecond=103 ) properties seen :0
[2024-05-27 21:49:42] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
[2024-05-27 21:49:42] [INFO ] Invariant cache hit.
[2024-05-27 21:49:42] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 177/187 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 27/214 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/224 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 237/461 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/465 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/465 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/468 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/468 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1122/1590 variables, 468/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1590 variables, 120/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1590 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1592 variables, 2/631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1592 variables, 1/632 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1592 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1592 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1592/1592 variables, and 632 constraints, problems are : Problem set: 0 solved, 1 unsolved in 764 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 470/470 constraints, ReadFeed: 120/120 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 177/187 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/214 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/224 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 237/461 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 21:49:43] [INFO ] Deduced a trap composed of 40 places in 147 ms of which 2 ms to minimize.
[2024-05-27 21:49:44] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 2 ms to minimize.
[2024-05-27 21:49:44] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 2 ms to minimize.
[2024-05-27 21:49:44] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 2 ms to minimize.
[2024-05-27 21:49:44] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 2 ms to minimize.
[2024-05-27 21:49:44] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 6/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/461 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/465 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/465 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/468 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/468 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1122/1590 variables, 468/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1590 variables, 120/635 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1590 variables, 1/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1590 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/1592 variables, 2/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1592 variables, 1/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1592 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1592 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1592/1592 variables, and 639 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2661 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 470/470 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 3435ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 81 ms.
Support contains 10 out of 470 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 470/470 places, 1142/1142 transitions.
Applied a total of 0 rules in 20 ms. Remains 470 /470 variables (removed 0) and now considering 1142/1142 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 470/470 places, 1142/1142 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 470/470 places, 1142/1142 transitions.
Applied a total of 0 rules in 18 ms. Remains 470 /470 variables (removed 0) and now considering 1142/1142 (removed 0) transitions.
[2024-05-27 21:49:46] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
[2024-05-27 21:49:46] [INFO ] Invariant cache hit.
[2024-05-27 21:49:46] [INFO ] Implicit Places using invariants in 428 ms returned []
[2024-05-27 21:49:46] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
[2024-05-27 21:49:46] [INFO ] Invariant cache hit.
[2024-05-27 21:49:47] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 21:49:52] [INFO ] Implicit Places using invariants and state equation in 6056 ms returned []
Implicit Place search using SMT with State Equation took 6486 ms to find 0 implicit places.
[2024-05-27 21:49:52] [INFO ] Redundant transitions in 20 ms returned []
Running 1140 sub problems to find dead transitions.
[2024-05-27 21:49:52] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
[2024-05-27 21:49:52] [INFO ] Invariant cache hit.
[2024-05-27 21:49:52] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
[2024-05-27 21:50:03] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 2 ms to minimize.
[2024-05-27 21:50:03] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 1 ms to minimize.
[2024-05-27 21:50:03] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 1 ms to minimize.
[2024-05-27 21:50:03] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 0 ms to minimize.
[2024-05-27 21:50:03] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 1 ms to minimize.
[2024-05-27 21:50:03] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 0 ms to minimize.
[2024-05-27 21:50:03] [INFO ] Deduced a trap composed of 39 places in 25 ms of which 0 ms to minimize.
[2024-05-27 21:50:03] [INFO ] Deduced a trap composed of 39 places in 25 ms of which 0 ms to minimize.
[2024-05-27 21:50:03] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-27 21:50:03] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 0 ms to minimize.
[2024-05-27 21:50:03] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-05-27 21:50:04] [INFO ] Deduced a trap composed of 182 places in 245 ms of which 3 ms to minimize.
[2024-05-27 21:50:07] [INFO ] Deduced a trap composed of 280 places in 244 ms of which 3 ms to minimize.
[2024-05-27 21:50:10] [INFO ] Deduced a trap composed of 166 places in 237 ms of which 3 ms to minimize.
[2024-05-27 21:50:11] [INFO ] Deduced a trap composed of 176 places in 233 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/468 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 468/1592 variables, and 55 constraints, problems are : Problem set: 0 solved, 1140 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/470 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1140/1140 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/468 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
[2024-05-27 21:50:30] [INFO ] Deduced a trap composed of 59 places in 121 ms of which 3 ms to minimize.
[2024-05-27 21:50:30] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 3 ms to minimize.
[2024-05-27 21:50:38] [INFO ] Deduced a trap composed of 171 places in 279 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/468 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
[2024-05-27 21:50:49] [INFO ] Deduced a trap composed of 172 places in 235 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/468 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 468/1592 variables, and 59 constraints, problems are : Problem set: 0 solved, 1140 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/470 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1140 constraints, Known Traps: 19/19 constraints]
After SMT, in 62590ms problems are : Problem set: 0 solved, 1140 unsolved
Search for dead transitions found 0 dead transitions in 62609ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69145 ms. Remains : 470/470 places, 1142/1142 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2] Max Struct:[20]
Ending property specific reduction for PolyORBLF-COL-S02J04T10-UpperBounds-15 in 252180 ms.
[2024-05-27 21:50:55] [INFO ] Flatten gal took : 136 ms
[2024-05-27 21:50:55] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-05-27 21:50:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 490 places, 1162 transitions and 5800 arcs took 8 ms.
Total runtime 1046344 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running PolyORBLF-COL-S02J04T10
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/419/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 490
TRANSITIONS: 1162
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.029s, Sys 0.000s]
SAVING FILE /home/mcc/execution/419/model (.net / .def) ...
EXPORT TIME: [User 0.004s, Sys 0.000s]
----------------------------------------------------------------------
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: 2410
MODEL NAME: /home/mcc/execution/419/model
490 places, 1162 transitions.
No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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-S02J04T10"
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-S02J04T10, 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-171654445200093"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J04T10.tgz
mv PolyORBLF-COL-S02J04T10 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 ;