Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.9K Apr 11 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 11 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 11 16:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 11 16:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.1K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K 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 17K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 11 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 11 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K May 18 16:43 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717248960105

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J06T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:36:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 13:36:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:36:01] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 13:36:01] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 13:36:02] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 643 ms
[2024-06-01 13:36:02] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 536 PT places and 1096.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2024-06-01 13:36:02] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-06-01 13:36:02] [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-06-01 13:36:02] [INFO ] Computed 26 invariants in 10 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 0, 1, 5, 0, 0, 0, 0, 0, 5, 0, 10, 0, 0] Max Struct:[26, 20, 6, 6, 1, 6, 1, 2, 2, 6, 6, 6, 26, 18, 1, 2]
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-06-01 13:36:02] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-06-01 13:36:02] [INFO ] Computed 26 invariants in 7 ms
[2024-06-01 13:36:02] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2024-06-01 13:36:02] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 10 ms returned sat
[2024-06-01 13:36:02] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-06-01 13:36:02] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 13:36:02] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-06-01 13:36:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:36:02] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:36:02] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-06-01 13:36:02] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-06-01 13:36:02] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2024-06-01 13:36:02] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 10 ms.
[2024-06-01 13:36:02] [INFO ] Added : 24 causal constraints over 5 iterations in 56 ms. Result :sat
Minimization took 27 ms.
[2024-06-01 13:36:02] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:36:02] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-06-01 13:36:02] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-06-01 13:36:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:36:02] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:36:02] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-06-01 13:36:02] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-06-01 13:36:02] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2024-06-01 13:36:02] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 13:36:02] [INFO ] Added : 54 causal constraints over 11 iterations in 83 ms. Result :sat
Minimization took 20 ms.
[2024-06-01 13:36:03] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:36:03] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-06-01 13:36:03] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-06-01 13:36:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:36:03] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-06-01 13:36:03] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-06-01 13:36:03] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-06-01 13:36:03] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2024-06-01 13:36:03] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 13:36:03] [INFO ] Added : 43 causal constraints over 10 iterations in 65 ms. Result :sat
Minimization took 38 ms.
[2024-06-01 13:36:03] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-06-01 13:36:03] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-06-01 13:36:03] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-06-01 13:36:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:36:03] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:36:03] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-06-01 13:36:03] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-06-01 13:36:03] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-06-01 13:36:03] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 13 ms to minimize.
[2024-06-01 13:36:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2024-06-01 13:36:03] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 13:36:03] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 2 ms to minimize.
[2024-06-01 13:36:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2024-06-01 13:36:03] [INFO ] Added : 59 causal constraints over 12 iterations in 141 ms. Result :sat
Minimization took 26 ms.
[2024-06-01 13:36:03] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:36:03] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2024-06-01 13:36:03] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-06-01 13:36:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:36:03] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:36:03] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-06-01 13:36:03] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-06-01 13:36:03] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-06-01 13:36:03] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:36:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2024-06-01 13:36:03] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-06-01 13:36:03] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-06-01 13:36:03] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-06-01 13:36:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:36:03] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:36:03] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-06-01 13:36:03] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-06-01 13:36:03] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2024-06-01 13:36:03] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 13:36:03] [INFO ] Added : 34 causal constraints over 7 iterations in 42 ms. Result :sat
Minimization took 20 ms.
[2024-06-01 13:36:03] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:36:03] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-06-01 13:36:03] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-06-01 13:36:03] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-06-01 13:36:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:36:03] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-06-01 13:36:03] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-06-01 13:36:04] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-06-01 13:36:04] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2024-06-01 13:36:04] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:36:04] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2024-06-01 13:36:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 81 ms
[2024-06-01 13:36:04] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 13:36:04] [INFO ] Added : 57 causal constraints over 12 iterations in 70 ms. Result :sat
Minimization took 22 ms.
[2024-06-01 13:36:04] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:36:04] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-06-01 13:36:04] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-06-01 13:36:04] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-06-01 13:36:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:36:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-06-01 13:36:04] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-06-01 13:36:04] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-06-01 13:36:04] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2024-06-01 13:36:04] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-06-01 13:36:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2024-06-01 13:36:04] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 13:36:04] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-01 13:36:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2024-06-01 13:36:04] [INFO ] Added : 54 causal constraints over 11 iterations in 102 ms. Result :sat
Minimization took 21 ms.
[2024-06-01 13:36:04] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-06-01 13:36:04] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-06-01 13:36:04] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-06-01 13:36:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:36:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:36:04] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-06-01 13:36:04] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-06-01 13:36:04] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-06-01 13:36:04] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 13:36:04] [INFO ] Deduced a trap composed of 35 places in 27 ms of which 1 ms to minimize.
[2024-06-01 13:36:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2024-06-01 13:36:04] [INFO ] Added : 60 causal constraints over 14 iterations in 139 ms. Result :sat
Minimization took 19 ms.
[2024-06-01 13:36:04] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:36:04] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-06-01 13:36:04] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-06-01 13:36:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:36:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-06-01 13:36:04] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-06-01 13:36:04] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-06-01 13:36:04] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2024-06-01 13:36:04] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 13:36:04] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:36:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2024-06-01 13:36:04] [INFO ] Added : 21 causal constraints over 5 iterations in 83 ms. Result :sat
Minimization took 43 ms.
[2024-06-01 13:36:05] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-06-01 13:36:05] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2024-06-01 13:36:05] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-06-01 13:36:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:36:05] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:36:05] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-06-01 13:36:05] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-06-01 13:36:05] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2024-06-01 13:36:05] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-06-01 13:36:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2024-06-01 13:36:05] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:36:05] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-06-01 13:36:05] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-06-01 13:36:05] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-06-01 13:36:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:36:05] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:36:05] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-06-01 13:36:05] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-06-01 13:36:05] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2024-06-01 13:36:05] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 13:36:05] [INFO ] Added : 11 causal constraints over 3 iterations in 21 ms. Result :sat
Minimization took 20 ms.
[2024-06-01 13:36:05] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-06-01 13:36:05] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 1 ms returned unsat
[2024-06-01 13:36:05] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-06-01 13:36:05] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-06-01 13:36:05] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-06-01 13:36:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:36:05] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-06-01 13:36:05] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-06-01 13:36:05] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-06-01 13:36:05] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-06-01 13:36:05] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 13:36:05] [INFO ] Added : 54 causal constraints over 11 iterations in 54 ms. Result :sat
Minimization took 19 ms.
[2024-06-01 13:36:05] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-06-01 13:36:05] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2024-06-01 13:36:05] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-06-01 13:36:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:36:05] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-06-01 13:36:05] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-06-01 13:36:05] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-06-01 13:36:05] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-06-01 13:36:05] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 13:36:05] [INFO ] Added : 58 causal constraints over 12 iterations in 67 ms. Result :sat
Minimization took 51 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 5, 0, 0, 0, 0, 0, 5, 0, 10, 0, 0] Max Struct:[26, 20, 6, 6, 5, 1, 2, 2, 6, 6, 5, 26, 10, 1, 2]
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-13 10 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-11 5 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-05 5 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-06-01 13:36:05] [INFO ] Unfolded HLPN to a Petri net with 536 places and 1064 transitions 4866 arcs in 46 ms.
[2024-06-01 13:36:05] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[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]
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] Max Struct:[26, 20, 6, 6, 1, 2, 2, 6, 6, 26, 1, 2]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[26, 20, 6, 6, 1, 2, 2, 6, 6, 26, 1, 2]
[2024-06-01 13:36:05] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 536 cols
[2024-06-01 13:36:05] [INFO ] Computed 50 invariants in 55 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[26, 20, 6, 6, 1, 2, 2, 6, 6, 26, 1, 2]
RANDOM walk for 10000 steps (4 resets) in 114 ms. (86 steps per ms)
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-02 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90003 steps (26 resets) in 399 ms. (225 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 1, 1, 1, 1, 1, 2, 1] Max Struct:[26, 20, 6, 2, 2, 6, 6, 26, 2]
[2024-06-01 13:36:06] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-06-01 13:36:06] [INFO ] Invariant cache hit.
[2024-06-01 13:36:06] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned sat
[2024-06-01 13:36:06] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 21 ms returned sat
[2024-06-01 13:36:07] [INFO ] [Real]Absence check using state equation in 465 ms returned sat
[2024-06-01 13:36:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:36:07] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2024-06-01 13:36:07] [INFO ] [Nat]Absence check using 17 positive and 33 generalized place invariants in 23 ms returned sat
[2024-06-01 13:36:07] [INFO ] [Nat]Absence check using state equation in 733 ms returned sat
[2024-06-01 13:36:07] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:36:08] [INFO ] [Nat]Added 72 Read/Feed constraints in 364 ms returned sat
[2024-06-01 13:36:08] [INFO ] Computed and/alt/rep : 630/2206/624 causal constraints (skipped 330 transitions) in 73 ms.
[2024-06-01 13:36:10] [INFO ] Added : 77 causal constraints over 16 iterations in 1621 ms. Result :sat
Minimization took 590 ms.
[2024-06-01 13:36:10] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned sat
[2024-06-01 13:36:10] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 17 ms returned sat
[2024-06-01 13:36:11] [INFO ] [Real]Absence check using state equation in 345 ms returned sat
[2024-06-01 13:36:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:36:11] [INFO ] [Nat]Absence check using 17 positive place invariants in 14 ms returned sat
[2024-06-01 13:36:11] [INFO ] [Nat]Absence check using 17 positive and 33 generalized place invariants in 22 ms returned sat
[2024-06-01 13:36:11] [INFO ] [Nat]Absence check using state equation in 735 ms returned sat
[2024-06-01 13:36:12] [INFO ] [Nat]Added 72 Read/Feed constraints in 430 ms returned sat
[2024-06-01 13:36:12] [INFO ] Computed and/alt/rep : 630/2206/624 causal constraints (skipped 330 transitions) in 91 ms.
[2024-06-01 13:36:13] [INFO ] Added : 80 causal constraints over 16 iterations in 1429 ms. Result :sat
Minimization took 810 ms.
[2024-06-01 13:36:14] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2024-06-01 13:36:14] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 9 ms returned unsat
[2024-06-01 13:36:14] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2024-06-01 13:36:14] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 20 ms returned sat
[2024-06-01 13:36:15] [INFO ] [Real]Absence check using state equation in 326 ms returned sat
[2024-06-01 13:36:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:36:15] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2024-06-01 13:36:15] [INFO ] [Nat]Absence check using 17 positive and 33 generalized place invariants in 17 ms returned sat
[2024-06-01 13:36:16] [INFO ] [Nat]Absence check using state equation in 843 ms returned sat
[2024-06-01 13:36:16] [INFO ] [Nat]Added 72 Read/Feed constraints in 87 ms returned sat
[2024-06-01 13:36:16] [INFO ] Deduced a trap composed of 117 places in 217 ms of which 7 ms to minimize.
[2024-06-01 13:36:16] [INFO ] Deduced a trap composed of 75 places in 152 ms of which 3 ms to minimize.
[2024-06-01 13:36:16] [INFO ] Deduced a trap composed of 75 places in 151 ms of which 2 ms to minimize.
[2024-06-01 13:36:17] [INFO ] Deduced a trap composed of 74 places in 148 ms of which 2 ms to minimize.
[2024-06-01 13:36:17] [INFO ] Deduced a trap composed of 84 places in 149 ms of which 3 ms to minimize.
[2024-06-01 13:36:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 1048 ms
[2024-06-01 13:36:17] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2024-06-01 13:36:17] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 9 ms returned unsat
[2024-06-01 13:36:17] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2024-06-01 13:36:17] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 8 ms returned unsat
[2024-06-01 13:36:17] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2024-06-01 13:36:17] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 9 ms returned unsat
[2024-06-01 13:36:17] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2024-06-01 13:36:17] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 14 ms returned sat
[2024-06-01 13:36:17] [INFO ] [Real]Absence check using state equation in 327 ms returned sat
[2024-06-01 13:36:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:36:17] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2024-06-01 13:36:18] [INFO ] [Nat]Absence check using 17 positive and 33 generalized place invariants in 17 ms returned sat
[2024-06-01 13:36:18] [INFO ] [Nat]Absence check using state equation in 549 ms returned sat
[2024-06-01 13:36:18] [INFO ] [Nat]Added 72 Read/Feed constraints in 269 ms returned sat
[2024-06-01 13:36:18] [INFO ] Computed and/alt/rep : 630/2206/624 causal constraints (skipped 330 transitions) in 72 ms.
[2024-06-01 13:36:21] [INFO ] Added : 207 causal constraints over 42 iterations in 2877 ms. Result :sat
Minimization took 723 ms.
[2024-06-01 13:36:22] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2024-06-01 13:36:22] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 12 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2, 1, 1, 1, 1, 1, 2, 1] Max Struct:[26, 20, 1, 1, 1, 1, 1, 26, 1]
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2, 2] Max Struct:[26, 20, 26]
Support contains 18 out of 536 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 534 transition count 920
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 98 place count 486 transition count 920
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 98 place count 486 transition count 860
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 218 place count 426 transition count 860
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 302 place count 384 transition count 818
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 308 place count 384 transition count 812
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 314 place count 378 transition count 812
Applied a total of 314 rules in 205 ms. Remains 378 /536 variables (removed 158) and now considering 812/968 (removed 156) transitions.
Running 810 sub problems to find dead transitions.
[2024-06-01 13:36:22] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 378 cols
[2024-06-01 13:36:22] [INFO ] Computed 48 invariants in 24 ms
[2024-06-01 13:36:22] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/376 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/376 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:36:29] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 2 ms to minimize.
[2024-06-01 13:36:29] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 3 ms to minimize.
[2024-06-01 13:36:29] [INFO ] Deduced a trap composed of 47 places in 33 ms of which 0 ms to minimize.
[2024-06-01 13:36:29] [INFO ] Deduced a trap composed of 48 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:36:29] [INFO ] Deduced a trap composed of 47 places in 31 ms of which 1 ms to minimize.
[2024-06-01 13:36:29] [INFO ] Deduced a trap composed of 47 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:36:29] [INFO ] Deduced a trap composed of 133 places in 140 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 810 unsolved
SMT process timed out in 21631ms, After SMT, problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 21656ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21886 ms. Remains : 378/536 places, 812/968 transitions.
[2024-06-01 13:36:44] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 13:36:44] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2, 2] Max Struct:[26, 20, 26]
RANDOM walk for 1000000 steps (533 resets) in 3131 ms. (319 steps per ms)
BEST_FIRST walk for 3000003 steps (595 resets) in 4892 ms. (613 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 2] Max Struct:[26, 20, 26]
[2024-06-01 13:36:52] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 13:36:52] [INFO ] Invariant cache hit.
[2024-06-01 13:36:52] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-06-01 13:36:52] [INFO ] [Real]Absence check using 13 positive and 35 generalized place invariants in 27 ms returned sat
[2024-06-01 13:36:52] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2024-06-01 13:36:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:36:52] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-06-01 13:36:52] [INFO ] [Nat]Absence check using 13 positive and 35 generalized place invariants in 15 ms returned sat
[2024-06-01 13:36:53] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2024-06-01 13:36:53] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:36:53] [INFO ] [Nat]Added 72 Read/Feed constraints in 354 ms returned sat
[2024-06-01 13:36:53] [INFO ] Computed and/alt/rep : 462/2050/456 causal constraints (skipped 342 transitions) in 43 ms.
[2024-06-01 13:36:54] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 2 ms to minimize.
[2024-06-01 13:36:54] [INFO ] Deduced a trap composed of 135 places in 144 ms of which 2 ms to minimize.
[2024-06-01 13:36:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 523 ms
[2024-06-01 13:36:55] [INFO ] Added : 85 causal constraints over 18 iterations in 1534 ms. Result :sat
Minimization took 2984 ms.
[2024-06-01 13:36:58] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-06-01 13:36:58] [INFO ] [Real]Absence check using 13 positive and 35 generalized place invariants in 11 ms returned sat
[2024-06-01 13:36:58] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2024-06-01 13:36:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:36:58] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-06-01 13:36:58] [INFO ] [Nat]Absence check using 13 positive and 35 generalized place invariants in 14 ms returned sat
[2024-06-01 13:36:58] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2024-06-01 13:36:58] [INFO ] [Nat]Added 72 Read/Feed constraints in 182 ms returned sat
[2024-06-01 13:36:58] [INFO ] Computed and/alt/rep : 462/2050/456 causal constraints (skipped 342 transitions) in 59 ms.
[2024-06-01 13:37:00] [INFO ] Deduced a trap composed of 142 places in 157 ms of which 2 ms to minimize.
[2024-06-01 13:37:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 278 ms
[2024-06-01 13:37:00] [INFO ] Added : 94 causal constraints over 19 iterations in 1728 ms. Result :sat
Minimization took 2887 ms.
[2024-06-01 13:37:03] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-06-01 13:37:03] [INFO ] [Real]Absence check using 13 positive and 35 generalized place invariants in 21 ms returned sat
[2024-06-01 13:37:03] [INFO ] [Real]Absence check using state equation in 244 ms returned sat
[2024-06-01 13:37:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:37:03] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-06-01 13:37:03] [INFO ] [Nat]Absence check using 13 positive and 35 generalized place invariants in 15 ms returned sat
[2024-06-01 13:37:04] [INFO ] [Nat]Absence check using state equation in 285 ms returned sat
[2024-06-01 13:37:04] [INFO ] [Nat]Added 72 Read/Feed constraints in 437 ms returned sat
[2024-06-01 13:37:04] [INFO ] Computed and/alt/rep : 462/2050/456 causal constraints (skipped 342 transitions) in 82 ms.
[2024-06-01 13:37:06] [INFO ] Deduced a trap composed of 113 places in 231 ms of which 3 ms to minimize.
[2024-06-01 13:37:06] [INFO ] Deduced a trap composed of 15 places in 188 ms of which 3 ms to minimize.
[2024-06-01 13:37:06] [INFO ] Deduced a trap composed of 138 places in 193 ms of which 2 ms to minimize.
[2024-06-01 13:37:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1172 ms
[2024-06-01 13:37:07] [INFO ] Added : 94 causal constraints over 20 iterations in 2888 ms. Result :sat
Minimization took 3410 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2, 2] Max Struct:[26, 20, 26]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2, 2] Max Struct:[26, 20, 26]
Support contains 18 out of 378 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 812/812 transitions.
Applied a total of 0 rules in 20 ms. Remains 378 /378 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 378/378 places, 812/812 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 812/812 transitions.
Applied a total of 0 rules in 17 ms. Remains 378 /378 variables (removed 0) and now considering 812/812 (removed 0) transitions.
[2024-06-01 13:37:12] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 13:37:12] [INFO ] Invariant cache hit.
[2024-06-01 13:37:13] [INFO ] Implicit Places using invariants in 329 ms returned [342, 343, 344, 345, 346, 347]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 334 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 372/378 places, 812/812 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 366 transition count 806
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 366 transition count 806
Applied a total of 12 rules in 44 ms. Remains 366 /372 variables (removed 6) and now considering 806/812 (removed 6) transitions.
[2024-06-01 13:37:13] [INFO ] Flow matrix only has 794 transitions (discarded 12 similar events)
// Phase 1: matrix 794 rows 366 cols
[2024-06-01 13:37:13] [INFO ] Computed 42 invariants in 13 ms
[2024-06-01 13:37:13] [INFO ] Implicit Places using invariants in 407 ms returned []
[2024-06-01 13:37:13] [INFO ] Flow matrix only has 794 transitions (discarded 12 similar events)
[2024-06-01 13:37:13] [INFO ] Invariant cache hit.
[2024-06-01 13:37:13] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:37:16] [INFO ] Implicit Places using invariants and state equation in 2976 ms returned []
Implicit Place search using SMT with State Equation took 3386 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 366/378 places, 806/812 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3784 ms. Remains : 366/378 places, 806/812 transitions.
[2024-06-01 13:37:16] [INFO ] Flow matrix only has 794 transitions (discarded 12 similar events)
[2024-06-01 13:37:16] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2, 2] Max Struct:[26, 20, 26]
RANDOM walk for 1000000 steps (548 resets) in 2893 ms. (345 steps per ms)
BEST_FIRST walk for 3000002 steps (587 resets) in 4270 ms. (702 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 2] Max Struct:[26, 20, 26]
[2024-06-01 13:37:23] [INFO ] Flow matrix only has 794 transitions (discarded 12 similar events)
[2024-06-01 13:37:23] [INFO ] Invariant cache hit.
[2024-06-01 13:37:23] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-06-01 13:37:23] [INFO ] [Real]Absence check using 14 positive and 28 generalized place invariants in 21 ms returned sat
[2024-06-01 13:37:24] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
[2024-06-01 13:37:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:37:24] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-06-01 13:37:24] [INFO ] [Nat]Absence check using 14 positive and 28 generalized place invariants in 18 ms returned sat
[2024-06-01 13:37:24] [INFO ] [Nat]Absence check using state equation in 302 ms returned sat
[2024-06-01 13:37:24] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:37:24] [INFO ] [Nat]Added 72 Read/Feed constraints in 295 ms returned sat
[2024-06-01 13:37:24] [INFO ] Computed and/alt/rep : 456/2043/450 causal constraints (skipped 342 transitions) in 59 ms.
[2024-06-01 13:37:26] [INFO ] Added : 106 causal constraints over 22 iterations in 1400 ms. Result :sat
Minimization took 1852 ms.
[2024-06-01 13:37:28] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-06-01 13:37:28] [INFO ] [Real]Absence check using 14 positive and 28 generalized place invariants in 21 ms returned sat
[2024-06-01 13:37:28] [INFO ] [Real]Absence check using state equation in 296 ms returned sat
[2024-06-01 13:37:28] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:37:28] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-06-01 13:37:28] [INFO ] [Nat]Absence check using 14 positive and 28 generalized place invariants in 17 ms returned sat
[2024-06-01 13:37:29] [INFO ] [Nat]Absence check using state equation in 461 ms returned sat
[2024-06-01 13:37:29] [INFO ] [Nat]Added 72 Read/Feed constraints in 144 ms returned sat
[2024-06-01 13:37:29] [INFO ] Computed and/alt/rep : 456/2043/450 causal constraints (skipped 342 transitions) in 62 ms.
[2024-06-01 13:37:30] [INFO ] Deduced a trap composed of 134 places in 210 ms of which 3 ms to minimize.
[2024-06-01 13:37:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 357 ms
[2024-06-01 13:37:31] [INFO ] Added : 90 causal constraints over 18 iterations in 1837 ms. Result :sat
Minimization took 2046 ms.
[2024-06-01 13:37:33] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2024-06-01 13:37:33] [INFO ] [Real]Absence check using 14 positive and 28 generalized place invariants in 17 ms returned sat
[2024-06-01 13:37:33] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2024-06-01 13:37:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:37:33] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2024-06-01 13:37:33] [INFO ] [Nat]Absence check using 14 positive and 28 generalized place invariants in 13 ms returned sat
[2024-06-01 13:37:33] [INFO ] [Nat]Absence check using state equation in 269 ms returned sat
[2024-06-01 13:37:34] [INFO ] [Nat]Added 72 Read/Feed constraints in 321 ms returned sat
[2024-06-01 13:37:34] [INFO ] Computed and/alt/rep : 456/2043/450 causal constraints (skipped 342 transitions) in 58 ms.
[2024-06-01 13:37:35] [INFO ] Added : 91 causal constraints over 19 iterations in 1753 ms. Result :sat
Minimization took 1975 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2, 2] Max Struct:[26, 20, 26]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2, 2] Max Struct:[26, 20, 26]
Support contains 18 out of 366 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 366/366 places, 806/806 transitions.
Applied a total of 0 rules in 18 ms. Remains 366 /366 variables (removed 0) and now considering 806/806 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 366/366 places, 806/806 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 366/366 places, 806/806 transitions.
Applied a total of 0 rules in 15 ms. Remains 366 /366 variables (removed 0) and now considering 806/806 (removed 0) transitions.
[2024-06-01 13:37:39] [INFO ] Flow matrix only has 794 transitions (discarded 12 similar events)
[2024-06-01 13:37:39] [INFO ] Invariant cache hit.
[2024-06-01 13:37:39] [INFO ] Implicit Places using invariants in 450 ms returned []
[2024-06-01 13:37:39] [INFO ] Flow matrix only has 794 transitions (discarded 12 similar events)
[2024-06-01 13:37:39] [INFO ] Invariant cache hit.
[2024-06-01 13:37:39] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:37:43] [INFO ] Implicit Places using invariants and state equation in 3441 ms returned []
Implicit Place search using SMT with State Equation took 3896 ms to find 0 implicit places.
[2024-06-01 13:37:43] [INFO ] Redundant transitions in 67 ms returned []
Running 804 sub problems to find dead transitions.
[2024-06-01 13:37:43] [INFO ] Flow matrix only has 794 transitions (discarded 12 similar events)
[2024-06-01 13:37:43] [INFO ] Invariant cache hit.
[2024-06-01 13:37:43] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 804 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 804 unsolved
[2024-06-01 13:37:48] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:37:48] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:37:48] [INFO ] Deduced a trap composed of 47 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:37:48] [INFO ] Deduced a trap composed of 47 places in 26 ms of which 1 ms to minimize.
[2024-06-01 13:37:48] [INFO ] Deduced a trap composed of 47 places in 26 ms of which 1 ms to minimize.
[2024-06-01 13:37:48] [INFO ] Deduced a trap composed of 125 places in 140 ms of which 5 ms to minimize.
[2024-06-01 13:37:48] [INFO ] Deduced a trap composed of 47 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 7/47 constraints. Problems are: Problem set: 0 solved, 804 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 804 unsolved
Problem TDEAD726 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD805 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/365 variables, 1/48 constraints. Problems are: Problem set: 36 solved, 768 unsolved
[2024-06-01 13:38:05] [INFO ] Deduced a trap composed of 148 places in 151 ms of which 3 ms to minimize.
[2024-06-01 13:38:05] [INFO ] Deduced a trap composed of 134 places in 200 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 2/50 constraints. Problems are: Problem set: 36 solved, 768 unsolved
[2024-06-01 13:38:12] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 365/1160 variables, and 51 constraints, problems are : Problem set: 36 solved, 768 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/366 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 804/804 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 36 solved, 768 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 13/13 constraints. Problems are: Problem set: 36 solved, 768 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 27/40 constraints. Problems are: Problem set: 36 solved, 768 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 10/50 constraints. Problems are: Problem set: 36 solved, 768 unsolved
[2024-06-01 13:38:15] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 1 ms to minimize.
[2024-06-01 13:38:20] [INFO ] Deduced a trap composed of 114 places in 181 ms of which 2 ms to minimize.
[2024-06-01 13:38:22] [INFO ] Deduced a trap composed of 55 places in 195 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 3/53 constraints. Problems are: Problem set: 36 solved, 768 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 0/53 constraints. Problems are: Problem set: 36 solved, 768 unsolved
At refinement iteration 5 (OVERLAPS) 1/365 variables, 1/54 constraints. Problems are: Problem set: 36 solved, 768 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 365/1160 variables, and 54 constraints, problems are : Problem set: 36 solved, 768 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/366 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/804 constraints, Known Traps: 13/13 constraints]
After SMT, in 61039ms problems are : Problem set: 36 solved, 768 unsolved
Search for dead transitions found 36 dead transitions in 61049ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 366/366 places, 770/806 transitions.
Applied a total of 0 rules in 19 ms. Remains 366 /366 variables (removed 0) and now considering 770/770 (removed 0) transitions.
[2024-06-01 13:38:44] [INFO ] Redundant transitions in 7 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 65073 ms. Remains : 366/366 places, 770/806 transitions.
[2024-06-01 13:38:44] [INFO ] Flow matrix only has 758 transitions (discarded 12 similar events)
// Phase 1: matrix 758 rows 366 cols
[2024-06-01 13:38:44] [INFO ] Computed 42 invariants in 13 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2, 2] Max Struct:[26, 20, 26]
RANDOM walk for 1000000 steps (521 resets) in 2477 ms. (403 steps per ms)
BEST_FIRST walk for 3000002 steps (671 resets) in 3865 ms. (775 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 2] Max Struct:[26, 20, 26]
[2024-06-01 13:38:50] [INFO ] Flow matrix only has 758 transitions (discarded 12 similar events)
[2024-06-01 13:38:50] [INFO ] Invariant cache hit.
[2024-06-01 13:38:50] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-06-01 13:38:50] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 33 ms returned sat
[2024-06-01 13:38:51] [INFO ] [Real]Absence check using state equation in 476 ms returned sat
[2024-06-01 13:38:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:38:51] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-06-01 13:38:51] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 26 ms returned sat
[2024-06-01 13:38:51] [INFO ] [Nat]Absence check using state equation in 465 ms returned sat
[2024-06-01 13:38:51] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:38:52] [INFO ] [Nat]Added 72 Read/Feed constraints in 495 ms returned sat
[2024-06-01 13:38:52] [INFO ] Computed and/alt/rep : 504/2415/498 causal constraints (skipped 258 transitions) in 60 ms.
[2024-06-01 13:38:53] [INFO ] Added : 123 causal constraints over 25 iterations in 1447 ms. Result :sat
Minimization took 1999 ms.
[2024-06-01 13:38:55] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-06-01 13:38:55] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 34 ms returned sat
[2024-06-01 13:38:56] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2024-06-01 13:38:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:38:56] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-06-01 13:38:56] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 18 ms returned sat
[2024-06-01 13:38:56] [INFO ] [Nat]Absence check using state equation in 216 ms returned sat
[2024-06-01 13:38:56] [INFO ] [Nat]Added 72 Read/Feed constraints in 309 ms returned sat
[2024-06-01 13:38:56] [INFO ] Deduced a trap composed of 117 places in 202 ms of which 3 ms to minimize.
[2024-06-01 13:38:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 305 ms
[2024-06-01 13:38:57] [INFO ] Computed and/alt/rep : 504/2415/498 causal constraints (skipped 258 transitions) in 49 ms.
[2024-06-01 13:38:59] [INFO ] Added : 65 causal constraints over 14 iterations in 2450 ms. Result :sat
Minimization took 1688 ms.
[2024-06-01 13:39:01] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-06-01 13:39:01] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 26 ms returned sat
[2024-06-01 13:39:01] [INFO ] [Real]Absence check using state equation in 373 ms returned sat
[2024-06-01 13:39:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:39:01] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-06-01 13:39:01] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 28 ms returned sat
[2024-06-01 13:39:02] [INFO ] [Nat]Absence check using state equation in 442 ms returned sat
[2024-06-01 13:39:02] [INFO ] [Nat]Added 72 Read/Feed constraints in 339 ms returned sat
[2024-06-01 13:39:02] [INFO ] Computed and/alt/rep : 504/2415/498 causal constraints (skipped 258 transitions) in 72 ms.
[2024-06-01 13:39:03] [INFO ] Added : 64 causal constraints over 13 iterations in 933 ms. Result :sat
Minimization took 1824 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2, 2] Max Struct:[26, 20, 26]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2, 2] Max Struct:[26, 20, 26]
Support contains 18 out of 366 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 366/366 places, 770/770 transitions.
Applied a total of 0 rules in 30 ms. Remains 366 /366 variables (removed 0) and now considering 770/770 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 366/366 places, 770/770 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 366/366 places, 770/770 transitions.
Applied a total of 0 rules in 25 ms. Remains 366 /366 variables (removed 0) and now considering 770/770 (removed 0) transitions.
[2024-06-01 13:39:07] [INFO ] Flow matrix only has 758 transitions (discarded 12 similar events)
[2024-06-01 13:39:07] [INFO ] Invariant cache hit.
[2024-06-01 13:39:07] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-06-01 13:39:07] [INFO ] Flow matrix only has 758 transitions (discarded 12 similar events)
[2024-06-01 13:39:07] [INFO ] Invariant cache hit.
[2024-06-01 13:39:07] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:39:11] [INFO ] Implicit Places using invariants and state equation in 4351 ms returned []
Implicit Place search using SMT with State Equation took 4676 ms to find 0 implicit places.
[2024-06-01 13:39:11] [INFO ] Redundant transitions in 11 ms returned []
Running 768 sub problems to find dead transitions.
[2024-06-01 13:39:11] [INFO ] Flow matrix only has 758 transitions (discarded 12 similar events)
[2024-06-01 13:39:11] [INFO ] Invariant cache hit.
[2024-06-01 13:39:11] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 768 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 768 unsolved
[2024-06-01 13:39:16] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:39:16] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:39:16] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 2 ms to minimize.
[2024-06-01 13:39:16] [INFO ] Deduced a trap composed of 47 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:39:17] [INFO ] Deduced a trap composed of 47 places in 25 ms of which 0 ms to minimize.
[2024-06-01 13:39:17] [INFO ] Deduced a trap composed of 119 places in 118 ms of which 2 ms to minimize.
[2024-06-01 13:39:17] [INFO ] Deduced a trap composed of 104 places in 135 ms of which 2 ms to minimize.
[2024-06-01 13:39:17] [INFO ] Deduced a trap composed of 106 places in 136 ms of which 2 ms to minimize.
[2024-06-01 13:39:18] [INFO ] Deduced a trap composed of 118 places in 206 ms of which 3 ms to minimize.
[2024-06-01 13:39:18] [INFO ] Deduced a trap composed of 119 places in 150 ms of which 3 ms to minimize.
[2024-06-01 13:39:18] [INFO ] Deduced a trap composed of 113 places in 146 ms of which 2 ms to minimize.
[2024-06-01 13:39:18] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:39:19] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 3 ms to minimize.
[2024-06-01 13:39:20] [INFO ] Deduced a trap composed of 166 places in 180 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 768 unsolved
[2024-06-01 13:39:24] [INFO ] Deduced a trap composed of 148 places in 180 ms of which 3 ms to minimize.
[2024-06-01 13:39:25] [INFO ] Deduced a trap composed of 181 places in 187 ms of which 3 ms to minimize.
[2024-06-01 13:39:25] [INFO ] Deduced a trap composed of 166 places in 141 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 768 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 768 unsolved
At refinement iteration 5 (OVERLAPS) 1/365 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 768 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 768 unsolved
SMT process timed out in 30721ms, After SMT, problems are : Problem set: 0 solved, 768 unsolved
Search for dead transitions found 0 dead transitions in 30729ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35453 ms. Remains : 366/366 places, 770/770 transitions.
RANDOM walk for 40001 steps (23 resets) in 1298 ms. (30 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (11 resets) in 358 ms. (111 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (10 resets) in 210 ms. (189 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (9 resets) in 304 ms. (131 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (14 resets) in 170 ms. (233 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (11 resets) in 130 ms. (305 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (16 resets) in 243 ms. (163 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 232357 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :0 out of 6
Probabilistic random walk after 232357 steps, saw 116965 distinct states, run finished after 3003 ms. (steps per millisecond=77 ) properties seen :0
[2024-06-01 13:39:46] [INFO ] Flow matrix only has 758 transitions (discarded 12 similar events)
[2024-06-01 13:39:46] [INFO ] Invariant cache hit.
[2024-06-01 13:39:46] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem MAX0 is UNSAT
Problem MAX2 is UNSAT
At refinement iteration 1 (OVERLAPS) 318/336 variables, 14/14 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/14 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Problem MAX1 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 13/349 variables, 12/26 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 0/26 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 15/364 variables, 15/41 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 0/41 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 758/1122 variables, 364/405 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1122 variables, 72/477 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1122 variables, 0/477 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/1124 variables, 2/479 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1124 variables, 1/480 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1124 variables, 0/480 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/1124 variables, 0/480 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1124/1124 variables, and 480 constraints, problems are : Problem set: 3 solved, 3 unsolved in 442 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 366/366 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 318/336 variables, 14/14 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-06-01 13:39:47] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 2 ms to minimize.
[2024-06-01 13:39:47] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 2 ms to minimize.
[2024-06-01 13:39:47] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 3/17 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/336 variables, 0/17 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 13/349 variables, 12/29 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-06-01 13:39:47] [INFO ] Deduced a trap composed of 47 places in 30 ms of which 1 ms to minimize.
[2024-06-01 13:39:47] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 2/31 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/31 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 15/364 variables, 15/46 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-06-01 13:39:47] [INFO ] Deduced a trap composed of 124 places in 153 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 1/47 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-06-01 13:39:47] [INFO ] Deduced a trap composed of 47 places in 30 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 1/48 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-06-01 13:39:47] [INFO ] Deduced a trap composed of 145 places in 149 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/364 variables, 1/49 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/364 variables, 0/49 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 758/1122 variables, 364/413 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1122 variables, 72/485 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1122 variables, 3/488 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1122 variables, 0/488 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 2/1124 variables, 2/490 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1124 variables, 1/491 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1124 variables, 0/491 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1124 variables, 0/491 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1124/1124 variables, and 491 constraints, problems are : Problem set: 3 solved, 3 unsolved in 4062 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 366/366 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/6 constraints, Known Traps: 8/8 constraints]
After SMT, in 4520ms problems are : Problem set: 3 solved, 3 unsolved
Parikh walk visited 0 properties in 1293 ms.
Support contains 18 out of 366 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 366/366 places, 770/770 transitions.
Applied a total of 0 rules in 11 ms. Remains 366 /366 variables (removed 0) and now considering 770/770 (removed 0) transitions.
Running 768 sub problems to find dead transitions.
[2024-06-01 13:39:52] [INFO ] Flow matrix only has 758 transitions (discarded 12 similar events)
[2024-06-01 13:39:52] [INFO ] Invariant cache hit.
[2024-06-01 13:39:52] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 768 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 768 unsolved
[2024-06-01 13:39:57] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:39:57] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 0 ms to minimize.
[2024-06-01 13:39:57] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:39:57] [INFO ] Deduced a trap composed of 47 places in 26 ms of which 1 ms to minimize.
[2024-06-01 13:39:57] [INFO ] Deduced a trap composed of 47 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:39:57] [INFO ] Deduced a trap composed of 119 places in 139 ms of which 2 ms to minimize.
[2024-06-01 13:39:57] [INFO ] Deduced a trap composed of 104 places in 137 ms of which 2 ms to minimize.
[2024-06-01 13:39:57] [INFO ] Deduced a trap composed of 106 places in 141 ms of which 2 ms to minimize.
[2024-06-01 13:39:58] [INFO ] Deduced a trap composed of 118 places in 140 ms of which 2 ms to minimize.
[2024-06-01 13:39:58] [INFO ] Deduced a trap composed of 119 places in 140 ms of which 2 ms to minimize.
[2024-06-01 13:39:58] [INFO ] Deduced a trap composed of 113 places in 144 ms of which 2 ms to minimize.
[2024-06-01 13:39:58] [INFO ] Deduced a trap composed of 47 places in 26 ms of which 1 ms to minimize.
[2024-06-01 13:39:59] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2024-06-01 13:40:00] [INFO ] Deduced a trap composed of 166 places in 130 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 768 unsolved
[2024-06-01 13:40:03] [INFO ] Deduced a trap composed of 148 places in 145 ms of which 2 ms to minimize.
[2024-06-01 13:40:04] [INFO ] Deduced a trap composed of 181 places in 124 ms of which 2 ms to minimize.
[2024-06-01 13:40:05] [INFO ] Deduced a trap composed of 166 places in 141 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 768 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 364/1124 variables, and 57 constraints, problems are : Problem set: 0 solved, 768 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/366 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 768/768 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 768 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 768 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 768 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 768 unsolved
[2024-06-01 13:40:14] [INFO ] Deduced a trap composed of 148 places in 141 ms of which 2 ms to minimize.
[2024-06-01 13:40:14] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:40:14] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 2 ms to minimize.
[2024-06-01 13:40:17] [INFO ] Deduced a trap composed of 170 places in 188 ms of which 2 ms to minimize.
[2024-06-01 13:40:17] [INFO ] Deduced a trap composed of 222 places in 179 ms of which 3 ms to minimize.
[2024-06-01 13:40:19] [INFO ] Deduced a trap composed of 176 places in 198 ms of which 3 ms to minimize.
[2024-06-01 13:40:19] [INFO ] Deduced a trap composed of 181 places in 143 ms of which 2 ms to minimize.
[2024-06-01 13:40:20] [INFO ] Deduced a trap composed of 114 places in 186 ms of which 2 ms to minimize.
[2024-06-01 13:40:21] [INFO ] Deduced a trap composed of 103 places in 143 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 768 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 768 unsolved
At refinement iteration 5 (OVERLAPS) 1/365 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 768 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 365/1124 variables, and 67 constraints, problems are : Problem set: 0 solved, 768 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/366 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/768 constraints, Known Traps: 26/26 constraints]
After SMT, in 40846ms problems are : Problem set: 0 solved, 768 unsolved
Search for dead transitions found 0 dead transitions in 40854ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40868 ms. Remains : 366/366 places, 770/770 transitions.
RANDOM walk for 40000 steps (18 resets) in 217 ms. (183 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (12 resets) in 127 ms. (312 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (12 resets) in 137 ms. (289 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (12 resets) in 123 ms. (322 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 314110 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :0 out of 3
Probabilistic random walk after 314110 steps, saw 153378 distinct states, run finished after 3001 ms. (steps per millisecond=104 ) properties seen :0
[2024-06-01 13:40:36] [INFO ] Flow matrix only has 758 transitions (discarded 12 similar events)
[2024-06-01 13:40:36] [INFO ] Invariant cache hit.
[2024-06-01 13:40:36] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 318/336 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 13/349 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 15/364 variables, 15/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 758/1122 variables, 364/405 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1122 variables, 72/477 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1122 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/1124 variables, 2/479 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1124 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1124 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/1124 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1124/1124 variables, and 480 constraints, problems are : Problem set: 0 solved, 3 unsolved in 526 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 366/366 constraints, ReadFeed: 72/72 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/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 318/336 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 13:40:37] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 1 ms to minimize.
[2024-06-01 13:40:37] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:40:37] [INFO ] Deduced a trap composed of 47 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/336 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 13/349 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 13:40:37] [INFO ] Deduced a trap composed of 47 places in 32 ms of which 1 ms to minimize.
[2024-06-01 13:40:37] [INFO ] Deduced a trap composed of 47 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 15/364 variables, 15/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 13:40:37] [INFO ] Deduced a trap composed of 124 places in 163 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 13:40:37] [INFO ] Deduced a trap composed of 47 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 13:40:37] [INFO ] Deduced a trap composed of 145 places in 168 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/364 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/364 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 758/1122 variables, 364/413 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1122 variables, 72/485 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1122 variables, 3/488 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1122 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 2/1124 variables, 2/490 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1124 variables, 1/491 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1124 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1124 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1124/1124 variables, and 491 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4994 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 366/366 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 8/8 constraints]
After SMT, in 5530ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1584 ms.
Support contains 18 out of 366 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 366/366 places, 770/770 transitions.
Applied a total of 0 rules in 9 ms. Remains 366 /366 variables (removed 0) and now considering 770/770 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 366/366 places, 770/770 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 366/366 places, 770/770 transitions.
Applied a total of 0 rules in 9 ms. Remains 366 /366 variables (removed 0) and now considering 770/770 (removed 0) transitions.
[2024-06-01 13:40:43] [INFO ] Flow matrix only has 758 transitions (discarded 12 similar events)
[2024-06-01 13:40:43] [INFO ] Invariant cache hit.
[2024-06-01 13:40:43] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-06-01 13:40:43] [INFO ] Flow matrix only has 758 transitions (discarded 12 similar events)
[2024-06-01 13:40:43] [INFO ] Invariant cache hit.
[2024-06-01 13:40:44] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:40:48] [INFO ] Implicit Places using invariants and state equation in 4434 ms returned []
Implicit Place search using SMT with State Equation took 4659 ms to find 0 implicit places.
[2024-06-01 13:40:48] [INFO ] Redundant transitions in 11 ms returned []
Running 768 sub problems to find dead transitions.
[2024-06-01 13:40:48] [INFO ] Flow matrix only has 758 transitions (discarded 12 similar events)
[2024-06-01 13:40:48] [INFO ] Invariant cache hit.
[2024-06-01 13:40:48] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 768 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 768 unsolved
[2024-06-01 13:40:53] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 2 ms to minimize.
[2024-06-01 13:40:53] [INFO ] Deduced a trap composed of 47 places in 36 ms of which 0 ms to minimize.
[2024-06-01 13:40:53] [INFO ] Deduced a trap composed of 47 places in 36 ms of which 0 ms to minimize.
[2024-06-01 13:40:53] [INFO ] Deduced a trap composed of 47 places in 25 ms of which 0 ms to minimize.
[2024-06-01 13:40:53] [INFO ] Deduced a trap composed of 47 places in 26 ms of which 1 ms to minimize.
[2024-06-01 13:40:53] [INFO ] Deduced a trap composed of 119 places in 120 ms of which 2 ms to minimize.
[2024-06-01 13:40:53] [INFO ] Deduced a trap composed of 104 places in 121 ms of which 2 ms to minimize.
[2024-06-01 13:40:53] [INFO ] Deduced a trap composed of 106 places in 120 ms of which 2 ms to minimize.
[2024-06-01 13:40:54] [INFO ] Deduced a trap composed of 118 places in 134 ms of which 2 ms to minimize.
[2024-06-01 13:40:54] [INFO ] Deduced a trap composed of 119 places in 123 ms of which 2 ms to minimize.
[2024-06-01 13:40:54] [INFO ] Deduced a trap composed of 113 places in 119 ms of which 2 ms to minimize.
[2024-06-01 13:40:54] [INFO ] Deduced a trap composed of 47 places in 26 ms of which 1 ms to minimize.
[2024-06-01 13:40:55] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-06-01 13:40:56] [INFO ] Deduced a trap composed of 166 places in 196 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 768 unsolved
[2024-06-01 13:40:59] [INFO ] Deduced a trap composed of 148 places in 130 ms of which 2 ms to minimize.
[2024-06-01 13:41:00] [INFO ] Deduced a trap composed of 181 places in 127 ms of which 2 ms to minimize.
[2024-06-01 13:41:00] [INFO ] Deduced a trap composed of 166 places in 119 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 768 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 768 unsolved
At refinement iteration 5 (OVERLAPS) 1/365 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 768 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 4.0)
(s1 6.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 768 unsolved
SMT process timed out in 30976ms, After SMT, problems are : Problem set: 0 solved, 768 unsolved
Search for dead transitions found 0 dead transitions in 30991ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35684 ms. Remains : 366/366 places, 770/770 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 366 transition count 758
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 1 with 12 rules applied. Total rules applied 24 place count 366 transition count 746
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 366 transition count 740
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 36 place count 360 transition count 740
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 43 place count 360 transition count 733
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 50 place count 353 transition count 733
Applied a total of 50 rules in 54 ms. Remains 353 /366 variables (removed 13) and now considering 733/770 (removed 37) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 733 rows 353 cols
[2024-06-01 13:41:19] [INFO ] Computed 42 invariants in 8 ms
[2024-06-01 13:41:19] [INFO ] [Real]Absence check using 14 positive place invariants in 17 ms returned sat
[2024-06-01 13:41:19] [INFO ] [Real]Absence check using 14 positive and 28 generalized place invariants in 39 ms returned sat
[2024-06-01 13:41:19] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-01 13:41:19] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2024-06-01 13:41:19] [INFO ] [Nat]Absence check using 14 positive and 28 generalized place invariants in 30 ms returned sat
[2024-06-01 13:41:21] [INFO ] After 1500ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-06-01 13:41:21] [INFO ] Deduced a trap composed of 118 places in 140 ms of which 2 ms to minimize.
[2024-06-01 13:41:22] [INFO ] Deduced a trap composed of 123 places in 182 ms of which 2 ms to minimize.
[2024-06-01 13:41:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 414 ms
[2024-06-01 13:41:22] [INFO ] Deduced a trap composed of 125 places in 128 ms of which 2 ms to minimize.
[2024-06-01 13:41:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
TRAPS : Iteration 1
[2024-06-01 13:41:40] [INFO ] Deduced a trap composed of 111 places in 203 ms of which 3 ms to minimize.
[2024-06-01 13:41:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 625 ms
TRAPS : Iteration 2
[2024-06-01 13:41:41] [INFO ] After 21605ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-06-01 13:41:42] [INFO ] After 23512ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 23742 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2, 2, 2] Max Struct:[26, 20, 26]
Starting property specific reduction for PolyORBLF-COL-S02J06T06-UpperBounds-00
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:[26]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[26]
[2024-06-01 13:41:42] [INFO ] Flow matrix only has 758 transitions (discarded 12 similar events)
// Phase 1: matrix 758 rows 366 cols
[2024-06-01 13:41:42] [INFO ] Computed 42 invariants in 16 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[26]
RANDOM walk for 10000 steps (9 resets) in 25 ms. (384 steps per ms)
BEST_FIRST walk for 10001 steps (5 resets) in 14 ms. (666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[26]
[2024-06-01 13:41:42] [INFO ] Flow matrix only has 758 transitions (discarded 12 similar events)
[2024-06-01 13:41:42] [INFO ] Invariant cache hit.
[2024-06-01 13:41:43] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-06-01 13:41:43] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 23 ms returned sat
[2024-06-01 13:41:43] [INFO ] [Real]Absence check using state equation in 406 ms returned sat
[2024-06-01 13:41:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:41:43] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-06-01 13:41:43] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 20 ms returned sat
[2024-06-01 13:41:44] [INFO ] [Nat]Absence check using state equation in 457 ms returned sat
[2024-06-01 13:41:44] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:41:44] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 13:41:44] [INFO ] [Nat]Added 72 Read/Feed constraints in 591 ms returned sat
[2024-06-01 13:41:44] [INFO ] Computed and/alt/rep : 504/2415/498 causal constraints (skipped 258 transitions) in 62 ms.
[2024-06-01 13:41:46] [INFO ] Added : 135 causal constraints over 27 iterations in 1712 ms. Result :sat
Minimization took 823 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[26]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[26]
Support contains 6 out of 366 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 366/366 places, 770/770 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 366 transition count 764
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 360 transition count 764
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 360 transition count 758
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 24 place count 354 transition count 758
Applied a total of 24 rules in 37 ms. Remains 354 /366 variables (removed 12) and now considering 758/770 (removed 12) transitions.
Running 756 sub problems to find dead transitions.
[2024-06-01 13:41:47] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
// Phase 1: matrix 746 rows 354 cols
[2024-06-01 13:41:47] [INFO ] Computed 42 invariants in 11 ms
[2024-06-01 13:41:47] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-06-01 13:41:52] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 2 ms to minimize.
[2024-06-01 13:41:52] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 2 ms to minimize.
[2024-06-01 13:41:52] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:41:52] [INFO ] Deduced a trap composed of 45 places in 27 ms of which 1 ms to minimize.
[2024-06-01 13:41:52] [INFO ] Deduced a trap composed of 45 places in 27 ms of which 0 ms to minimize.
[2024-06-01 13:41:52] [INFO ] Deduced a trap composed of 45 places in 27 ms of which 1 ms to minimize.
[2024-06-01 13:41:53] [INFO ] Deduced a trap composed of 161 places in 147 ms of which 3 ms to minimize.
[2024-06-01 13:41:53] [INFO ] Deduced a trap composed of 141 places in 146 ms of which 2 ms to minimize.
[2024-06-01 13:41:53] [INFO ] Deduced a trap composed of 117 places in 150 ms of which 2 ms to minimize.
[2024-06-01 13:41:53] [INFO ] Deduced a trap composed of 122 places in 140 ms of which 2 ms to minimize.
[2024-06-01 13:41:53] [INFO ] Deduced a trap composed of 45 places in 26 ms of which 1 ms to minimize.
[2024-06-01 13:41:53] [INFO ] Deduced a trap composed of 121 places in 121 ms of which 2 ms to minimize.
[2024-06-01 13:41:53] [INFO ] Deduced a trap composed of 126 places in 146 ms of which 2 ms to minimize.
[2024-06-01 13:41:54] [INFO ] Deduced a trap composed of 118 places in 171 ms of which 2 ms to minimize.
[2024-06-01 13:41:54] [INFO ] Deduced a trap composed of 116 places in 145 ms of which 2 ms to minimize.
[2024-06-01 13:41:54] [INFO ] Deduced a trap composed of 126 places in 142 ms of which 2 ms to minimize.
[2024-06-01 13:41:54] [INFO ] Deduced a trap composed of 127 places in 141 ms of which 3 ms to minimize.
[2024-06-01 13:41:54] [INFO ] Deduced a trap composed of 117 places in 165 ms of which 2 ms to minimize.
[2024-06-01 13:41:57] [INFO ] Deduced a trap composed of 154 places in 125 ms of which 2 ms to minimize.
[2024-06-01 13:42:00] [INFO ] Deduced a trap composed of 154 places in 157 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-06-01 13:42:02] [INFO ] Deduced a trap composed of 151 places in 189 ms of which 2 ms to minimize.
[2024-06-01 13:42:02] [INFO ] Deduced a trap composed of 153 places in 165 ms of which 2 ms to minimize.
[2024-06-01 13:42:03] [INFO ] Deduced a trap composed of 152 places in 165 ms of which 3 ms to minimize.
[2024-06-01 13:42:03] [INFO ] Deduced a trap composed of 154 places in 150 ms of which 2 ms to minimize.
[2024-06-01 13:42:06] [INFO ] Deduced a trap composed of 126 places in 176 ms of which 2 ms to minimize.
[2024-06-01 13:42:06] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 756 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 352/1100 variables, and 66 constraints, problems are : Problem set: 0 solved, 756 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/354 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 756/756 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 756 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 26/66 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-06-01 13:42:16] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 2 ms to minimize.
[2024-06-01 13:42:16] [INFO ] Deduced a trap composed of 52 places in 153 ms of which 3 ms to minimize.
[2024-06-01 13:42:23] [INFO ] Deduced a trap composed of 114 places in 153 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 756 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 352/1100 variables, and 69 constraints, problems are : Problem set: 0 solved, 756 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/354 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/756 constraints, Known Traps: 29/29 constraints]
After SMT, in 40911ms problems are : Problem set: 0 solved, 756 unsolved
Search for dead transitions found 0 dead transitions in 40920ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40959 ms. Remains : 354/366 places, 758/770 transitions.
[2024-06-01 13:42:28] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2024-06-01 13:42:28] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[26]
RANDOM walk for 1000000 steps (586 resets) in 2584 ms. (386 steps per ms)
BEST_FIRST walk for 1000001 steps (204 resets) in 1183 ms. (844 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[26]
[2024-06-01 13:42:31] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2024-06-01 13:42:31] [INFO ] Invariant cache hit.
[2024-06-01 13:42:31] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2024-06-01 13:42:32] [INFO ] [Real]Absence check using 16 positive and 26 generalized place invariants in 14 ms returned sat
[2024-06-01 13:42:32] [INFO ] [Real]Absence check using state equation in 268 ms returned sat
[2024-06-01 13:42:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:42:32] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2024-06-01 13:42:32] [INFO ] [Nat]Absence check using 16 positive and 26 generalized place invariants in 15 ms returned sat
[2024-06-01 13:42:32] [INFO ] [Nat]Absence check using state equation in 275 ms returned sat
[2024-06-01 13:42:32] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:42:33] [INFO ] [Nat]Added 72 Read/Feed constraints in 633 ms returned sat
[2024-06-01 13:42:33] [INFO ] Computed and/alt/rep : 492/2361/486 causal constraints (skipped 258 transitions) in 54 ms.
[2024-06-01 13:42:35] [INFO ] Added : 89 causal constraints over 19 iterations in 2561 ms. Result :sat
Minimization took 2216 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[26]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[26]
Support contains 6 out of 354 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 354/354 places, 758/758 transitions.
Applied a total of 0 rules in 10 ms. Remains 354 /354 variables (removed 0) and now considering 758/758 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 354/354 places, 758/758 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 354/354 places, 758/758 transitions.
Applied a total of 0 rules in 9 ms. Remains 354 /354 variables (removed 0) and now considering 758/758 (removed 0) transitions.
[2024-06-01 13:42:38] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2024-06-01 13:42:38] [INFO ] Invariant cache hit.
[2024-06-01 13:42:38] [INFO ] Implicit Places using invariants in 356 ms returned []
[2024-06-01 13:42:38] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2024-06-01 13:42:38] [INFO ] Invariant cache hit.
[2024-06-01 13:42:39] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:42:42] [INFO ] Implicit Places using invariants and state equation in 3363 ms returned []
Implicit Place search using SMT with State Equation took 3721 ms to find 0 implicit places.
[2024-06-01 13:42:42] [INFO ] Redundant transitions in 5 ms returned []
Running 756 sub problems to find dead transitions.
[2024-06-01 13:42:42] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2024-06-01 13:42:42] [INFO ] Invariant cache hit.
[2024-06-01 13:42:42] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-06-01 13:42:47] [INFO ] Deduced a trap composed of 45 places in 153 ms of which 2 ms to minimize.
[2024-06-01 13:42:48] [INFO ] Deduced a trap composed of 148 places in 122 ms of which 2 ms to minimize.
[2024-06-01 13:42:48] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:42:48] [INFO ] Deduced a trap composed of 45 places in 32 ms of which 1 ms to minimize.
[2024-06-01 13:42:48] [INFO ] Deduced a trap composed of 45 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:42:48] [INFO ] Deduced a trap composed of 45 places in 31 ms of which 1 ms to minimize.
[2024-06-01 13:42:48] [INFO ] Deduced a trap composed of 183 places in 167 ms of which 2 ms to minimize.
[2024-06-01 13:42:48] [INFO ] Deduced a trap composed of 161 places in 143 ms of which 2 ms to minimize.
[2024-06-01 13:42:48] [INFO ] Deduced a trap composed of 141 places in 145 ms of which 2 ms to minimize.
[2024-06-01 13:42:49] [INFO ] Deduced a trap composed of 129 places in 145 ms of which 2 ms to minimize.
[2024-06-01 13:42:49] [INFO ] Deduced a trap composed of 45 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:42:49] [INFO ] Deduced a trap composed of 122 places in 139 ms of which 2 ms to minimize.
[2024-06-01 13:42:49] [INFO ] Deduced a trap composed of 120 places in 119 ms of which 2 ms to minimize.
[2024-06-01 13:42:49] [INFO ] Deduced a trap composed of 153 places in 114 ms of which 2 ms to minimize.
[2024-06-01 13:42:51] [INFO ] Deduced a trap composed of 164 places in 171 ms of which 2 ms to minimize.
[2024-06-01 13:42:51] [INFO ] Deduced a trap composed of 164 places in 171 ms of which 2 ms to minimize.
[2024-06-01 13:42:53] [INFO ] Deduced a trap composed of 117 places in 185 ms of which 3 ms to minimize.
[2024-06-01 13:42:55] [INFO ] Deduced a trap composed of 118 places in 167 ms of which 3 ms to minimize.
[2024-06-01 13:42:55] [INFO ] Deduced a trap composed of 131 places in 135 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-06-01 13:42:58] [INFO ] Deduced a trap composed of 165 places in 163 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-06-01 13:43:08] [INFO ] Deduced a trap composed of 158 places in 163 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-06-01 13:43:12] [INFO ] Deduced a trap composed of 154 places in 148 ms of which 2 ms to minimize.
[2024-06-01 13:43:12] [INFO ] Deduced a trap composed of 154 places in 127 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 352/1100 variables, and 63 constraints, problems are : Problem set: 0 solved, 756 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/354 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 756/756 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 756 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 23/63 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-06-01 13:43:14] [INFO ] Deduced a trap composed of 146 places in 128 ms of which 2 ms to minimize.
[2024-06-01 13:43:18] [INFO ] Deduced a trap composed of 114 places in 139 ms of which 3 ms to minimize.
[2024-06-01 13:43:18] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 2 ms to minimize.
[2024-06-01 13:43:19] [INFO ] Deduced a trap composed of 210 places in 125 ms of which 2 ms to minimize.
[2024-06-01 13:43:19] [INFO ] Deduced a trap composed of 115 places in 116 ms of which 2 ms to minimize.
[2024-06-01 13:43:19] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 2 ms to minimize.
[2024-06-01 13:43:20] [INFO ] Deduced a trap composed of 51 places in 149 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 7/70 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-06-01 13:43:25] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 2 ms to minimize.
[2024-06-01 13:43:27] [INFO ] Deduced a trap composed of 50 places in 164 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 756 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 352/1100 variables, and 72 constraints, problems are : Problem set: 0 solved, 756 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/354 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/756 constraints, Known Traps: 32/32 constraints]
After SMT, in 60900ms problems are : Problem set: 0 solved, 756 unsolved
Search for dead transitions found 0 dead transitions in 60909ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64650 ms. Remains : 354/354 places, 758/758 transitions.
RANDOM walk for 40000 steps (17 resets) in 329 ms. (121 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (13 resets) in 87 ms. (454 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (9 resets) in 94 ms. (421 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 246294 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :0 out of 2
Probabilistic random walk after 246294 steps, saw 122043 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
[2024-06-01 13:43:46] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2024-06-01 13:43:46] [INFO ] Invariant cache hit.
[2024-06-01 13:43:46] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 18/24 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 3 (OVERLAPS) 248/272 variables, 3/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/284 variables, 4/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/298 variables, 7/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 53/351 variables, 20/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/351 variables, 0/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/352 variables, 1/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/352 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 746/1098 variables, 352/393 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1098 variables, 72/465 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1098 variables, 0/465 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1100 variables, 2/467 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1100 variables, 1/468 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1100 variables, 0/468 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1100 variables, 0/468 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1100/1100 variables, and 468 constraints, problems are : Problem set: 1 solved, 1 unsolved in 400 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 354/354 constraints, ReadFeed: 72/72 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/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/24 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 248/272 variables, 3/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/284 variables, 4/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/298 variables, 7/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 53/351 variables, 20/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 13:43:47] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:43:47] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/351 variables, 2/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/351 variables, 0/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/352 variables, 1/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/352 variables, 0/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1098/1100 variables, and 395 constraints, problems are : Problem set: 1 solved, 1 unsolved in 924 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 352/354 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1332ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 6 out of 354 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 354/354 places, 758/758 transitions.
Applied a total of 0 rules in 12 ms. Remains 354 /354 variables (removed 0) and now considering 758/758 (removed 0) transitions.
Running 756 sub problems to find dead transitions.
[2024-06-01 13:43:47] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2024-06-01 13:43:47] [INFO ] Invariant cache hit.
[2024-06-01 13:43:47] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-06-01 13:43:52] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 2 ms to minimize.
[2024-06-01 13:43:52] [INFO ] Deduced a trap composed of 148 places in 101 ms of which 2 ms to minimize.
[2024-06-01 13:43:52] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:43:52] [INFO ] Deduced a trap composed of 45 places in 24 ms of which 1 ms to minimize.
[2024-06-01 13:43:52] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:43:52] [INFO ] Deduced a trap composed of 45 places in 25 ms of which 1 ms to minimize.
[2024-06-01 13:43:52] [INFO ] Deduced a trap composed of 183 places in 132 ms of which 2 ms to minimize.
[2024-06-01 13:43:52] [INFO ] Deduced a trap composed of 161 places in 132 ms of which 2 ms to minimize.
[2024-06-01 13:43:53] [INFO ] Deduced a trap composed of 141 places in 150 ms of which 3 ms to minimize.
[2024-06-01 13:43:53] [INFO ] Deduced a trap composed of 129 places in 126 ms of which 2 ms to minimize.
[2024-06-01 13:43:53] [INFO ] Deduced a trap composed of 45 places in 25 ms of which 0 ms to minimize.
[2024-06-01 13:43:53] [INFO ] Deduced a trap composed of 122 places in 125 ms of which 2 ms to minimize.
[2024-06-01 13:43:53] [INFO ] Deduced a trap composed of 120 places in 120 ms of which 2 ms to minimize.
[2024-06-01 13:43:53] [INFO ] Deduced a trap composed of 153 places in 125 ms of which 2 ms to minimize.
[2024-06-01 13:43:55] [INFO ] Deduced a trap composed of 164 places in 151 ms of which 2 ms to minimize.
[2024-06-01 13:43:55] [INFO ] Deduced a trap composed of 164 places in 119 ms of which 2 ms to minimize.
[2024-06-01 13:43:56] [INFO ] Deduced a trap composed of 117 places in 183 ms of which 3 ms to minimize.
[2024-06-01 13:43:58] [INFO ] Deduced a trap composed of 118 places in 131 ms of which 2 ms to minimize.
[2024-06-01 13:43:58] [INFO ] Deduced a trap composed of 131 places in 131 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-06-01 13:44:01] [INFO ] Deduced a trap composed of 165 places in 153 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 756 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 352/1100 variables, and 60 constraints, problems are : Problem set: 0 solved, 756 unsolved in 20013 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/354 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 756/756 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 756 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-06-01 13:44:12] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 2 ms to minimize.
[2024-06-01 13:44:14] [INFO ] Deduced a trap composed of 53 places in 174 ms of which 3 ms to minimize.
[2024-06-01 13:44:15] [INFO ] Deduced a trap composed of 106 places in 167 ms of which 3 ms to minimize.
[2024-06-01 13:44:15] [INFO ] Deduced a trap composed of 114 places in 150 ms of which 2 ms to minimize.
[2024-06-01 13:44:15] [INFO ] Deduced a trap composed of 218 places in 161 ms of which 3 ms to minimize.
[2024-06-01 13:44:15] [INFO ] Deduced a trap composed of 200 places in 131 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-06-01 13:44:21] [INFO ] Deduced a trap composed of 148 places in 144 ms of which 2 ms to minimize.
[2024-06-01 13:44:21] [INFO ] Deduced a trap composed of 43 places in 120 ms of which 1 ms to minimize.
[2024-06-01 13:44:22] [INFO ] Deduced a trap composed of 186 places in 165 ms of which 3 ms to minimize.
[2024-06-01 13:44:25] [INFO ] Deduced a trap composed of 118 places in 158 ms of which 3 ms to minimize.
[2024-06-01 13:44:26] [INFO ] Deduced a trap composed of 146 places in 171 ms of which 2 ms to minimize.
[2024-06-01 13:44:27] [INFO ] Deduced a trap composed of 138 places in 162 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 756 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 352/1100 variables, and 72 constraints, problems are : Problem set: 0 solved, 756 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/354 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/756 constraints, Known Traps: 32/32 constraints]
After SMT, in 40800ms problems are : Problem set: 0 solved, 756 unsolved
Search for dead transitions found 0 dead transitions in 40807ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40821 ms. Remains : 354/354 places, 758/758 transitions.
RANDOM walk for 40000 steps (21 resets) in 209 ms. (190 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (11 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 394398 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :0 out of 1
Probabilistic random walk after 394398 steps, saw 187786 distinct states, run finished after 3001 ms. (steps per millisecond=131 ) properties seen :0
[2024-06-01 13:44:31] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2024-06-01 13:44:31] [INFO ] Invariant cache hit.
[2024-06-01 13:44:31] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/24 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 248/272 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/284 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/298 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 53/351 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/351 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/352 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/352 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 746/1098 variables, 352/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1098 variables, 72/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1098 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1100 variables, 2/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1100 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1100 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1100 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1100/1100 variables, and 468 constraints, problems are : Problem set: 0 solved, 1 unsolved in 453 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 354/354 constraints, ReadFeed: 72/72 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/24 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 248/272 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/284 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/298 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 53/351 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:44:32] [INFO ] Deduced a trap composed of 45 places in 86 ms of which 2 ms to minimize.
[2024-06-01 13:44:32] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/351 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/351 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/352 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/352 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 746/1098 variables, 352/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1098 variables, 72/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1098 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:44:34] [INFO ] Deduced a trap composed of 141 places in 195 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1098 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1098 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/1100 variables, 2/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1100 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1100 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1100 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1100/1100 variables, and 472 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2569 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 354/354 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 3038ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 22 ms.
Support contains 6 out of 354 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 354/354 places, 758/758 transitions.
Applied a total of 0 rules in 21 ms. Remains 354 /354 variables (removed 0) and now considering 758/758 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 354/354 places, 758/758 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 354/354 places, 758/758 transitions.
Applied a total of 0 rules in 16 ms. Remains 354 /354 variables (removed 0) and now considering 758/758 (removed 0) transitions.
[2024-06-01 13:44:34] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2024-06-01 13:44:34] [INFO ] Invariant cache hit.
[2024-06-01 13:44:35] [INFO ] Implicit Places using invariants in 320 ms returned []
[2024-06-01 13:44:35] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2024-06-01 13:44:35] [INFO ] Invariant cache hit.
[2024-06-01 13:44:35] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:44:39] [INFO ] Implicit Places using invariants and state equation in 3826 ms returned []
Implicit Place search using SMT with State Equation took 4147 ms to find 0 implicit places.
[2024-06-01 13:44:39] [INFO ] Redundant transitions in 10 ms returned []
Running 756 sub problems to find dead transitions.
[2024-06-01 13:44:39] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2024-06-01 13:44:39] [INFO ] Invariant cache hit.
[2024-06-01 13:44:39] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-06-01 13:44:44] [INFO ] Deduced a trap composed of 45 places in 90 ms of which 2 ms to minimize.
[2024-06-01 13:44:44] [INFO ] Deduced a trap composed of 148 places in 84 ms of which 2 ms to minimize.
[2024-06-01 13:44:44] [INFO ] Deduced a trap composed of 46 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:44:44] [INFO ] Deduced a trap composed of 45 places in 24 ms of which 0 ms to minimize.
[2024-06-01 13:44:44] [INFO ] Deduced a trap composed of 45 places in 23 ms of which 0 ms to minimize.
[2024-06-01 13:44:44] [INFO ] Deduced a trap composed of 45 places in 23 ms of which 1 ms to minimize.
[2024-06-01 13:44:44] [INFO ] Deduced a trap composed of 183 places in 118 ms of which 2 ms to minimize.
[2024-06-01 13:44:44] [INFO ] Deduced a trap composed of 161 places in 118 ms of which 2 ms to minimize.
[2024-06-01 13:44:44] [INFO ] Deduced a trap composed of 141 places in 116 ms of which 2 ms to minimize.
[2024-06-01 13:44:44] [INFO ] Deduced a trap composed of 129 places in 113 ms of which 2 ms to minimize.
[2024-06-01 13:44:45] [INFO ] Deduced a trap composed of 45 places in 23 ms of which 1 ms to minimize.
[2024-06-01 13:44:45] [INFO ] Deduced a trap composed of 122 places in 116 ms of which 2 ms to minimize.
[2024-06-01 13:44:45] [INFO ] Deduced a trap composed of 120 places in 114 ms of which 2 ms to minimize.
[2024-06-01 13:44:45] [INFO ] Deduced a trap composed of 153 places in 112 ms of which 2 ms to minimize.
[2024-06-01 13:44:47] [INFO ] Deduced a trap composed of 164 places in 153 ms of which 2 ms to minimize.
[2024-06-01 13:44:47] [INFO ] Deduced a trap composed of 164 places in 138 ms of which 2 ms to minimize.
[2024-06-01 13:44:48] [INFO ] Deduced a trap composed of 117 places in 142 ms of which 2 ms to minimize.
[2024-06-01 13:44:50] [INFO ] Deduced a trap composed of 118 places in 133 ms of which 2 ms to minimize.
[2024-06-01 13:44:50] [INFO ] Deduced a trap composed of 131 places in 146 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-06-01 13:44:53] [INFO ] Deduced a trap composed of 165 places in 136 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-06-01 13:45:03] [INFO ] Deduced a trap composed of 158 places in 159 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-06-01 13:45:07] [INFO ] Deduced a trap composed of 154 places in 151 ms of which 2 ms to minimize.
[2024-06-01 13:45:07] [INFO ] Deduced a trap composed of 154 places in 141 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 352/1100 variables, and 63 constraints, problems are : Problem set: 0 solved, 756 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/354 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 756/756 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 756 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 23/63 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-06-01 13:45:11] [INFO ] Deduced a trap composed of 146 places in 182 ms of which 3 ms to minimize.
[2024-06-01 13:45:16] [INFO ] Deduced a trap composed of 114 places in 160 ms of which 2 ms to minimize.
[2024-06-01 13:45:16] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 2 ms to minimize.
[2024-06-01 13:45:16] [INFO ] Deduced a trap composed of 210 places in 139 ms of which 3 ms to minimize.
[2024-06-01 13:45:16] [INFO ] Deduced a trap composed of 115 places in 168 ms of which 3 ms to minimize.
[2024-06-01 13:45:17] [INFO ] Deduced a trap composed of 31 places in 193 ms of which 3 ms to minimize.
[2024-06-01 13:45:17] [INFO ] Deduced a trap composed of 51 places in 167 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 7/70 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-06-01 13:45:23] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-06-01 13:45:24] [INFO ] Deduced a trap composed of 50 places in 113 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 756 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 352/1100 variables, and 72 constraints, problems are : Problem set: 0 solved, 756 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/354 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/756 constraints, Known Traps: 32/32 constraints]
After SMT, in 61136ms problems are : Problem set: 0 solved, 756 unsolved
Search for dead transitions found 0 dead transitions in 61149ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65328 ms. Remains : 354/354 places, 758/758 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2] Max Struct:[26]
Ending property specific reduction for PolyORBLF-COL-S02J06T06-UpperBounds-00 in 237258 ms.
Starting property specific reduction for PolyORBLF-COL-S02J06T06-UpperBounds-01
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-06-01 13:45:40] [INFO ] Flow matrix only has 758 transitions (discarded 12 similar events)
// Phase 1: matrix 758 rows 366 cols
[2024-06-01 13:45:40] [INFO ] Computed 42 invariants in 16 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[20]
RANDOM walk for 10000 steps (4 resets) in 41 ms. (238 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 20 ms. (476 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[20]
[2024-06-01 13:45:40] [INFO ] Flow matrix only has 758 transitions (discarded 12 similar events)
[2024-06-01 13:45:40] [INFO ] Invariant cache hit.
[2024-06-01 13:45:40] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-06-01 13:45:40] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 20 ms returned sat
[2024-06-01 13:45:40] [INFO ] [Real]Absence check using state equation in 220 ms returned sat
[2024-06-01 13:45:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:45:40] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-06-01 13:45:40] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 17 ms returned sat
[2024-06-01 13:45:40] [INFO ] [Nat]Absence check using state equation in 219 ms returned sat
[2024-06-01 13:45:40] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:45:41] [INFO ] [Nat]Added 72 Read/Feed constraints in 211 ms returned sat
[2024-06-01 13:45:41] [INFO ] Deduced a trap composed of 117 places in 155 ms of which 2 ms to minimize.
[2024-06-01 13:45:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 259 ms
[2024-06-01 13:45:41] [INFO ] Computed and/alt/rep : 504/2415/498 causal constraints (skipped 258 transitions) in 38 ms.
[2024-06-01 13:45:42] [INFO ] Added : 40 causal constraints over 8 iterations in 1207 ms. Result :sat
Minimization took 761 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 6 out of 366 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 366/366 places, 770/770 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 360 transition count 764
Applied a total of 12 rules in 36 ms. Remains 360 /366 variables (removed 6) and now considering 764/770 (removed 6) transitions.
Running 762 sub problems to find dead transitions.
[2024-06-01 13:45:43] [INFO ] Flow matrix only has 752 transitions (discarded 12 similar events)
// Phase 1: matrix 752 rows 360 cols
[2024-06-01 13:45:43] [INFO ] Computed 42 invariants in 20 ms
[2024-06-01 13:45:43] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 762 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 762 unsolved
[2024-06-01 13:45:48] [INFO ] Deduced a trap composed of 46 places in 91 ms of which 1 ms to minimize.
[2024-06-01 13:45:48] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 3 ms to minimize.
[2024-06-01 13:45:48] [INFO ] Deduced a trap composed of 46 places in 24 ms of which 1 ms to minimize.
[2024-06-01 13:45:48] [INFO ] Deduced a trap composed of 46 places in 27 ms of which 1 ms to minimize.
[2024-06-01 13:45:48] [INFO ] Deduced a trap composed of 46 places in 28 ms of which 0 ms to minimize.
[2024-06-01 13:45:48] [INFO ] Deduced a trap composed of 46 places in 26 ms of which 0 ms to minimize.
[2024-06-01 13:45:48] [INFO ] Deduced a trap composed of 141 places in 137 ms of which 2 ms to minimize.
[2024-06-01 13:45:48] [INFO ] Deduced a trap composed of 113 places in 136 ms of which 2 ms to minimize.
[2024-06-01 13:45:49] [INFO ] Deduced a trap composed of 46 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:45:50] [INFO ] Deduced a trap composed of 219 places in 191 ms of which 3 ms to minimize.
[2024-06-01 13:45:52] [INFO ] Deduced a trap composed of 114 places in 115 ms of which 2 ms to minimize.
[2024-06-01 13:45:52] [INFO ] Deduced a trap composed of 118 places in 119 ms of which 2 ms to minimize.
[2024-06-01 13:45:52] [INFO ] Deduced a trap composed of 106 places in 144 ms of which 2 ms to minimize.
[2024-06-01 13:45:53] [INFO ] Deduced a trap composed of 131 places in 125 ms of which 2 ms to minimize.
[2024-06-01 13:45:53] [INFO ] Deduced a trap composed of 136 places in 162 ms of which 2 ms to minimize.
[2024-06-01 13:45:53] [INFO ] Deduced a trap composed of 122 places in 112 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 762 unsolved
[2024-06-01 13:45:55] [INFO ] Deduced a trap composed of 155 places in 160 ms of which 3 ms to minimize.
[2024-06-01 13:45:55] [INFO ] Deduced a trap composed of 178 places in 116 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 762 unsolved
[2024-06-01 13:46:04] [INFO ] Deduced a trap composed of 132 places in 122 ms of which 2 ms to minimize.
[2024-06-01 13:46:04] [INFO ] Deduced a trap composed of 149 places in 151 ms of which 3 ms to minimize.
SMT process timed out in 21114ms, After SMT, problems are : Problem set: 0 solved, 762 unsolved
Search for dead transitions found 0 dead transitions in 21127ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21166 ms. Remains : 360/366 places, 764/770 transitions.
[2024-06-01 13:46:04] [INFO ] Flow matrix only has 752 transitions (discarded 12 similar events)
[2024-06-01 13:46:04] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[20]
RANDOM walk for 1000000 steps (522 resets) in 2328 ms. (429 steps per ms)
BEST_FIRST walk for 1000000 steps (223 resets) in 1429 ms. (699 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[20]
[2024-06-01 13:46:08] [INFO ] Flow matrix only has 752 transitions (discarded 12 similar events)
[2024-06-01 13:46:08] [INFO ] Invariant cache hit.
[2024-06-01 13:46:08] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2024-06-01 13:46:08] [INFO ] [Real]Absence check using 12 positive and 30 generalized place invariants in 20 ms returned sat
[2024-06-01 13:46:08] [INFO ] [Real]Absence check using state equation in 325 ms returned sat
[2024-06-01 13:46:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:46:08] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-06-01 13:46:08] [INFO ] [Nat]Absence check using 12 positive and 30 generalized place invariants in 23 ms returned sat
[2024-06-01 13:46:09] [INFO ] [Nat]Absence check using state equation in 500 ms returned sat
[2024-06-01 13:46:09] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:46:09] [INFO ] [Nat]Added 72 Read/Feed constraints in 176 ms returned sat
[2024-06-01 13:46:09] [INFO ] Deduced a trap composed of 125 places in 206 ms of which 3 ms to minimize.
[2024-06-01 13:46:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 263 ms
[2024-06-01 13:46:09] [INFO ] Computed and/alt/rep : 462/2289/456 causal constraints (skipped 294 transitions) in 62 ms.
[2024-06-01 13:46:10] [INFO ] Deduced a trap composed of 135 places in 202 ms of which 2 ms to minimize.
[2024-06-01 13:46:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1097 ms
[2024-06-01 13:46:12] [INFO ] Added : 95 causal constraints over 19 iterations in 2475 ms. Result :sat
Minimization took 2464 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 6 out of 360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 764/764 transitions.
Applied a total of 0 rules in 11 ms. Remains 360 /360 variables (removed 0) and now considering 764/764 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 360/360 places, 764/764 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 764/764 transitions.
Applied a total of 0 rules in 11 ms. Remains 360 /360 variables (removed 0) and now considering 764/764 (removed 0) transitions.
[2024-06-01 13:46:15] [INFO ] Flow matrix only has 752 transitions (discarded 12 similar events)
[2024-06-01 13:46:15] [INFO ] Invariant cache hit.
[2024-06-01 13:46:15] [INFO ] Implicit Places using invariants in 411 ms returned []
[2024-06-01 13:46:15] [INFO ] Flow matrix only has 752 transitions (discarded 12 similar events)
[2024-06-01 13:46:15] [INFO ] Invariant cache hit.
[2024-06-01 13:46:16] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:46:19] [INFO ] Implicit Places using invariants and state equation in 3429 ms returned []
Implicit Place search using SMT with State Equation took 3842 ms to find 0 implicit places.
[2024-06-01 13:46:19] [INFO ] Redundant transitions in 11 ms returned []
Running 762 sub problems to find dead transitions.
[2024-06-01 13:46:19] [INFO ] Flow matrix only has 752 transitions (discarded 12 similar events)
[2024-06-01 13:46:19] [INFO ] Invariant cache hit.
[2024-06-01 13:46:19] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 762 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 762 unsolved
[2024-06-01 13:46:24] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:46:24] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:46:24] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:46:24] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:46:25] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 2 ms to minimize.
[2024-06-01 13:46:25] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:46:26] [INFO ] Deduced a trap composed of 46 places in 159 ms of which 2 ms to minimize.
[2024-06-01 13:46:26] [INFO ] Deduced a trap composed of 224 places in 189 ms of which 3 ms to minimize.
[2024-06-01 13:46:27] [INFO ] Deduced a trap composed of 123 places in 135 ms of which 2 ms to minimize.
[2024-06-01 13:46:28] [INFO ] Deduced a trap composed of 114 places in 113 ms of which 2 ms to minimize.
[2024-06-01 13:46:28] [INFO ] Deduced a trap composed of 120 places in 150 ms of which 2 ms to minimize.
[2024-06-01 13:46:29] [INFO ] Deduced a trap composed of 152 places in 162 ms of which 3 ms to minimize.
[2024-06-01 13:46:29] [INFO ] Deduced a trap composed of 144 places in 159 ms of which 2 ms to minimize.
[2024-06-01 13:46:29] [INFO ] Deduced a trap composed of 153 places in 137 ms of which 2 ms to minimize.
[2024-06-01 13:46:29] [INFO ] Deduced a trap composed of 147 places in 145 ms of which 3 ms to minimize.
[2024-06-01 13:46:30] [INFO ] Deduced a trap composed of 140 places in 145 ms of which 3 ms to minimize.
[2024-06-01 13:46:31] [INFO ] Deduced a trap composed of 121 places in 197 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 762 unsolved
[2024-06-01 13:46:32] [INFO ] Deduced a trap composed of 118 places in 141 ms of which 3 ms to minimize.
[2024-06-01 13:46:36] [INFO ] Deduced a trap composed of 119 places in 125 ms of which 2 ms to minimize.
[2024-06-01 13:46:36] [INFO ] Deduced a trap composed of 190 places in 152 ms of which 2 ms to minimize.
[2024-06-01 13:46:36] [INFO ] Deduced a trap composed of 141 places in 137 ms of which 2 ms to minimize.
[2024-06-01 13:46:36] [INFO ] Deduced a trap composed of 155 places in 171 ms of which 3 ms to minimize.
[2024-06-01 13:46:37] [INFO ] Deduced a trap composed of 137 places in 131 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 6/63 constraints. Problems are: Problem set: 0 solved, 762 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 762 unsolved
Problem TDEAD592 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/360 variables, 2/65 constraints. Problems are: Problem set: 30 solved, 732 unsolved
[2024-06-01 13:46:49] [INFO ] Deduced a trap composed of 112 places in 144 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 360/1112 variables, and 66 constraints, problems are : Problem set: 30 solved, 732 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/360 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 762/762 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 30 solved, 732 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 12/12 constraints. Problems are: Problem set: 30 solved, 732 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 28/40 constraints. Problems are: Problem set: 30 solved, 732 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 23/63 constraints. Problems are: Problem set: 30 solved, 732 unsolved
[2024-06-01 13:46:51] [INFO ] Deduced a trap composed of 118 places in 141 ms of which 2 ms to minimize.
[2024-06-01 13:46:53] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 2 ms to minimize.
[2024-06-01 13:46:53] [INFO ] Deduced a trap composed of 117 places in 107 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 3/66 constraints. Problems are: Problem set: 30 solved, 732 unsolved
[2024-06-01 13:46:58] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 2 ms to minimize.
[2024-06-01 13:47:04] [INFO ] Deduced a trap composed of 175 places in 129 ms of which 2 ms to minimize.
[2024-06-01 13:47:05] [INFO ] Deduced a trap composed of 160 places in 165 ms of which 3 ms to minimize.
[2024-06-01 13:47:05] [INFO ] Deduced a trap composed of 171 places in 147 ms of which 2 ms to minimize.
[2024-06-01 13:47:05] [INFO ] Deduced a trap composed of 162 places in 146 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 5/71 constraints. Problems are: Problem set: 30 solved, 732 unsolved
[2024-06-01 13:47:13] [INFO ] Deduced a trap composed of 52 places in 174 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 1/72 constraints. Problems are: Problem set: 30 solved, 732 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 358/1112 variables, and 72 constraints, problems are : Problem set: 30 solved, 732 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/360 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/762 constraints, Known Traps: 32/33 constraints]
After SMT, in 61020ms problems are : Problem set: 30 solved, 732 unsolved
Search for dead transitions found 30 dead transitions in 61033ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 360/360 places, 734/764 transitions.
Reduce places removed 2 places and 12 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 358 transition count 722
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 14 place count 346 transition count 710
Applied a total of 14 rules in 25 ms. Remains 346 /360 variables (removed 14) and now considering 710/734 (removed 24) transitions.
[2024-06-01 13:47:20] [INFO ] Flow matrix only has 698 transitions (discarded 12 similar events)
// Phase 1: matrix 698 rows 346 cols
[2024-06-01 13:47:20] [INFO ] Computed 42 invariants in 7 ms
[2024-06-01 13:47:20] [INFO ] Implicit Places using invariants in 299 ms returned []
[2024-06-01 13:47:20] [INFO ] Flow matrix only has 698 transitions (discarded 12 similar events)
[2024-06-01 13:47:20] [INFO ] Invariant cache hit.
[2024-06-01 13:47:20] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:47:23] [INFO ] Implicit Places using invariants and state equation in 2649 ms returned []
Implicit Place search using SMT with State Equation took 2950 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 346/360 places, 710/764 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 67879 ms. Remains : 346/360 places, 710/764 transitions.
[2024-06-01 13:47:23] [INFO ] Flow matrix only has 698 transitions (discarded 12 similar events)
[2024-06-01 13:47:23] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[12]
RANDOM walk for 1000000 steps (556 resets) in 2370 ms. (421 steps per ms)
BEST_FIRST walk for 1000000 steps (191 resets) in 1175 ms. (850 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[12]
[2024-06-01 13:47:26] [INFO ] Flow matrix only has 698 transitions (discarded 12 similar events)
[2024-06-01 13:47:26] [INFO ] Invariant cache hit.
[2024-06-01 13:47:26] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-06-01 13:47:26] [INFO ] [Real]Absence check using 14 positive and 28 generalized place invariants in 12 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[2]
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for PolyORBLF-COL-S02J06T06-UpperBounds-01 in 106732 ms.
Starting property specific reduction for PolyORBLF-COL-S02J06T06-UpperBounds-12
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[26]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[26]
[2024-06-01 13:47:26] [INFO ] Flow matrix only has 758 transitions (discarded 12 similar events)
// Phase 1: matrix 758 rows 366 cols
[2024-06-01 13:47:26] [INFO ] Computed 42 invariants in 12 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[26]
RANDOM walk for 10000 steps (7 resets) in 45 ms. (217 steps per ms)
BEST_FIRST walk for 10000 steps (3 resets) in 22 ms. (434 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[26]
[2024-06-01 13:47:27] [INFO ] Flow matrix only has 758 transitions (discarded 12 similar events)
[2024-06-01 13:47:27] [INFO ] Invariant cache hit.
[2024-06-01 13:47:27] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-06-01 13:47:27] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 33 ms returned sat
[2024-06-01 13:47:27] [INFO ] [Real]Absence check using state equation in 376 ms returned sat
[2024-06-01 13:47:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:47:27] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-06-01 13:47:27] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 22 ms returned sat
[2024-06-01 13:47:28] [INFO ] [Nat]Absence check using state equation in 414 ms returned sat
[2024-06-01 13:47:28] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:47:28] [INFO ] [Nat]Added 72 Read/Feed constraints in 333 ms returned sat
[2024-06-01 13:47:28] [INFO ] Computed and/alt/rep : 504/2415/498 causal constraints (skipped 258 transitions) in 63 ms.
[2024-06-01 13:47:29] [INFO ] Added : 64 causal constraints over 13 iterations in 1085 ms. Result :sat
Minimization took 565 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[26]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[26]
Support contains 6 out of 366 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 366/366 places, 770/770 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 366 transition count 764
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 360 transition count 764
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 24 place count 354 transition count 758
Applied a total of 24 rules in 42 ms. Remains 354 /366 variables (removed 12) and now considering 758/770 (removed 12) transitions.
Running 756 sub problems to find dead transitions.
[2024-06-01 13:47:30] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
// Phase 1: matrix 746 rows 354 cols
[2024-06-01 13:47:30] [INFO ] Computed 42 invariants in 15 ms
[2024-06-01 13:47:30] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-06-01 13:47:35] [INFO ] Deduced a trap composed of 45 places in 73 ms of which 2 ms to minimize.
[2024-06-01 13:47:35] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 2 ms to minimize.
[2024-06-01 13:47:35] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:47:35] [INFO ] Deduced a trap composed of 45 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:47:35] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:47:35] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:47:35] [INFO ] Deduced a trap composed of 132 places in 191 ms of which 2 ms to minimize.
[2024-06-01 13:47:35] [INFO ] Deduced a trap composed of 143 places in 192 ms of which 2 ms to minimize.
[2024-06-01 13:47:36] [INFO ] Deduced a trap composed of 134 places in 173 ms of which 2 ms to minimize.
[2024-06-01 13:47:36] [INFO ] Deduced a trap composed of 138 places in 195 ms of which 3 ms to minimize.
[2024-06-01 13:47:36] [INFO ] Deduced a trap composed of 118 places in 195 ms of which 3 ms to minimize.
[2024-06-01 13:47:36] [INFO ] Deduced a trap composed of 124 places in 146 ms of which 2 ms to minimize.
[2024-06-01 13:47:37] [INFO ] Deduced a trap composed of 118 places in 136 ms of which 2 ms to minimize.
[2024-06-01 13:47:37] [INFO ] Deduced a trap composed of 138 places in 137 ms of which 2 ms to minimize.
[2024-06-01 13:47:37] [INFO ] Deduced a trap composed of 133 places in 136 ms of which 2 ms to minimize.
[2024-06-01 13:47:37] [INFO ] Deduced a trap composed of 122 places in 137 ms of which 2 ms to minimize.
[2024-06-01 13:47:37] [INFO ] Deduced a trap composed of 156 places in 140 ms of which 2 ms to minimize.
[2024-06-01 13:47:37] [INFO ] Deduced a trap composed of 108 places in 137 ms of which 2 ms to minimize.
[2024-06-01 13:47:38] [INFO ] Deduced a trap composed of 47 places in 166 ms of which 3 ms to minimize.
[2024-06-01 13:47:38] [INFO ] Deduced a trap composed of 55 places in 168 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-06-01 13:47:39] [INFO ] Deduced a trap composed of 117 places in 181 ms of which 2 ms to minimize.
[2024-06-01 13:47:39] [INFO ] Deduced a trap composed of 117 places in 174 ms of which 3 ms to minimize.
[2024-06-01 13:47:39] [INFO ] Deduced a trap composed of 112 places in 167 ms of which 2 ms to minimize.
[2024-06-01 13:47:40] [INFO ] Deduced a trap composed of 44 places in 120 ms of which 2 ms to minimize.
[2024-06-01 13:47:41] [INFO ] Deduced a trap composed of 210 places in 151 ms of which 2 ms to minimize.
[2024-06-01 13:47:43] [INFO ] Deduced a trap composed of 106 places in 155 ms of which 3 ms to minimize.
[2024-06-01 13:47:43] [INFO ] Deduced a trap composed of 114 places in 138 ms of which 2 ms to minimize.
[2024-06-01 13:47:44] [INFO ] Deduced a trap composed of 126 places in 156 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-06-01 13:47:49] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 352/1100 variables, and 69 constraints, problems are : Problem set: 0 solved, 756 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/354 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 756/756 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 756 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 29/69 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-06-01 13:47:53] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 756 unsolved
SMT process timed out in 40909ms, After SMT, problems are : Problem set: 0 solved, 756 unsolved
Search for dead transitions found 0 dead transitions in 40921ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40966 ms. Remains : 354/366 places, 758/770 transitions.
[2024-06-01 13:48:11] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2024-06-01 13:48:11] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[26]
RANDOM walk for 1000000 steps (540 resets) in 2535 ms. (394 steps per ms)
BEST_FIRST walk for 1000000 steps (231 resets) in 1198 ms. (834 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[26]
[2024-06-01 13:48:14] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2024-06-01 13:48:14] [INFO ] Invariant cache hit.
[2024-06-01 13:48:14] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2024-06-01 13:48:14] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 29 ms returned sat
[2024-06-01 13:48:15] [INFO ] [Real]Absence check using state equation in 323 ms returned sat
[2024-06-01 13:48:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:48:15] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-06-01 13:48:15] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 15 ms returned sat
[2024-06-01 13:48:15] [INFO ] [Nat]Absence check using state equation in 470 ms returned sat
[2024-06-01 13:48:15] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:48:16] [INFO ] [Nat]Added 72 Read/Feed constraints in 440 ms returned sat
[2024-06-01 13:48:16] [INFO ] Computed and/alt/rep : 456/2283/450 causal constraints (skipped 294 transitions) in 57 ms.
[2024-06-01 13:48:17] [INFO ] Added : 98 causal constraints over 20 iterations in 1242 ms. Result :sat
Minimization took 1664 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[26]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[26]
Support contains 6 out of 354 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 354/354 places, 758/758 transitions.
Applied a total of 0 rules in 11 ms. Remains 354 /354 variables (removed 0) and now considering 758/758 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 354/354 places, 758/758 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 354/354 places, 758/758 transitions.
Applied a total of 0 rules in 10 ms. Remains 354 /354 variables (removed 0) and now considering 758/758 (removed 0) transitions.
[2024-06-01 13:48:19] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2024-06-01 13:48:19] [INFO ] Invariant cache hit.
[2024-06-01 13:48:20] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-06-01 13:48:20] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2024-06-01 13:48:20] [INFO ] Invariant cache hit.
[2024-06-01 13:48:20] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:48:23] [INFO ] Implicit Places using invariants and state equation in 3122 ms returned []
Implicit Place search using SMT with State Equation took 3448 ms to find 0 implicit places.
[2024-06-01 13:48:23] [INFO ] Redundant transitions in 10 ms returned []
Running 756 sub problems to find dead transitions.
[2024-06-01 13:48:23] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2024-06-01 13:48:23] [INFO ] Invariant cache hit.
[2024-06-01 13:48:23] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-06-01 13:48:28] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 2 ms to minimize.
[2024-06-01 13:48:28] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 2 ms to minimize.
[2024-06-01 13:48:28] [INFO ] Deduced a trap composed of 45 places in 29 ms of which 1 ms to minimize.
[2024-06-01 13:48:28] [INFO ] Deduced a trap composed of 45 places in 27 ms of which 1 ms to minimize.
[2024-06-01 13:48:28] [INFO ] Deduced a trap composed of 45 places in 30 ms of which 1 ms to minimize.
[2024-06-01 13:48:28] [INFO ] Deduced a trap composed of 45 places in 29 ms of which 1 ms to minimize.
[2024-06-01 13:48:28] [INFO ] Deduced a trap composed of 123 places in 140 ms of which 1 ms to minimize.
[2024-06-01 13:48:30] [INFO ] Deduced a trap composed of 213 places in 134 ms of which 2 ms to minimize.
[2024-06-01 13:48:31] [INFO ] Deduced a trap composed of 106 places in 159 ms of which 3 ms to minimize.
[2024-06-01 13:48:32] [INFO ] Deduced a trap composed of 114 places in 128 ms of which 2 ms to minimize.
[2024-06-01 13:48:32] [INFO ] Deduced a trap composed of 117 places in 174 ms of which 3 ms to minimize.
[2024-06-01 13:48:33] [INFO ] Deduced a trap composed of 135 places in 185 ms of which 2 ms to minimize.
[2024-06-01 13:48:33] [INFO ] Deduced a trap composed of 130 places in 153 ms of which 3 ms to minimize.
[2024-06-01 13:48:34] [INFO ] Deduced a trap composed of 118 places in 143 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-06-01 13:48:35] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:48:39] [INFO ] Deduced a trap composed of 131 places in 179 ms of which 2 ms to minimize.
[2024-06-01 13:48:39] [INFO ] Deduced a trap composed of 118 places in 146 ms of which 2 ms to minimize.
[2024-06-01 13:48:40] [INFO ] Deduced a trap composed of 113 places in 155 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-06-01 13:48:48] [INFO ] Deduced a trap composed of 154 places in 147 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 756 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 352/1100 variables, and 59 constraints, problems are : Problem set: 0 solved, 756 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/354 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 756/756 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 756 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-06-01 13:48:56] [INFO ] Deduced a trap composed of 42 places in 146 ms of which 3 ms to minimize.
[2024-06-01 13:48:57] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2024-06-01 13:48:57] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 2 ms to minimize.
[2024-06-01 13:48:58] [INFO ] Deduced a trap composed of 158 places in 194 ms of which 3 ms to minimize.
[2024-06-01 13:48:58] [INFO ] Deduced a trap composed of 158 places in 210 ms of which 3 ms to minimize.
[2024-06-01 13:48:58] [INFO ] Deduced a trap composed of 158 places in 178 ms of which 2 ms to minimize.
[2024-06-01 13:48:58] [INFO ] Deduced a trap composed of 158 places in 166 ms of which 2 ms to minimize.
[2024-06-01 13:48:58] [INFO ] Deduced a trap composed of 158 places in 147 ms of which 2 ms to minimize.
[2024-06-01 13:48:59] [INFO ] Deduced a trap composed of 158 places in 193 ms of which 3 ms to minimize.
[2024-06-01 13:48:59] [INFO ] Deduced a trap composed of 169 places in 207 ms of which 3 ms to minimize.
[2024-06-01 13:49:01] [INFO ] Deduced a trap composed of 26 places in 191 ms of which 3 ms to minimize.
[2024-06-01 13:49:01] [INFO ] Deduced a trap composed of 59 places in 172 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 5 (OVERLAPS) 1/353 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 756 unsolved
Problem TDEAD580 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
At refinement iteration 7 (OVERLAPS) 1/354 variables, 1/73 constraints. Problems are: Problem set: 30 solved, 726 unsolved
[2024-06-01 13:49:16] [INFO ] Deduced a trap composed of 112 places in 161 ms of which 3 ms to minimize.
[2024-06-01 13:49:20] [INFO ] Deduced a trap composed of 109 places in 193 ms of which 3 ms to minimize.
[2024-06-01 13:49:20] [INFO ] Deduced a trap composed of 117 places in 170 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 3/76 constraints. Problems are: Problem set: 30 solved, 726 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 354/1100 variables, and 76 constraints, problems are : Problem set: 30 solved, 726 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/354 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/756 constraints, Known Traps: 34/34 constraints]
After SMT, in 60944ms problems are : Problem set: 30 solved, 726 unsolved
Search for dead transitions found 30 dead transitions in 60957ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 354/354 places, 728/758 transitions.
Reduce places removed 2 places and 12 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 352 transition count 716
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 14 place count 340 transition count 704
Applied a total of 14 rules in 14 ms. Remains 340 /354 variables (removed 14) and now considering 704/728 (removed 24) transitions.
[2024-06-01 13:49:24] [INFO ] Flow matrix only has 692 transitions (discarded 12 similar events)
// Phase 1: matrix 692 rows 340 cols
[2024-06-01 13:49:24] [INFO ] Computed 42 invariants in 16 ms
[2024-06-01 13:49:24] [INFO ] Implicit Places using invariants in 336 ms returned []
[2024-06-01 13:49:24] [INFO ] Flow matrix only has 692 transitions (discarded 12 similar events)
[2024-06-01 13:49:24] [INFO ] Invariant cache hit.
[2024-06-01 13:49:24] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:49:26] [INFO ] Implicit Places using invariants and state equation in 2295 ms returned []
Implicit Place search using SMT with State Equation took 2635 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 340/354 places, 704/758 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 67089 ms. Remains : 340/354 places, 704/758 transitions.
[2024-06-01 13:49:26] [INFO ] Flow matrix only has 692 transitions (discarded 12 similar events)
[2024-06-01 13:49:26] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[26]
RANDOM walk for 1000000 steps (565 resets) in 2574 ms. (388 steps per ms)
BEST_FIRST walk for 1000000 steps (244 resets) in 1326 ms. (753 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[26]
[2024-06-01 13:49:30] [INFO ] Flow matrix only has 692 transitions (discarded 12 similar events)
[2024-06-01 13:49:30] [INFO ] Invariant cache hit.
[2024-06-01 13:49:30] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-06-01 13:49:30] [INFO ] [Real]Absence check using 14 positive and 28 generalized place invariants in 13 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[2]
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-12 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for PolyORBLF-COL-S02J06T06-UpperBounds-12 in 123886 ms.
[2024-06-01 13:49:31] [INFO ] Flatten gal took : 144 ms
[2024-06-01 13:49:31] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2024-06-01 13:49:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 366 places, 770 transitions and 3712 arcs took 7 ms.
Total runtime 809661 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : PolyORBLF-COL-S02J06T06-UpperBounds-00

BK_STOP 1717249771369

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J06T06.tgz
mv PolyORBLF-COL-S02J06T06 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;