Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.7K Apr 12 09:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 12 09:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 12 09:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 12 09:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 12 10:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 12 10:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 10:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 12 10:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 93K May 18 16:43 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716877699508

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S05J40
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 06:28:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-28 06:28:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 06:28:20] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-28 06:28:21] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 06:28:21] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 749 ms
[2024-05-28 06:28:21] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 669 PT places and 1712.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2024-05-28 06:28:21] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 4 ms.
[2024-05-28 06:28:21] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2024-05-28 06:28:21] [INFO ] Computed 13 invariants in 8 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0] Max Struct:[5, 1, +inf, 10, +inf, 1, 10, 1, 5, +inf, +inf, +inf, +inf, +inf, 2, 10]
FORMULA PolyORBNT-COL-S05J40-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J40-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-28 06:28:21] [INFO ] Invariant cache hit.
[2024-05-28 06:28:21] [INFO ] [Real]Absence check using 6 positive place invariants in 26 ms returned sat
[2024-05-28 06:28:22] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2024-05-28 06:28:22] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-05-28 06:28:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 06:28:22] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-28 06:28:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:28:22] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 06:28:22] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 10 ms returned sat
[2024-05-28 06:28:22] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-05-28 06:28:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 06:28:22] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 06:28:22] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 19 ms to minimize.
[2024-05-28 06:28:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2024-05-28 06:28:22] [INFO ] Added : 36 causal constraints over 8 iterations in 176 ms. Result :sat
Minimization took 48 ms.
[2024-05-28 06:28:22] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 06:28:22] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-28 06:28:22] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-28 06:28:22] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 06:28:22] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 2 ms to minimize.
[2024-05-28 06:28:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:28:22] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 06:28:22] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 06:28:22] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-05-28 06:28:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 06:28:22] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 18 ms to minimize.
[2024-05-28 06:28:22] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:28:22] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-28 06:28:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 142 ms
[2024-05-28 06:28:22] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-28 06:28:22] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:28:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2024-05-28 06:28:22] [INFO ] Added : 36 causal constraints over 8 iterations in 107 ms. Result :sat
Minimization took 32 ms.
[2024-05-28 06:28:22] [INFO ] [Real]Absence check using 6 positive place invariants in 27 ms returned sat
[2024-05-28 06:28:22] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 06:28:22] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-28 06:28:22] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-28 06:28:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:28:23] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-28 06:28:23] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 06:28:23] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-28 06:28:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-28 06:28:23] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-28 06:28:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2024-05-28 06:28:23] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 17 ms.
[2024-05-28 06:28:23] [INFO ] Added : 22 causal constraints over 5 iterations in 476 ms. Result :sat
Minimization took 76 ms.
[2024-05-28 06:28:23] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 06:28:23] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-28 06:28:23] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-28 06:28:23] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 06:28:23] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:28:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:28:23] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 06:28:23] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 06:28:24] [INFO ] [Nat]Absence check using state equation in 264 ms returned sat
[2024-05-28 06:28:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-05-28 06:28:24] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:28:24] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:28:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 73 ms
[2024-05-28 06:28:24] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 06:28:24] [INFO ] Added : 36 causal constraints over 8 iterations in 153 ms. Result :sat
Minimization took 31 ms.
[2024-05-28 06:28:24] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-05-28 06:28:24] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2024-05-28 06:28:24] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-28 06:28:24] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-28 06:28:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:28:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 06:28:24] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 06:28:24] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-28 06:28:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 06:28:24] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-28 06:28:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2024-05-28 06:28:24] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-28 06:28:24] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 0 ms to minimize.
[2024-05-28 06:28:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2024-05-28 06:28:24] [INFO ] Added : 36 causal constraints over 8 iterations in 120 ms. Result :sat
Minimization took 244 ms.
[2024-05-28 06:28:25] [INFO ] [Real]Absence check using 6 positive place invariants in 53 ms returned sat
[2024-05-28 06:28:25] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 54 ms returned sat
[2024-05-28 06:28:25] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2024-05-28 06:28:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:28:25] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 06:28:25] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 06:28:25] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-28 06:28:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 06:28:25] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-28 06:28:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2024-05-28 06:28:25] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-28 06:28:25] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-28 06:28:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2024-05-28 06:28:25] [INFO ] Added : 36 causal constraints over 8 iterations in 129 ms. Result :sat
Minimization took 38 ms.
[2024-05-28 06:28:25] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 06:28:25] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned sat
[2024-05-28 06:28:25] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-28 06:28:25] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 06:28:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:28:25] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-28 06:28:25] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 06:28:25] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-28 06:28:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 06:28:25] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 06:28:26] [INFO ] Added : 21 causal constraints over 5 iterations in 390 ms. Result :sat
Minimization took 167 ms.
[2024-05-28 06:28:26] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 06:28:26] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned unsat
[2024-05-28 06:28:26] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-28 06:28:26] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned unsat
[2024-05-28 06:28:26] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 06:28:26] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 06:28:26] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-28 06:28:26] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-28 06:28:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:28:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 06:28:26] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 06:28:26] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-28 06:28:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 06:28:26] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 06:28:26] [INFO ] Added : 36 causal constraints over 8 iterations in 50 ms. Result :sat
Minimization took 32 ms.
[2024-05-28 06:28:26] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 06:28:26] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-28 06:28:26] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-28 06:28:26] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-28 06:28:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:28:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 06:28:26] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 06:28:26] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-28 06:28:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 06:28:26] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 06:28:26] [INFO ] Added : 3 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 15 ms.
[2024-05-28 06:28:26] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 06:28:26] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 06:28:26] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-28 06:28:26] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-28 06:28:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:28:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 06:28:26] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 31 ms returned sat
[2024-05-28 06:28:26] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-05-28 06:28:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 06:28:26] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:28:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2024-05-28 06:28:27] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-28 06:28:27] [INFO ] Added : 20 causal constraints over 4 iterations in 72 ms. Result :sat
Minimization took 35 ms.
[2024-05-28 06:28:27] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-28 06:28:27] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-28 06:28:27] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-28 06:28:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:28:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-28 06:28:27] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-28 06:28:27] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-28 06:28:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 06:28:27] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 06:28:27] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:28:27] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-28 06:28:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 91 ms
[2024-05-28 06:28:27] [INFO ] Added : 20 causal constraints over 4 iterations in 235 ms. Result :sat
Minimization took 57 ms.
[2024-05-28 06:28:27] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-28 06:28:27] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-28 06:28:27] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-28 06:28:27] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-28 06:28:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:28:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 06:28:27] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 06:28:27] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-28 06:28:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-28 06:28:27] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-28 06:28:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2024-05-28 06:28:27] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 06:28:28] [INFO ] Added : 10 causal constraints over 2 iterations in 550 ms. Result :sat
Minimization took 56 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0] Max Struct:[5, +inf, 10, +inf, 10, 1, 5, 1, 1, +inf, +inf, +inf, 2, 10]
FORMULA PolyORBNT-COL-S05J40-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J40-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-28 06:28:28] [INFO ] Unfolded HLPN to a Petri net with 669 places and 1630 transitions 10784 arcs in 133 ms.
[2024-05-28 06:28:28] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Deduced a syphon composed of 40 places in 13 ms
Reduce places removed 40 places and 40 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 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:[5, +inf, 10, +inf, 10, 1, 5, +inf, +inf, +inf, 2, 10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[5, +inf, 10, +inf, 10, 1, 5, +inf, +inf, +inf, 2, 10]
[2024-05-28 06:28:28] [INFO ] Flow matrix only has 931 transitions (discarded 4 similar events)
// Phase 1: matrix 931 rows 629 cols
[2024-05-28 06:28:28] [INFO ] Computed 102 invariants in 110 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[5, 11, 10, 11, 10, 1, 5, 11, 41, 41, 2, 10]
RANDOM walk for 10000 steps (683 resets) in 188 ms. (52 steps per ms)
FORMULA PolyORBNT-COL-S05J40-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-14 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100005 steps (1329 resets) in 384 ms. (259 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 1, 4, 1, 4, 4, 1, 1, 1, 3] Max Struct:[5, 11, 10, 11, 10, 5, 11, 41, 41, 10]
[2024-05-28 06:28:29] [INFO ] Flow matrix only has 931 transitions (discarded 4 similar events)
[2024-05-28 06:28:29] [INFO ] Invariant cache hit.
[2024-05-28 06:28:29] [INFO ] [Real]Absence check using 95 positive place invariants in 56 ms returned sat
[2024-05-28 06:28:29] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 9 ms returned sat
[2024-05-28 06:28:29] [INFO ] [Real]Absence check using state equation in 458 ms returned sat
[2024-05-28 06:28:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:28:30] [INFO ] [Nat]Absence check using 95 positive place invariants in 21 ms returned sat
[2024-05-28 06:28:30] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 8 ms returned sat
[2024-05-28 06:28:31] [INFO ] [Nat]Absence check using state equation in 1058 ms returned unsat
[2024-05-28 06:28:31] [INFO ] [Real]Absence check using 95 positive place invariants in 33 ms returned sat
[2024-05-28 06:28:31] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 5 ms returned unsat
[2024-05-28 06:28:31] [INFO ] [Real]Absence check using 95 positive place invariants in 45 ms returned sat
[2024-05-28 06:28:31] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 20 ms returned unsat
[2024-05-28 06:28:31] [INFO ] [Real]Absence check using 95 positive place invariants in 23 ms returned sat
[2024-05-28 06:28:31] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 4 ms returned unsat
[2024-05-28 06:28:31] [INFO ] [Real]Absence check using 95 positive place invariants in 27 ms returned sat
[2024-05-28 06:28:31] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 12 ms returned sat
[2024-05-28 06:28:32] [INFO ] [Real]Absence check using state equation in 510 ms returned sat
[2024-05-28 06:28:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:28:32] [INFO ] [Nat]Absence check using 95 positive place invariants in 30 ms returned sat
[2024-05-28 06:28:32] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 11 ms returned sat
[2024-05-28 06:28:33] [INFO ] [Nat]Absence check using state equation in 1103 ms returned unknown
[2024-05-28 06:28:33] [INFO ] [Real]Absence check using 95 positive place invariants in 22 ms returned sat
[2024-05-28 06:28:33] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 9 ms returned unsat
[2024-05-28 06:28:33] [INFO ] [Real]Absence check using 95 positive place invariants in 21 ms returned sat
[2024-05-28 06:28:33] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 4 ms returned unsat
[2024-05-28 06:28:33] [INFO ] [Real]Absence check using 95 positive place invariants in 22 ms returned sat
[2024-05-28 06:28:33] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 5 ms returned unsat
[2024-05-28 06:28:33] [INFO ] [Real]Absence check using 95 positive place invariants in 21 ms returned sat
[2024-05-28 06:28:33] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 9 ms returned unsat
[2024-05-28 06:28:34] [INFO ] [Real]Absence check using 95 positive place invariants in 25 ms returned sat
[2024-05-28 06:28:34] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 12 ms returned sat
[2024-05-28 06:28:34] [INFO ] [Real]Absence check using state equation in 288 ms returned sat
[2024-05-28 06:28:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:28:34] [INFO ] [Nat]Absence check using 95 positive place invariants in 22 ms returned sat
[2024-05-28 06:28:34] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 10 ms returned sat
[2024-05-28 06:28:35] [INFO ] [Nat]Absence check using state equation in 526 ms returned sat
[2024-05-28 06:28:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 06:28:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 202 ms returned sat
[2024-05-28 06:28:35] [INFO ] Computed and/alt/rep : 549/1329/549 causal constraints (skipped 376 transitions) in 146 ms.
[2024-05-28 06:28:36] [INFO ] Added : 17 causal constraints over 4 iterations in 544 ms. Result :sat
Minimization took 616 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 1, 4, 1, 4, 4, 1, 1, 1, 3] Max Struct:[4, 1, 4, 1, 10, 4, 1, 1, 1, 10]
FORMULA PolyORBNT-COL-S05J40-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-08 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 3] Max Struct:[10, 10]
Support contains 2 out of 629 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 629/629 places, 935/935 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 624 transition count 889
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 97 place count 578 transition count 889
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 97 place count 578 transition count 845
Deduced a syphon composed of 44 places in 2 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 185 place count 534 transition count 845
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 186 place count 533 transition count 844
Iterating global reduction 2 with 1 rules applied. Total rules applied 187 place count 533 transition count 844
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 191 place count 531 transition count 842
Applied a total of 191 rules in 357 ms. Remains 531 /629 variables (removed 98) and now considering 842/935 (removed 93) transitions.
Running 836 sub problems to find dead transitions.
[2024-05-28 06:28:37] [INFO ] Flow matrix only has 838 transitions (discarded 4 similar events)
// Phase 1: matrix 838 rows 531 cols
[2024-05-28 06:28:37] [INFO ] Computed 97 invariants in 43 ms
[2024-05-28 06:28:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 836 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 836 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 836 unsolved
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD620 is UNSAT
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 4/530 variables, 4/96 constraints. Problems are: Problem set: 78 solved, 758 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 530/1369 variables, and 96 constraints, problems are : Problem set: 78 solved, 758 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/531 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 836/836 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 78 solved, 758 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 86/86 constraints. Problems are: Problem set: 78 solved, 758 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 6/92 constraints. Problems are: Problem set: 78 solved, 758 unsolved
[2024-05-28 06:29:00] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 1 ms to minimize.
[2024-05-28 06:29:05] [INFO ] Deduced a trap composed of 14 places in 222 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 2/94 constraints. Problems are: Problem set: 78 solved, 758 unsolved
[2024-05-28 06:29:10] [INFO ] Deduced a trap composed of 124 places in 213 ms of which 4 ms to minimize.
[2024-05-28 06:29:10] [INFO ] Deduced a trap composed of 112 places in 251 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 2/96 constraints. Problems are: Problem set: 78 solved, 758 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 526/1369 variables, and 96 constraints, problems are : Problem set: 78 solved, 758 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 86/90 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/531 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/836 constraints, Known Traps: 4/4 constraints]
After SMT, in 42287ms problems are : Problem set: 78 solved, 758 unsolved
Search for dead transitions found 78 dead transitions in 42330ms
Found 78 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 78 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 78 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 531/629 places, 764/935 transitions.
Applied a total of 0 rules in 34 ms. Remains 531 /531 variables (removed 0) and now considering 764/764 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42757 ms. Remains : 531/629 places, 764/935 transitions.
[2024-05-28 06:29:19] [INFO ] Flow matrix only has 760 transitions (discarded 4 similar events)
// Phase 1: matrix 760 rows 531 cols
[2024-05-28 06:29:19] [INFO ] Computed 97 invariants in 17 ms
Current structural bounds on expressions (after invariants) : Max Seen:[4, 3] Max Struct:[10, 10]
RANDOM walk for 1000000 steps (47305 resets) in 4011 ms. (249 steps per ms)
BEST_FIRST walk for 2000002 steps (7782 resets) in 2579 ms. (775 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 3] Max Struct:[10, 10]
[2024-05-28 06:29:26] [INFO ] Flow matrix only has 760 transitions (discarded 4 similar events)
[2024-05-28 06:29:26] [INFO ] Invariant cache hit.
[2024-05-28 06:29:26] [INFO ] [Real]Absence check using 90 positive place invariants in 22 ms returned sat
[2024-05-28 06:29:26] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 11 ms returned sat
[2024-05-28 06:29:26] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2024-05-28 06:29:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:29:26] [INFO ] [Nat]Absence check using 90 positive place invariants in 21 ms returned sat
[2024-05-28 06:29:26] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 11 ms returned sat
[2024-05-28 06:29:26] [INFO ] [Nat]Absence check using state equation in 284 ms returned unsat
[2024-05-28 06:29:26] [INFO ] [Real]Absence check using 90 positive place invariants in 16 ms returned sat
[2024-05-28 06:29:26] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 9 ms returned sat
[2024-05-28 06:29:27] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2024-05-28 06:29:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 06:29:27] [INFO ] [Real]Added 1 Read/Feed constraints in 42 ms returned sat
[2024-05-28 06:29:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:29:27] [INFO ] [Nat]Absence check using 90 positive place invariants in 17 ms returned sat
[2024-05-28 06:29:27] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 24 ms returned sat
[2024-05-28 06:29:27] [INFO ] [Nat]Absence check using state equation in 244 ms returned sat
[2024-05-28 06:29:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 144 ms returned sat
[2024-05-28 06:29:27] [INFO ] Deduced a trap composed of 165 places in 209 ms of which 4 ms to minimize.
[2024-05-28 06:29:28] [INFO ] Deduced a trap composed of 171 places in 206 ms of which 4 ms to minimize.
[2024-05-28 06:29:28] [INFO ] Deduced a trap composed of 180 places in 205 ms of which 4 ms to minimize.
[2024-05-28 06:29:28] [INFO ] Deduced a trap composed of 177 places in 188 ms of which 3 ms to minimize.
[2024-05-28 06:29:28] [INFO ] Deduced a trap composed of 179 places in 178 ms of which 4 ms to minimize.
[2024-05-28 06:29:29] [INFO ] Deduced a trap composed of 155 places in 174 ms of which 3 ms to minimize.
[2024-05-28 06:29:29] [INFO ] Deduced a trap composed of 173 places in 176 ms of which 4 ms to minimize.
[2024-05-28 06:29:29] [INFO ] Deduced a trap composed of 170 places in 199 ms of which 3 ms to minimize.
[2024-05-28 06:29:29] [INFO ] Deduced a trap composed of 182 places in 171 ms of which 3 ms to minimize.
[2024-05-28 06:29:29] [INFO ] Deduced a trap composed of 161 places in 177 ms of which 3 ms to minimize.
[2024-05-28 06:29:30] [INFO ] Deduced a trap composed of 167 places in 276 ms of which 13 ms to minimize.
[2024-05-28 06:29:30] [INFO ] Deduced a trap composed of 173 places in 302 ms of which 9 ms to minimize.
[2024-05-28 06:29:31] [INFO ] Deduced a trap composed of 173 places in 221 ms of which 4 ms to minimize.
[2024-05-28 06:29:31] [INFO ] Deduced a trap composed of 155 places in 181 ms of which 4 ms to minimize.
[2024-05-28 06:29:31] [INFO ] Deduced a trap composed of 161 places in 203 ms of which 3 ms to minimize.
[2024-05-28 06:29:32] [INFO ] Deduced a trap composed of 161 places in 227 ms of which 4 ms to minimize.
[2024-05-28 06:29:32] [INFO ] Deduced a trap composed of 170 places in 197 ms of which 3 ms to minimize.
[2024-05-28 06:29:32] [INFO ] Deduced a trap composed of 164 places in 174 ms of which 3 ms to minimize.
[2024-05-28 06:29:32] [INFO ] Deduced a trap composed of 155 places in 184 ms of which 4 ms to minimize.
[2024-05-28 06:29:33] [INFO ] Deduced a trap composed of 179 places in 180 ms of which 3 ms to minimize.
[2024-05-28 06:29:33] [INFO ] Deduced a trap composed of 161 places in 217 ms of which 4 ms to minimize.
[2024-05-28 06:29:33] [INFO ] Deduced a trap composed of 167 places in 240 ms of which 4 ms to minimize.
[2024-05-28 06:29:33] [INFO ] Deduced a trap composed of 167 places in 234 ms of which 6 ms to minimize.
[2024-05-28 06:29:34] [INFO ] Deduced a trap composed of 158 places in 285 ms of which 17 ms to minimize.
[2024-05-28 06:29:34] [INFO ] Deduced a trap composed of 152 places in 272 ms of which 7 ms to minimize.
[2024-05-28 06:29:34] [INFO ] Deduced a trap composed of 164 places in 269 ms of which 5 ms to minimize.
[2024-05-28 06:29:35] [INFO ] Deduced a trap composed of 173 places in 275 ms of which 3 ms to minimize.
[2024-05-28 06:29:35] [INFO ] Deduced a trap composed of 173 places in 238 ms of which 4 ms to minimize.
[2024-05-28 06:29:36] [INFO ] Deduced a trap composed of 176 places in 276 ms of which 7 ms to minimize.
[2024-05-28 06:29:36] [INFO ] Deduced a trap composed of 158 places in 297 ms of which 6 ms to minimize.
[2024-05-28 06:29:37] [INFO ] Deduced a trap composed of 173 places in 235 ms of which 4 ms to minimize.
[2024-05-28 06:29:37] [INFO ] Deduced a trap composed of 170 places in 316 ms of which 6 ms to minimize.
[2024-05-28 06:29:37] [INFO ] Deduced a trap composed of 173 places in 243 ms of which 3 ms to minimize.
[2024-05-28 06:29:39] [INFO ] Deduced a trap composed of 164 places in 261 ms of which 5 ms to minimize.
[2024-05-28 06:29:40] [INFO ] Deduced a trap composed of 168 places in 228 ms of which 6 ms to minimize.
[2024-05-28 06:29:40] [INFO ] Deduced a trap composed of 161 places in 228 ms of which 3 ms to minimize.
[2024-05-28 06:29:40] [INFO ] Deduced a trap composed of 164 places in 232 ms of which 3 ms to minimize.
[2024-05-28 06:29:41] [INFO ] Deduced a trap composed of 167 places in 228 ms of which 3 ms to minimize.
[2024-05-28 06:29:42] [INFO ] Deduced a trap composed of 155 places in 177 ms of which 4 ms to minimize.
[2024-05-28 06:29:42] [INFO ] Deduced a trap composed of 173 places in 211 ms of which 3 ms to minimize.
[2024-05-28 06:29:46] [INFO ] Deduced a trap composed of 182 places in 219 ms of which 4 ms to minimize.
[2024-05-28 06:29:46] [INFO ] Deduced a trap composed of 164 places in 218 ms of which 4 ms to minimize.
[2024-05-28 06:29:48] [INFO ] Deduced a trap composed of 170 places in 252 ms of which 4 ms to minimize.
[2024-05-28 06:29:48] [INFO ] Deduced a trap composed of 171 places in 230 ms of which 3 ms to minimize.
[2024-05-28 06:29:49] [INFO ] Deduced a trap composed of 170 places in 235 ms of which 4 ms to minimize.
[2024-05-28 06:29:50] [INFO ] Deduced a trap composed of 170 places in 211 ms of which 3 ms to minimize.
[2024-05-28 06:29:51] [INFO ] Deduced a trap composed of 161 places in 208 ms of which 4 ms to minimize.
[2024-05-28 06:29:51] [INFO ] Deduced a trap composed of 173 places in 182 ms of which 3 ms to minimize.
[2024-05-28 06:29:56] [INFO ] Trap strengthening (SAT) tested/added 48/48 trap constraints in 28390 ms
Current structural bounds on expressions (after SMT) : Max Seen:[4, 3] Max Struct:[4, 10]
FORMULA PolyORBNT-COL-S05J40-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[10]
Support contains 1 out of 531 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 764/764 transitions.
Applied a total of 0 rules in 44 ms. Remains 531 /531 variables (removed 0) and now considering 764/764 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 531/531 places, 764/764 transitions.
[2024-05-28 06:29:56] [INFO ] Flow matrix only has 760 transitions (discarded 4 similar events)
[2024-05-28 06:29:56] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[10]
RANDOM walk for 1000001 steps (47237 resets) in 3899 ms. (256 steps per ms)
BEST_FIRST walk for 1000001 steps (4522 resets) in 1146 ms. (871 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[10]
[2024-05-28 06:30:01] [INFO ] Flow matrix only has 760 transitions (discarded 4 similar events)
[2024-05-28 06:30:01] [INFO ] Invariant cache hit.
[2024-05-28 06:30:01] [INFO ] [Real]Absence check using 90 positive place invariants in 23 ms returned sat
[2024-05-28 06:30:01] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 13 ms returned sat
[2024-05-28 06:30:01] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2024-05-28 06:30:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 06:30:01] [INFO ] [Real]Added 1 Read/Feed constraints in 19 ms returned sat
[2024-05-28 06:30:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:30:01] [INFO ] [Nat]Absence check using 90 positive place invariants in 24 ms returned sat
[2024-05-28 06:30:01] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 13 ms returned sat
[2024-05-28 06:30:01] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2024-05-28 06:30:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 168 ms returned sat
[2024-05-28 06:30:02] [INFO ] Deduced a trap composed of 165 places in 246 ms of which 4 ms to minimize.
[2024-05-28 06:30:02] [INFO ] Deduced a trap composed of 171 places in 203 ms of which 3 ms to minimize.
[2024-05-28 06:30:02] [INFO ] Deduced a trap composed of 180 places in 199 ms of which 3 ms to minimize.
[2024-05-28 06:30:03] [INFO ] Deduced a trap composed of 177 places in 208 ms of which 3 ms to minimize.
[2024-05-28 06:30:03] [INFO ] Deduced a trap composed of 179 places in 201 ms of which 3 ms to minimize.
[2024-05-28 06:30:03] [INFO ] Deduced a trap composed of 155 places in 215 ms of which 3 ms to minimize.
[2024-05-28 06:30:03] [INFO ] Deduced a trap composed of 173 places in 239 ms of which 3 ms to minimize.
[2024-05-28 06:30:04] [INFO ] Deduced a trap composed of 170 places in 223 ms of which 3 ms to minimize.
[2024-05-28 06:30:04] [INFO ] Deduced a trap composed of 182 places in 246 ms of which 4 ms to minimize.
[2024-05-28 06:30:04] [INFO ] Deduced a trap composed of 161 places in 216 ms of which 4 ms to minimize.
[2024-05-28 06:30:05] [INFO ] Deduced a trap composed of 167 places in 226 ms of which 3 ms to minimize.
[2024-05-28 06:30:05] [INFO ] Deduced a trap composed of 173 places in 233 ms of which 4 ms to minimize.
[2024-05-28 06:30:06] [INFO ] Deduced a trap composed of 173 places in 258 ms of which 4 ms to minimize.
[2024-05-28 06:30:06] [INFO ] Deduced a trap composed of 155 places in 258 ms of which 4 ms to minimize.
[2024-05-28 06:30:06] [INFO ] Deduced a trap composed of 161 places in 227 ms of which 3 ms to minimize.
[2024-05-28 06:30:07] [INFO ] Deduced a trap composed of 161 places in 218 ms of which 4 ms to minimize.
[2024-05-28 06:30:07] [INFO ] Deduced a trap composed of 170 places in 172 ms of which 3 ms to minimize.
[2024-05-28 06:30:07] [INFO ] Deduced a trap composed of 164 places in 183 ms of which 4 ms to minimize.
[2024-05-28 06:30:07] [INFO ] Deduced a trap composed of 155 places in 198 ms of which 3 ms to minimize.
[2024-05-28 06:30:07] [INFO ] Deduced a trap composed of 179 places in 185 ms of which 3 ms to minimize.
[2024-05-28 06:30:08] [INFO ] Deduced a trap composed of 161 places in 199 ms of which 3 ms to minimize.
[2024-05-28 06:30:08] [INFO ] Deduced a trap composed of 167 places in 171 ms of which 3 ms to minimize.
[2024-05-28 06:30:08] [INFO ] Deduced a trap composed of 167 places in 164 ms of which 4 ms to minimize.
[2024-05-28 06:30:08] [INFO ] Deduced a trap composed of 158 places in 181 ms of which 3 ms to minimize.
[2024-05-28 06:30:09] [INFO ] Deduced a trap composed of 152 places in 173 ms of which 3 ms to minimize.
[2024-05-28 06:30:09] [INFO ] Deduced a trap composed of 164 places in 172 ms of which 3 ms to minimize.
[2024-05-28 06:30:09] [INFO ] Deduced a trap composed of 173 places in 160 ms of which 3 ms to minimize.
[2024-05-28 06:30:09] [INFO ] Deduced a trap composed of 173 places in 186 ms of which 3 ms to minimize.
[2024-05-28 06:30:10] [INFO ] Deduced a trap composed of 176 places in 166 ms of which 3 ms to minimize.
[2024-05-28 06:30:10] [INFO ] Deduced a trap composed of 158 places in 175 ms of which 3 ms to minimize.
[2024-05-28 06:30:10] [INFO ] Deduced a trap composed of 173 places in 211 ms of which 3 ms to minimize.
[2024-05-28 06:30:10] [INFO ] Deduced a trap composed of 170 places in 210 ms of which 3 ms to minimize.
[2024-05-28 06:30:11] [INFO ] Deduced a trap composed of 173 places in 253 ms of which 3 ms to minimize.
[2024-05-28 06:30:13] [INFO ] Deduced a trap composed of 164 places in 459 ms of which 19 ms to minimize.
[2024-05-28 06:30:13] [INFO ] Deduced a trap composed of 168 places in 267 ms of which 4 ms to minimize.
[2024-05-28 06:30:14] [INFO ] Deduced a trap composed of 161 places in 254 ms of which 3 ms to minimize.
[2024-05-28 06:30:14] [INFO ] Deduced a trap composed of 164 places in 246 ms of which 3 ms to minimize.
[2024-05-28 06:30:14] [INFO ] Deduced a trap composed of 167 places in 202 ms of which 3 ms to minimize.
[2024-05-28 06:30:15] [INFO ] Deduced a trap composed of 155 places in 210 ms of which 3 ms to minimize.
[2024-05-28 06:30:16] [INFO ] Deduced a trap composed of 173 places in 210 ms of which 4 ms to minimize.
[2024-05-28 06:30:19] [INFO ] Deduced a trap composed of 182 places in 218 ms of which 4 ms to minimize.
[2024-05-28 06:30:20] [INFO ] Deduced a trap composed of 164 places in 275 ms of which 3 ms to minimize.
[2024-05-28 06:30:22] [INFO ] Deduced a trap composed of 170 places in 247 ms of which 3 ms to minimize.
[2024-05-28 06:30:22] [INFO ] Deduced a trap composed of 171 places in 211 ms of which 4 ms to minimize.
[2024-05-28 06:30:23] [INFO ] Deduced a trap composed of 170 places in 249 ms of which 3 ms to minimize.
[2024-05-28 06:30:25] [INFO ] Deduced a trap composed of 170 places in 210 ms of which 4 ms to minimize.
[2024-05-28 06:30:25] [INFO ] Deduced a trap composed of 161 places in 279 ms of which 3 ms to minimize.
[2024-05-28 06:30:25] [INFO ] Deduced a trap composed of 173 places in 291 ms of which 3 ms to minimize.
[2024-05-28 06:30:30] [INFO ] Trap strengthening (SAT) tested/added 48/48 trap constraints in 28311 ms
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[10]
Support contains 1 out of 531 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 764/764 transitions.
Applied a total of 0 rules in 56 ms. Remains 531 /531 variables (removed 0) and now considering 764/764 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 531/531 places, 764/764 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 764/764 transitions.
Applied a total of 0 rules in 41 ms. Remains 531 /531 variables (removed 0) and now considering 764/764 (removed 0) transitions.
[2024-05-28 06:30:30] [INFO ] Flow matrix only has 760 transitions (discarded 4 similar events)
[2024-05-28 06:30:30] [INFO ] Invariant cache hit.
[2024-05-28 06:30:31] [INFO ] Implicit Places using invariants in 748 ms returned []
[2024-05-28 06:30:31] [INFO ] Flow matrix only has 760 transitions (discarded 4 similar events)
[2024-05-28 06:30:31] [INFO ] Invariant cache hit.
[2024-05-28 06:30:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 06:30:33] [INFO ] Implicit Places using invariants and state equation in 2085 ms returned []
Implicit Place search using SMT with State Equation took 2838 ms to find 0 implicit places.
[2024-05-28 06:30:33] [INFO ] Redundant transitions in 54 ms returned []
Running 758 sub problems to find dead transitions.
[2024-05-28 06:30:33] [INFO ] Flow matrix only has 760 transitions (discarded 4 similar events)
[2024-05-28 06:30:33] [INFO ] Invariant cache hit.
[2024-05-28 06:30:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 06:30:40] [INFO ] Deduced a trap composed of 137 places in 193 ms of which 3 ms to minimize.
[2024-05-28 06:30:41] [INFO ] Deduced a trap composed of 137 places in 169 ms of which 3 ms to minimize.
[2024-05-28 06:30:41] [INFO ] Deduced a trap composed of 137 places in 157 ms of which 3 ms to minimize.
[2024-05-28 06:30:41] [INFO ] Deduced a trap composed of 137 places in 210 ms of which 3 ms to minimize.
[2024-05-28 06:30:41] [INFO ] Deduced a trap composed of 137 places in 167 ms of which 3 ms to minimize.
[2024-05-28 06:30:41] [INFO ] Deduced a trap composed of 137 places in 176 ms of which 3 ms to minimize.
[2024-05-28 06:30:42] [INFO ] Deduced a trap composed of 137 places in 176 ms of which 3 ms to minimize.
[2024-05-28 06:30:42] [INFO ] Deduced a trap composed of 137 places in 199 ms of which 3 ms to minimize.
[2024-05-28 06:30:42] [INFO ] Deduced a trap composed of 137 places in 157 ms of which 3 ms to minimize.
[2024-05-28 06:30:42] [INFO ] Deduced a trap composed of 137 places in 168 ms of which 3 ms to minimize.
[2024-05-28 06:30:42] [INFO ] Deduced a trap composed of 137 places in 169 ms of which 3 ms to minimize.
[2024-05-28 06:30:43] [INFO ] Deduced a trap composed of 137 places in 421 ms of which 33 ms to minimize.
[2024-05-28 06:30:43] [INFO ] Deduced a trap composed of 161 places in 252 ms of which 3 ms to minimize.
[2024-05-28 06:30:44] [INFO ] Deduced a trap composed of 138 places in 247 ms of which 3 ms to minimize.
[2024-05-28 06:30:44] [INFO ] Deduced a trap composed of 137 places in 214 ms of which 4 ms to minimize.
[2024-05-28 06:30:44] [INFO ] Deduced a trap composed of 138 places in 222 ms of which 4 ms to minimize.
[2024-05-28 06:30:44] [INFO ] Deduced a trap composed of 137 places in 211 ms of which 3 ms to minimize.
[2024-05-28 06:30:45] [INFO ] Deduced a trap composed of 158 places in 207 ms of which 4 ms to minimize.
[2024-05-28 06:30:50] [INFO ] Deduced a trap composed of 127 places in 241 ms of which 4 ms to minimize.
[2024-05-28 06:30:50] [INFO ] Deduced a trap composed of 14 places in 253 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 06:30:56] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/526 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 5 (OVERLAPS) 4/530 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 758 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 530/1291 variables, and 117 constraints, problems are : Problem set: 0 solved, 758 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/531 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 758/758 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 758 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 21/113 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 06:31:06] [INFO ] Deduced a trap composed of 141 places in 188 ms of which 3 ms to minimize.
[2024-05-28 06:31:06] [INFO ] Deduced a trap composed of 137 places in 167 ms of which 3 ms to minimize.
[2024-05-28 06:31:06] [INFO ] Deduced a trap composed of 137 places in 167 ms of which 2 ms to minimize.
[2024-05-28 06:31:06] [INFO ] Deduced a trap composed of 137 places in 199 ms of which 4 ms to minimize.
[2024-05-28 06:31:07] [INFO ] Deduced a trap composed of 137 places in 165 ms of which 3 ms to minimize.
[2024-05-28 06:31:07] [INFO ] Deduced a trap composed of 137 places in 151 ms of which 2 ms to minimize.
[2024-05-28 06:31:07] [INFO ] Deduced a trap composed of 137 places in 185 ms of which 2 ms to minimize.
[2024-05-28 06:31:07] [INFO ] Deduced a trap composed of 137 places in 176 ms of which 3 ms to minimize.
[2024-05-28 06:31:07] [INFO ] Deduced a trap composed of 141 places in 178 ms of which 4 ms to minimize.
[2024-05-28 06:31:07] [INFO ] Deduced a trap composed of 137 places in 156 ms of which 3 ms to minimize.
[2024-05-28 06:31:08] [INFO ] Deduced a trap composed of 137 places in 174 ms of which 3 ms to minimize.
[2024-05-28 06:31:08] [INFO ] Deduced a trap composed of 137 places in 150 ms of which 3 ms to minimize.
[2024-05-28 06:31:08] [INFO ] Deduced a trap composed of 141 places in 189 ms of which 3 ms to minimize.
[2024-05-28 06:31:08] [INFO ] Deduced a trap composed of 137 places in 167 ms of which 3 ms to minimize.
[2024-05-28 06:31:08] [INFO ] Deduced a trap composed of 141 places in 154 ms of which 3 ms to minimize.
[2024-05-28 06:31:09] [INFO ] Deduced a trap composed of 137 places in 150 ms of which 3 ms to minimize.
[2024-05-28 06:31:09] [INFO ] Deduced a trap composed of 137 places in 174 ms of which 3 ms to minimize.
[2024-05-28 06:31:09] [INFO ] Deduced a trap composed of 138 places in 177 ms of which 3 ms to minimize.
[2024-05-28 06:31:09] [INFO ] Deduced a trap composed of 138 places in 182 ms of which 3 ms to minimize.
[2024-05-28 06:31:09] [INFO ] Deduced a trap composed of 138 places in 175 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 20/133 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 06:31:11] [INFO ] Deduced a trap composed of 142 places in 218 ms of which 3 ms to minimize.
[2024-05-28 06:31:12] [INFO ] Deduced a trap composed of 137 places in 210 ms of which 3 ms to minimize.
[2024-05-28 06:31:12] [INFO ] Deduced a trap composed of 142 places in 173 ms of which 3 ms to minimize.
[2024-05-28 06:31:12] [INFO ] Deduced a trap composed of 137 places in 172 ms of which 3 ms to minimize.
[2024-05-28 06:31:12] [INFO ] Deduced a trap composed of 142 places in 173 ms of which 3 ms to minimize.
[2024-05-28 06:31:12] [INFO ] Deduced a trap composed of 137 places in 185 ms of which 3 ms to minimize.
[2024-05-28 06:31:12] [INFO ] Deduced a trap composed of 138 places in 169 ms of which 2 ms to minimize.
[2024-05-28 06:31:13] [INFO ] Deduced a trap composed of 138 places in 194 ms of which 4 ms to minimize.
[2024-05-28 06:31:13] [INFO ] Deduced a trap composed of 141 places in 173 ms of which 3 ms to minimize.
[2024-05-28 06:31:13] [INFO ] Deduced a trap composed of 138 places in 176 ms of which 3 ms to minimize.
[2024-05-28 06:31:13] [INFO ] Deduced a trap composed of 137 places in 178 ms of which 3 ms to minimize.
[2024-05-28 06:31:13] [INFO ] Deduced a trap composed of 141 places in 178 ms of which 3 ms to minimize.
[2024-05-28 06:31:14] [INFO ] Deduced a trap composed of 138 places in 173 ms of which 3 ms to minimize.
[2024-05-28 06:31:14] [INFO ] Deduced a trap composed of 141 places in 175 ms of which 3 ms to minimize.
[2024-05-28 06:31:14] [INFO ] Deduced a trap composed of 138 places in 173 ms of which 3 ms to minimize.
[2024-05-28 06:31:14] [INFO ] Deduced a trap composed of 137 places in 170 ms of which 3 ms to minimize.
[2024-05-28 06:31:14] [INFO ] Deduced a trap composed of 138 places in 167 ms of which 3 ms to minimize.
[2024-05-28 06:31:15] [INFO ] Deduced a trap composed of 142 places in 172 ms of which 3 ms to minimize.
[2024-05-28 06:31:15] [INFO ] Deduced a trap composed of 137 places in 169 ms of which 2 ms to minimize.
[2024-05-28 06:31:15] [INFO ] Deduced a trap composed of 138 places in 169 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/526 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 06:31:16] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 2 ms to minimize.
[2024-05-28 06:31:17] [INFO ] Deduced a trap composed of 141 places in 225 ms of which 4 ms to minimize.
[2024-05-28 06:31:18] [INFO ] Deduced a trap composed of 138 places in 199 ms of which 3 ms to minimize.
[2024-05-28 06:31:18] [INFO ] Deduced a trap composed of 137 places in 180 ms of which 3 ms to minimize.
[2024-05-28 06:31:18] [INFO ] Deduced a trap composed of 138 places in 183 ms of which 4 ms to minimize.
[2024-05-28 06:31:18] [INFO ] Deduced a trap composed of 141 places in 206 ms of which 6 ms to minimize.
[2024-05-28 06:31:18] [INFO ] Deduced a trap composed of 142 places in 189 ms of which 4 ms to minimize.
[2024-05-28 06:31:19] [INFO ] Deduced a trap composed of 137 places in 195 ms of which 3 ms to minimize.
[2024-05-28 06:31:19] [INFO ] Deduced a trap composed of 141 places in 171 ms of which 3 ms to minimize.
[2024-05-28 06:31:19] [INFO ] Deduced a trap composed of 141 places in 169 ms of which 4 ms to minimize.
[2024-05-28 06:31:19] [INFO ] Deduced a trap composed of 137 places in 176 ms of which 3 ms to minimize.
[2024-05-28 06:31:19] [INFO ] Deduced a trap composed of 137 places in 159 ms of which 3 ms to minimize.
[2024-05-28 06:31:19] [INFO ] Deduced a trap composed of 137 places in 162 ms of which 3 ms to minimize.
[2024-05-28 06:31:20] [INFO ] Deduced a trap composed of 141 places in 209 ms of which 3 ms to minimize.
[2024-05-28 06:31:20] [INFO ] Deduced a trap composed of 141 places in 178 ms of which 3 ms to minimize.
[2024-05-28 06:31:20] [INFO ] Deduced a trap composed of 137 places in 162 ms of which 3 ms to minimize.
[2024-05-28 06:31:20] [INFO ] Deduced a trap composed of 141 places in 175 ms of which 3 ms to minimize.
[2024-05-28 06:31:21] [INFO ] Deduced a trap composed of 137 places in 174 ms of which 3 ms to minimize.
[2024-05-28 06:31:21] [INFO ] Deduced a trap composed of 137 places in 193 ms of which 3 ms to minimize.
[2024-05-28 06:31:21] [INFO ] Deduced a trap composed of 161 places in 215 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/526 variables, 20/173 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 06:31:22] [INFO ] Deduced a trap composed of 141 places in 177 ms of which 3 ms to minimize.
[2024-05-28 06:31:22] [INFO ] Deduced a trap composed of 137 places in 174 ms of which 3 ms to minimize.
[2024-05-28 06:31:23] [INFO ] Deduced a trap composed of 137 places in 222 ms of which 3 ms to minimize.
[2024-05-28 06:31:23] [INFO ] Deduced a trap composed of 137 places in 173 ms of which 3 ms to minimize.
[2024-05-28 06:31:23] [INFO ] Deduced a trap composed of 137 places in 192 ms of which 4 ms to minimize.
[2024-05-28 06:31:23] [INFO ] Deduced a trap composed of 141 places in 231 ms of which 3 ms to minimize.
[2024-05-28 06:31:24] [INFO ] Deduced a trap composed of 137 places in 182 ms of which 4 ms to minimize.
[2024-05-28 06:31:24] [INFO ] Deduced a trap composed of 137 places in 214 ms of which 4 ms to minimize.
[2024-05-28 06:31:24] [INFO ] Deduced a trap composed of 137 places in 194 ms of which 3 ms to minimize.
[2024-05-28 06:31:24] [INFO ] Deduced a trap composed of 137 places in 190 ms of which 3 ms to minimize.
[2024-05-28 06:31:25] [INFO ] Deduced a trap composed of 137 places in 258 ms of which 4 ms to minimize.
[2024-05-28 06:31:25] [INFO ] Deduced a trap composed of 137 places in 257 ms of which 4 ms to minimize.
[2024-05-28 06:31:26] [INFO ] Deduced a trap composed of 141 places in 271 ms of which 4 ms to minimize.
[2024-05-28 06:31:26] [INFO ] Deduced a trap composed of 141 places in 200 ms of which 3 ms to minimize.
[2024-05-28 06:31:26] [INFO ] Deduced a trap composed of 137 places in 251 ms of which 3 ms to minimize.
[2024-05-28 06:31:26] [INFO ] Deduced a trap composed of 137 places in 249 ms of which 5 ms to minimize.
[2024-05-28 06:31:27] [INFO ] Deduced a trap composed of 137 places in 223 ms of which 4 ms to minimize.
[2024-05-28 06:31:27] [INFO ] Deduced a trap composed of 137 places in 237 ms of which 3 ms to minimize.
[2024-05-28 06:31:27] [INFO ] Deduced a trap composed of 141 places in 218 ms of which 4 ms to minimize.
[2024-05-28 06:31:27] [INFO ] Deduced a trap composed of 137 places in 203 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 20/193 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 06:31:28] [INFO ] Deduced a trap composed of 153 places in 184 ms of which 4 ms to minimize.
[2024-05-28 06:31:29] [INFO ] Deduced a trap composed of 137 places in 208 ms of which 4 ms to minimize.
[2024-05-28 06:31:29] [INFO ] Deduced a trap composed of 158 places in 166 ms of which 3 ms to minimize.
[2024-05-28 06:31:29] [INFO ] Deduced a trap composed of 137 places in 167 ms of which 4 ms to minimize.
[2024-05-28 06:31:29] [INFO ] Deduced a trap composed of 176 places in 214 ms of which 6 ms to minimize.
[2024-05-28 06:31:29] [INFO ] Deduced a trap composed of 137 places in 213 ms of which 3 ms to minimize.
[2024-05-28 06:31:30] [INFO ] Deduced a trap composed of 137 places in 182 ms of which 3 ms to minimize.
[2024-05-28 06:31:30] [INFO ] Deduced a trap composed of 137 places in 168 ms of which 3 ms to minimize.
[2024-05-28 06:31:30] [INFO ] Deduced a trap composed of 155 places in 190 ms of which 3 ms to minimize.
[2024-05-28 06:31:30] [INFO ] Deduced a trap composed of 161 places in 166 ms of which 2 ms to minimize.
[2024-05-28 06:31:31] [INFO ] Deduced a trap composed of 137 places in 190 ms of which 3 ms to minimize.
[2024-05-28 06:31:31] [INFO ] Deduced a trap composed of 164 places in 164 ms of which 2 ms to minimize.
[2024-05-28 06:31:31] [INFO ] Deduced a trap composed of 137 places in 159 ms of which 5 ms to minimize.
[2024-05-28 06:31:31] [INFO ] Deduced a trap composed of 137 places in 170 ms of which 3 ms to minimize.
[2024-05-28 06:31:31] [INFO ] Deduced a trap composed of 137 places in 180 ms of which 4 ms to minimize.
[2024-05-28 06:31:32] [INFO ] Deduced a trap composed of 137 places in 160 ms of which 3 ms to minimize.
[2024-05-28 06:31:32] [INFO ] Deduced a trap composed of 137 places in 159 ms of which 3 ms to minimize.
[2024-05-28 06:31:32] [INFO ] Deduced a trap composed of 137 places in 161 ms of which 2 ms to minimize.
[2024-05-28 06:31:32] [INFO ] Deduced a trap composed of 137 places in 165 ms of which 3 ms to minimize.
[2024-05-28 06:31:32] [INFO ] Deduced a trap composed of 137 places in 172 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/526 variables, 20/213 constraints. Problems are: Problem set: 0 solved, 758 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 2)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 1)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 1)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 1)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 1)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 1)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 1)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 526/1291 variables, and 213 constraints, problems are : Problem set: 0 solved, 758 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 86/90 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/531 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/758 constraints, Known Traps: 121/121 constraints]
After SMT, in 61678ms problems are : Problem set: 0 solved, 758 unsolved
Search for dead transitions found 0 dead transitions in 61689ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64637 ms. Remains : 531/531 places, 764/764 transitions.
RANDOM walk for 40000 steps (1896 resets) in 1002 ms. (39 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (202 resets) in 289 ms. (137 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (142 resets) in 254 ms. (156 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 349641 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :0 out of 2
Probabilistic random walk after 349641 steps, saw 106877 distinct states, run finished after 3005 ms. (steps per millisecond=116 ) properties seen :0
[2024-05-28 06:31:38] [INFO ] Flow matrix only has 760 transitions (discarded 4 similar events)
[2024-05-28 06:31:38] [INFO ] Invariant cache hit.
[2024-05-28 06:31:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 92/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 3 (OVERLAPS) 382/475 variables, 46/47 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/475 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 42/517 variables, 42/89 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/517 variables, 0/89 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/528 variables, 6/95 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/528 variables, 0/95 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/530 variables, 2/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/530 variables, 0/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 760/1290 variables, 530/627 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1290 variables, 1/628 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1290 variables, 0/628 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/1291 variables, 1/629 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1291 variables, 0/629 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1291 variables, 0/629 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1291/1291 variables, and 629 constraints, problems are : Problem set: 1 solved, 1 unsolved in 591 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 531/531 constraints, ReadFeed: 1/1 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/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 92/93 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 382/475 variables, 46/47 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/475 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 42/517 variables, 42/89 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/517 variables, 0/89 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/528 variables, 6/95 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/528 variables, 0/95 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/530 variables, 2/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/530 variables, 0/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 760/1290 variables, 530/627 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1290 variables, 1/628 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1290 variables, 1/629 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1290 variables, 0/629 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/1291 variables, 1/630 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1291 variables, 0/630 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1291 variables, 0/630 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1291/1291 variables, and 630 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1490 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 531/531 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2110ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 531 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 764/764 transitions.
Applied a total of 0 rules in 24 ms. Remains 531 /531 variables (removed 0) and now considering 764/764 (removed 0) transitions.
Running 758 sub problems to find dead transitions.
[2024-05-28 06:31:41] [INFO ] Flow matrix only has 760 transitions (discarded 4 similar events)
[2024-05-28 06:31:41] [INFO ] Invariant cache hit.
[2024-05-28 06:31:41] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 06:31:51] [INFO ] Deduced a trap composed of 137 places in 198 ms of which 3 ms to minimize.
[2024-05-28 06:31:51] [INFO ] Deduced a trap composed of 137 places in 304 ms of which 4 ms to minimize.
[2024-05-28 06:31:51] [INFO ] Deduced a trap composed of 137 places in 185 ms of which 3 ms to minimize.
[2024-05-28 06:31:52] [INFO ] Deduced a trap composed of 137 places in 200 ms of which 3 ms to minimize.
[2024-05-28 06:31:52] [INFO ] Deduced a trap composed of 137 places in 179 ms of which 3 ms to minimize.
[2024-05-28 06:31:52] [INFO ] Deduced a trap composed of 137 places in 182 ms of which 3 ms to minimize.
[2024-05-28 06:31:52] [INFO ] Deduced a trap composed of 137 places in 177 ms of which 3 ms to minimize.
[2024-05-28 06:31:52] [INFO ] Deduced a trap composed of 137 places in 197 ms of which 3 ms to minimize.
[2024-05-28 06:31:53] [INFO ] Deduced a trap composed of 137 places in 169 ms of which 3 ms to minimize.
[2024-05-28 06:31:53] [INFO ] Deduced a trap composed of 137 places in 170 ms of which 4 ms to minimize.
[2024-05-28 06:31:53] [INFO ] Deduced a trap composed of 137 places in 191 ms of which 4 ms to minimize.
[2024-05-28 06:31:53] [INFO ] Deduced a trap composed of 137 places in 172 ms of which 3 ms to minimize.
[2024-05-28 06:31:54] [INFO ] Deduced a trap composed of 161 places in 218 ms of which 3 ms to minimize.
[2024-05-28 06:31:54] [INFO ] Deduced a trap composed of 138 places in 189 ms of which 3 ms to minimize.
[2024-05-28 06:31:54] [INFO ] Deduced a trap composed of 137 places in 216 ms of which 4 ms to minimize.
[2024-05-28 06:31:54] [INFO ] Deduced a trap composed of 138 places in 188 ms of which 4 ms to minimize.
[2024-05-28 06:31:54] [INFO ] Deduced a trap composed of 137 places in 180 ms of which 6 ms to minimize.
[2024-05-28 06:31:55] [INFO ] Deduced a trap composed of 158 places in 167 ms of which 3 ms to minimize.
[2024-05-28 06:32:00] [INFO ] Deduced a trap composed of 127 places in 192 ms of which 4 ms to minimize.
[2024-05-28 06:32:00] [INFO ] Deduced a trap composed of 14 places in 217 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 758 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 526/1291 variables, and 112 constraints, problems are : Problem set: 0 solved, 758 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 86/90 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/531 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 758/758 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 758 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 06:32:04] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 2 ms to minimize.
[2024-05-28 06:32:05] [INFO ] Deduced a trap composed of 141 places in 197 ms of which 3 ms to minimize.
[2024-05-28 06:32:06] [INFO ] Deduced a trap composed of 137 places in 184 ms of which 3 ms to minimize.
[2024-05-28 06:32:06] [INFO ] Deduced a trap composed of 141 places in 179 ms of which 3 ms to minimize.
[2024-05-28 06:32:06] [INFO ] Deduced a trap composed of 137 places in 178 ms of which 4 ms to minimize.
[2024-05-28 06:32:06] [INFO ] Deduced a trap composed of 137 places in 190 ms of which 3 ms to minimize.
[2024-05-28 06:32:06] [INFO ] Deduced a trap composed of 137 places in 232 ms of which 3 ms to minimize.
[2024-05-28 06:32:07] [INFO ] Deduced a trap composed of 137 places in 240 ms of which 4 ms to minimize.
[2024-05-28 06:32:07] [INFO ] Deduced a trap composed of 137 places in 240 ms of which 3 ms to minimize.
[2024-05-28 06:32:07] [INFO ] Deduced a trap composed of 137 places in 222 ms of which 3 ms to minimize.
[2024-05-28 06:32:08] [INFO ] Deduced a trap composed of 141 places in 222 ms of which 4 ms to minimize.
[2024-05-28 06:32:08] [INFO ] Deduced a trap composed of 137 places in 250 ms of which 3 ms to minimize.
[2024-05-28 06:32:08] [INFO ] Deduced a trap composed of 137 places in 231 ms of which 4 ms to minimize.
[2024-05-28 06:32:08] [INFO ] Deduced a trap composed of 141 places in 242 ms of which 3 ms to minimize.
[2024-05-28 06:32:09] [INFO ] Deduced a trap composed of 137 places in 182 ms of which 3 ms to minimize.
[2024-05-28 06:32:09] [INFO ] Deduced a trap composed of 137 places in 206 ms of which 3 ms to minimize.
[2024-05-28 06:32:09] [INFO ] Deduced a trap composed of 141 places in 300 ms of which 4 ms to minimize.
[2024-05-28 06:32:09] [INFO ] Deduced a trap composed of 137 places in 230 ms of which 4 ms to minimize.
[2024-05-28 06:32:10] [INFO ] Deduced a trap composed of 141 places in 249 ms of which 3 ms to minimize.
[2024-05-28 06:32:10] [INFO ] Deduced a trap composed of 137 places in 237 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 06:32:12] [INFO ] Deduced a trap composed of 141 places in 225 ms of which 4 ms to minimize.
[2024-05-28 06:32:13] [INFO ] Deduced a trap composed of 137 places in 208 ms of which 4 ms to minimize.
[2024-05-28 06:32:13] [INFO ] Deduced a trap composed of 137 places in 231 ms of which 3 ms to minimize.
[2024-05-28 06:32:13] [INFO ] Deduced a trap composed of 141 places in 230 ms of which 3 ms to minimize.
[2024-05-28 06:32:13] [INFO ] Deduced a trap composed of 137 places in 224 ms of which 4 ms to minimize.
[2024-05-28 06:32:13] [INFO ] Deduced a trap composed of 137 places in 217 ms of which 4 ms to minimize.
[2024-05-28 06:32:14] [INFO ] Deduced a trap composed of 137 places in 228 ms of which 4 ms to minimize.
[2024-05-28 06:32:14] [INFO ] Deduced a trap composed of 141 places in 226 ms of which 4 ms to minimize.
[2024-05-28 06:32:14] [INFO ] Deduced a trap composed of 137 places in 226 ms of which 3 ms to minimize.
[2024-05-28 06:32:14] [INFO ] Deduced a trap composed of 141 places in 178 ms of which 3 ms to minimize.
[2024-05-28 06:32:15] [INFO ] Deduced a trap composed of 141 places in 178 ms of which 4 ms to minimize.
[2024-05-28 06:32:15] [INFO ] Deduced a trap composed of 141 places in 176 ms of which 3 ms to minimize.
[2024-05-28 06:32:15] [INFO ] Deduced a trap composed of 137 places in 172 ms of which 3 ms to minimize.
[2024-05-28 06:32:15] [INFO ] Deduced a trap composed of 141 places in 188 ms of which 4 ms to minimize.
[2024-05-28 06:32:15] [INFO ] Deduced a trap composed of 141 places in 220 ms of which 4 ms to minimize.
[2024-05-28 06:32:16] [INFO ] Deduced a trap composed of 141 places in 180 ms of which 3 ms to minimize.
[2024-05-28 06:32:16] [INFO ] Deduced a trap composed of 137 places in 183 ms of which 4 ms to minimize.
[2024-05-28 06:32:16] [INFO ] Deduced a trap composed of 141 places in 211 ms of which 3 ms to minimize.
[2024-05-28 06:32:16] [INFO ] Deduced a trap composed of 141 places in 198 ms of which 3 ms to minimize.
[2024-05-28 06:32:16] [INFO ] Deduced a trap composed of 141 places in 199 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/526 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 06:32:19] [INFO ] Deduced a trap composed of 141 places in 192 ms of which 4 ms to minimize.
[2024-05-28 06:32:19] [INFO ] Deduced a trap composed of 157 places in 180 ms of which 3 ms to minimize.
[2024-05-28 06:32:19] [INFO ] Deduced a trap composed of 141 places in 178 ms of which 3 ms to minimize.
[2024-05-28 06:32:19] [INFO ] Deduced a trap composed of 137 places in 175 ms of which 3 ms to minimize.
[2024-05-28 06:32:19] [INFO ] Deduced a trap composed of 141 places in 176 ms of which 3 ms to minimize.
[2024-05-28 06:32:20] [INFO ] Deduced a trap composed of 141 places in 182 ms of which 3 ms to minimize.
[2024-05-28 06:32:20] [INFO ] Deduced a trap composed of 137 places in 178 ms of which 3 ms to minimize.
[2024-05-28 06:32:20] [INFO ] Deduced a trap composed of 141 places in 203 ms of which 3 ms to minimize.
[2024-05-28 06:32:20] [INFO ] Deduced a trap composed of 137 places in 236 ms of which 3 ms to minimize.
[2024-05-28 06:32:21] [INFO ] Deduced a trap composed of 137 places in 256 ms of which 4 ms to minimize.
[2024-05-28 06:32:21] [INFO ] Deduced a trap composed of 137 places in 187 ms of which 4 ms to minimize.
[2024-05-28 06:32:21] [INFO ] Deduced a trap composed of 137 places in 187 ms of which 4 ms to minimize.
[2024-05-28 06:32:21] [INFO ] Deduced a trap composed of 137 places in 185 ms of which 3 ms to minimize.
[2024-05-28 06:32:21] [INFO ] Deduced a trap composed of 138 places in 177 ms of which 3 ms to minimize.
[2024-05-28 06:32:22] [INFO ] Deduced a trap composed of 141 places in 175 ms of which 3 ms to minimize.
[2024-05-28 06:32:22] [INFO ] Deduced a trap composed of 137 places in 177 ms of which 3 ms to minimize.
[2024-05-28 06:32:22] [INFO ] Deduced a trap composed of 158 places in 178 ms of which 3 ms to minimize.
[2024-05-28 06:32:23] [INFO ] Deduced a trap composed of 137 places in 229 ms of which 4 ms to minimize.
[2024-05-28 06:32:23] [INFO ] Deduced a trap composed of 141 places in 213 ms of which 4 ms to minimize.
SMT process timed out in 42322ms, After SMT, problems are : Problem set: 0 solved, 758 unsolved
Search for dead transitions found 0 dead transitions in 42347ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42393 ms. Remains : 531/531 places, 764/764 transitions.
RANDOM walk for 40000 steps (1908 resets) in 369 ms. (108 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (170 resets) in 136 ms. (292 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 437092 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :0 out of 1
Probabilistic random walk after 437092 steps, saw 134129 distinct states, run finished after 3002 ms. (steps per millisecond=145 ) properties seen :0
[2024-05-28 06:32:26] [INFO ] Flow matrix only has 760 transitions (discarded 4 similar events)
[2024-05-28 06:32:26] [INFO ] Invariant cache hit.
[2024-05-28 06:32:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 92/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 382/475 variables, 46/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/475 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 42/517 variables, 42/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/517 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/528 variables, 6/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/528 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/530 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/530 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 760/1290 variables, 530/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1290 variables, 1/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1290 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/1291 variables, 1/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1291 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1291 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1291/1291 variables, and 629 constraints, problems are : Problem set: 0 solved, 1 unsolved in 423 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 531/531 constraints, ReadFeed: 1/1 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 92/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 382/475 variables, 46/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/475 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 42/517 variables, 42/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/517 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/528 variables, 6/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/528 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/530 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/530 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 760/1290 variables, 530/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1290 variables, 1/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1290 variables, 1/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1290 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/1291 variables, 1/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1291 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1291 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1291/1291 variables, and 630 constraints, problems are : Problem set: 0 solved, 1 unsolved in 856 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 531/531 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1312ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 531 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 764/764 transitions.
Applied a total of 0 rules in 29 ms. Remains 531 /531 variables (removed 0) and now considering 764/764 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 531/531 places, 764/764 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 764/764 transitions.
Applied a total of 0 rules in 19 ms. Remains 531 /531 variables (removed 0) and now considering 764/764 (removed 0) transitions.
[2024-05-28 06:32:27] [INFO ] Flow matrix only has 760 transitions (discarded 4 similar events)
[2024-05-28 06:32:27] [INFO ] Invariant cache hit.
[2024-05-28 06:32:28] [INFO ] Implicit Places using invariants in 577 ms returned []
[2024-05-28 06:32:28] [INFO ] Flow matrix only has 760 transitions (discarded 4 similar events)
[2024-05-28 06:32:28] [INFO ] Invariant cache hit.
[2024-05-28 06:32:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 06:32:30] [INFO ] Implicit Places using invariants and state equation in 2087 ms returned []
Implicit Place search using SMT with State Equation took 2672 ms to find 0 implicit places.
[2024-05-28 06:32:30] [INFO ] Redundant transitions in 5 ms returned []
Running 758 sub problems to find dead transitions.
[2024-05-28 06:32:30] [INFO ] Flow matrix only has 760 transitions (discarded 4 similar events)
[2024-05-28 06:32:30] [INFO ] Invariant cache hit.
[2024-05-28 06:32:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 06:32:37] [INFO ] Deduced a trap composed of 137 places in 161 ms of which 3 ms to minimize.
[2024-05-28 06:32:37] [INFO ] Deduced a trap composed of 137 places in 191 ms of which 3 ms to minimize.
[2024-05-28 06:32:37] [INFO ] Deduced a trap composed of 137 places in 217 ms of which 3 ms to minimize.
[2024-05-28 06:32:38] [INFO ] Deduced a trap composed of 137 places in 220 ms of which 3 ms to minimize.
[2024-05-28 06:32:38] [INFO ] Deduced a trap composed of 137 places in 188 ms of which 3 ms to minimize.
[2024-05-28 06:32:38] [INFO ] Deduced a trap composed of 137 places in 193 ms of which 3 ms to minimize.
[2024-05-28 06:32:38] [INFO ] Deduced a trap composed of 137 places in 193 ms of which 3 ms to minimize.
[2024-05-28 06:32:38] [INFO ] Deduced a trap composed of 137 places in 162 ms of which 4 ms to minimize.
[2024-05-28 06:32:39] [INFO ] Deduced a trap composed of 137 places in 164 ms of which 3 ms to minimize.
[2024-05-28 06:32:39] [INFO ] Deduced a trap composed of 137 places in 151 ms of which 3 ms to minimize.
[2024-05-28 06:32:39] [INFO ] Deduced a trap composed of 137 places in 171 ms of which 3 ms to minimize.
[2024-05-28 06:32:39] [INFO ] Deduced a trap composed of 137 places in 175 ms of which 3 ms to minimize.
[2024-05-28 06:32:39] [INFO ] Deduced a trap composed of 161 places in 211 ms of which 3 ms to minimize.
[2024-05-28 06:32:40] [INFO ] Deduced a trap composed of 138 places in 168 ms of which 2 ms to minimize.
[2024-05-28 06:32:40] [INFO ] Deduced a trap composed of 137 places in 174 ms of which 3 ms to minimize.
[2024-05-28 06:32:40] [INFO ] Deduced a trap composed of 138 places in 148 ms of which 2 ms to minimize.
[2024-05-28 06:32:40] [INFO ] Deduced a trap composed of 137 places in 167 ms of which 3 ms to minimize.
[2024-05-28 06:32:40] [INFO ] Deduced a trap composed of 158 places in 188 ms of which 5 ms to minimize.
[2024-05-28 06:32:45] [INFO ] Deduced a trap composed of 127 places in 195 ms of which 3 ms to minimize.
[2024-05-28 06:32:46] [INFO ] Deduced a trap composed of 14 places in 195 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 06:32:51] [INFO ] Deduced a trap composed of 164 places in 169 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/526 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 5 (OVERLAPS) 4/530 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 758 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 530/1291 variables, and 117 constraints, problems are : Problem set: 0 solved, 758 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/531 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 758/758 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 758 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 21/113 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 06:33:03] [INFO ] Deduced a trap composed of 141 places in 232 ms of which 3 ms to minimize.
[2024-05-28 06:33:03] [INFO ] Deduced a trap composed of 137 places in 202 ms of which 3 ms to minimize.
[2024-05-28 06:33:03] [INFO ] Deduced a trap composed of 137 places in 223 ms of which 4 ms to minimize.
[2024-05-28 06:33:03] [INFO ] Deduced a trap composed of 137 places in 232 ms of which 4 ms to minimize.
[2024-05-28 06:33:04] [INFO ] Deduced a trap composed of 137 places in 208 ms of which 4 ms to minimize.
[2024-05-28 06:33:04] [INFO ] Deduced a trap composed of 137 places in 218 ms of which 4 ms to minimize.
[2024-05-28 06:33:04] [INFO ] Deduced a trap composed of 137 places in 237 ms of which 4 ms to minimize.
[2024-05-28 06:33:04] [INFO ] Deduced a trap composed of 137 places in 215 ms of which 3 ms to minimize.
[2024-05-28 06:33:04] [INFO ] Deduced a trap composed of 141 places in 212 ms of which 3 ms to minimize.
[2024-05-28 06:33:05] [INFO ] Deduced a trap composed of 137 places in 237 ms of which 4 ms to minimize.
[2024-05-28 06:33:05] [INFO ] Deduced a trap composed of 137 places in 198 ms of which 3 ms to minimize.
[2024-05-28 06:33:05] [INFO ] Deduced a trap composed of 137 places in 232 ms of which 4 ms to minimize.
[2024-05-28 06:33:05] [INFO ] Deduced a trap composed of 141 places in 253 ms of which 3 ms to minimize.
[2024-05-28 06:33:06] [INFO ] Deduced a trap composed of 137 places in 207 ms of which 3 ms to minimize.
[2024-05-28 06:33:06] [INFO ] Deduced a trap composed of 141 places in 209 ms of which 4 ms to minimize.
[2024-05-28 06:33:06] [INFO ] Deduced a trap composed of 137 places in 239 ms of which 3 ms to minimize.
[2024-05-28 06:33:06] [INFO ] Deduced a trap composed of 137 places in 231 ms of which 3 ms to minimize.
[2024-05-28 06:33:07] [INFO ] Deduced a trap composed of 138 places in 241 ms of which 4 ms to minimize.
[2024-05-28 06:33:07] [INFO ] Deduced a trap composed of 138 places in 220 ms of which 4 ms to minimize.
[2024-05-28 06:33:07] [INFO ] Deduced a trap composed of 138 places in 210 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 20/133 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 06:33:10] [INFO ] Deduced a trap composed of 142 places in 219 ms of which 3 ms to minimize.
[2024-05-28 06:33:10] [INFO ] Deduced a trap composed of 137 places in 222 ms of which 4 ms to minimize.
[2024-05-28 06:33:10] [INFO ] Deduced a trap composed of 142 places in 226 ms of which 3 ms to minimize.
[2024-05-28 06:33:10] [INFO ] Deduced a trap composed of 137 places in 221 ms of which 4 ms to minimize.
[2024-05-28 06:33:11] [INFO ] Deduced a trap composed of 142 places in 228 ms of which 4 ms to minimize.
[2024-05-28 06:33:11] [INFO ] Deduced a trap composed of 137 places in 219 ms of which 4 ms to minimize.
[2024-05-28 06:33:11] [INFO ] Deduced a trap composed of 138 places in 195 ms of which 4 ms to minimize.
[2024-05-28 06:33:11] [INFO ] Deduced a trap composed of 138 places in 196 ms of which 4 ms to minimize.
[2024-05-28 06:33:11] [INFO ] Deduced a trap composed of 141 places in 218 ms of which 4 ms to minimize.
[2024-05-28 06:33:12] [INFO ] Deduced a trap composed of 138 places in 223 ms of which 4 ms to minimize.
[2024-05-28 06:33:12] [INFO ] Deduced a trap composed of 137 places in 208 ms of which 4 ms to minimize.
[2024-05-28 06:33:12] [INFO ] Deduced a trap composed of 141 places in 240 ms of which 4 ms to minimize.
[2024-05-28 06:33:12] [INFO ] Deduced a trap composed of 138 places in 206 ms of which 3 ms to minimize.
[2024-05-28 06:33:13] [INFO ] Deduced a trap composed of 141 places in 241 ms of which 3 ms to minimize.
[2024-05-28 06:33:13] [INFO ] Deduced a trap composed of 138 places in 233 ms of which 4 ms to minimize.
[2024-05-28 06:33:13] [INFO ] Deduced a trap composed of 137 places in 197 ms of which 3 ms to minimize.
[2024-05-28 06:33:13] [INFO ] Deduced a trap composed of 138 places in 210 ms of which 3 ms to minimize.
[2024-05-28 06:33:14] [INFO ] Deduced a trap composed of 142 places in 194 ms of which 4 ms to minimize.
[2024-05-28 06:33:14] [INFO ] Deduced a trap composed of 137 places in 242 ms of which 4 ms to minimize.
[2024-05-28 06:33:14] [INFO ] Deduced a trap composed of 138 places in 220 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/526 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 06:33:15] [INFO ] Deduced a trap composed of 13 places in 181 ms of which 2 ms to minimize.
[2024-05-28 06:33:17] [INFO ] Deduced a trap composed of 141 places in 263 ms of which 4 ms to minimize.
[2024-05-28 06:33:17] [INFO ] Deduced a trap composed of 138 places in 257 ms of which 3 ms to minimize.
[2024-05-28 06:33:17] [INFO ] Deduced a trap composed of 137 places in 222 ms of which 4 ms to minimize.
[2024-05-28 06:33:18] [INFO ] Deduced a trap composed of 138 places in 223 ms of which 4 ms to minimize.
[2024-05-28 06:33:18] [INFO ] Deduced a trap composed of 141 places in 206 ms of which 3 ms to minimize.
[2024-05-28 06:33:18] [INFO ] Deduced a trap composed of 142 places in 199 ms of which 3 ms to minimize.
[2024-05-28 06:33:18] [INFO ] Deduced a trap composed of 137 places in 193 ms of which 3 ms to minimize.
[2024-05-28 06:33:19] [INFO ] Deduced a trap composed of 141 places in 228 ms of which 3 ms to minimize.
[2024-05-28 06:33:19] [INFO ] Deduced a trap composed of 141 places in 194 ms of which 3 ms to minimize.
[2024-05-28 06:33:19] [INFO ] Deduced a trap composed of 137 places in 192 ms of which 3 ms to minimize.
[2024-05-28 06:33:19] [INFO ] Deduced a trap composed of 137 places in 208 ms of which 3 ms to minimize.
[2024-05-28 06:33:19] [INFO ] Deduced a trap composed of 137 places in 191 ms of which 3 ms to minimize.
[2024-05-28 06:33:20] [INFO ] Deduced a trap composed of 141 places in 228 ms of which 4 ms to minimize.
[2024-05-28 06:33:20] [INFO ] Deduced a trap composed of 141 places in 213 ms of which 4 ms to minimize.
[2024-05-28 06:33:20] [INFO ] Deduced a trap composed of 137 places in 173 ms of which 3 ms to minimize.
[2024-05-28 06:33:21] [INFO ] Deduced a trap composed of 141 places in 195 ms of which 3 ms to minimize.
[2024-05-28 06:33:21] [INFO ] Deduced a trap composed of 137 places in 220 ms of which 3 ms to minimize.
[2024-05-28 06:33:21] [INFO ] Deduced a trap composed of 137 places in 254 ms of which 4 ms to minimize.
[2024-05-28 06:33:22] [INFO ] Deduced a trap composed of 161 places in 259 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/526 variables, 20/173 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 06:33:23] [INFO ] Deduced a trap composed of 141 places in 240 ms of which 4 ms to minimize.
[2024-05-28 06:33:23] [INFO ] Deduced a trap composed of 137 places in 221 ms of which 4 ms to minimize.
[2024-05-28 06:33:23] [INFO ] Deduced a trap composed of 137 places in 258 ms of which 4 ms to minimize.
[2024-05-28 06:33:24] [INFO ] Deduced a trap composed of 137 places in 249 ms of which 4 ms to minimize.
[2024-05-28 06:33:24] [INFO ] Deduced a trap composed of 137 places in 246 ms of which 4 ms to minimize.
[2024-05-28 06:33:24] [INFO ] Deduced a trap composed of 141 places in 241 ms of which 4 ms to minimize.
[2024-05-28 06:33:25] [INFO ] Deduced a trap composed of 137 places in 209 ms of which 3 ms to minimize.
[2024-05-28 06:33:25] [INFO ] Deduced a trap composed of 137 places in 249 ms of which 3 ms to minimize.
[2024-05-28 06:33:25] [INFO ] Deduced a trap composed of 137 places in 259 ms of which 4 ms to minimize.
[2024-05-28 06:33:25] [INFO ] Deduced a trap composed of 137 places in 223 ms of which 3 ms to minimize.
[2024-05-28 06:33:26] [INFO ] Deduced a trap composed of 137 places in 258 ms of which 4 ms to minimize.
[2024-05-28 06:33:26] [INFO ] Deduced a trap composed of 137 places in 241 ms of which 4 ms to minimize.
[2024-05-28 06:33:27] [INFO ] Deduced a trap composed of 141 places in 251 ms of which 3 ms to minimize.
[2024-05-28 06:33:27] [INFO ] Deduced a trap composed of 141 places in 220 ms of which 4 ms to minimize.
[2024-05-28 06:33:28] [INFO ] Deduced a trap composed of 137 places in 251 ms of which 3 ms to minimize.
[2024-05-28 06:33:28] [INFO ] Deduced a trap composed of 137 places in 192 ms of which 3 ms to minimize.
[2024-05-28 06:33:28] [INFO ] Deduced a trap composed of 137 places in 268 ms of which 4 ms to minimize.
[2024-05-28 06:33:28] [INFO ] Deduced a trap composed of 137 places in 213 ms of which 4 ms to minimize.
[2024-05-28 06:33:29] [INFO ] Deduced a trap composed of 141 places in 221 ms of which 3 ms to minimize.
[2024-05-28 06:33:29] [INFO ] Deduced a trap composed of 137 places in 203 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 20/193 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 06:33:30] [INFO ] Deduced a trap composed of 153 places in 222 ms of which 4 ms to minimize.
[2024-05-28 06:33:30] [INFO ] Deduced a trap composed of 137 places in 210 ms of which 4 ms to minimize.
[2024-05-28 06:33:30] [INFO ] Deduced a trap composed of 158 places in 219 ms of which 4 ms to minimize.
[2024-05-28 06:33:31] [INFO ] Deduced a trap composed of 137 places in 191 ms of which 4 ms to minimize.
[2024-05-28 06:33:31] [INFO ] Deduced a trap composed of 176 places in 193 ms of which 3 ms to minimize.
[2024-05-28 06:33:31] [INFO ] Deduced a trap composed of 137 places in 188 ms of which 4 ms to minimize.
[2024-05-28 06:33:31] [INFO ] Deduced a trap composed of 137 places in 209 ms of which 3 ms to minimize.
[2024-05-28 06:33:32] [INFO ] Deduced a trap composed of 137 places in 188 ms of which 3 ms to minimize.
SMT process timed out in 61510ms, After SMT, problems are : Problem set: 0 solved, 758 unsolved
Search for dead transitions found 0 dead transitions in 61523ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64231 ms. Remains : 531/531 places, 764/764 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[10]
Starting property specific reduction for PolyORBNT-COL-S05J40-UpperBounds-15
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
[2024-05-28 06:33:32] [INFO ] Flow matrix only has 760 transitions (discarded 4 similar events)
[2024-05-28 06:33:32] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (452 resets) in 36 ms. (270 steps per ms)
BEST_FIRST walk for 10001 steps (38 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[10]
[2024-05-28 06:33:32] [INFO ] Flow matrix only has 760 transitions (discarded 4 similar events)
[2024-05-28 06:33:32] [INFO ] Invariant cache hit.
[2024-05-28 06:33:32] [INFO ] [Real]Absence check using 90 positive place invariants in 18 ms returned sat
[2024-05-28 06:33:32] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 9 ms returned sat
[2024-05-28 06:33:32] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2024-05-28 06:33:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 06:33:32] [INFO ] [Real]Added 1 Read/Feed constraints in 18 ms returned sat
[2024-05-28 06:33:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:33:32] [INFO ] [Nat]Absence check using 90 positive place invariants in 17 ms returned sat
[2024-05-28 06:33:32] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 9 ms returned sat
[2024-05-28 06:33:32] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2024-05-28 06:33:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 109 ms returned sat
[2024-05-28 06:33:33] [INFO ] Deduced a trap composed of 165 places in 214 ms of which 3 ms to minimize.
[2024-05-28 06:33:33] [INFO ] Deduced a trap composed of 171 places in 226 ms of which 3 ms to minimize.
[2024-05-28 06:33:33] [INFO ] Deduced a trap composed of 180 places in 189 ms of which 3 ms to minimize.
[2024-05-28 06:33:33] [INFO ] Deduced a trap composed of 177 places in 206 ms of which 3 ms to minimize.
[2024-05-28 06:33:34] [INFO ] Deduced a trap composed of 179 places in 199 ms of which 3 ms to minimize.
[2024-05-28 06:33:34] [INFO ] Deduced a trap composed of 155 places in 207 ms of which 3 ms to minimize.
[2024-05-28 06:33:34] [INFO ] Deduced a trap composed of 173 places in 198 ms of which 3 ms to minimize.
[2024-05-28 06:33:34] [INFO ] Deduced a trap composed of 170 places in 233 ms of which 4 ms to minimize.
[2024-05-28 06:33:35] [INFO ] Deduced a trap composed of 182 places in 229 ms of which 4 ms to minimize.
[2024-05-28 06:33:35] [INFO ] Deduced a trap composed of 161 places in 224 ms of which 4 ms to minimize.
[2024-05-28 06:33:35] [INFO ] Deduced a trap composed of 167 places in 226 ms of which 4 ms to minimize.
[2024-05-28 06:33:35] [INFO ] Deduced a trap composed of 173 places in 207 ms of which 4 ms to minimize.
[2024-05-28 06:33:36] [INFO ] Deduced a trap composed of 173 places in 247 ms of which 4 ms to minimize.
[2024-05-28 06:33:36] [INFO ] Deduced a trap composed of 155 places in 232 ms of which 3 ms to minimize.
[2024-05-28 06:33:37] [INFO ] Deduced a trap composed of 161 places in 252 ms of which 4 ms to minimize.
[2024-05-28 06:33:37] [INFO ] Deduced a trap composed of 161 places in 232 ms of which 3 ms to minimize.
[2024-05-28 06:33:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:929)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[10]
Support contains 1 out of 531 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 764/764 transitions.
Applied a total of 0 rules in 28 ms. Remains 531 /531 variables (removed 0) and now considering 764/764 (removed 0) transitions.
Running 758 sub problems to find dead transitions.
[2024-05-28 06:33:37] [INFO ] Flow matrix only has 760 transitions (discarded 4 similar events)
[2024-05-28 06:33:37] [INFO ] Invariant cache hit.
[2024-05-28 06:33:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 06:33:44] [INFO ] Deduced a trap composed of 137 places in 217 ms of which 4 ms to minimize.
[2024-05-28 06:33:44] [INFO ] Deduced a trap composed of 137 places in 202 ms of which 4 ms to minimize.
[2024-05-28 06:33:45] [INFO ] Deduced a trap composed of 137 places in 202 ms of which 3 ms to minimize.
[2024-05-28 06:33:45] [INFO ] Deduced a trap composed of 137 places in 223 ms of which 4 ms to minimize.
[2024-05-28 06:33:45] [INFO ] Deduced a trap composed of 137 places in 204 ms of which 3 ms to minimize.
[2024-05-28 06:33:45] [INFO ] Deduced a trap composed of 137 places in 230 ms of which 4 ms to minimize.
[2024-05-28 06:33:46] [INFO ] Deduced a trap composed of 137 places in 247 ms of which 4 ms to minimize.
[2024-05-28 06:33:46] [INFO ] Deduced a trap composed of 137 places in 212 ms of which 3 ms to minimize.
[2024-05-28 06:33:46] [INFO ] Deduced a trap composed of 137 places in 206 ms of which 4 ms to minimize.
[2024-05-28 06:33:46] [INFO ] Deduced a trap composed of 137 places in 195 ms of which 3 ms to minimize.
[2024-05-28 06:33:47] [INFO ] Deduced a trap composed of 137 places in 201 ms of which 3 ms to minimize.
[2024-05-28 06:33:47] [INFO ] Deduced a trap composed of 137 places in 218 ms of which 4 ms to minimize.
[2024-05-28 06:33:47] [INFO ] Deduced a trap composed of 161 places in 219 ms of which 4 ms to minimize.
[2024-05-28 06:33:47] [INFO ] Deduced a trap composed of 138 places in 206 ms of which 4 ms to minimize.
[2024-05-28 06:33:48] [INFO ] Deduced a trap composed of 137 places in 204 ms of which 4 ms to minimize.
[2024-05-28 06:33:48] [INFO ] Deduced a trap composed of 138 places in 183 ms of which 3 ms to minimize.
[2024-05-28 06:33:48] [INFO ] Deduced a trap composed of 137 places in 197 ms of which 3 ms to minimize.
[2024-05-28 06:33:48] [INFO ] Deduced a trap composed of 158 places in 164 ms of which 3 ms to minimize.
[2024-05-28 06:33:53] [INFO ] Deduced a trap composed of 127 places in 222 ms of which 4 ms to minimize.
[2024-05-28 06:33:53] [INFO ] Deduced a trap composed of 14 places in 194 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 758 unsolved
(s438 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 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 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 (/ 2.0 3.0))
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 (/ 2.0 3.0))
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 (/ 1.0 3.0))
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 (/ 1.0 3.0))
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 4.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 9.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 1.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 1.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 1.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 526/1291 variables, and 112 constraints, problems are : Problem set: 0 solved, 758 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 86/90 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/531 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 758/758 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 758 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 06:34:00] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 2 ms to minimize.
[2024-05-28 06:34:01] [INFO ] Deduced a trap composed of 141 places in 198 ms of which 3 ms to minimize.
[2024-05-28 06:34:01] [INFO ] Deduced a trap composed of 137 places in 189 ms of which 3 ms to minimize.
[2024-05-28 06:34:02] [INFO ] Deduced a trap composed of 141 places in 207 ms of which 4 ms to minimize.
[2024-05-28 06:34:02] [INFO ] Deduced a trap composed of 137 places in 174 ms of which 3 ms to minimize.
[2024-05-28 06:34:02] [INFO ] Deduced a trap composed of 137 places in 174 ms of which 3 ms to minimize.
[2024-05-28 06:34:02] [INFO ] Deduced a trap composed of 137 places in 173 ms of which 3 ms to minimize.
[2024-05-28 06:34:02] [INFO ] Deduced a trap composed of 137 places in 202 ms of which 3 ms to minimize.
[2024-05-28 06:34:03] [INFO ] Deduced a trap composed of 137 places in 207 ms of which 3 ms to minimize.
[2024-05-28 06:34:03] [INFO ] Deduced a trap composed of 137 places in 178 ms of which 3 ms to minimize.
[2024-05-28 06:34:03] [INFO ] Deduced a trap composed of 141 places in 196 ms of which 4 ms to minimize.
[2024-05-28 06:34:03] [INFO ] Deduced a trap composed of 137 places in 214 ms of which 4 ms to minimize.
[2024-05-28 06:34:04] [INFO ] Deduced a trap composed of 137 places in 179 ms of which 3 ms to minimize.
[2024-05-28 06:34:04] [INFO ] Deduced a trap composed of 141 places in 200 ms of which 3 ms to minimize.
[2024-05-28 06:34:04] [INFO ] Deduced a trap composed of 137 places in 166 ms of which 2 ms to minimize.
[2024-05-28 06:34:04] [INFO ] Deduced a trap composed of 137 places in 223 ms of which 3 ms to minimize.
[2024-05-28 06:34:04] [INFO ] Deduced a trap composed of 141 places in 188 ms of which 3 ms to minimize.
[2024-05-28 06:34:05] [INFO ] Deduced a trap composed of 137 places in 186 ms of which 3 ms to minimize.
[2024-05-28 06:34:05] [INFO ] Deduced a trap composed of 141 places in 182 ms of which 3 ms to minimize.
[2024-05-28 06:34:05] [INFO ] Deduced a trap composed of 137 places in 182 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 06:34:07] [INFO ] Deduced a trap composed of 141 places in 202 ms of which 3 ms to minimize.
[2024-05-28 06:34:07] [INFO ] Deduced a trap composed of 137 places in 188 ms of which 3 ms to minimize.
[2024-05-28 06:34:07] [INFO ] Deduced a trap composed of 137 places in 156 ms of which 3 ms to minimize.
[2024-05-28 06:34:08] [INFO ] Deduced a trap composed of 141 places in 169 ms of which 3 ms to minimize.
[2024-05-28 06:34:08] [INFO ] Deduced a trap composed of 137 places in 174 ms of which 3 ms to minimize.
[2024-05-28 06:34:08] [INFO ] Deduced a trap composed of 137 places in 162 ms of which 3 ms to minimize.
[2024-05-28 06:34:08] [INFO ] Deduced a trap composed of 137 places in 181 ms of which 3 ms to minimize.
[2024-05-28 06:34:08] [INFO ] Deduced a trap composed of 141 places in 166 ms of which 3 ms to minimize.
[2024-05-28 06:34:09] [INFO ] Deduced a trap composed of 137 places in 168 ms of which 3 ms to minimize.
[2024-05-28 06:34:09] [INFO ] Deduced a trap composed of 141 places in 180 ms of which 3 ms to minimize.
[2024-05-28 06:34:09] [INFO ] Deduced a trap composed of 141 places in 172 ms of which 3 ms to minimize.
[2024-05-28 06:34:09] [INFO ] Deduced a trap composed of 141 places in 201 ms of which 3 ms to minimize.
[2024-05-28 06:34:09] [INFO ] Deduced a trap composed of 137 places in 161 ms of which 2 ms to minimize.
[2024-05-28 06:34:10] [INFO ] Deduced a trap composed of 141 places in 182 ms of which 3 ms to minimize.
[2024-05-28 06:34:10] [INFO ] Deduced a trap composed of 141 places in 202 ms of which 3 ms to minimize.
[2024-05-28 06:34:10] [INFO ] Deduced a trap composed of 141 places in 165 ms of which 2 ms to minimize.
[2024-05-28 06:34:10] [INFO ] Deduced a trap composed of 137 places in 163 ms of which 3 ms to minimize.
[2024-05-28 06:34:10] [INFO ] Deduced a trap composed of 141 places in 166 ms of which 3 ms to minimize.
[2024-05-28 06:34:10] [INFO ] Deduced a trap composed of 141 places in 171 ms of which 3 ms to minimize.
[2024-05-28 06:34:11] [INFO ] Deduced a trap composed of 141 places in 166 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/526 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 06:34:13] [INFO ] Deduced a trap composed of 141 places in 168 ms of which 3 ms to minimize.
[2024-05-28 06:34:13] [INFO ] Deduced a trap composed of 157 places in 173 ms of which 3 ms to minimize.
[2024-05-28 06:34:13] [INFO ] Deduced a trap composed of 141 places in 169 ms of which 3 ms to minimize.
[2024-05-28 06:34:13] [INFO ] Deduced a trap composed of 137 places in 165 ms of which 3 ms to minimize.
[2024-05-28 06:34:13] [INFO ] Deduced a trap composed of 141 places in 172 ms of which 3 ms to minimize.
[2024-05-28 06:34:14] [INFO ] Deduced a trap composed of 141 places in 174 ms of which 3 ms to minimize.
[2024-05-28 06:34:14] [INFO ] Deduced a trap composed of 137 places in 166 ms of which 2 ms to minimize.
[2024-05-28 06:34:14] [INFO ] Deduced a trap composed of 141 places in 163 ms of which 3 ms to minimize.
[2024-05-28 06:34:14] [INFO ] Deduced a trap composed of 137 places in 176 ms of which 19 ms to minimize.
[2024-05-28 06:34:14] [INFO ] Deduced a trap composed of 137 places in 181 ms of which 3 ms to minimize.
[2024-05-28 06:34:15] [INFO ] Deduced a trap composed of 137 places in 177 ms of which 2 ms to minimize.
[2024-05-28 06:34:15] [INFO ] Deduced a trap composed of 137 places in 163 ms of which 3 ms to minimize.
[2024-05-28 06:34:15] [INFO ] Deduced a trap composed of 137 places in 158 ms of which 2 ms to minimize.
[2024-05-28 06:34:15] [INFO ] Deduced a trap composed of 138 places in 214 ms of which 5 ms to minimize.
[2024-05-28 06:34:15] [INFO ] Deduced a trap composed of 141 places in 157 ms of which 3 ms to minimize.
[2024-05-28 06:34:16] [INFO ] Deduced a trap composed of 137 places in 156 ms of which 3 ms to minimize.
[2024-05-28 06:34:16] [INFO ] Deduced a trap composed of 158 places in 214 ms of which 3 ms to minimize.
[2024-05-28 06:34:16] [INFO ] Deduced a trap composed of 137 places in 221 ms of which 3 ms to minimize.
[2024-05-28 06:34:17] [INFO ] Deduced a trap composed of 141 places in 206 ms of which 3 ms to minimize.
[2024-05-28 06:34:17] [INFO ] Deduced a trap composed of 137 places in 200 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/526 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 06:34:18] [INFO ] Deduced a trap composed of 167 places in 180 ms of which 3 ms to minimize.
[2024-05-28 06:34:18] [INFO ] Deduced a trap composed of 173 places in 193 ms of which 3 ms to minimize.
[2024-05-28 06:34:18] [INFO ] Deduced a trap composed of 179 places in 203 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 526/1291 variables, and 175 constraints, problems are : Problem set: 0 solved, 758 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 86/90 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/531 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/758 constraints, Known Traps: 83/83 constraints]
After SMT, in 41409ms problems are : Problem set: 0 solved, 758 unsolved
Search for dead transitions found 0 dead transitions in 41423ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41455 ms. Remains : 531/531 places, 764/764 transitions.
[2024-05-28 06:34:19] [INFO ] Flow matrix only has 760 transitions (discarded 4 similar events)
[2024-05-28 06:34:19] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[10]
RANDOM walk for 1000000 steps (47268 resets) in 3946 ms. (253 steps per ms)
BEST_FIRST walk for 1000001 steps (4338 resets) in 1240 ms. (805 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[10]
[2024-05-28 06:34:24] [INFO ] Flow matrix only has 760 transitions (discarded 4 similar events)
[2024-05-28 06:34:24] [INFO ] Invariant cache hit.
[2024-05-28 06:34:24] [INFO ] [Real]Absence check using 90 positive place invariants in 24 ms returned sat
[2024-05-28 06:34:24] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 14 ms returned sat
[2024-05-28 06:34:24] [INFO ] [Real]Absence check using state equation in 216 ms returned sat
[2024-05-28 06:34:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 06:34:24] [INFO ] [Real]Added 1 Read/Feed constraints in 20 ms returned sat
[2024-05-28 06:34:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:34:24] [INFO ] [Nat]Absence check using 90 positive place invariants in 22 ms returned sat
[2024-05-28 06:34:24] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 11 ms returned sat
[2024-05-28 06:34:25] [INFO ] [Nat]Absence check using state equation in 241 ms returned sat
[2024-05-28 06:34:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 149 ms returned sat
[2024-05-28 06:34:25] [INFO ] Deduced a trap composed of 165 places in 201 ms of which 5 ms to minimize.
[2024-05-28 06:34:25] [INFO ] Deduced a trap composed of 171 places in 201 ms of which 4 ms to minimize.
[2024-05-28 06:34:25] [INFO ] Deduced a trap composed of 180 places in 193 ms of which 3 ms to minimize.
[2024-05-28 06:34:26] [INFO ] Deduced a trap composed of 177 places in 176 ms of which 3 ms to minimize.
[2024-05-28 06:34:26] [INFO ] Deduced a trap composed of 179 places in 216 ms of which 3 ms to minimize.
[2024-05-28 06:34:26] [INFO ] Deduced a trap composed of 155 places in 191 ms of which 3 ms to minimize.
[2024-05-28 06:34:26] [INFO ] Deduced a trap composed of 173 places in 178 ms of which 3 ms to minimize.
[2024-05-28 06:34:27] [INFO ] Deduced a trap composed of 170 places in 173 ms of which 3 ms to minimize.
[2024-05-28 06:34:27] [INFO ] Deduced a trap composed of 182 places in 169 ms of which 3 ms to minimize.
[2024-05-28 06:34:27] [INFO ] Deduced a trap composed of 161 places in 177 ms of which 3 ms to minimize.
[2024-05-28 06:34:27] [INFO ] Deduced a trap composed of 167 places in 174 ms of which 3 ms to minimize.
[2024-05-28 06:34:27] [INFO ] Deduced a trap composed of 173 places in 176 ms of which 3 ms to minimize.
[2024-05-28 06:34:28] [INFO ] Deduced a trap composed of 173 places in 219 ms of which 4 ms to minimize.
[2024-05-28 06:34:28] [INFO ] Deduced a trap composed of 155 places in 226 ms of which 4 ms to minimize.
[2024-05-28 06:34:29] [INFO ] Deduced a trap composed of 161 places in 228 ms of which 4 ms to minimize.
[2024-05-28 06:34:29] [INFO ] Deduced a trap composed of 161 places in 197 ms of which 3 ms to minimize.
[2024-05-28 06:34:29] [INFO ] Deduced a trap composed of 170 places in 192 ms of which 3 ms to minimize.
[2024-05-28 06:34:30] [INFO ] Deduced a trap composed of 164 places in 241 ms of which 4 ms to minimize.
[2024-05-28 06:34:30] [INFO ] Deduced a trap composed of 155 places in 236 ms of which 4 ms to minimize.
[2024-05-28 06:34:30] [INFO ] Deduced a trap composed of 179 places in 238 ms of which 4 ms to minimize.
[2024-05-28 06:34:30] [INFO ] Deduced a trap composed of 161 places in 240 ms of which 4 ms to minimize.
[2024-05-28 06:34:31] [INFO ] Deduced a trap composed of 167 places in 209 ms of which 3 ms to minimize.
[2024-05-28 06:34:31] [INFO ] Deduced a trap composed of 167 places in 213 ms of which 4 ms to minimize.
[2024-05-28 06:34:31] [INFO ] Deduced a trap composed of 158 places in 251 ms of which 3 ms to minimize.
[2024-05-28 06:34:32] [INFO ] Deduced a trap composed of 152 places in 212 ms of which 4 ms to minimize.
[2024-05-28 06:34:32] [INFO ] Deduced a trap composed of 164 places in 220 ms of which 4 ms to minimize.
[2024-05-28 06:34:32] [INFO ] Deduced a trap composed of 173 places in 189 ms of which 3 ms to minimize.
[2024-05-28 06:34:32] [INFO ] Deduced a trap composed of 173 places in 239 ms of which 4 ms to minimize.
[2024-05-28 06:34:33] [INFO ] Deduced a trap composed of 176 places in 222 ms of which 4 ms to minimize.
[2024-05-28 06:34:33] [INFO ] Deduced a trap composed of 158 places in 225 ms of which 4 ms to minimize.
[2024-05-28 06:34:34] [INFO ] Deduced a trap composed of 173 places in 217 ms of which 3 ms to minimize.
[2024-05-28 06:34:34] [INFO ] Deduced a trap composed of 170 places in 233 ms of which 4 ms to minimize.
[2024-05-28 06:34:34] [INFO ] Deduced a trap composed of 173 places in 239 ms of which 4 ms to minimize.
[2024-05-28 06:34:36] [INFO ] Deduced a trap composed of 164 places in 213 ms of which 3 ms to minimize.
[2024-05-28 06:34:37] [INFO ] Deduced a trap composed of 168 places in 200 ms of which 3 ms to minimize.
[2024-05-28 06:34:37] [INFO ] Deduced a trap composed of 161 places in 198 ms of which 4 ms to minimize.
[2024-05-28 06:34:37] [INFO ] Deduced a trap composed of 164 places in 198 ms of which 3 ms to minimize.
[2024-05-28 06:34:38] [INFO ] Deduced a trap composed of 167 places in 207 ms of which 3 ms to minimize.
[2024-05-28 06:34:39] [INFO ] Deduced a trap composed of 155 places in 251 ms of which 3 ms to minimize.
[2024-05-28 06:34:40] [INFO ] Deduced a trap composed of 173 places in 232 ms of which 4 ms to minimize.
[2024-05-28 06:34:43] [INFO ] Deduced a trap composed of 182 places in 238 ms of which 3 ms to minimize.
[2024-05-28 06:34:43] [INFO ] Deduced a trap composed of 164 places in 244 ms of which 4 ms to minimize.
[2024-05-28 06:34:45] [INFO ] Deduced a trap composed of 170 places in 215 ms of which 4 ms to minimize.
[2024-05-28 06:34:45] [INFO ] Deduced a trap composed of 171 places in 209 ms of which 3 ms to minimize.
[2024-05-28 06:34:46] [INFO ] Deduced a trap composed of 170 places in 248 ms of which 3 ms to minimize.
[2024-05-28 06:34:47] [INFO ] Deduced a trap composed of 170 places in 239 ms of which 4 ms to minimize.
[2024-05-28 06:34:48] [INFO ] Deduced a trap composed of 161 places in 236 ms of which 3 ms to minimize.
[2024-05-28 06:34:48] [INFO ] Deduced a trap composed of 173 places in 238 ms of which 5 ms to minimize.
[2024-05-28 06:34:53] [INFO ] Trap strengthening (SAT) tested/added 48/48 trap constraints in 27920 ms
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[10]
Support contains 1 out of 531 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 764/764 transitions.
Applied a total of 0 rules in 21 ms. Remains 531 /531 variables (removed 0) and now considering 764/764 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 531/531 places, 764/764 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 764/764 transitions.
Applied a total of 0 rules in 17 ms. Remains 531 /531 variables (removed 0) and now considering 764/764 (removed 0) transitions.
[2024-05-28 06:34:53] [INFO ] Flow matrix only has 760 transitions (discarded 4 similar events)
[2024-05-28 06:34:53] [INFO ] Invariant cache hit.
[2024-05-28 06:34:53] [INFO ] Implicit Places using invariants in 563 ms returned []
[2024-05-28 06:34:53] [INFO ] Flow matrix only has 760 transitions (discarded 4 similar events)
[2024-05-28 06:34:53] [INFO ] Invariant cache hit.
[2024-05-28 06:34:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 06:34:55] [INFO ] Implicit Places using invariants and state equation in 2115 ms returned []
Implicit Place search using SMT with State Equation took 2681 ms to find 0 implicit places.
[2024-05-28 06:34:55] [INFO ] Redundant transitions in 62 ms returned []
Running 758 sub problems to find dead transitions.
[2024-05-28 06:34:55] [INFO ] Flow matrix only has 760 transitions (discarded 4 similar events)
[2024-05-28 06:34:55] [INFO ] Invariant cache hit.
[2024-05-28 06:34:55] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 06:35:03] [INFO ] Deduced a trap composed of 137 places in 194 ms of which 4 ms to minimize.
[2024-05-28 06:35:03] [INFO ] Deduced a trap composed of 137 places in 191 ms of which 4 ms to minimize.
[2024-05-28 06:35:03] [INFO ] Deduced a trap composed of 137 places in 192 ms of which 4 ms to minimize.
[2024-05-28 06:35:04] [INFO ] Deduced a trap composed of 137 places in 223 ms of which 3 ms to minimize.
[2024-05-28 06:35:04] [INFO ] Deduced a trap composed of 137 places in 190 ms of which 3 ms to minimize.
[2024-05-28 06:35:04] [INFO ] Deduced a trap composed of 137 places in 188 ms of which 3 ms to minimize.
[2024-05-28 06:35:04] [INFO ] Deduced a trap composed of 137 places in 195 ms of which 4 ms to minimize.
[2024-05-28 06:35:04] [INFO ] Deduced a trap composed of 137 places in 183 ms of which 3 ms to minimize.
[2024-05-28 06:35:05] [INFO ] Deduced a trap composed of 137 places in 162 ms of which 2 ms to minimize.
[2024-05-28 06:35:05] [INFO ] Deduced a trap composed of 137 places in 196 ms of which 3 ms to minimize.
[2024-05-28 06:35:05] [INFO ] Deduced a trap composed of 137 places in 181 ms of which 3 ms to minimize.
[2024-05-28 06:35:05] [INFO ] Deduced a trap composed of 137 places in 182 ms of which 3 ms to minimize.
[2024-05-28 06:35:06] [INFO ] Deduced a trap composed of 161 places in 210 ms of which 4 ms to minimize.
[2024-05-28 06:35:06] [INFO ] Deduced a trap composed of 138 places in 172 ms of which 4 ms to minimize.
[2024-05-28 06:35:06] [INFO ] Deduced a trap composed of 137 places in 175 ms of which 3 ms to minimize.
[2024-05-28 06:35:06] [INFO ] Deduced a trap composed of 138 places in 171 ms of which 4 ms to minimize.
[2024-05-28 06:35:06] [INFO ] Deduced a trap composed of 137 places in 241 ms of which 4 ms to minimize.
[2024-05-28 06:35:07] [INFO ] Deduced a trap composed of 158 places in 187 ms of which 3 ms to minimize.
[2024-05-28 06:35:11] [INFO ] Deduced a trap composed of 127 places in 213 ms of which 4 ms to minimize.
[2024-05-28 06:35:12] [INFO ] Deduced a trap composed of 14 places in 207 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 06:35:18] [INFO ] Deduced a trap composed of 164 places in 176 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/526 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 5 (OVERLAPS) 4/530 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 758 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 530/1291 variables, and 117 constraints, problems are : Problem set: 0 solved, 758 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/531 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 758/758 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 758 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 21/113 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 06:35:28] [INFO ] Deduced a trap composed of 141 places in 219 ms of which 4 ms to minimize.
[2024-05-28 06:35:28] [INFO ] Deduced a trap composed of 137 places in 184 ms of which 4 ms to minimize.
[2024-05-28 06:35:28] [INFO ] Deduced a trap composed of 137 places in 221 ms of which 4 ms to minimize.
[2024-05-28 06:35:29] [INFO ] Deduced a trap composed of 137 places in 210 ms of which 3 ms to minimize.
[2024-05-28 06:35:29] [INFO ] Deduced a trap composed of 137 places in 224 ms of which 3 ms to minimize.
[2024-05-28 06:35:29] [INFO ] Deduced a trap composed of 137 places in 237 ms of which 5 ms to minimize.
[2024-05-28 06:35:29] [INFO ] Deduced a trap composed of 137 places in 185 ms of which 3 ms to minimize.
[2024-05-28 06:35:30] [INFO ] Deduced a trap composed of 137 places in 179 ms of which 4 ms to minimize.
[2024-05-28 06:35:30] [INFO ] Deduced a trap composed of 141 places in 224 ms of which 4 ms to minimize.
[2024-05-28 06:35:30] [INFO ] Deduced a trap composed of 137 places in 198 ms of which 3 ms to minimize.
[2024-05-28 06:35:30] [INFO ] Deduced a trap composed of 137 places in 238 ms of which 4 ms to minimize.
[2024-05-28 06:35:30] [INFO ] Deduced a trap composed of 137 places in 203 ms of which 3 ms to minimize.
[2024-05-28 06:35:31] [INFO ] Deduced a trap composed of 141 places in 243 ms of which 4 ms to minimize.
[2024-05-28 06:35:31] [INFO ] Deduced a trap composed of 137 places in 226 ms of which 4 ms to minimize.
[2024-05-28 06:35:31] [INFO ] Deduced a trap composed of 141 places in 231 ms of which 4 ms to minimize.
[2024-05-28 06:35:32] [INFO ] Deduced a trap composed of 137 places in 243 ms of which 4 ms to minimize.
[2024-05-28 06:35:32] [INFO ] Deduced a trap composed of 137 places in 223 ms of which 3 ms to minimize.
[2024-05-28 06:35:32] [INFO ] Deduced a trap composed of 138 places in 250 ms of which 4 ms to minimize.
[2024-05-28 06:35:32] [INFO ] Deduced a trap composed of 138 places in 220 ms of which 3 ms to minimize.
[2024-05-28 06:35:33] [INFO ] Deduced a trap composed of 138 places in 235 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 20/133 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 06:35:35] [INFO ] Deduced a trap composed of 142 places in 202 ms of which 3 ms to minimize.
[2024-05-28 06:35:35] [INFO ] Deduced a trap composed of 137 places in 179 ms of which 3 ms to minimize.
[2024-05-28 06:35:35] [INFO ] Deduced a trap composed of 142 places in 165 ms of which 3 ms to minimize.
[2024-05-28 06:35:35] [INFO ] Deduced a trap composed of 137 places in 178 ms of which 3 ms to minimize.
[2024-05-28 06:35:36] [INFO ] Deduced a trap composed of 142 places in 176 ms of which 3 ms to minimize.
[2024-05-28 06:35:36] [INFO ] Deduced a trap composed of 137 places in 157 ms of which 3 ms to minimize.
[2024-05-28 06:35:36] [INFO ] Deduced a trap composed of 138 places in 179 ms of which 3 ms to minimize.
[2024-05-28 06:35:36] [INFO ] Deduced a trap composed of 138 places in 184 ms of which 3 ms to minimize.
[2024-05-28 06:35:36] [INFO ] Deduced a trap composed of 141 places in 150 ms of which 3 ms to minimize.
[2024-05-28 06:35:36] [INFO ] Deduced a trap composed of 138 places in 183 ms of which 4 ms to minimize.
[2024-05-28 06:35:37] [INFO ] Deduced a trap composed of 137 places in 158 ms of which 3 ms to minimize.
[2024-05-28 06:35:37] [INFO ] Deduced a trap composed of 141 places in 195 ms of which 3 ms to minimize.
[2024-05-28 06:35:37] [INFO ] Deduced a trap composed of 138 places in 190 ms of which 3 ms to minimize.
[2024-05-28 06:35:37] [INFO ] Deduced a trap composed of 141 places in 184 ms of which 8 ms to minimize.
[2024-05-28 06:35:37] [INFO ] Deduced a trap composed of 138 places in 180 ms of which 3 ms to minimize.
[2024-05-28 06:35:38] [INFO ] Deduced a trap composed of 137 places in 177 ms of which 3 ms to minimize.
[2024-05-28 06:35:38] [INFO ] Deduced a trap composed of 138 places in 174 ms of which 3 ms to minimize.
[2024-05-28 06:35:38] [INFO ] Deduced a trap composed of 142 places in 168 ms of which 3 ms to minimize.
[2024-05-28 06:35:38] [INFO ] Deduced a trap composed of 137 places in 150 ms of which 3 ms to minimize.
[2024-05-28 06:35:38] [INFO ] Deduced a trap composed of 138 places in 160 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/526 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 06:35:39] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 2 ms to minimize.
[2024-05-28 06:35:41] [INFO ] Deduced a trap composed of 141 places in 202 ms of which 3 ms to minimize.
[2024-05-28 06:35:41] [INFO ] Deduced a trap composed of 138 places in 184 ms of which 3 ms to minimize.
[2024-05-28 06:35:41] [INFO ] Deduced a trap composed of 137 places in 196 ms of which 3 ms to minimize.
[2024-05-28 06:35:41] [INFO ] Deduced a trap composed of 138 places in 252 ms of which 4 ms to minimize.
[2024-05-28 06:35:42] [INFO ] Deduced a trap composed of 141 places in 255 ms of which 4 ms to minimize.
[2024-05-28 06:35:42] [INFO ] Deduced a trap composed of 142 places in 228 ms of which 3 ms to minimize.
[2024-05-28 06:35:42] [INFO ] Deduced a trap composed of 137 places in 223 ms of which 4 ms to minimize.
[2024-05-28 06:35:42] [INFO ] Deduced a trap composed of 141 places in 182 ms of which 3 ms to minimize.
[2024-05-28 06:35:42] [INFO ] Deduced a trap composed of 141 places in 169 ms of which 3 ms to minimize.
[2024-05-28 06:35:43] [INFO ] Deduced a trap composed of 137 places in 204 ms of which 3 ms to minimize.
[2024-05-28 06:35:43] [INFO ] Deduced a trap composed of 137 places in 184 ms of which 3 ms to minimize.
[2024-05-28 06:35:43] [INFO ] Deduced a trap composed of 137 places in 185 ms of which 5 ms to minimize.
[2024-05-28 06:35:43] [INFO ] Deduced a trap composed of 141 places in 208 ms of which 3 ms to minimize.
[2024-05-28 06:35:44] [INFO ] Deduced a trap composed of 141 places in 177 ms of which 3 ms to minimize.
[2024-05-28 06:35:44] [INFO ] Deduced a trap composed of 137 places in 175 ms of which 3 ms to minimize.
[2024-05-28 06:35:44] [INFO ] Deduced a trap composed of 141 places in 195 ms of which 3 ms to minimize.
[2024-05-28 06:35:45] [INFO ] Deduced a trap composed of 137 places in 246 ms of which 3 ms to minimize.
[2024-05-28 06:35:45] [INFO ] Deduced a trap composed of 137 places in 203 ms of which 4 ms to minimize.
[2024-05-28 06:35:45] [INFO ] Deduced a trap composed of 161 places in 207 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/526 variables, 20/173 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 06:35:46] [INFO ] Deduced a trap composed of 141 places in 229 ms of which 4 ms to minimize.
[2024-05-28 06:35:46] [INFO ] Deduced a trap composed of 137 places in 199 ms of which 4 ms to minimize.
[2024-05-28 06:35:47] [INFO ] Deduced a trap composed of 137 places in 203 ms of which 4 ms to minimize.
[2024-05-28 06:35:47] [INFO ] Deduced a trap composed of 137 places in 227 ms of which 4 ms to minimize.
[2024-05-28 06:35:47] [INFO ] Deduced a trap composed of 137 places in 243 ms of which 3 ms to minimize.
[2024-05-28 06:35:48] [INFO ] Deduced a trap composed of 141 places in 218 ms of which 3 ms to minimize.
[2024-05-28 06:35:48] [INFO ] Deduced a trap composed of 137 places in 185 ms of which 4 ms to minimize.
[2024-05-28 06:35:48] [INFO ] Deduced a trap composed of 137 places in 228 ms of which 4 ms to minimize.
[2024-05-28 06:35:48] [INFO ] Deduced a trap composed of 137 places in 218 ms of which 4 ms to minimize.
[2024-05-28 06:35:49] [INFO ] Deduced a trap composed of 137 places in 189 ms of which 3 ms to minimize.
[2024-05-28 06:35:49] [INFO ] Deduced a trap composed of 137 places in 242 ms of which 6 ms to minimize.
[2024-05-28 06:35:49] [INFO ] Deduced a trap composed of 137 places in 202 ms of which 3 ms to minimize.
[2024-05-28 06:35:50] [INFO ] Deduced a trap composed of 141 places in 257 ms of which 4 ms to minimize.
[2024-05-28 06:35:50] [INFO ] Deduced a trap composed of 141 places in 178 ms of which 3 ms to minimize.
[2024-05-28 06:35:51] [INFO ] Deduced a trap composed of 137 places in 229 ms of which 3 ms to minimize.
[2024-05-28 06:35:51] [INFO ] Deduced a trap composed of 137 places in 194 ms of which 3 ms to minimize.
[2024-05-28 06:35:51] [INFO ] Deduced a trap composed of 137 places in 214 ms of which 3 ms to minimize.
[2024-05-28 06:35:51] [INFO ] Deduced a trap composed of 137 places in 187 ms of which 3 ms to minimize.
[2024-05-28 06:35:52] [INFO ] Deduced a trap composed of 141 places in 186 ms of which 3 ms to minimize.
[2024-05-28 06:35:52] [INFO ] Deduced a trap composed of 137 places in 186 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 20/193 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 06:35:53] [INFO ] Deduced a trap composed of 153 places in 172 ms of which 3 ms to minimize.
[2024-05-28 06:35:53] [INFO ] Deduced a trap composed of 137 places in 199 ms of which 3 ms to minimize.
[2024-05-28 06:35:53] [INFO ] Deduced a trap composed of 158 places in 207 ms of which 3 ms to minimize.
[2024-05-28 06:35:53] [INFO ] Deduced a trap composed of 137 places in 185 ms of which 3 ms to minimize.
[2024-05-28 06:35:53] [INFO ] Deduced a trap composed of 176 places in 172 ms of which 3 ms to minimize.
[2024-05-28 06:35:54] [INFO ] Deduced a trap composed of 137 places in 176 ms of which 3 ms to minimize.
[2024-05-28 06:35:54] [INFO ] Deduced a trap composed of 137 places in 175 ms of which 3 ms to minimize.
[2024-05-28 06:35:54] [INFO ] Deduced a trap composed of 137 places in 145 ms of which 3 ms to minimize.
[2024-05-28 06:35:54] [INFO ] Deduced a trap composed of 155 places in 181 ms of which 3 ms to minimize.
[2024-05-28 06:35:55] [INFO ] Deduced a trap composed of 161 places in 169 ms of which 3 ms to minimize.
[2024-05-28 06:35:55] [INFO ] Deduced a trap composed of 137 places in 178 ms of which 3 ms to minimize.
[2024-05-28 06:35:55] [INFO ] Deduced a trap composed of 164 places in 170 ms of which 3 ms to minimize.
[2024-05-28 06:35:55] [INFO ] Deduced a trap composed of 137 places in 200 ms of which 6 ms to minimize.
[2024-05-28 06:35:55] [INFO ] Deduced a trap composed of 137 places in 193 ms of which 4 ms to minimize.
[2024-05-28 06:35:56] [INFO ] Deduced a trap composed of 137 places in 162 ms of which 3 ms to minimize.
[2024-05-28 06:35:56] [INFO ] Deduced a trap composed of 137 places in 168 ms of which 3 ms to minimize.
[2024-05-28 06:35:56] [INFO ] Deduced a trap composed of 137 places in 164 ms of which 3 ms to minimize.
[2024-05-28 06:35:56] [INFO ] Deduced a trap composed of 137 places in 163 ms of which 3 ms to minimize.
[2024-05-28 06:35:57] [INFO ] Deduced a trap composed of 137 places in 272 ms of which 3 ms to minimize.
[2024-05-28 06:35:57] [INFO ] Deduced a trap composed of 137 places in 189 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/526 variables, 20/213 constraints. Problems are: Problem set: 0 solved, 758 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 526/1291 variables, and 213 constraints, problems are : Problem set: 0 solved, 758 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 86/90 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/531 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/758 constraints, Known Traps: 121/121 constraints]
After SMT, in 61576ms problems are : Problem set: 0 solved, 758 unsolved
Search for dead transitions found 0 dead transitions in 61591ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64360 ms. Remains : 531/531 places, 764/764 transitions.
RANDOM walk for 40002 steps (1889 resets) in 216 ms. (184 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (207 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (206 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 346084 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :0 out of 2
Probabilistic random walk after 346084 steps, saw 105757 distinct states, run finished after 3001 ms. (steps per millisecond=115 ) properties seen :0
[2024-05-28 06:36:00] [INFO ] Flow matrix only has 760 transitions (discarded 4 similar events)
[2024-05-28 06:36:00] [INFO ] Invariant cache hit.
[2024-05-28 06:36:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 92/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 3 (OVERLAPS) 382/475 variables, 46/47 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/475 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 42/517 variables, 42/89 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/517 variables, 0/89 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/528 variables, 6/95 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/528 variables, 0/95 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/530 variables, 2/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/530 variables, 0/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 760/1290 variables, 530/627 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1290 variables, 1/628 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1290 variables, 0/628 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/1291 variables, 1/629 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1291 variables, 0/629 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1291 variables, 0/629 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1291/1291 variables, and 629 constraints, problems are : Problem set: 1 solved, 1 unsolved in 440 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 531/531 constraints, ReadFeed: 1/1 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/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 92/93 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 382/475 variables, 46/47 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/475 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 42/517 variables, 42/89 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/517 variables, 0/89 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/528 variables, 6/95 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/528 variables, 0/95 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/530 variables, 2/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/530 variables, 0/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 760/1290 variables, 530/627 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1290 variables, 1/628 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1290 variables, 1/629 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1290 variables, 0/629 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/1291 variables, 1/630 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1291 variables, 0/630 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1291 variables, 0/630 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1291/1291 variables, and 630 constraints, problems are : Problem set: 1 solved, 1 unsolved in 751 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 531/531 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1216ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 531 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 764/764 transitions.
Applied a total of 0 rules in 21 ms. Remains 531 /531 variables (removed 0) and now considering 764/764 (removed 0) transitions.
Running 758 sub problems to find dead transitions.
[2024-05-28 06:36:01] [INFO ] Flow matrix only has 760 transitions (discarded 4 similar events)
[2024-05-28 06:36:01] [INFO ] Invariant cache hit.
[2024-05-28 06:36:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 06:36:08] [INFO ] Deduced a trap composed of 137 places in 165 ms of which 3 ms to minimize.
[2024-05-28 06:36:09] [INFO ] Deduced a trap composed of 137 places in 222 ms of which 3 ms to minimize.
[2024-05-28 06:36:09] [INFO ] Deduced a trap composed of 137 places in 153 ms of which 3 ms to minimize.
[2024-05-28 06:36:09] [INFO ] Deduced a trap composed of 137 places in 175 ms of which 4 ms to minimize.
[2024-05-28 06:36:09] [INFO ] Deduced a trap composed of 137 places in 164 ms of which 3 ms to minimize.
[2024-05-28 06:36:09] [INFO ] Deduced a trap composed of 137 places in 153 ms of which 2 ms to minimize.
[2024-05-28 06:36:10] [INFO ] Deduced a trap composed of 137 places in 162 ms of which 3 ms to minimize.
[2024-05-28 06:36:10] [INFO ] Deduced a trap composed of 137 places in 157 ms of which 3 ms to minimize.
[2024-05-28 06:36:10] [INFO ] Deduced a trap composed of 137 places in 162 ms of which 3 ms to minimize.
[2024-05-28 06:36:10] [INFO ] Deduced a trap composed of 137 places in 169 ms of which 2 ms to minimize.
[2024-05-28 06:36:10] [INFO ] Deduced a trap composed of 137 places in 177 ms of which 3 ms to minimize.
[2024-05-28 06:36:10] [INFO ] Deduced a trap composed of 137 places in 155 ms of which 3 ms to minimize.
[2024-05-28 06:36:11] [INFO ] Deduced a trap composed of 161 places in 171 ms of which 3 ms to minimize.
[2024-05-28 06:36:11] [INFO ] Deduced a trap composed of 138 places in 165 ms of which 3 ms to minimize.
[2024-05-28 06:36:11] [INFO ] Deduced a trap composed of 137 places in 178 ms of which 3 ms to minimize.
[2024-05-28 06:36:11] [INFO ] Deduced a trap composed of 138 places in 175 ms of which 2 ms to minimize.
[2024-05-28 06:36:12] [INFO ] Deduced a trap composed of 137 places in 151 ms of which 3 ms to minimize.
[2024-05-28 06:36:12] [INFO ] Deduced a trap composed of 158 places in 155 ms of which 2 ms to minimize.
[2024-05-28 06:36:16] [INFO ] Deduced a trap composed of 127 places in 196 ms of which 3 ms to minimize.
[2024-05-28 06:36:17] [INFO ] Deduced a trap composed of 14 places in 168 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 06:36:22] [INFO ] Deduced a trap composed of 164 places in 139 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 758 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 526/1291 variables, and 113 constraints, problems are : Problem set: 0 solved, 758 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 86/90 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/531 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 758/758 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 758 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 21/113 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 06:36:24] [INFO ] Deduced a trap composed of 141 places in 166 ms of which 3 ms to minimize.
[2024-05-28 06:36:24] [INFO ] Deduced a trap composed of 137 places in 164 ms of which 3 ms to minimize.
[2024-05-28 06:36:24] [INFO ] Deduced a trap composed of 137 places in 158 ms of which 3 ms to minimize.
[2024-05-28 06:36:24] [INFO ] Deduced a trap composed of 137 places in 169 ms of which 3 ms to minimize.
[2024-05-28 06:36:25] [INFO ] Deduced a trap composed of 137 places in 167 ms of which 3 ms to minimize.
[2024-05-28 06:36:25] [INFO ] Deduced a trap composed of 137 places in 167 ms of which 3 ms to minimize.
[2024-05-28 06:36:25] [INFO ] Deduced a trap composed of 137 places in 171 ms of which 3 ms to minimize.
[2024-05-28 06:36:25] [INFO ] Deduced a trap composed of 137 places in 182 ms of which 3 ms to minimize.
[2024-05-28 06:36:25] [INFO ] Deduced a trap composed of 141 places in 167 ms of which 3 ms to minimize.
[2024-05-28 06:36:25] [INFO ] Deduced a trap composed of 137 places in 168 ms of which 3 ms to minimize.
[2024-05-28 06:36:26] [INFO ] Deduced a trap composed of 137 places in 204 ms of which 3 ms to minimize.
[2024-05-28 06:36:26] [INFO ] Deduced a trap composed of 137 places in 175 ms of which 3 ms to minimize.
[2024-05-28 06:36:26] [INFO ] Deduced a trap composed of 141 places in 158 ms of which 3 ms to minimize.
[2024-05-28 06:36:26] [INFO ] Deduced a trap composed of 137 places in 201 ms of which 4 ms to minimize.
[2024-05-28 06:36:27] [INFO ] Deduced a trap composed of 141 places in 211 ms of which 3 ms to minimize.
[2024-05-28 06:36:27] [INFO ] Deduced a trap composed of 137 places in 172 ms of which 3 ms to minimize.
[2024-05-28 06:36:27] [INFO ] Deduced a trap composed of 137 places in 179 ms of which 3 ms to minimize.
[2024-05-28 06:36:27] [INFO ] Deduced a trap composed of 138 places in 170 ms of which 5 ms to minimize.
[2024-05-28 06:36:27] [INFO ] Deduced a trap composed of 138 places in 171 ms of which 3 ms to minimize.
[2024-05-28 06:36:27] [INFO ] Deduced a trap composed of 138 places in 172 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 20/133 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 06:36:30] [INFO ] Deduced a trap composed of 142 places in 173 ms of which 3 ms to minimize.
[2024-05-28 06:36:30] [INFO ] Deduced a trap composed of 137 places in 172 ms of which 3 ms to minimize.
[2024-05-28 06:36:30] [INFO ] Deduced a trap composed of 142 places in 164 ms of which 2 ms to minimize.
[2024-05-28 06:36:30] [INFO ] Deduced a trap composed of 137 places in 176 ms of which 3 ms to minimize.
[2024-05-28 06:36:30] [INFO ] Deduced a trap composed of 142 places in 174 ms of which 3 ms to minimize.
[2024-05-28 06:36:31] [INFO ] Deduced a trap composed of 137 places in 165 ms of which 2 ms to minimize.
[2024-05-28 06:36:31] [INFO ] Deduced a trap composed of 138 places in 175 ms of which 3 ms to minimize.
[2024-05-28 06:36:31] [INFO ] Deduced a trap composed of 138 places in 170 ms of which 3 ms to minimize.
[2024-05-28 06:36:31] [INFO ] Deduced a trap composed of 141 places in 170 ms of which 3 ms to minimize.
[2024-05-28 06:36:31] [INFO ] Deduced a trap composed of 138 places in 156 ms of which 2 ms to minimize.
[2024-05-28 06:36:32] [INFO ] Deduced a trap composed of 137 places in 170 ms of which 3 ms to minimize.
[2024-05-28 06:36:32] [INFO ] Deduced a trap composed of 141 places in 197 ms of which 3 ms to minimize.
[2024-05-28 06:36:32] [INFO ] Deduced a trap composed of 138 places in 178 ms of which 3 ms to minimize.
[2024-05-28 06:36:32] [INFO ] Deduced a trap composed of 141 places in 159 ms of which 6 ms to minimize.
[2024-05-28 06:36:32] [INFO ] Deduced a trap composed of 138 places in 291 ms of which 5 ms to minimize.
[2024-05-28 06:36:33] [INFO ] Deduced a trap composed of 137 places in 198 ms of which 3 ms to minimize.
[2024-05-28 06:36:33] [INFO ] Deduced a trap composed of 138 places in 213 ms of which 3 ms to minimize.
[2024-05-28 06:36:33] [INFO ] Deduced a trap composed of 142 places in 271 ms of which 3 ms to minimize.
[2024-05-28 06:36:33] [INFO ] Deduced a trap composed of 137 places in 156 ms of which 3 ms to minimize.
[2024-05-28 06:36:33] [INFO ] Deduced a trap composed of 138 places in 195 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/526 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 06:36:35] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 1 ms to minimize.
[2024-05-28 06:36:36] [INFO ] Deduced a trap composed of 141 places in 184 ms of which 3 ms to minimize.
[2024-05-28 06:36:36] [INFO ] Deduced a trap composed of 138 places in 180 ms of which 3 ms to minimize.
[2024-05-28 06:36:36] [INFO ] Deduced a trap composed of 137 places in 215 ms of which 3 ms to minimize.
[2024-05-28 06:36:36] [INFO ] Deduced a trap composed of 138 places in 166 ms of which 2 ms to minimize.
[2024-05-28 06:36:37] [INFO ] Deduced a trap composed of 141 places in 189 ms of which 3 ms to minimize.
[2024-05-28 06:36:37] [INFO ] Deduced a trap composed of 142 places in 188 ms of which 3 ms to minimize.
[2024-05-28 06:36:37] [INFO ] Deduced a trap composed of 137 places in 196 ms of which 2 ms to minimize.
[2024-05-28 06:36:37] [INFO ] Deduced a trap composed of 141 places in 192 ms of which 3 ms to minimize.
[2024-05-28 06:36:37] [INFO ] Deduced a trap composed of 141 places in 185 ms of which 3 ms to minimize.
[2024-05-28 06:36:38] [INFO ] Deduced a trap composed of 137 places in 177 ms of which 2 ms to minimize.
[2024-05-28 06:36:38] [INFO ] Deduced a trap composed of 137 places in 171 ms of which 3 ms to minimize.
[2024-05-28 06:36:38] [INFO ] Deduced a trap composed of 137 places in 170 ms of which 3 ms to minimize.
[2024-05-28 06:36:38] [INFO ] Deduced a trap composed of 141 places in 219 ms of which 3 ms to minimize.
[2024-05-28 06:36:39] [INFO ] Deduced a trap composed of 141 places in 191 ms of which 3 ms to minimize.
[2024-05-28 06:36:39] [INFO ] Deduced a trap composed of 137 places in 177 ms of which 4 ms to minimize.
[2024-05-28 06:36:39] [INFO ] Deduced a trap composed of 141 places in 190 ms of which 3 ms to minimize.
[2024-05-28 06:36:39] [INFO ] Deduced a trap composed of 137 places in 174 ms of which 2 ms to minimize.
[2024-05-28 06:36:40] [INFO ] Deduced a trap composed of 137 places in 172 ms of which 3 ms to minimize.
[2024-05-28 06:36:40] [INFO ] Deduced a trap composed of 161 places in 160 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/526 variables, 20/173 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 06:36:41] [INFO ] Deduced a trap composed of 141 places in 164 ms of which 3 ms to minimize.
[2024-05-28 06:36:41] [INFO ] Deduced a trap composed of 137 places in 179 ms of which 3 ms to minimize.
[2024-05-28 06:36:41] [INFO ] Deduced a trap composed of 137 places in 170 ms of which 3 ms to minimize.
[2024-05-28 06:36:41] [INFO ] Deduced a trap composed of 137 places in 183 ms of which 3 ms to minimize.
[2024-05-28 06:36:41] [INFO ] Deduced a trap composed of 137 places in 193 ms of which 3 ms to minimize.
[2024-05-28 06:36:42] [INFO ] Deduced a trap composed of 141 places in 167 ms of which 2 ms to minimize.
[2024-05-28 06:36:42] [INFO ] Deduced a trap composed of 137 places in 175 ms of which 3 ms to minimize.
[2024-05-28 06:36:42] [INFO ] Deduced a trap composed of 137 places in 184 ms of which 3 ms to minimize.
[2024-05-28 06:36:42] [INFO ] Deduced a trap composed of 137 places in 169 ms of which 2 ms to minimize.
[2024-05-28 06:36:43] [INFO ] Deduced a trap composed of 137 places in 184 ms of which 3 ms to minimize.
[2024-05-28 06:36:43] [INFO ] Deduced a trap composed of 137 places in 219 ms of which 3 ms to minimize.
SMT process timed out in 41568ms, After SMT, problems are : Problem set: 0 solved, 758 unsolved
Search for dead transitions found 0 dead transitions in 41588ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41616 ms. Remains : 531/531 places, 764/764 transitions.
RANDOM walk for 40001 steps (1892 resets) in 294 ms. (135 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (163 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 489905 steps, run timeout after 3001 ms. (steps per millisecond=163 ) properties seen :0 out of 1
Probabilistic random walk after 489905 steps, saw 150605 distinct states, run finished after 3001 ms. (steps per millisecond=163 ) properties seen :0
[2024-05-28 06:36:46] [INFO ] Flow matrix only has 760 transitions (discarded 4 similar events)
[2024-05-28 06:36:46] [INFO ] Invariant cache hit.
[2024-05-28 06:36:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 92/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 382/475 variables, 46/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/475 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 42/517 variables, 42/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/517 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/528 variables, 6/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/528 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/530 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/530 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 760/1290 variables, 530/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1290 variables, 1/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1290 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/1291 variables, 1/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1291 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1291 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1291/1291 variables, and 629 constraints, problems are : Problem set: 0 solved, 1 unsolved in 429 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 531/531 constraints, ReadFeed: 1/1 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 92/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 382/475 variables, 46/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/475 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 42/517 variables, 42/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/517 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/528 variables, 6/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/528 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/530 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/530 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 760/1290 variables, 530/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1290 variables, 1/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1290 variables, 1/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1290 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/1291 variables, 1/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1291 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1291 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1291/1291 variables, and 630 constraints, problems are : Problem set: 0 solved, 1 unsolved in 760 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 531/531 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1223ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 531 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 764/764 transitions.
Applied a total of 0 rules in 28 ms. Remains 531 /531 variables (removed 0) and now considering 764/764 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 531/531 places, 764/764 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 764/764 transitions.
Applied a total of 0 rules in 16 ms. Remains 531 /531 variables (removed 0) and now considering 764/764 (removed 0) transitions.
[2024-05-28 06:36:47] [INFO ] Flow matrix only has 760 transitions (discarded 4 similar events)
[2024-05-28 06:36:47] [INFO ] Invariant cache hit.
[2024-05-28 06:36:48] [INFO ] Implicit Places using invariants in 499 ms returned []
[2024-05-28 06:36:48] [INFO ] Flow matrix only has 760 transitions (discarded 4 similar events)
[2024-05-28 06:36:48] [INFO ] Invariant cache hit.
[2024-05-28 06:36:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 06:36:50] [INFO ] Implicit Places using invariants and state equation in 1919 ms returned []
Implicit Place search using SMT with State Equation took 2433 ms to find 0 implicit places.
[2024-05-28 06:36:50] [INFO ] Redundant transitions in 7 ms returned []
Running 758 sub problems to find dead transitions.
[2024-05-28 06:36:50] [INFO ] Flow matrix only has 760 transitions (discarded 4 similar events)
[2024-05-28 06:36:50] [INFO ] Invariant cache hit.
[2024-05-28 06:36:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 06:36:56] [INFO ] Deduced a trap composed of 137 places in 166 ms of which 3 ms to minimize.
[2024-05-28 06:36:57] [INFO ] Deduced a trap composed of 137 places in 176 ms of which 3 ms to minimize.
[2024-05-28 06:36:57] [INFO ] Deduced a trap composed of 137 places in 186 ms of which 3 ms to minimize.
[2024-05-28 06:36:57] [INFO ] Deduced a trap composed of 137 places in 176 ms of which 3 ms to minimize.
[2024-05-28 06:36:57] [INFO ] Deduced a trap composed of 137 places in 167 ms of which 3 ms to minimize.
[2024-05-28 06:36:58] [INFO ] Deduced a trap composed of 137 places in 182 ms of which 3 ms to minimize.
[2024-05-28 06:36:58] [INFO ] Deduced a trap composed of 137 places in 172 ms of which 3 ms to minimize.
[2024-05-28 06:36:58] [INFO ] Deduced a trap composed of 137 places in 182 ms of which 3 ms to minimize.
[2024-05-28 06:36:58] [INFO ] Deduced a trap composed of 137 places in 185 ms of which 3 ms to minimize.
[2024-05-28 06:36:58] [INFO ] Deduced a trap composed of 137 places in 171 ms of which 3 ms to minimize.
[2024-05-28 06:36:58] [INFO ] Deduced a trap composed of 137 places in 164 ms of which 3 ms to minimize.
[2024-05-28 06:36:59] [INFO ] Deduced a trap composed of 137 places in 167 ms of which 3 ms to minimize.
[2024-05-28 06:36:59] [INFO ] Deduced a trap composed of 161 places in 184 ms of which 3 ms to minimize.
[2024-05-28 06:36:59] [INFO ] Deduced a trap composed of 138 places in 164 ms of which 3 ms to minimize.
[2024-05-28 06:36:59] [INFO ] Deduced a trap composed of 137 places in 165 ms of which 3 ms to minimize.
[2024-05-28 06:36:59] [INFO ] Deduced a trap composed of 138 places in 173 ms of which 3 ms to minimize.
[2024-05-28 06:37:00] [INFO ] Deduced a trap composed of 137 places in 174 ms of which 2 ms to minimize.
[2024-05-28 06:37:00] [INFO ] Deduced a trap composed of 158 places in 169 ms of which 3 ms to minimize.
[2024-05-28 06:37:04] [INFO ] Deduced a trap composed of 127 places in 186 ms of which 3 ms to minimize.
[2024-05-28 06:37:05] [INFO ] Deduced a trap composed of 14 places in 187 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 758 unsolved
[2024-05-28 06:37:10] [INFO ] Deduced a trap composed of 164 places in 164 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/526 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 758 unsolved
At refinement iteration 5 (OVERLAPS) 4/530 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 758 unsolved
(s338 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 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 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 4.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 9.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 1.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 1.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 0.0)
(s285 1.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 1.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/530 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 758 unsolved
SMT process timed out in 31372ms, After SMT, problems are : Problem set: 0 solved, 758 unsolved
Search for dead transitions found 0 dead transitions in 31380ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33857 ms. Remains : 531/531 places, 764/764 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 531 transition count 760
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 531 transition count 759
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 530 transition count 759
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 530 transition count 758
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 529 transition count 758
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 529 transition count 754
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 16 place count 525 transition count 754
Applied a total of 16 rules in 116 ms. Remains 525 /531 variables (removed 6) and now considering 754/764 (removed 10) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 754 rows 525 cols
[2024-05-28 06:37:21] [INFO ] Computed 97 invariants in 10 ms
[2024-05-28 06:37:22] [INFO ] [Real]Absence check using 90 positive place invariants in 49 ms returned sat
[2024-05-28 06:37:22] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 15 ms returned sat
[2024-05-28 06:37:22] [INFO ] After 274ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 06:37:22] [INFO ] [Nat]Absence check using 90 positive place invariants in 16 ms returned sat
[2024-05-28 06:37:22] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 12 ms returned sat
[2024-05-28 06:37:22] [INFO ] After 264ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-28 06:37:22] [INFO ] After 339ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-28 06:37:22] [INFO ] After 538ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 976 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[10]
Ending property specific reduction for PolyORBNT-COL-S05J40-UpperBounds-15 in 230574 ms.
[2024-05-28 06:37:22] [INFO ] Flatten gal took : 202 ms
[2024-05-28 06:37:22] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 18 ms.
[2024-05-28 06:37:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 531 places, 764 transitions and 3936 arcs took 7 ms.
Total runtime 542209 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBNT-COL-S05J40

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/420/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 531
TRANSITIONS: 764
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.020s, Sys 0.000s]


SAVING FILE /home/mcc/execution/420/model (.net / .def) ...
EXPORT TIME: [User 0.003s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 3292
MODEL NAME: /home/mcc/execution/420/model
531 places, 764 transitions.

No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S05J40.tgz
mv PolyORBNT-COL-S05J40 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 ;