About the Execution of LTSMin+red for PolyORBNT-COL-S10J40
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 648860.00 | 0.00 | 0.00 | 1 1 10 1 1 1 10 4 1 1 3 4 ? 1 2 41 | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r516-tajo-171654447100421.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBNT-COL-S10J40, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654447100421
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 8.5K Apr 12 11:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 12 11:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Apr 12 10:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 12 10:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 13:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 12 13:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 13:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 12 13:00 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-S10J40-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717259280529
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S10J40
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:28:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 16:28:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:28:02] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 16:28:02] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 16:28:02] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 724 ms
[2024-06-01 16:28:02] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 894 PT places and 12462.0 transition bindings in 28 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
[2024-06-01 16:28:02] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 5 ms.
[2024-06-01 16:28:02] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2024-06-01 16:28:02] [INFO ] Computed 13 invariants in 9 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[1, 0, 10, 0, 1, 0, 10, 0, 0, 0, 3, 0, 0, 0, 0, 41] Max Struct:[1, 1, 10, +inf, 1, 1, 10, 10, +inf, +inf, +inf, 10, 4, +inf, 2, 41]
FORMULA PolyORBNT-COL-S10J40-UpperBounds-15 41 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J40-UpperBounds-06 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J40-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J40-UpperBounds-02 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J40-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-06-01 16:28:02] [INFO ] Invariant cache hit.
[2024-06-01 16:28:03] [INFO ] [Real]Absence check using 6 positive place invariants in 11 ms returned sat
[2024-06-01 16:28:03] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 14 ms returned sat
[2024-06-01 16:28:03] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2024-06-01 16:28:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:28:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 16:28:03] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 6 ms returned sat
[2024-06-01 16:28:03] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-06-01 16:28:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:28:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 16:28:03] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 7 ms to minimize.
[2024-06-01 16:28:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2024-06-01 16:28:03] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 9 ms.
[2024-06-01 16:28:03] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-06-01 16:28:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2024-06-01 16:28:03] [INFO ] Added : 36 causal constraints over 8 iterations in 150 ms. Result :sat
Minimization took 42 ms.
[2024-06-01 16:28:03] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 16:28:03] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-06-01 16:28:03] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-06-01 16:28:03] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 16:28:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:28:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 16:28:03] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-06-01 16:28:03] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2024-06-01 16:28:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 16:28:03] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 16:28:03] [INFO ] Added : 3 causal constraints over 1 iterations in 28 ms. Result :sat
Minimization took 14 ms.
[2024-06-01 16:28:03] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-06-01 16:28:03] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-06-01 16:28:03] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-06-01 16:28:03] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2024-06-01 16:28:03] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 4 ms to minimize.
[2024-06-01 16:28:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:28:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-06-01 16:28:03] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 17 ms returned sat
[2024-06-01 16:28:03] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-06-01 16:28:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2024-06-01 16:28:03] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-06-01 16:28:04] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 16:28:04] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 1 ms to minimize.
[2024-06-01 16:28:04] [INFO ] Deduced a trap composed of 18 places in 17 ms of which 1 ms to minimize.
[2024-06-01 16:28:04] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
[2024-06-01 16:28:04] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 153 ms
[2024-06-01 16:28:04] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 16:28:04] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 0 ms to minimize.
[2024-06-01 16:28:04] [INFO ] Deduced a trap composed of 14 places in 17 ms of which 1 ms to minimize.
[2024-06-01 16:28:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 45 ms
[2024-06-01 16:28:04] [INFO ] Added : 36 causal constraints over 8 iterations in 97 ms. Result :sat
Minimization took 23 ms.
[2024-06-01 16:28:04] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 16:28:04] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-06-01 16:28:04] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-06-01 16:28:04] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 16:28:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:28:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 16:28:04] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-06-01 16:28:04] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 16:28:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 16:28:04] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 16:28:04] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-06-01 16:28:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2024-06-01 16:28:04] [INFO ] Added : 36 causal constraints over 8 iterations in 85 ms. Result :sat
Minimization took 115 ms.
[2024-06-01 16:28:04] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 16:28:04] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-06-01 16:28:04] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-06-01 16:28:04] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 16:28:04] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 0 ms to minimize.
[2024-06-01 16:28:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:28:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 16:28:04] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-06-01 16:28:04] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 16:28:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 16:28:04] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 0 ms to minimize.
[2024-06-01 16:28:04] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
[2024-06-01 16:28:04] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
[2024-06-01 16:28:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 70 ms
[2024-06-01 16:28:04] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 16:28:04] [INFO ] Deduced a trap composed of 14 places in 17 ms of which 0 ms to minimize.
[2024-06-01 16:28:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2024-06-01 16:28:04] [INFO ] Added : 36 causal constraints over 8 iterations in 81 ms. Result :sat
Minimization took 19 ms.
[2024-06-01 16:28:04] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 16:28:04] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-06-01 16:28:04] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 16:28:04] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 16:28:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:28:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 16:28:04] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-06-01 16:28:04] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 16:28:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 16:28:04] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 16:28:04] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 13 ms.
[2024-06-01 16:28:04] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 16:28:04] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned unsat
[2024-06-01 16:28:04] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 16:28:04] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-06-01 16:28:04] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 16:28:04] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 16:28:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:28:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 16:28:04] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-06-01 16:28:04] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 16:28:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 16:28:04] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
[2024-06-01 16:28:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2024-06-01 16:28:04] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 16:28:05] [INFO ] Added : 22 causal constraints over 5 iterations in 408 ms. Result :sat
Minimization took 66 ms.
[2024-06-01 16:28:05] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-06-01 16:28:05] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-06-01 16:28:05] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-06-01 16:28:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:28:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 16:28:05] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-06-01 16:28:05] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-06-01 16:28:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 16:28:05] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-06-01 16:28:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2024-06-01 16:28:05] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 16:28:05] [INFO ] Added : 22 causal constraints over 5 iterations in 129 ms. Result :sat
Minimization took 170 ms.
[2024-06-01 16:28:05] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 16:28:05] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-06-01 16:28:06] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-06-01 16:28:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:28:06] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 16:28:06] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-06-01 16:28:06] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-06-01 16:28:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-06-01 16:28:06] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2024-06-01 16:28:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2024-06-01 16:28:06] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 8 ms.
[2024-06-01 16:28:06] [INFO ] Added : 36 causal constraints over 8 iterations in 54 ms. Result :sat
Minimization took 30 ms.
[2024-06-01 16:28:06] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-01 16:28:06] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-06-01 16:28:06] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-06-01 16:28:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:28:06] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 16:28:06] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-06-01 16:28:06] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 16:28:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 16:28:06] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 16:28:06] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-06-01 16:28:06] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-06-01 16:28:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 84 ms
[2024-06-01 16:28:06] [INFO ] Added : 20 causal constraints over 5 iterations in 281 ms. Result :sat
Minimization took 113 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0] Max Struct:[1, +inf, 1, 10, +inf, +inf, 3, 10, 4, +inf, 2]
FORMULA PolyORBNT-COL-S10J40-UpperBounds-10 3 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-06-01 16:28:06] [INFO ] Unfolded HLPN to a Petri net with 894 places and 12380 transitions 114079 arcs in 286 ms.
[2024-06-01 16:28:06] [INFO ] Unfolded 10 HLPN properties in 1 ms.
Deduced a syphon composed of 40 places in 54 ms
Reduce places removed 40 places and 40 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+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] Max Struct:[1, +inf, 1, 10, +inf, +inf, 10, 4, +inf, 2]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, +inf, 1, 10, +inf, +inf, 10, 4, +inf, 2]
[2024-06-01 16:28:07] [INFO ] Flow matrix only has 2221 transitions (discarded 9 similar events)
// Phase 1: matrix 2221 rows 854 cols
[2024-06-01 16:28:07] [INFO ] Computed 112 invariants in 223 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 11, 1, 10, 11, 11, 10, 4, 41, 2]
RANDOM walk for 10000 steps (560 resets) in 354 ms. (28 steps per ms)
FORMULA PolyORBNT-COL-S10J40-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90008 steps (943 resets) in 448 ms. (200 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 4, 0, 1, 4, 3, 0, 0] Max Struct:[11, 1, 10, 11, 11, 10, 4, 41, 2]
[2024-06-01 16:28:08] [INFO ] Flow matrix only has 2221 transitions (discarded 9 similar events)
[2024-06-01 16:28:08] [INFO ] Invariant cache hit.
[2024-06-01 16:28:08] [INFO ] [Real]Absence check using 105 positive place invariants in 32 ms returned sat
[2024-06-01 16:28:08] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 35 ms returned unsat
[2024-06-01 16:28:08] [INFO ] [Real]Absence check using 105 positive place invariants in 51 ms returned sat
[2024-06-01 16:28:08] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 31 ms returned sat
[2024-06-01 16:28:09] [INFO ] [Real]Absence check using state equation in 624 ms returned sat
[2024-06-01 16:28:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:28:09] [INFO ] [Nat]Absence check using 105 positive place invariants in 33 ms returned sat
[2024-06-01 16:28:09] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 36 ms returned sat
[2024-06-01 16:28:10] [INFO ] [Nat]Absence check using state equation in 776 ms returned sat
[2024-06-01 16:28:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:28:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 442 ms returned sat
[2024-06-01 16:28:11] [INFO ] Deduced a trap composed of 371 places in 548 ms of which 6 ms to minimize.
[2024-06-01 16:28:12] [INFO ] Deduced a trap composed of 398 places in 642 ms of which 6 ms to minimize.
[2024-06-01 16:28:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1460 ms
[2024-06-01 16:28:12] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 313 ms.
[2024-06-01 16:28:14] [INFO ] Deduced a trap composed of 19 places in 710 ms of which 5 ms to minimize.
[2024-06-01 16:28:14] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 859 ms
Maximisation of solution failed !
Minimization took 1 ms.
[2024-06-01 16:28:14] [INFO ] [Real]Absence check using 105 positive place invariants in 28 ms returned sat
[2024-06-01 16:28:14] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 20 ms returned sat
[2024-06-01 16:28:15] [INFO ] [Real]Absence check using state equation in 671 ms returned sat
[2024-06-01 16:28:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:28:15] [INFO ] [Nat]Absence check using 105 positive place invariants in 31 ms returned sat
[2024-06-01 16:28:15] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 17 ms returned sat
[2024-06-01 16:28:16] [INFO ] [Nat]Absence check using state equation in 1387 ms returned unsat
[2024-06-01 16:28:16] [INFO ] [Real]Absence check using 105 positive place invariants in 33 ms returned sat
[2024-06-01 16:28:16] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 23 ms returned sat
[2024-06-01 16:28:17] [INFO ] [Real]Absence check using state equation in 568 ms returned sat
[2024-06-01 16:28:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:28:17] [INFO ] [Nat]Absence check using 105 positive place invariants in 37 ms returned sat
[2024-06-01 16:28:17] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 21 ms returned sat
[2024-06-01 16:28:18] [INFO ] [Nat]Absence check using state equation in 479 ms returned sat
[2024-06-01 16:28:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 418 ms returned sat
[2024-06-01 16:28:19] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 590 ms.
[2024-06-01 16:28:20] [INFO ] Deduced a trap composed of 19 places in 636 ms of which 6 ms to minimize.
[2024-06-01 16:28:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1066 ms
[2024-06-01 16:28:21] [INFO ] Added : 23 causal constraints over 5 iterations in 2389 ms. Result :sat
Minimization took 757 ms.
[2024-06-01 16:28:22] [INFO ] [Real]Absence check using 105 positive place invariants in 33 ms returned sat
[2024-06-01 16:28:22] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 18 ms returned unsat
[2024-06-01 16:28:22] [INFO ] [Real]Absence check using 105 positive place invariants in 32 ms returned sat
[2024-06-01 16:28:22] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 19 ms returned unsat
[2024-06-01 16:28:22] [INFO ] [Real]Absence check using 105 positive place invariants in 32 ms returned sat
[2024-06-01 16:28:22] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 23 ms returned sat
[2024-06-01 16:28:23] [INFO ] [Real]Absence check using state equation in 603 ms returned sat
[2024-06-01 16:28:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:28:23] [INFO ] [Nat]Absence check using 105 positive place invariants in 25 ms returned sat
[2024-06-01 16:28:23] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 15 ms returned sat
[2024-06-01 16:28:23] [INFO ] [Nat]Absence check using state equation in 717 ms returned sat
[2024-06-01 16:28:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 261 ms returned sat
[2024-06-01 16:28:24] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 180 ms.
[2024-06-01 16:28:25] [INFO ] Added : 12 causal constraints over 3 iterations in 736 ms. Result :sat
Minimization took 704 ms.
[2024-06-01 16:28:25] [INFO ] [Real]Absence check using 105 positive place invariants in 26 ms returned sat
[2024-06-01 16:28:25] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 15 ms returned sat
[2024-06-01 16:28:26] [INFO ] [Real]Absence check using state equation in 739 ms returned sat
[2024-06-01 16:28:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:28:26] [INFO ] [Nat]Absence check using 105 positive place invariants in 34 ms returned sat
[2024-06-01 16:28:26] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 19 ms returned sat
[2024-06-01 16:28:27] [INFO ] [Nat]Absence check using state equation in 764 ms returned sat
[2024-06-01 16:28:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 354 ms returned sat
[2024-06-01 16:28:28] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 189 ms.
[2024-06-01 16:28:29] [INFO ] Deduced a trap composed of 19 places in 401 ms of which 1 ms to minimize.
[2024-06-01 16:28:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 839 ms
[2024-06-01 16:28:30] [INFO ] Added : 22 causal constraints over 5 iterations in 1983 ms. Result :sat
Minimization took 649 ms.
[2024-06-01 16:28:30] [INFO ] [Real]Absence check using 105 positive place invariants in 30 ms returned sat
[2024-06-01 16:28:30] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 19 ms returned sat
[2024-06-01 16:28:31] [INFO ] [Real]Absence check using state equation in 656 ms returned sat
[2024-06-01 16:28:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:28:31] [INFO ] [Nat]Absence check using 105 positive place invariants in 27 ms returned sat
[2024-06-01 16:28:31] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 24 ms returned sat
[2024-06-01 16:28:33] [INFO ] [Nat]Absence check using state equation in 1450 ms returned sat
[2024-06-01 16:28:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 151 ms returned sat
[2024-06-01 16:28:33] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 148 ms.
[2024-06-01 16:28:34] [INFO ] Added : 7 causal constraints over 3 iterations in 939 ms. Result :sat
Minimization took 654 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 4, 0, 1, 4, 3, 0, 0] Max Struct:[1, 1, 4, 11, 1, 4, 4, 41, 2]
FORMULA PolyORBNT-COL-S10J40-UpperBounds-11 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J40-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J40-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J40-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 3, 0, 0] Max Struct:[1, 11, 4, 41, 2]
Support contains 45 out of 854 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 854/854 places, 2230/2230 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 844 transition count 2228
Reduce places removed 2 places and 0 transitions.
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Iterating post reduction 1 with 43 rules applied. Total rules applied 55 place count 842 transition count 2187
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 96 place count 801 transition count 2187
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 96 place count 801 transition count 2182
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 106 place count 796 transition count 2182
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 108 place count 795 transition count 2181
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 109 place count 795 transition count 2180
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 110 place count 794 transition count 2180
Applied a total of 110 rules in 425 ms. Remains 794 /854 variables (removed 60) and now considering 2180/2230 (removed 50) transitions.
Running 2169 sub problems to find dead transitions.
[2024-06-01 16:28:35] [INFO ] Flow matrix only has 2171 transitions (discarded 9 similar events)
// Phase 1: matrix 2171 rows 794 cols
[2024-06-01 16:28:35] [INFO ] Computed 102 invariants in 63 ms
[2024-06-01 16:28:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/784 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 2169 unsolved
SMT process timed out in 38220ms, After SMT, problems are : Problem set: 0 solved, 2169 unsolved
Search for dead transitions found 0 dead transitions in 38282ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38773 ms. Remains : 794/854 places, 2180/2230 transitions.
[2024-06-01 16:29:13] [INFO ] Flow matrix only has 2171 transitions (discarded 9 similar events)
[2024-06-01 16:29:13] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 3, 0, 0] Max Struct:[1, 11, 4, 41, 2]
RANDOM walk for 1000000 steps (70390 resets) in 15403 ms. (64 steps per ms)
FORMULA PolyORBNT-COL-S10J40-UpperBounds-14 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S10J40-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 3000003 steps (24654 resets) in 8080 ms. (371 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 3, 1] Max Struct:[11, 4, 41]
[2024-06-01 16:29:37] [INFO ] Flow matrix only has 2171 transitions (discarded 9 similar events)
[2024-06-01 16:29:37] [INFO ] Invariant cache hit.
[2024-06-01 16:29:37] [INFO ] [Real]Absence check using 96 positive place invariants in 40 ms returned sat
[2024-06-01 16:29:37] [INFO ] [Real]Absence check using 96 positive and 6 generalized place invariants in 8 ms returned unsat
[2024-06-01 16:29:37] [INFO ] [Real]Absence check using 96 positive place invariants in 24 ms returned sat
[2024-06-01 16:29:37] [INFO ] [Real]Absence check using 96 positive and 6 generalized place invariants in 13 ms returned sat
[2024-06-01 16:29:38] [INFO ] [Real]Absence check using state equation in 492 ms returned sat
[2024-06-01 16:29:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:29:38] [INFO ] [Nat]Absence check using 96 positive place invariants in 25 ms returned sat
[2024-06-01 16:29:38] [INFO ] [Nat]Absence check using 96 positive and 6 generalized place invariants in 12 ms returned sat
[2024-06-01 16:29:38] [INFO ] [Nat]Absence check using state equation in 551 ms returned sat
[2024-06-01 16:29:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:29:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 359 ms returned sat
[2024-06-01 16:29:39] [INFO ] Computed and/alt/rep : 1539/4935/1539 causal constraints (skipped 621 transitions) in 190 ms.
[2024-06-01 16:29:40] [INFO ] Added : 6 causal constraints over 2 iterations in 659 ms. Result :sat
Minimization took 2246 ms.
[2024-06-01 16:29:42] [INFO ] [Real]Absence check using 96 positive place invariants in 31 ms returned sat
[2024-06-01 16:29:42] [INFO ] [Real]Absence check using 96 positive and 6 generalized place invariants in 6 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 3, 1] Max Struct:[1, 4, 1]
FORMULA PolyORBNT-COL-S10J40-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J40-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[4]
Support contains 1 out of 794 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 794/794 places, 2180/2180 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 794 transition count 2179
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 793 transition count 2179
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 2 place count 793 transition count 2138
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 84 place count 752 transition count 2138
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 88 place count 750 transition count 2136
Applied a total of 88 rules in 158 ms. Remains 750 /794 variables (removed 44) and now considering 2136/2180 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 750/794 places, 2136/2180 transitions.
[2024-06-01 16:29:42] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
// Phase 1: matrix 2127 rows 750 cols
[2024-06-01 16:29:42] [INFO ] Computed 102 invariants in 36 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[4]
RANDOM walk for 1000000 steps (72802 resets) in 14181 ms. (70 steps per ms)
BEST_FIRST walk for 1000000 steps (8448 resets) in 2249 ms. (444 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[4]
[2024-06-01 16:29:59] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2024-06-01 16:29:59] [INFO ] Invariant cache hit.
[2024-06-01 16:29:59] [INFO ] [Real]Absence check using 95 positive place invariants in 26 ms returned sat
[2024-06-01 16:29:59] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 16 ms returned sat
[2024-06-01 16:29:59] [INFO ] [Real]Absence check using state equation in 512 ms returned sat
[2024-06-01 16:29:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:30:00] [INFO ] [Nat]Absence check using 95 positive place invariants in 22 ms returned sat
[2024-06-01 16:30:00] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 12 ms returned sat
[2024-06-01 16:30:00] [INFO ] [Nat]Absence check using state equation in 551 ms returned sat
[2024-06-01 16:30:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:30:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 189 ms returned sat
[2024-06-01 16:30:01] [INFO ] Computed and/alt/rep : 1495/5626/1495 causal constraints (skipped 621 transitions) in 197 ms.
[2024-06-01 16:30:01] [INFO ] Added : 9 causal constraints over 3 iterations in 860 ms. Result :sat
Minimization took 4089 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[4]
Support contains 1 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 2136/2136 transitions.
Applied a total of 0 rules in 53 ms. Remains 750 /750 variables (removed 0) and now considering 2136/2136 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 750/750 places, 2136/2136 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 2136/2136 transitions.
Applied a total of 0 rules in 50 ms. Remains 750 /750 variables (removed 0) and now considering 2136/2136 (removed 0) transitions.
[2024-06-01 16:30:06] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2024-06-01 16:30:06] [INFO ] Invariant cache hit.
[2024-06-01 16:30:06] [INFO ] Implicit Places using invariants in 748 ms returned []
[2024-06-01 16:30:06] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2024-06-01 16:30:06] [INFO ] Invariant cache hit.
[2024-06-01 16:30:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:30:12] [INFO ] Implicit Places using invariants and state equation in 5364 ms returned []
Implicit Place search using SMT with State Equation took 6127 ms to find 0 implicit places.
[2024-06-01 16:30:12] [INFO ] Redundant transitions in 133 ms returned []
Running 2125 sub problems to find dead transitions.
[2024-06-01 16:30:12] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2024-06-01 16:30:12] [INFO ] Invariant cache hit.
[2024-06-01 16:30:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/740 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/740 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 740/2877 variables, and 92 constraints, problems are : Problem set: 0 solved, 2125 unsolved in 30071 ms.
Refiners :[Positive P Invariants (semi-flows): 86/95 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/750 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2125/1125 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/740 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/740 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/740 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1007 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1019 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1071 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1092 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1303 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1324 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1334 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1360 is UNSAT
Problem TDEAD1361 is UNSAT
Problem TDEAD1362 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1364 is UNSAT
Problem TDEAD1365 is UNSAT
Problem TDEAD1366 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1369 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1371 is UNSAT
Problem TDEAD1372 is UNSAT
Problem TDEAD1373 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1375 is UNSAT
Problem TDEAD1376 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1379 is UNSAT
Problem TDEAD1380 is UNSAT
Problem TDEAD1381 is UNSAT
Problem TDEAD1382 is UNSAT
Problem TDEAD1383 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1385 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1388 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1390 is UNSAT
Problem TDEAD1391 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1393 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1395 is UNSAT
Problem TDEAD1396 is UNSAT
Problem TDEAD1397 is UNSAT
Problem TDEAD1398 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1400 is UNSAT
Problem TDEAD1401 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1403 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1407 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1409 is UNSAT
Problem TDEAD1410 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1414 is UNSAT
Problem TDEAD1415 is UNSAT
Problem TDEAD1416 is UNSAT
Problem TDEAD1417 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1420 is UNSAT
Problem TDEAD1421 is UNSAT
Problem TDEAD1422 is UNSAT
Problem TDEAD1423 is UNSAT
Problem TDEAD1424 is UNSAT
Problem TDEAD1427 is UNSAT
Problem TDEAD1428 is UNSAT
Problem TDEAD1431 is UNSAT
Problem TDEAD1432 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1437 is UNSAT
Problem TDEAD1440 is UNSAT
Problem TDEAD1441 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1443 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1447 is UNSAT
Problem TDEAD1450 is UNSAT
Problem TDEAD1454 is UNSAT
Problem TDEAD1455 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1458 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1462 is UNSAT
Problem TDEAD1465 is UNSAT
Problem TDEAD1469 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1475 is UNSAT
Problem TDEAD1476 is UNSAT
Problem TDEAD1477 is UNSAT
Problem TDEAD1478 is UNSAT
Problem TDEAD1479 is UNSAT
Problem TDEAD1480 is UNSAT
Problem TDEAD1483 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1501 is UNSAT
Problem TDEAD1502 is UNSAT
Problem TDEAD1503 is UNSAT
Problem TDEAD1504 is UNSAT
Problem TDEAD1505 is UNSAT
Problem TDEAD1506 is UNSAT
Problem TDEAD1507 is UNSAT
Problem TDEAD1508 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1514 is UNSAT
Problem TDEAD1518 is UNSAT
Problem TDEAD1523 is UNSAT
Problem TDEAD1529 is UNSAT
Problem TDEAD1536 is UNSAT
Problem TDEAD1537 is UNSAT
Problem TDEAD1538 is UNSAT
Problem TDEAD1539 is UNSAT
Problem TDEAD1540 is UNSAT
Problem TDEAD1541 is UNSAT
Problem TDEAD1542 is UNSAT
Problem TDEAD1543 is UNSAT
Problem TDEAD1544 is UNSAT
Problem TDEAD1547 is UNSAT
Problem TDEAD1550 is UNSAT
Problem TDEAD1554 is UNSAT
Problem TDEAD1559 is UNSAT
Problem TDEAD1565 is UNSAT
Problem TDEAD1572 is UNSAT
Problem TDEAD1580 is UNSAT
Problem TDEAD1581 is UNSAT
Problem TDEAD1582 is UNSAT
Problem TDEAD1583 is UNSAT
Problem TDEAD1584 is UNSAT
Problem TDEAD1585 is UNSAT
Problem TDEAD1586 is UNSAT
Problem TDEAD1587 is UNSAT
Problem TDEAD1588 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1592 is UNSAT
Problem TDEAD1595 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1604 is UNSAT
Problem TDEAD1610 is UNSAT
Problem TDEAD1617 is UNSAT
Problem TDEAD1625 is UNSAT
Problem TDEAD1634 is UNSAT
Problem TDEAD1635 is UNSAT
Problem TDEAD1636 is UNSAT
Problem TDEAD1637 is UNSAT
Problem TDEAD1638 is UNSAT
Problem TDEAD1639 is UNSAT
Problem TDEAD1640 is UNSAT
Problem TDEAD1641 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1643 is UNSAT
Problem TDEAD1644 is UNSAT
Problem TDEAD1647 is UNSAT
Problem TDEAD1650 is UNSAT
Problem TDEAD1654 is UNSAT
Problem TDEAD1659 is UNSAT
Problem TDEAD1665 is UNSAT
Problem TDEAD1672 is UNSAT
Problem TDEAD1680 is UNSAT
Problem TDEAD1689 is UNSAT
Problem TDEAD1699 is UNSAT
At refinement iteration 3 (OVERLAPS) 9/749 variables, 9/101 constraints. Problems are: Problem set: 558 solved, 1567 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 749/2877 variables, and 101 constraints, problems are : Problem set: 558 solved, 1567 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 95/95 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/750 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/1125 constraints, Known Traps: 0/0 constraints]
After SMT, in 78193ms problems are : Problem set: 558 solved, 1567 unsolved
Search for dead transitions found 558 dead transitions in 78236ms
Found 558 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 558 transitions
Dead transitions reduction (with SMT) removed 558 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 750/750 places, 1578/2136 transitions.
Applied a total of 0 rules in 31 ms. Remains 750 /750 variables (removed 0) and now considering 1578/1578 (removed 0) transitions.
[2024-06-01 16:31:30] [INFO ] Redundant transitions in 79 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 84692 ms. Remains : 750/750 places, 1578/2136 transitions.
[2024-06-01 16:31:30] [INFO ] Flow matrix only has 1569 transitions (discarded 9 similar events)
// Phase 1: matrix 1569 rows 750 cols
[2024-06-01 16:31:30] [INFO ] Computed 102 invariants in 51 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[4]
RANDOM walk for 1000000 steps (72614 resets) in 9785 ms. (102 steps per ms)
BEST_FIRST walk for 1000001 steps (8370 resets) in 1876 ms. (532 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[4]
[2024-06-01 16:31:42] [INFO ] Flow matrix only has 1569 transitions (discarded 9 similar events)
[2024-06-01 16:31:42] [INFO ] Invariant cache hit.
[2024-06-01 16:31:42] [INFO ] [Real]Absence check using 95 positive place invariants in 27 ms returned sat
[2024-06-01 16:31:42] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 17 ms returned sat
[2024-06-01 16:31:43] [INFO ] [Real]Absence check using state equation in 383 ms returned sat
[2024-06-01 16:31:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:31:43] [INFO ] [Nat]Absence check using 95 positive place invariants in 24 ms returned sat
[2024-06-01 16:31:43] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 16 ms returned sat
[2024-06-01 16:31:43] [INFO ] [Nat]Absence check using state equation in 371 ms returned sat
[2024-06-01 16:31:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:31:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 68 ms returned sat
[2024-06-01 16:31:44] [INFO ] Deduced a trap composed of 302 places in 444 ms of which 5 ms to minimize.
[2024-06-01 16:31:44] [INFO ] Deduced a trap composed of 298 places in 454 ms of which 5 ms to minimize.
[2024-06-01 16:31:45] [INFO ] Deduced a trap composed of 302 places in 385 ms of which 4 ms to minimize.
[2024-06-01 16:31:45] [INFO ] Deduced a trap composed of 298 places in 375 ms of which 5 ms to minimize.
[2024-06-01 16:31:45] [INFO ] Deduced a trap composed of 302 places in 360 ms of which 4 ms to minimize.
[2024-06-01 16:31:46] [INFO ] Deduced a trap composed of 304 places in 340 ms of which 4 ms to minimize.
[2024-06-01 16:31:46] [INFO ] Deduced a trap composed of 294 places in 384 ms of which 4 ms to minimize.
[2024-06-01 16:31:47] [INFO ] Deduced a trap composed of 298 places in 388 ms of which 5 ms to minimize.
[2024-06-01 16:31:47] [INFO ] Deduced a trap composed of 298 places in 375 ms of which 4 ms to minimize.
[2024-06-01 16:31:48] [INFO ] Deduced a trap composed of 294 places in 429 ms of which 5 ms to minimize.
[2024-06-01 16:31:48] [INFO ] Deduced a trap composed of 305 places in 432 ms of which 5 ms to minimize.
[2024-06-01 16:31:49] [INFO ] Deduced a trap composed of 294 places in 391 ms of which 4 ms to minimize.
[2024-06-01 16:31:49] [INFO ] Deduced a trap composed of 302 places in 338 ms of which 4 ms to minimize.
[2024-06-01 16:31:49] [INFO ] Deduced a trap composed of 300 places in 358 ms of which 4 ms to minimize.
[2024-06-01 16:31:50] [INFO ] Deduced a trap composed of 300 places in 387 ms of which 4 ms to minimize.
[2024-06-01 16:31:50] [INFO ] Deduced a trap composed of 298 places in 434 ms of which 5 ms to minimize.
[2024-06-01 16:31:51] [INFO ] Deduced a trap composed of 308 places in 364 ms of which 5 ms to minimize.
[2024-06-01 16:31:51] [INFO ] Deduced a trap composed of 302 places in 375 ms of which 4 ms to minimize.
[2024-06-01 16:31:52] [INFO ] Deduced a trap composed of 298 places in 371 ms of which 4 ms to minimize.
[2024-06-01 16:31:52] [INFO ] Deduced a trap composed of 306 places in 405 ms of which 5 ms to minimize.
[2024-06-01 16:31:53] [INFO ] Deduced a trap composed of 298 places in 409 ms of which 5 ms to minimize.
[2024-06-01 16:31:53] [INFO ] Deduced a trap composed of 310 places in 353 ms of which 4 ms to minimize.
[2024-06-01 16:31:54] [INFO ] Deduced a trap composed of 298 places in 378 ms of which 4 ms to minimize.
[2024-06-01 16:31:54] [INFO ] Deduced a trap composed of 292 places in 355 ms of which 4 ms to minimize.
[2024-06-01 16:31:55] [INFO ] Deduced a trap composed of 294 places in 358 ms of which 5 ms to minimize.
[2024-06-01 16:31:55] [INFO ] Deduced a trap composed of 294 places in 399 ms of which 4 ms to minimize.
[2024-06-01 16:31:56] [INFO ] Deduced a trap composed of 300 places in 439 ms of which 5 ms to minimize.
[2024-06-01 16:31:57] [INFO ] Deduced a trap composed of 301 places in 404 ms of which 5 ms to minimize.
[2024-06-01 16:31:58] [INFO ] Deduced a trap composed of 288 places in 361 ms of which 4 ms to minimize.
[2024-06-01 16:31:58] [INFO ] Deduced a trap composed of 308 places in 457 ms of which 5 ms to minimize.
[2024-06-01 16:31:59] [INFO ] Deduced a trap composed of 291 places in 428 ms of which 9 ms to minimize.
[2024-06-01 16:31:59] [INFO ] Deduced a trap composed of 306 places in 387 ms of which 5 ms to minimize.
[2024-06-01 16:32:00] [INFO ] Deduced a trap composed of 297 places in 415 ms of which 4 ms to minimize.
[2024-06-01 16:32:04] [INFO ] Trap strengthening (SAT) tested/added 33/33 trap constraints in 20940 ms
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[4]
Support contains 1 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1578/1578 transitions.
Applied a total of 0 rules in 50 ms. Remains 750 /750 variables (removed 0) and now considering 1578/1578 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 750/750 places, 1578/1578 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1578/1578 transitions.
Applied a total of 0 rules in 40 ms. Remains 750 /750 variables (removed 0) and now considering 1578/1578 (removed 0) transitions.
[2024-06-01 16:32:04] [INFO ] Flow matrix only has 1569 transitions (discarded 9 similar events)
[2024-06-01 16:32:04] [INFO ] Invariant cache hit.
[2024-06-01 16:32:05] [INFO ] Implicit Places using invariants in 514 ms returned []
[2024-06-01 16:32:05] [INFO ] Flow matrix only has 1569 transitions (discarded 9 similar events)
[2024-06-01 16:32:05] [INFO ] Invariant cache hit.
[2024-06-01 16:32:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:32:08] [INFO ] Implicit Places using invariants and state equation in 3064 ms returned []
Implicit Place search using SMT with State Equation took 3580 ms to find 0 implicit places.
[2024-06-01 16:32:08] [INFO ] Redundant transitions in 63 ms returned []
Running 1567 sub problems to find dead transitions.
[2024-06-01 16:32:08] [INFO ] Flow matrix only has 1569 transitions (discarded 9 similar events)
[2024-06-01 16:32:08] [INFO ] Invariant cache hit.
[2024-06-01 16:32:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/740 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/740 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
[2024-06-01 16:32:30] [INFO ] Deduced a trap composed of 191 places in 224 ms of which 4 ms to minimize.
[2024-06-01 16:32:30] [INFO ] Deduced a trap composed of 196 places in 213 ms of which 3 ms to minimize.
[2024-06-01 16:32:30] [INFO ] Deduced a trap composed of 196 places in 215 ms of which 3 ms to minimize.
[2024-06-01 16:32:30] [INFO ] Deduced a trap composed of 201 places in 214 ms of which 3 ms to minimize.
[2024-06-01 16:32:31] [INFO ] Deduced a trap composed of 201 places in 213 ms of which 4 ms to minimize.
[2024-06-01 16:32:31] [INFO ] Deduced a trap composed of 302 places in 218 ms of which 3 ms to minimize.
[2024-06-01 16:32:31] [INFO ] Deduced a trap composed of 236 places in 232 ms of which 4 ms to minimize.
[2024-06-01 16:32:31] [INFO ] Deduced a trap composed of 186 places in 218 ms of which 4 ms to minimize.
[2024-06-01 16:32:32] [INFO ] Deduced a trap composed of 226 places in 213 ms of which 3 ms to minimize.
[2024-06-01 16:32:32] [INFO ] Deduced a trap composed of 231 places in 214 ms of which 4 ms to minimize.
[2024-06-01 16:32:32] [INFO ] Deduced a trap composed of 221 places in 219 ms of which 4 ms to minimize.
[2024-06-01 16:32:32] [INFO ] Deduced a trap composed of 216 places in 273 ms of which 4 ms to minimize.
[2024-06-01 16:32:33] [INFO ] Deduced a trap composed of 196 places in 232 ms of which 3 ms to minimize.
[2024-06-01 16:32:33] [INFO ] Deduced a trap composed of 211 places in 219 ms of which 4 ms to minimize.
[2024-06-01 16:32:33] [INFO ] Deduced a trap composed of 206 places in 224 ms of which 3 ms to minimize.
[2024-06-01 16:32:33] [INFO ] Deduced a trap composed of 216 places in 220 ms of which 4 ms to minimize.
[2024-06-01 16:32:33] [INFO ] Deduced a trap composed of 201 places in 238 ms of which 4 ms to minimize.
[2024-06-01 16:32:34] [INFO ] Deduced a trap composed of 196 places in 242 ms of which 4 ms to minimize.
[2024-06-01 16:32:34] [INFO ] Deduced a trap composed of 206 places in 244 ms of which 4 ms to minimize.
[2024-06-01 16:32:34] [INFO ] Deduced a trap composed of 196 places in 238 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/740 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
[2024-06-01 16:32:37] [INFO ] Deduced a trap composed of 236 places in 260 ms of which 4 ms to minimize.
[2024-06-01 16:32:38] [INFO ] Deduced a trap composed of 236 places in 280 ms of which 4 ms to minimize.
[2024-06-01 16:32:38] [INFO ] Deduced a trap composed of 236 places in 253 ms of which 4 ms to minimize.
[2024-06-01 16:32:38] [INFO ] Deduced a trap composed of 241 places in 268 ms of which 4 ms to minimize.
[2024-06-01 16:32:38] [INFO ] Deduced a trap composed of 236 places in 252 ms of which 4 ms to minimize.
[2024-06-01 16:32:39] [INFO ] Deduced a trap composed of 236 places in 250 ms of which 4 ms to minimize.
[2024-06-01 16:32:39] [INFO ] Deduced a trap composed of 231 places in 257 ms of which 4 ms to minimize.
[2024-06-01 16:32:39] [INFO ] Deduced a trap composed of 206 places in 281 ms of which 3 ms to minimize.
[2024-06-01 16:32:40] [INFO ] Deduced a trap composed of 211 places in 244 ms of which 4 ms to minimize.
[2024-06-01 16:32:40] [INFO ] Deduced a trap composed of 201 places in 250 ms of which 4 ms to minimize.
[2024-06-01 16:32:40] [INFO ] Deduced a trap composed of 201 places in 241 ms of which 4 ms to minimize.
[2024-06-01 16:32:40] [INFO ] Deduced a trap composed of 216 places in 239 ms of which 4 ms to minimize.
[2024-06-01 16:32:41] [INFO ] Deduced a trap composed of 201 places in 235 ms of which 4 ms to minimize.
[2024-06-01 16:32:41] [INFO ] Deduced a trap composed of 196 places in 272 ms of which 4 ms to minimize.
[2024-06-01 16:32:41] [INFO ] Deduced a trap composed of 298 places in 232 ms of which 4 ms to minimize.
[2024-06-01 16:32:41] [INFO ] Deduced a trap composed of 302 places in 253 ms of which 4 ms to minimize.
[2024-06-01 16:32:42] [INFO ] Deduced a trap composed of 151 places in 302 ms of which 4 ms to minimize.
[2024-06-01 16:32:42] [INFO ] Deduced a trap composed of 300 places in 258 ms of which 3 ms to minimize.
[2024-06-01 16:32:42] [INFO ] Deduced a trap composed of 302 places in 296 ms of which 5 ms to minimize.
[2024-06-01 16:32:43] [INFO ] Deduced a trap composed of 300 places in 309 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/740 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 740/2319 variables, and 132 constraints, problems are : Problem set: 0 solved, 1567 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 86/95 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/750 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1567/1567 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1567 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/740 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/740 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/740 variables, 40/132 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
[2024-06-01 16:32:48] [INFO ] Deduced a trap composed of 282 places in 241 ms of which 4 ms to minimize.
[2024-06-01 16:32:48] [INFO ] Deduced a trap composed of 216 places in 229 ms of which 4 ms to minimize.
[2024-06-01 16:32:48] [INFO ] Deduced a trap composed of 211 places in 228 ms of which 4 ms to minimize.
[2024-06-01 16:32:49] [INFO ] Deduced a trap composed of 221 places in 230 ms of which 3 ms to minimize.
[2024-06-01 16:32:49] [INFO ] Deduced a trap composed of 211 places in 237 ms of which 4 ms to minimize.
[2024-06-01 16:32:49] [INFO ] Deduced a trap composed of 211 places in 235 ms of which 4 ms to minimize.
[2024-06-01 16:32:49] [INFO ] Deduced a trap composed of 226 places in 238 ms of which 4 ms to minimize.
[2024-06-01 16:32:50] [INFO ] Deduced a trap composed of 196 places in 279 ms of which 4 ms to minimize.
[2024-06-01 16:32:50] [INFO ] Deduced a trap composed of 186 places in 242 ms of which 4 ms to minimize.
[2024-06-01 16:32:50] [INFO ] Deduced a trap composed of 196 places in 254 ms of which 4 ms to minimize.
[2024-06-01 16:32:50] [INFO ] Deduced a trap composed of 196 places in 240 ms of which 4 ms to minimize.
[2024-06-01 16:32:51] [INFO ] Deduced a trap composed of 186 places in 266 ms of which 4 ms to minimize.
[2024-06-01 16:32:51] [INFO ] Deduced a trap composed of 201 places in 259 ms of which 4 ms to minimize.
[2024-06-01 16:32:51] [INFO ] Deduced a trap composed of 196 places in 299 ms of which 5 ms to minimize.
[2024-06-01 16:32:52] [INFO ] Deduced a trap composed of 181 places in 238 ms of which 4 ms to minimize.
[2024-06-01 16:32:52] [INFO ] Deduced a trap composed of 211 places in 228 ms of which 4 ms to minimize.
[2024-06-01 16:32:52] [INFO ] Deduced a trap composed of 206 places in 295 ms of which 4 ms to minimize.
[2024-06-01 16:32:52] [INFO ] Deduced a trap composed of 216 places in 273 ms of which 5 ms to minimize.
[2024-06-01 16:32:53] [INFO ] Deduced a trap composed of 216 places in 277 ms of which 5 ms to minimize.
[2024-06-01 16:32:53] [INFO ] Deduced a trap composed of 201 places in 229 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/740 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
[2024-06-01 16:32:55] [INFO ] Deduced a trap composed of 18 places in 221 ms of which 1 ms to minimize.
[2024-06-01 16:32:56] [INFO ] Deduced a trap composed of 226 places in 365 ms of which 4 ms to minimize.
[2024-06-01 16:32:57] [INFO ] Deduced a trap composed of 191 places in 389 ms of which 5 ms to minimize.
[2024-06-01 16:32:57] [INFO ] Deduced a trap composed of 221 places in 401 ms of which 5 ms to minimize.
[2024-06-01 16:32:57] [INFO ] Deduced a trap composed of 181 places in 370 ms of which 4 ms to minimize.
[2024-06-01 16:32:58] [INFO ] Deduced a trap composed of 196 places in 356 ms of which 4 ms to minimize.
[2024-06-01 16:32:58] [INFO ] Deduced a trap composed of 210 places in 323 ms of which 4 ms to minimize.
[2024-06-01 16:32:59] [INFO ] Deduced a trap composed of 186 places in 332 ms of which 4 ms to minimize.
[2024-06-01 16:32:59] [INFO ] Deduced a trap composed of 191 places in 387 ms of which 4 ms to minimize.
[2024-06-01 16:32:59] [INFO ] Deduced a trap composed of 186 places in 330 ms of which 3 ms to minimize.
[2024-06-01 16:33:00] [INFO ] Deduced a trap composed of 191 places in 322 ms of which 4 ms to minimize.
[2024-06-01 16:33:00] [INFO ] Deduced a trap composed of 190 places in 320 ms of which 4 ms to minimize.
[2024-06-01 16:33:01] [INFO ] Deduced a trap composed of 201 places in 361 ms of which 4 ms to minimize.
[2024-06-01 16:33:01] [INFO ] Deduced a trap composed of 206 places in 328 ms of which 3 ms to minimize.
[2024-06-01 16:33:01] [INFO ] Deduced a trap composed of 236 places in 351 ms of which 5 ms to minimize.
[2024-06-01 16:33:02] [INFO ] Deduced a trap composed of 231 places in 398 ms of which 5 ms to minimize.
[2024-06-01 16:33:02] [INFO ] Deduced a trap composed of 201 places in 287 ms of which 4 ms to minimize.
[2024-06-01 16:33:02] [INFO ] Deduced a trap composed of 181 places in 350 ms of which 5 ms to minimize.
[2024-06-01 16:33:03] [INFO ] Deduced a trap composed of 300 places in 359 ms of which 4 ms to minimize.
[2024-06-01 16:33:03] [INFO ] Deduced a trap composed of 220 places in 312 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/740 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
[2024-06-01 16:33:04] [INFO ] Deduced a trap composed of 206 places in 309 ms of which 5 ms to minimize.
[2024-06-01 16:33:04] [INFO ] Deduced a trap composed of 206 places in 217 ms of which 3 ms to minimize.
[2024-06-01 16:33:05] [INFO ] Deduced a trap composed of 304 places in 219 ms of which 4 ms to minimize.
[2024-06-01 16:33:05] [INFO ] Deduced a trap composed of 206 places in 227 ms of which 5 ms to minimize.
[2024-06-01 16:33:05] [INFO ] Deduced a trap composed of 292 places in 296 ms of which 5 ms to minimize.
[2024-06-01 16:33:05] [INFO ] Deduced a trap composed of 186 places in 247 ms of which 4 ms to minimize.
[2024-06-01 16:33:06] [INFO ] Deduced a trap composed of 181 places in 248 ms of which 4 ms to minimize.
[2024-06-01 16:33:06] [INFO ] Deduced a trap composed of 186 places in 267 ms of which 4 ms to minimize.
[2024-06-01 16:33:06] [INFO ] Deduced a trap composed of 308 places in 249 ms of which 3 ms to minimize.
[2024-06-01 16:33:06] [INFO ] Deduced a trap composed of 201 places in 243 ms of which 4 ms to minimize.
[2024-06-01 16:33:07] [INFO ] Deduced a trap composed of 211 places in 243 ms of which 4 ms to minimize.
[2024-06-01 16:33:07] [INFO ] Deduced a trap composed of 201 places in 242 ms of which 4 ms to minimize.
[2024-06-01 16:33:07] [INFO ] Deduced a trap composed of 211 places in 276 ms of which 5 ms to minimize.
[2024-06-01 16:33:08] [INFO ] Deduced a trap composed of 191 places in 279 ms of which 4 ms to minimize.
[2024-06-01 16:33:08] [INFO ] Deduced a trap composed of 191 places in 246 ms of which 3 ms to minimize.
[2024-06-01 16:33:08] [INFO ] Deduced a trap composed of 226 places in 265 ms of which 4 ms to minimize.
[2024-06-01 16:33:09] [INFO ] Deduced a trap composed of 231 places in 297 ms of which 5 ms to minimize.
[2024-06-01 16:33:09] [INFO ] Deduced a trap composed of 231 places in 277 ms of which 5 ms to minimize.
[2024-06-01 16:33:09] [INFO ] Deduced a trap composed of 310 places in 304 ms of which 5 ms to minimize.
[2024-06-01 16:33:09] [INFO ] Deduced a trap composed of 231 places in 274 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/740 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
[2024-06-01 16:33:10] [INFO ] Deduced a trap composed of 288 places in 290 ms of which 5 ms to minimize.
[2024-06-01 16:33:11] [INFO ] Deduced a trap composed of 315 places in 332 ms of which 5 ms to minimize.
[2024-06-01 16:33:11] [INFO ] Deduced a trap composed of 315 places in 348 ms of which 5 ms to minimize.
[2024-06-01 16:33:12] [INFO ] Deduced a trap composed of 315 places in 301 ms of which 4 ms to minimize.
[2024-06-01 16:33:12] [INFO ] Deduced a trap composed of 300 places in 239 ms of which 4 ms to minimize.
[2024-06-01 16:33:12] [INFO ] Deduced a trap composed of 303 places in 272 ms of which 4 ms to minimize.
[2024-06-01 16:33:12] [INFO ] Deduced a trap composed of 306 places in 260 ms of which 3 ms to minimize.
[2024-06-01 16:33:13] [INFO ] Deduced a trap composed of 309 places in 254 ms of which 4 ms to minimize.
[2024-06-01 16:33:13] [INFO ] Deduced a trap composed of 306 places in 250 ms of which 3 ms to minimize.
[2024-06-01 16:33:13] [INFO ] Deduced a trap composed of 309 places in 222 ms of which 4 ms to minimize.
[2024-06-01 16:33:14] [INFO ] Deduced a trap composed of 309 places in 306 ms of which 5 ms to minimize.
[2024-06-01 16:33:14] [INFO ] Deduced a trap composed of 312 places in 256 ms of which 4 ms to minimize.
[2024-06-01 16:33:14] [INFO ] Deduced a trap composed of 315 places in 297 ms of which 4 ms to minimize.
[2024-06-01 16:33:14] [INFO ] Deduced a trap composed of 312 places in 310 ms of which 5 ms to minimize.
[2024-06-01 16:33:15] [INFO ] Deduced a trap composed of 312 places in 329 ms of which 5 ms to minimize.
SMT process timed out in 66977ms, After SMT, problems are : Problem set: 0 solved, 1567 unsolved
Search for dead transitions found 0 dead transitions in 67010ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70707 ms. Remains : 750/750 places, 1578/1578 transitions.
RANDOM walk for 40000 steps (2967 resets) in 1225 ms. (32 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (344 resets) in 235 ms. (169 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (320 resets) in 254 ms. (156 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 342308 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :0 out of 2
Probabilistic random walk after 342308 steps, saw 55442 distinct states, run finished after 3004 ms. (steps per millisecond=113 ) properties seen :0
[2024-06-01 16:33:19] [INFO ] Flow matrix only has 1569 transitions (discarded 9 similar events)
[2024-06-01 16:33:19] [INFO ] Invariant cache hit.
[2024-06-01 16:33:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 137/146 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 593/739 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/739 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/740 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/740 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/748 variables, 5/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/748 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/749 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/749 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1569/2318 variables, 749/851 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2318 variables, 1/852 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2318 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/2319 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2319 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/2319 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2319/2319 variables, and 853 constraints, problems are : Problem set: 0 solved, 2 unsolved in 868 ms.
Refiners :[Positive P Invariants (semi-flows): 95/95 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 750/750 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 137/146 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 593/739 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/739 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/740 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/740 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/748 variables, 5/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/748 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/749 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/749 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1569/2318 variables, 749/851 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2318 variables, 1/852 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 16:33:20] [INFO ] Deduced a trap composed of 294 places in 288 ms of which 4 ms to minimize.
[2024-06-01 16:33:21] [INFO ] Deduced a trap composed of 296 places in 376 ms of which 3 ms to minimize.
[2024-06-01 16:33:21] [INFO ] Deduced a trap composed of 292 places in 329 ms of which 4 ms to minimize.
[2024-06-01 16:33:22] [INFO ] Deduced a trap composed of 309 places in 325 ms of which 3 ms to minimize.
[2024-06-01 16:33:22] [INFO ] Deduced a trap composed of 304 places in 271 ms of which 4 ms to minimize.
[2024-06-01 16:33:22] [INFO ] Deduced a trap composed of 305 places in 333 ms of which 5 ms to minimize.
[2024-06-01 16:33:23] [INFO ] Deduced a trap composed of 298 places in 297 ms of which 4 ms to minimize.
[2024-06-01 16:33:23] [INFO ] Deduced a trap composed of 292 places in 379 ms of which 5 ms to minimize.
[2024-06-01 16:33:23] [INFO ] Deduced a trap composed of 300 places in 389 ms of which 4 ms to minimize.
[2024-06-01 16:33:24] [INFO ] Deduced a trap composed of 294 places in 375 ms of which 4 ms to minimize.
[2024-06-01 16:33:24] [INFO ] Deduced a trap composed of 302 places in 315 ms of which 4 ms to minimize.
[2024-06-01 16:33:25] [INFO ] Deduced a trap composed of 294 places in 394 ms of which 3 ms to minimize.
SMT process timed out in 6122ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1578/1578 transitions.
Applied a total of 0 rules in 45 ms. Remains 750 /750 variables (removed 0) and now considering 1578/1578 (removed 0) transitions.
Running 1567 sub problems to find dead transitions.
[2024-06-01 16:33:25] [INFO ] Flow matrix only has 1569 transitions (discarded 9 similar events)
[2024-06-01 16:33:25] [INFO ] Invariant cache hit.
[2024-06-01 16:33:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/740 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/740 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
[2024-06-01 16:33:47] [INFO ] Deduced a trap composed of 191 places in 290 ms of which 4 ms to minimize.
[2024-06-01 16:33:47] [INFO ] Deduced a trap composed of 196 places in 254 ms of which 4 ms to minimize.
[2024-06-01 16:33:47] [INFO ] Deduced a trap composed of 196 places in 280 ms of which 4 ms to minimize.
[2024-06-01 16:33:48] [INFO ] Deduced a trap composed of 201 places in 263 ms of which 4 ms to minimize.
[2024-06-01 16:33:48] [INFO ] Deduced a trap composed of 201 places in 247 ms of which 4 ms to minimize.
[2024-06-01 16:33:48] [INFO ] Deduced a trap composed of 302 places in 301 ms of which 4 ms to minimize.
[2024-06-01 16:33:48] [INFO ] Deduced a trap composed of 236 places in 270 ms of which 4 ms to minimize.
[2024-06-01 16:33:49] [INFO ] Deduced a trap composed of 186 places in 293 ms of which 5 ms to minimize.
[2024-06-01 16:33:49] [INFO ] Deduced a trap composed of 226 places in 311 ms of which 5 ms to minimize.
[2024-06-01 16:33:49] [INFO ] Deduced a trap composed of 231 places in 273 ms of which 4 ms to minimize.
[2024-06-01 16:33:50] [INFO ] Deduced a trap composed of 221 places in 303 ms of which 5 ms to minimize.
[2024-06-01 16:33:50] [INFO ] Deduced a trap composed of 216 places in 301 ms of which 5 ms to minimize.
[2024-06-01 16:33:50] [INFO ] Deduced a trap composed of 196 places in 316 ms of which 5 ms to minimize.
[2024-06-01 16:33:51] [INFO ] Deduced a trap composed of 211 places in 296 ms of which 5 ms to minimize.
[2024-06-01 16:33:51] [INFO ] Deduced a trap composed of 206 places in 285 ms of which 5 ms to minimize.
[2024-06-01 16:33:51] [INFO ] Deduced a trap composed of 216 places in 284 ms of which 4 ms to minimize.
[2024-06-01 16:33:52] [INFO ] Deduced a trap composed of 201 places in 276 ms of which 4 ms to minimize.
[2024-06-01 16:33:52] [INFO ] Deduced a trap composed of 196 places in 280 ms of which 4 ms to minimize.
[2024-06-01 16:33:52] [INFO ] Deduced a trap composed of 206 places in 290 ms of which 4 ms to minimize.
[2024-06-01 16:33:52] [INFO ] Deduced a trap composed of 196 places in 262 ms of which 3 ms to minimize.
SMT process timed out in 27684ms, After SMT, problems are : Problem set: 0 solved, 1567 unsolved
Search for dead transitions found 0 dead transitions in 27704ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27760 ms. Remains : 750/750 places, 1578/1578 transitions.
RANDOM walk for 40000 steps (2879 resets) in 639 ms. (62 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (317 resets) in 118 ms. (336 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (339 resets) in 161 ms. (246 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 365260 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :0 out of 2
Probabilistic random walk after 365260 steps, saw 58988 distinct states, run finished after 3001 ms. (steps per millisecond=121 ) properties seen :0
[2024-06-01 16:33:56] [INFO ] Flow matrix only has 1569 transitions (discarded 9 similar events)
[2024-06-01 16:33:56] [INFO ] Invariant cache hit.
[2024-06-01 16:33:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 137/146 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 593/739 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/739 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/740 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/740 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/748 variables, 5/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/748 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/749 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/749 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1569/2318 variables, 749/851 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2318 variables, 1/852 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2318 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/2319 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2319 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/2319 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2319/2319 variables, and 853 constraints, problems are : Problem set: 0 solved, 2 unsolved in 760 ms.
Refiners :[Positive P Invariants (semi-flows): 95/95 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 750/750 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 137/146 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 593/739 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/739 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/740 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/740 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/748 variables, 5/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/748 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/749 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/749 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1569/2318 variables, 749/851 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2318 variables, 1/852 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 16:33:58] [INFO ] Deduced a trap composed of 294 places in 366 ms of which 4 ms to minimize.
[2024-06-01 16:33:58] [INFO ] Deduced a trap composed of 296 places in 291 ms of which 4 ms to minimize.
[2024-06-01 16:33:58] [INFO ] Deduced a trap composed of 292 places in 332 ms of which 4 ms to minimize.
[2024-06-01 16:33:59] [INFO ] Deduced a trap composed of 309 places in 348 ms of which 4 ms to minimize.
[2024-06-01 16:33:59] [INFO ] Deduced a trap composed of 304 places in 326 ms of which 3 ms to minimize.
[2024-06-01 16:33:59] [INFO ] Deduced a trap composed of 305 places in 316 ms of which 3 ms to minimize.
[2024-06-01 16:34:00] [INFO ] Deduced a trap composed of 298 places in 300 ms of which 3 ms to minimize.
[2024-06-01 16:34:00] [INFO ] Deduced a trap composed of 292 places in 416 ms of which 5 ms to minimize.
[2024-06-01 16:34:01] [INFO ] Deduced a trap composed of 300 places in 278 ms of which 3 ms to minimize.
[2024-06-01 16:34:01] [INFO ] Deduced a trap composed of 294 places in 276 ms of which 4 ms to minimize.
[2024-06-01 16:34:01] [INFO ] Deduced a trap composed of 302 places in 327 ms of which 5 ms to minimize.
[2024-06-01 16:34:02] [INFO ] Deduced a trap composed of 294 places in 383 ms of which 4 ms to minimize.
[2024-06-01 16:34:02] [INFO ] Deduced a trap composed of 290 places in 351 ms of which 5 ms to minimize.
[2024-06-01 16:34:03] [INFO ] Deduced a trap composed of 301 places in 402 ms of which 5 ms to minimize.
[2024-06-01 16:34:03] [INFO ] Deduced a trap composed of 302 places in 387 ms of which 5 ms to minimize.
[2024-06-01 16:34:03] [INFO ] Deduced a trap composed of 296 places in 393 ms of which 5 ms to minimize.
[2024-06-01 16:34:04] [INFO ] Deduced a trap composed of 286 places in 408 ms of which 5 ms to minimize.
[2024-06-01 16:34:04] [INFO ] Deduced a trap composed of 307 places in 357 ms of which 5 ms to minimize.
[2024-06-01 16:34:05] [INFO ] Deduced a trap composed of 306 places in 316 ms of which 3 ms to minimize.
[2024-06-01 16:34:05] [INFO ] Deduced a trap composed of 302 places in 329 ms of which 5 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/2318 variables, 20/872 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 16:34:06] [INFO ] Deduced a trap composed of 296 places in 387 ms of which 4 ms to minimize.
[2024-06-01 16:34:06] [INFO ] Deduced a trap composed of 296 places in 399 ms of which 5 ms to minimize.
[2024-06-01 16:34:07] [INFO ] Deduced a trap composed of 288 places in 395 ms of which 4 ms to minimize.
[2024-06-01 16:34:07] [INFO ] Deduced a trap composed of 303 places in 367 ms of which 5 ms to minimize.
[2024-06-01 16:34:08] [INFO ] Deduced a trap composed of 290 places in 401 ms of which 5 ms to minimize.
[2024-06-01 16:34:08] [INFO ] Deduced a trap composed of 297 places in 340 ms of which 5 ms to minimize.
[2024-06-01 16:34:08] [INFO ] Deduced a trap composed of 304 places in 331 ms of which 5 ms to minimize.
[2024-06-01 16:34:09] [INFO ] Deduced a trap composed of 306 places in 308 ms of which 3 ms to minimize.
[2024-06-01 16:34:09] [INFO ] Deduced a trap composed of 302 places in 266 ms of which 3 ms to minimize.
[2024-06-01 16:34:09] [INFO ] Deduced a trap composed of 300 places in 342 ms of which 4 ms to minimize.
[2024-06-01 16:34:10] [INFO ] Deduced a trap composed of 292 places in 400 ms of which 5 ms to minimize.
[2024-06-01 16:34:10] [INFO ] Deduced a trap composed of 302 places in 375 ms of which 4 ms to minimize.
[2024-06-01 16:34:11] [INFO ] Deduced a trap composed of 294 places in 428 ms of which 5 ms to minimize.
[2024-06-01 16:34:11] [INFO ] Deduced a trap composed of 290 places in 404 ms of which 5 ms to minimize.
[2024-06-01 16:34:11] [INFO ] Deduced a trap composed of 300 places in 318 ms of which 4 ms to minimize.
[2024-06-01 16:34:12] [INFO ] Deduced a trap composed of 294 places in 285 ms of which 4 ms to minimize.
[2024-06-01 16:34:12] [INFO ] Deduced a trap composed of 304 places in 351 ms of which 5 ms to minimize.
[2024-06-01 16:34:13] [INFO ] Deduced a trap composed of 286 places in 406 ms of which 5 ms to minimize.
[2024-06-01 16:34:13] [INFO ] Deduced a trap composed of 292 places in 421 ms of which 5 ms to minimize.
[2024-06-01 16:34:14] [INFO ] Deduced a trap composed of 312 places in 377 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/2318 variables, 20/892 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 16:34:14] [INFO ] Deduced a trap composed of 304 places in 393 ms of which 4 ms to minimize.
[2024-06-01 16:34:15] [INFO ] Deduced a trap composed of 302 places in 347 ms of which 5 ms to minimize.
[2024-06-01 16:34:16] [INFO ] Deduced a trap composed of 306 places in 416 ms of which 4 ms to minimize.
[2024-06-01 16:34:18] [INFO ] Deduced a trap composed of 309 places in 433 ms of which 5 ms to minimize.
[2024-06-01 16:34:18] [INFO ] Deduced a trap composed of 290 places in 424 ms of which 6 ms to minimize.
[2024-06-01 16:34:19] [INFO ] Deduced a trap composed of 296 places in 416 ms of which 5 ms to minimize.
[2024-06-01 16:34:19] [INFO ] Deduced a trap composed of 284 places in 417 ms of which 5 ms to minimize.
[2024-06-01 16:34:20] [INFO ] Deduced a trap composed of 296 places in 418 ms of which 5 ms to minimize.
[2024-06-01 16:34:24] [INFO ] Deduced a trap composed of 296 places in 354 ms of which 4 ms to minimize.
[2024-06-01 16:34:25] [INFO ] Deduced a trap composed of 292 places in 427 ms of which 6 ms to minimize.
[2024-06-01 16:34:25] [INFO ] Deduced a trap composed of 292 places in 332 ms of which 4 ms to minimize.
[2024-06-01 16:34:26] [INFO ] Deduced a trap composed of 296 places in 441 ms of which 5 ms to minimize.
[2024-06-01 16:34:26] [INFO ] Deduced a trap composed of 310 places in 417 ms of which 5 ms to minimize.
[2024-06-01 16:34:27] [INFO ] Deduced a trap composed of 302 places in 393 ms of which 5 ms to minimize.
[2024-06-01 16:34:27] [INFO ] Deduced a trap composed of 298 places in 359 ms of which 3 ms to minimize.
[2024-06-01 16:34:28] [INFO ] Deduced a trap composed of 302 places in 388 ms of which 6 ms to minimize.
[2024-06-01 16:34:28] [INFO ] Deduced a trap composed of 306 places in 364 ms of which 5 ms to minimize.
[2024-06-01 16:34:29] [INFO ] Deduced a trap composed of 296 places in 369 ms of which 5 ms to minimize.
[2024-06-01 16:34:29] [INFO ] Deduced a trap composed of 300 places in 392 ms of which 5 ms to minimize.
[2024-06-01 16:34:29] [INFO ] Deduced a trap composed of 294 places in 301 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/2318 variables, 20/912 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 16:34:30] [INFO ] Deduced a trap composed of 294 places in 380 ms of which 4 ms to minimize.
[2024-06-01 16:34:30] [INFO ] Deduced a trap composed of 296 places in 276 ms of which 3 ms to minimize.
[2024-06-01 16:34:31] [INFO ] Deduced a trap composed of 296 places in 374 ms of which 4 ms to minimize.
[2024-06-01 16:34:31] [INFO ] Deduced a trap composed of 290 places in 388 ms of which 5 ms to minimize.
[2024-06-01 16:34:32] [INFO ] Deduced a trap composed of 294 places in 448 ms of which 6 ms to minimize.
[2024-06-01 16:34:32] [INFO ] Deduced a trap composed of 300 places in 367 ms of which 4 ms to minimize.
[2024-06-01 16:34:33] [INFO ] Deduced a trap composed of 290 places in 407 ms of which 5 ms to minimize.
[2024-06-01 16:34:34] [INFO ] Deduced a trap composed of 294 places in 442 ms of which 6 ms to minimize.
[2024-06-01 16:34:34] [INFO ] Deduced a trap composed of 288 places in 393 ms of which 3 ms to minimize.
[2024-06-01 16:34:35] [INFO ] Deduced a trap composed of 282 places in 441 ms of which 5 ms to minimize.
[2024-06-01 16:34:36] [INFO ] Deduced a trap composed of 302 places in 431 ms of which 5 ms to minimize.
[2024-06-01 16:34:36] [INFO ] Deduced a trap composed of 299 places in 413 ms of which 5 ms to minimize.
[2024-06-01 16:34:37] [INFO ] Deduced a trap composed of 294 places in 437 ms of which 5 ms to minimize.
[2024-06-01 16:34:37] [INFO ] Deduced a trap composed of 304 places in 378 ms of which 4 ms to minimize.
[2024-06-01 16:34:37] [INFO ] Deduced a trap composed of 292 places in 432 ms of which 5 ms to minimize.
[2024-06-01 16:34:38] [INFO ] Deduced a trap composed of 305 places in 356 ms of which 4 ms to minimize.
[2024-06-01 16:34:38] [INFO ] Deduced a trap composed of 304 places in 368 ms of which 3 ms to minimize.
[2024-06-01 16:34:40] [INFO ] Deduced a trap composed of 292 places in 434 ms of which 5 ms to minimize.
[2024-06-01 16:34:40] [INFO ] Deduced a trap composed of 304 places in 349 ms of which 5 ms to minimize.
[2024-06-01 16:34:40] [INFO ] Deduced a trap composed of 305 places in 310 ms of which 4 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/2318 variables, 20/932 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 16:34:41] [INFO ] Deduced a trap composed of 302 places in 420 ms of which 5 ms to minimize.
[2024-06-01 16:34:42] [INFO ] Deduced a trap composed of 298 places in 416 ms of which 5 ms to minimize.
SMT process timed out in 45852ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 50 ms.
Support contains 1 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1578/1578 transitions.
Applied a total of 0 rules in 35 ms. Remains 750 /750 variables (removed 0) and now considering 1578/1578 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 750/750 places, 1578/1578 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1578/1578 transitions.
Applied a total of 0 rules in 34 ms. Remains 750 /750 variables (removed 0) and now considering 1578/1578 (removed 0) transitions.
[2024-06-01 16:34:42] [INFO ] Flow matrix only has 1569 transitions (discarded 9 similar events)
[2024-06-01 16:34:42] [INFO ] Invariant cache hit.
[2024-06-01 16:34:42] [INFO ] Implicit Places using invariants in 681 ms returned []
[2024-06-01 16:34:42] [INFO ] Flow matrix only has 1569 transitions (discarded 9 similar events)
[2024-06-01 16:34:42] [INFO ] Invariant cache hit.
[2024-06-01 16:34:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:34:46] [INFO ] Implicit Places using invariants and state equation in 3150 ms returned []
Implicit Place search using SMT with State Equation took 3834 ms to find 0 implicit places.
[2024-06-01 16:34:46] [INFO ] Redundant transitions in 46 ms returned []
Running 1567 sub problems to find dead transitions.
[2024-06-01 16:34:46] [INFO ] Flow matrix only has 1569 transitions (discarded 9 similar events)
[2024-06-01 16:34:46] [INFO ] Invariant cache hit.
[2024-06-01 16:34:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/740 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/740 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
[2024-06-01 16:35:09] [INFO ] Deduced a trap composed of 191 places in 295 ms of which 5 ms to minimize.
[2024-06-01 16:35:09] [INFO ] Deduced a trap composed of 196 places in 273 ms of which 4 ms to minimize.
[2024-06-01 16:35:09] [INFO ] Deduced a trap composed of 196 places in 313 ms of which 5 ms to minimize.
[2024-06-01 16:35:10] [INFO ] Deduced a trap composed of 201 places in 294 ms of which 5 ms to minimize.
[2024-06-01 16:35:10] [INFO ] Deduced a trap composed of 201 places in 221 ms of which 3 ms to minimize.
[2024-06-01 16:35:10] [INFO ] Deduced a trap composed of 302 places in 214 ms of which 4 ms to minimize.
[2024-06-01 16:35:10] [INFO ] Deduced a trap composed of 236 places in 270 ms of which 4 ms to minimize.
[2024-06-01 16:35:11] [INFO ] Deduced a trap composed of 186 places in 267 ms of which 5 ms to minimize.
[2024-06-01 16:35:11] [INFO ] Deduced a trap composed of 226 places in 250 ms of which 3 ms to minimize.
[2024-06-01 16:35:11] [INFO ] Deduced a trap composed of 231 places in 220 ms of which 3 ms to minimize.
[2024-06-01 16:35:11] [INFO ] Deduced a trap composed of 221 places in 250 ms of which 3 ms to minimize.
[2024-06-01 16:35:12] [INFO ] Deduced a trap composed of 216 places in 217 ms of which 4 ms to minimize.
[2024-06-01 16:35:12] [INFO ] Deduced a trap composed of 196 places in 260 ms of which 4 ms to minimize.
[2024-06-01 16:35:12] [INFO ] Deduced a trap composed of 211 places in 250 ms of which 3 ms to minimize.
[2024-06-01 16:35:13] [INFO ] Deduced a trap composed of 206 places in 305 ms of which 5 ms to minimize.
[2024-06-01 16:35:13] [INFO ] Deduced a trap composed of 216 places in 250 ms of which 4 ms to minimize.
[2024-06-01 16:35:13] [INFO ] Deduced a trap composed of 201 places in 312 ms of which 5 ms to minimize.
[2024-06-01 16:35:13] [INFO ] Deduced a trap composed of 196 places in 279 ms of which 5 ms to minimize.
[2024-06-01 16:35:14] [INFO ] Deduced a trap composed of 206 places in 251 ms of which 4 ms to minimize.
[2024-06-01 16:35:14] [INFO ] Deduced a trap composed of 196 places in 230 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/740 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
[2024-06-01 16:35:17] [INFO ] Deduced a trap composed of 236 places in 343 ms of which 5 ms to minimize.
[2024-06-01 16:35:17] [INFO ] Deduced a trap composed of 236 places in 311 ms of which 4 ms to minimize.
[2024-06-01 16:35:17] [INFO ] Deduced a trap composed of 236 places in 284 ms of which 4 ms to minimize.
[2024-06-01 16:35:18] [INFO ] Deduced a trap composed of 241 places in 273 ms of which 4 ms to minimize.
[2024-06-01 16:35:18] [INFO ] Deduced a trap composed of 236 places in 253 ms of which 3 ms to minimize.
[2024-06-01 16:35:18] [INFO ] Deduced a trap composed of 236 places in 228 ms of which 3 ms to minimize.
[2024-06-01 16:35:19] [INFO ] Deduced a trap composed of 231 places in 228 ms of which 3 ms to minimize.
[2024-06-01 16:35:19] [INFO ] Deduced a trap composed of 206 places in 231 ms of which 4 ms to minimize.
[2024-06-01 16:35:19] [INFO ] Deduced a trap composed of 211 places in 231 ms of which 3 ms to minimize.
[2024-06-01 16:35:19] [INFO ] Deduced a trap composed of 201 places in 287 ms of which 5 ms to minimize.
[2024-06-01 16:35:20] [INFO ] Deduced a trap composed of 201 places in 283 ms of which 4 ms to minimize.
[2024-06-01 16:35:20] [INFO ] Deduced a trap composed of 216 places in 262 ms of which 3 ms to minimize.
[2024-06-01 16:35:20] [INFO ] Deduced a trap composed of 201 places in 288 ms of which 5 ms to minimize.
[2024-06-01 16:35:20] [INFO ] Deduced a trap composed of 196 places in 258 ms of which 3 ms to minimize.
[2024-06-01 16:35:21] [INFO ] Deduced a trap composed of 298 places in 226 ms of which 3 ms to minimize.
[2024-06-01 16:35:21] [INFO ] Deduced a trap composed of 302 places in 262 ms of which 4 ms to minimize.
[2024-06-01 16:35:21] [INFO ] Deduced a trap composed of 151 places in 222 ms of which 4 ms to minimize.
[2024-06-01 16:35:22] [INFO ] Deduced a trap composed of 300 places in 283 ms of which 4 ms to minimize.
[2024-06-01 16:35:22] [INFO ] Deduced a trap composed of 302 places in 222 ms of which 3 ms to minimize.
[2024-06-01 16:35:22] [INFO ] Deduced a trap composed of 300 places in 223 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/740 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 740/2319 variables, and 132 constraints, problems are : Problem set: 0 solved, 1567 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 86/95 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/750 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1567/1567 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1567 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/740 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/740 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/740 variables, 40/132 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
[2024-06-01 16:35:26] [INFO ] Deduced a trap composed of 282 places in 341 ms of which 5 ms to minimize.
[2024-06-01 16:35:27] [INFO ] Deduced a trap composed of 216 places in 301 ms of which 5 ms to minimize.
[2024-06-01 16:35:27] [INFO ] Deduced a trap composed of 211 places in 321 ms of which 4 ms to minimize.
[2024-06-01 16:35:27] [INFO ] Deduced a trap composed of 221 places in 293 ms of which 4 ms to minimize.
[2024-06-01 16:35:28] [INFO ] Deduced a trap composed of 211 places in 280 ms of which 3 ms to minimize.
[2024-06-01 16:35:28] [INFO ] Deduced a trap composed of 211 places in 257 ms of which 5 ms to minimize.
[2024-06-01 16:35:28] [INFO ] Deduced a trap composed of 226 places in 222 ms of which 3 ms to minimize.
[2024-06-01 16:35:29] [INFO ] Deduced a trap composed of 196 places in 208 ms of which 4 ms to minimize.
[2024-06-01 16:35:29] [INFO ] Deduced a trap composed of 186 places in 263 ms of which 5 ms to minimize.
[2024-06-01 16:35:29] [INFO ] Deduced a trap composed of 196 places in 268 ms of which 5 ms to minimize.
[2024-06-01 16:35:29] [INFO ] Deduced a trap composed of 196 places in 220 ms of which 4 ms to minimize.
[2024-06-01 16:35:30] [INFO ] Deduced a trap composed of 186 places in 215 ms of which 3 ms to minimize.
[2024-06-01 16:35:30] [INFO ] Deduced a trap composed of 201 places in 239 ms of which 3 ms to minimize.
[2024-06-01 16:35:30] [INFO ] Deduced a trap composed of 196 places in 215 ms of which 4 ms to minimize.
[2024-06-01 16:35:30] [INFO ] Deduced a trap composed of 181 places in 211 ms of which 4 ms to minimize.
[2024-06-01 16:35:31] [INFO ] Deduced a trap composed of 211 places in 209 ms of which 3 ms to minimize.
[2024-06-01 16:35:31] [INFO ] Deduced a trap composed of 206 places in 206 ms of which 4 ms to minimize.
[2024-06-01 16:35:31] [INFO ] Deduced a trap composed of 216 places in 206 ms of which 4 ms to minimize.
[2024-06-01 16:35:31] [INFO ] Deduced a trap composed of 216 places in 226 ms of which 4 ms to minimize.
[2024-06-01 16:35:32] [INFO ] Deduced a trap composed of 201 places in 260 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/740 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
[2024-06-01 16:35:33] [INFO ] Deduced a trap composed of 18 places in 154 ms of which 1 ms to minimize.
[2024-06-01 16:35:35] [INFO ] Deduced a trap composed of 226 places in 375 ms of which 4 ms to minimize.
[2024-06-01 16:35:35] [INFO ] Deduced a trap composed of 191 places in 361 ms of which 5 ms to minimize.
[2024-06-01 16:35:35] [INFO ] Deduced a trap composed of 221 places in 356 ms of which 4 ms to minimize.
[2024-06-01 16:35:36] [INFO ] Deduced a trap composed of 181 places in 364 ms of which 5 ms to minimize.
[2024-06-01 16:35:36] [INFO ] Deduced a trap composed of 196 places in 299 ms of which 4 ms to minimize.
[2024-06-01 16:35:36] [INFO ] Deduced a trap composed of 210 places in 373 ms of which 5 ms to minimize.
[2024-06-01 16:35:37] [INFO ] Deduced a trap composed of 186 places in 297 ms of which 4 ms to minimize.
[2024-06-01 16:35:37] [INFO ] Deduced a trap composed of 191 places in 363 ms of which 5 ms to minimize.
[2024-06-01 16:35:38] [INFO ] Deduced a trap composed of 186 places in 364 ms of which 5 ms to minimize.
[2024-06-01 16:35:38] [INFO ] Deduced a trap composed of 191 places in 414 ms of which 5 ms to minimize.
[2024-06-01 16:35:38] [INFO ] Deduced a trap composed of 190 places in 415 ms of which 4 ms to minimize.
[2024-06-01 16:35:39] [INFO ] Deduced a trap composed of 201 places in 299 ms of which 4 ms to minimize.
[2024-06-01 16:35:39] [INFO ] Deduced a trap composed of 206 places in 386 ms of which 3 ms to minimize.
[2024-06-01 16:35:40] [INFO ] Deduced a trap composed of 236 places in 361 ms of which 5 ms to minimize.
[2024-06-01 16:35:40] [INFO ] Deduced a trap composed of 231 places in 359 ms of which 4 ms to minimize.
[2024-06-01 16:35:40] [INFO ] Deduced a trap composed of 201 places in 347 ms of which 5 ms to minimize.
[2024-06-01 16:35:41] [INFO ] Deduced a trap composed of 181 places in 313 ms of which 3 ms to minimize.
[2024-06-01 16:35:41] [INFO ] Deduced a trap composed of 300 places in 305 ms of which 3 ms to minimize.
[2024-06-01 16:35:41] [INFO ] Deduced a trap composed of 220 places in 351 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/740 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
[2024-06-01 16:35:42] [INFO ] Deduced a trap composed of 206 places in 346 ms of which 6 ms to minimize.
[2024-06-01 16:35:43] [INFO ] Deduced a trap composed of 206 places in 309 ms of which 5 ms to minimize.
[2024-06-01 16:35:43] [INFO ] Deduced a trap composed of 304 places in 315 ms of which 5 ms to minimize.
[2024-06-01 16:35:43] [INFO ] Deduced a trap composed of 206 places in 266 ms of which 4 ms to minimize.
[2024-06-01 16:35:44] [INFO ] Deduced a trap composed of 292 places in 305 ms of which 5 ms to minimize.
[2024-06-01 16:35:44] [INFO ] Deduced a trap composed of 186 places in 247 ms of which 4 ms to minimize.
[2024-06-01 16:35:44] [INFO ] Deduced a trap composed of 181 places in 240 ms of which 4 ms to minimize.
[2024-06-01 16:35:45] [INFO ] Deduced a trap composed of 186 places in 248 ms of which 4 ms to minimize.
[2024-06-01 16:35:45] [INFO ] Deduced a trap composed of 308 places in 250 ms of which 4 ms to minimize.
[2024-06-01 16:35:45] [INFO ] Deduced a trap composed of 201 places in 301 ms of which 5 ms to minimize.
[2024-06-01 16:35:46] [INFO ] Deduced a trap composed of 211 places in 272 ms of which 4 ms to minimize.
[2024-06-01 16:35:46] [INFO ] Deduced a trap composed of 201 places in 278 ms of which 4 ms to minimize.
[2024-06-01 16:35:46] [INFO ] Deduced a trap composed of 211 places in 242 ms of which 4 ms to minimize.
[2024-06-01 16:35:46] [INFO ] Deduced a trap composed of 191 places in 242 ms of which 4 ms to minimize.
[2024-06-01 16:35:47] [INFO ] Deduced a trap composed of 191 places in 254 ms of which 4 ms to minimize.
[2024-06-01 16:35:47] [INFO ] Deduced a trap composed of 226 places in 253 ms of which 3 ms to minimize.
[2024-06-01 16:35:47] [INFO ] Deduced a trap composed of 231 places in 249 ms of which 4 ms to minimize.
[2024-06-01 16:35:47] [INFO ] Deduced a trap composed of 231 places in 228 ms of which 4 ms to minimize.
[2024-06-01 16:35:48] [INFO ] Deduced a trap composed of 310 places in 271 ms of which 4 ms to minimize.
[2024-06-01 16:35:48] [INFO ] Deduced a trap composed of 231 places in 243 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/740 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
[2024-06-01 16:35:49] [INFO ] Deduced a trap composed of 288 places in 309 ms of which 5 ms to minimize.
[2024-06-01 16:35:49] [INFO ] Deduced a trap composed of 315 places in 328 ms of which 4 ms to minimize.
[2024-06-01 16:35:50] [INFO ] Deduced a trap composed of 315 places in 340 ms of which 5 ms to minimize.
[2024-06-01 16:35:50] [INFO ] Deduced a trap composed of 315 places in 303 ms of which 7 ms to minimize.
[2024-06-01 16:35:50] [INFO ] Deduced a trap composed of 300 places in 309 ms of which 3 ms to minimize.
[2024-06-01 16:35:51] [INFO ] Deduced a trap composed of 303 places in 273 ms of which 4 ms to minimize.
[2024-06-01 16:35:51] [INFO ] Deduced a trap composed of 306 places in 304 ms of which 4 ms to minimize.
[2024-06-01 16:35:51] [INFO ] Deduced a trap composed of 309 places in 270 ms of which 4 ms to minimize.
[2024-06-01 16:35:52] [INFO ] Deduced a trap composed of 306 places in 287 ms of which 4 ms to minimize.
[2024-06-01 16:35:52] [INFO ] Deduced a trap composed of 309 places in 249 ms of which 4 ms to minimize.
[2024-06-01 16:35:52] [INFO ] Deduced a trap composed of 309 places in 243 ms of which 3 ms to minimize.
[2024-06-01 16:35:52] [INFO ] Deduced a trap composed of 312 places in 244 ms of which 4 ms to minimize.
[2024-06-01 16:35:53] [INFO ] Deduced a trap composed of 315 places in 313 ms of which 5 ms to minimize.
SMT process timed out in 67221ms, After SMT, problems are : Problem set: 0 solved, 1567 unsolved
Search for dead transitions found 0 dead transitions in 67247ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71173 ms. Remains : 750/750 places, 1578/1578 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[4]
Starting property specific reduction for PolyORBNT-COL-S10J40-UpperBounds-12
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[4]
[2024-06-01 16:35:53] [INFO ] Flow matrix only has 1569 transitions (discarded 9 similar events)
[2024-06-01 16:35:53] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 10000 steps (731 resets) in 128 ms. (77 steps per ms)
BEST_FIRST walk for 10001 steps (73 resets) in 24 ms. (400 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[4]
[2024-06-01 16:35:53] [INFO ] Flow matrix only has 1569 transitions (discarded 9 similar events)
[2024-06-01 16:35:53] [INFO ] Invariant cache hit.
[2024-06-01 16:35:53] [INFO ] [Real]Absence check using 95 positive place invariants in 25 ms returned sat
[2024-06-01 16:35:53] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 16 ms returned sat
[2024-06-01 16:35:53] [INFO ] [Real]Absence check using state equation in 352 ms returned sat
[2024-06-01 16:35:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:35:54] [INFO ] [Nat]Absence check using 95 positive place invariants in 21 ms returned sat
[2024-06-01 16:35:54] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 12 ms returned sat
[2024-06-01 16:35:54] [INFO ] [Nat]Absence check using state equation in 332 ms returned sat
[2024-06-01 16:35:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:35:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 65 ms returned sat
[2024-06-01 16:35:54] [INFO ] Deduced a trap composed of 302 places in 392 ms of which 4 ms to minimize.
[2024-06-01 16:35:55] [INFO ] Deduced a trap composed of 298 places in 350 ms of which 3 ms to minimize.
[2024-06-01 16:35:55] [INFO ] Deduced a trap composed of 302 places in 312 ms of which 4 ms to minimize.
[2024-06-01 16:35:56] [INFO ] Deduced a trap composed of 298 places in 352 ms of which 4 ms to minimize.
[2024-06-01 16:35:56] [INFO ] Deduced a trap composed of 302 places in 423 ms of which 5 ms to minimize.
[2024-06-01 16:35:57] [INFO ] Deduced a trap composed of 304 places in 438 ms of which 5 ms to minimize.
[2024-06-01 16:35:57] [INFO ] Deduced a trap composed of 294 places in 432 ms of which 5 ms to minimize.
[2024-06-01 16:35:58] [INFO ] Deduced a trap composed of 298 places in 436 ms of which 5 ms to minimize.
[2024-06-01 16:35:58] [INFO ] Deduced a trap composed of 298 places in 449 ms of which 5 ms to minimize.
[2024-06-01 16:35:59] [INFO ] Deduced a trap composed of 294 places in 422 ms of which 5 ms to minimize.
[2024-06-01 16:35:59] [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:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[4]
Support contains 1 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1578/1578 transitions.
Applied a total of 0 rules in 34 ms. Remains 750 /750 variables (removed 0) and now considering 1578/1578 (removed 0) transitions.
Running 1567 sub problems to find dead transitions.
[2024-06-01 16:35:59] [INFO ] Flow matrix only has 1569 transitions (discarded 9 similar events)
[2024-06-01 16:35:59] [INFO ] Invariant cache hit.
[2024-06-01 16:35:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/740 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/740 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
[2024-06-01 16:36:20] [INFO ] Deduced a trap composed of 191 places in 232 ms of which 3 ms to minimize.
[2024-06-01 16:36:20] [INFO ] Deduced a trap composed of 196 places in 235 ms of which 4 ms to minimize.
[2024-06-01 16:36:20] [INFO ] Deduced a trap composed of 196 places in 230 ms of which 4 ms to minimize.
[2024-06-01 16:36:20] [INFO ] Deduced a trap composed of 201 places in 233 ms of which 3 ms to minimize.
[2024-06-01 16:36:21] [INFO ] Deduced a trap composed of 201 places in 231 ms of which 4 ms to minimize.
[2024-06-01 16:36:21] [INFO ] Deduced a trap composed of 302 places in 275 ms of which 3 ms to minimize.
[2024-06-01 16:36:21] [INFO ] Deduced a trap composed of 236 places in 293 ms of which 5 ms to minimize.
[2024-06-01 16:36:21] [INFO ] Deduced a trap composed of 186 places in 290 ms of which 5 ms to minimize.
[2024-06-01 16:36:22] [INFO ] Deduced a trap composed of 226 places in 241 ms of which 4 ms to minimize.
[2024-06-01 16:36:22] [INFO ] Deduced a trap composed of 231 places in 233 ms of which 3 ms to minimize.
[2024-06-01 16:36:22] [INFO ] Deduced a trap composed of 221 places in 231 ms of which 3 ms to minimize.
[2024-06-01 16:36:22] [INFO ] Deduced a trap composed of 216 places in 222 ms of which 3 ms to minimize.
[2024-06-01 16:36:23] [INFO ] Deduced a trap composed of 196 places in 227 ms of which 4 ms to minimize.
[2024-06-01 16:36:23] [INFO ] Deduced a trap composed of 211 places in 221 ms of which 4 ms to minimize.
[2024-06-01 16:36:23] [INFO ] Deduced a trap composed of 206 places in 219 ms of which 4 ms to minimize.
[2024-06-01 16:36:23] [INFO ] Deduced a trap composed of 216 places in 221 ms of which 4 ms to minimize.
[2024-06-01 16:36:24] [INFO ] Deduced a trap composed of 201 places in 238 ms of which 4 ms to minimize.
[2024-06-01 16:36:24] [INFO ] Deduced a trap composed of 196 places in 260 ms of which 4 ms to minimize.
[2024-06-01 16:36:24] [INFO ] Deduced a trap composed of 206 places in 241 ms of which 4 ms to minimize.
[2024-06-01 16:36:24] [INFO ] Deduced a trap composed of 196 places in 237 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/740 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 740/2319 variables, and 112 constraints, problems are : Problem set: 0 solved, 1567 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 86/95 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/750 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1567/1567 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1567 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/740 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/740 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/740 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
[2024-06-01 16:36:28] [INFO ] Deduced a trap composed of 313 places in 381 ms of which 5 ms to minimize.
[2024-06-01 16:36:28] [INFO ] Deduced a trap composed of 306 places in 341 ms of which 4 ms to minimize.
[2024-06-01 16:36:28] [INFO ] Deduced a trap composed of 321 places in 375 ms of which 5 ms to minimize.
[2024-06-01 16:36:29] [INFO ] Deduced a trap composed of 310 places in 361 ms of which 4 ms to minimize.
[2024-06-01 16:36:29] [INFO ] Deduced a trap composed of 308 places in 366 ms of which 4 ms to minimize.
[2024-06-01 16:36:29] [INFO ] Deduced a trap composed of 312 places in 350 ms of which 5 ms to minimize.
[2024-06-01 16:36:30] [INFO ] Deduced a trap composed of 302 places in 353 ms of which 4 ms to minimize.
[2024-06-01 16:36:30] [INFO ] Deduced a trap composed of 302 places in 400 ms of which 5 ms to minimize.
[2024-06-01 16:36:31] [INFO ] Deduced a trap composed of 205 places in 383 ms of which 5 ms to minimize.
[2024-06-01 16:36:31] [INFO ] Deduced a trap composed of 226 places in 370 ms of which 5 ms to minimize.
[2024-06-01 16:36:31] [INFO ] Deduced a trap composed of 225 places in 346 ms of which 4 ms to minimize.
[2024-06-01 16:36:32] [INFO ] Deduced a trap composed of 176 places in 304 ms of which 3 ms to minimize.
[2024-06-01 16:36:32] [INFO ] Deduced a trap composed of 211 places in 284 ms of which 3 ms to minimize.
[2024-06-01 16:36:32] [INFO ] Deduced a trap composed of 231 places in 372 ms of which 5 ms to minimize.
[2024-06-01 16:36:33] [INFO ] Deduced a trap composed of 236 places in 349 ms of which 4 ms to minimize.
[2024-06-01 16:36:33] [INFO ] Deduced a trap composed of 211 places in 370 ms of which 4 ms to minimize.
[2024-06-01 16:36:34] [INFO ] Deduced a trap composed of 302 places in 425 ms of which 5 ms to minimize.
[2024-06-01 16:36:34] [INFO ] Deduced a trap composed of 186 places in 396 ms of which 4 ms to minimize.
[2024-06-01 16:36:34] [INFO ] Deduced a trap composed of 216 places in 398 ms of which 5 ms to minimize.
[2024-06-01 16:36:35] [INFO ] Deduced a trap composed of 201 places in 393 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/740 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
[2024-06-01 16:36:36] [INFO ] Deduced a trap composed of 294 places in 293 ms of which 5 ms to minimize.
[2024-06-01 16:36:36] [INFO ] Deduced a trap composed of 294 places in 264 ms of which 5 ms to minimize.
[2024-06-01 16:36:36] [INFO ] Deduced a trap composed of 292 places in 290 ms of which 5 ms to minimize.
[2024-06-01 16:36:37] [INFO ] Deduced a trap composed of 296 places in 241 ms of which 3 ms to minimize.
[2024-06-01 16:36:37] [INFO ] Deduced a trap composed of 302 places in 213 ms of which 3 ms to minimize.
[2024-06-01 16:36:37] [INFO ] Deduced a trap composed of 186 places in 266 ms of which 5 ms to minimize.
[2024-06-01 16:36:37] [INFO ] Deduced a trap composed of 211 places in 250 ms of which 4 ms to minimize.
[2024-06-01 16:36:38] [INFO ] Deduced a trap composed of 206 places in 215 ms of which 4 ms to minimize.
[2024-06-01 16:36:38] [INFO ] Deduced a trap composed of 211 places in 242 ms of which 3 ms to minimize.
[2024-06-01 16:36:38] [INFO ] Deduced a trap composed of 201 places in 250 ms of which 4 ms to minimize.
[2024-06-01 16:36:38] [INFO ] Deduced a trap composed of 201 places in 251 ms of which 3 ms to minimize.
[2024-06-01 16:36:39] [INFO ] Deduced a trap composed of 300 places in 217 ms of which 3 ms to minimize.
[2024-06-01 16:36:39] [INFO ] Deduced a trap composed of 201 places in 240 ms of which 4 ms to minimize.
[2024-06-01 16:36:39] [INFO ] Deduced a trap composed of 302 places in 307 ms of which 3 ms to minimize.
[2024-06-01 16:36:40] [INFO ] Deduced a trap composed of 201 places in 214 ms of which 4 ms to minimize.
[2024-06-01 16:36:40] [INFO ] Deduced a trap composed of 206 places in 216 ms of which 3 ms to minimize.
[2024-06-01 16:36:40] [INFO ] Deduced a trap composed of 302 places in 220 ms of which 4 ms to minimize.
[2024-06-01 16:36:40] [INFO ] Deduced a trap composed of 302 places in 234 ms of which 3 ms to minimize.
[2024-06-01 16:36:41] [INFO ] Deduced a trap composed of 306 places in 218 ms of which 3 ms to minimize.
[2024-06-01 16:36:41] [INFO ] Deduced a trap composed of 304 places in 267 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/740 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
[2024-06-01 16:36:42] [INFO ] Deduced a trap composed of 191 places in 383 ms of which 3 ms to minimize.
[2024-06-01 16:36:42] [INFO ] Deduced a trap composed of 225 places in 361 ms of which 6 ms to minimize.
[2024-06-01 16:36:42] [INFO ] Deduced a trap composed of 211 places in 363 ms of which 5 ms to minimize.
[2024-06-01 16:36:43] [INFO ] Deduced a trap composed of 201 places in 445 ms of which 5 ms to minimize.
[2024-06-01 16:36:43] [INFO ] Deduced a trap composed of 216 places in 416 ms of which 5 ms to minimize.
[2024-06-01 16:36:44] [INFO ] Deduced a trap composed of 201 places in 401 ms of which 4 ms to minimize.
[2024-06-01 16:36:44] [INFO ] Deduced a trap composed of 225 places in 313 ms of which 4 ms to minimize.
[2024-06-01 16:36:45] [INFO ] Deduced a trap composed of 221 places in 346 ms of which 4 ms to minimize.
[2024-06-01 16:36:45] [INFO ] Deduced a trap composed of 205 places in 292 ms of which 3 ms to minimize.
[2024-06-01 16:36:45] [INFO ] Deduced a trap composed of 221 places in 359 ms of which 3 ms to minimize.
[2024-06-01 16:36:46] [INFO ] Deduced a trap composed of 215 places in 362 ms of which 4 ms to minimize.
[2024-06-01 16:36:46] [INFO ] Deduced a trap composed of 196 places in 444 ms of which 5 ms to minimize.
SMT process timed out in 47454ms, After SMT, problems are : Problem set: 0 solved, 1567 unsolved
Search for dead transitions found 0 dead transitions in 47473ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47511 ms. Remains : 750/750 places, 1578/1578 transitions.
[2024-06-01 16:36:46] [INFO ] Flow matrix only has 1569 transitions (discarded 9 similar events)
[2024-06-01 16:36:46] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[4]
RANDOM walk for 1000000 steps (72481 resets) in 9827 ms. (101 steps per ms)
BEST_FIRST walk for 1000001 steps (8077 resets) in 1873 ms. (533 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[4]
[2024-06-01 16:36:58] [INFO ] Flow matrix only has 1569 transitions (discarded 9 similar events)
[2024-06-01 16:36:58] [INFO ] Invariant cache hit.
[2024-06-01 16:36:58] [INFO ] [Real]Absence check using 95 positive place invariants in 25 ms returned sat
[2024-06-01 16:36:58] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 32 ms returned sat
[2024-06-01 16:36:58] [INFO ] [Real]Absence check using state equation in 386 ms returned sat
[2024-06-01 16:36:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:36:59] [INFO ] [Nat]Absence check using 95 positive place invariants in 20 ms returned sat
[2024-06-01 16:36:59] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 11 ms returned sat
[2024-06-01 16:36:59] [INFO ] [Nat]Absence check using state equation in 406 ms returned sat
[2024-06-01 16:36:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:36:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 118 ms returned sat
[2024-06-01 16:37:00] [INFO ] Deduced a trap composed of 302 places in 438 ms of which 6 ms to minimize.
[2024-06-01 16:37:00] [INFO ] Deduced a trap composed of 298 places in 401 ms of which 5 ms to minimize.
[2024-06-01 16:37:00] [INFO ] Deduced a trap composed of 302 places in 368 ms of which 3 ms to minimize.
[2024-06-01 16:37:01] [INFO ] Deduced a trap composed of 298 places in 388 ms of which 4 ms to minimize.
[2024-06-01 16:37:01] [INFO ] Deduced a trap composed of 302 places in 436 ms of which 5 ms to minimize.
[2024-06-01 16:37:02] [INFO ] Deduced a trap composed of 304 places in 415 ms of which 5 ms to minimize.
[2024-06-01 16:37:02] [INFO ] Deduced a trap composed of 294 places in 362 ms of which 3 ms to minimize.
[2024-06-01 16:37:03] [INFO ] Deduced a trap composed of 298 places in 397 ms of which 5 ms to minimize.
[2024-06-01 16:37:03] [INFO ] Deduced a trap composed of 298 places in 356 ms of which 4 ms to minimize.
[2024-06-01 16:37:04] [INFO ] Deduced a trap composed of 294 places in 398 ms of which 5 ms to minimize.
[2024-06-01 16:37:04] [INFO ] Deduced a trap composed of 305 places in 353 ms of which 4 ms to minimize.
[2024-06-01 16:37:04] [INFO ] Deduced a trap composed of 294 places in 371 ms of which 4 ms to minimize.
[2024-06-01 16:37:05] [INFO ] Deduced a trap composed of 302 places in 372 ms of which 4 ms to minimize.
[2024-06-01 16:37:05] [INFO ] Deduced a trap composed of 300 places in 384 ms of which 5 ms to minimize.
[2024-06-01 16:37:06] [INFO ] Deduced a trap composed of 300 places in 332 ms of which 3 ms to minimize.
[2024-06-01 16:37:06] [INFO ] Deduced a trap composed of 298 places in 357 ms of which 5 ms to minimize.
[2024-06-01 16:37:07] [INFO ] Deduced a trap composed of 308 places in 381 ms of which 5 ms to minimize.
[2024-06-01 16:37:07] [INFO ] Deduced a trap composed of 302 places in 406 ms of which 5 ms to minimize.
[2024-06-01 16:37:07] [INFO ] Deduced a trap composed of 298 places in 402 ms of which 5 ms to minimize.
[2024-06-01 16:37:08] [INFO ] Deduced a trap composed of 306 places in 436 ms of which 5 ms to minimize.
[2024-06-01 16:37:09] [INFO ] Deduced a trap composed of 298 places in 445 ms of which 5 ms to minimize.
[2024-06-01 16:37:09] [INFO ] Deduced a trap composed of 310 places in 460 ms of which 5 ms to minimize.
[2024-06-01 16:37:10] [INFO ] Deduced a trap composed of 298 places in 462 ms of which 5 ms to minimize.
[2024-06-01 16:37:11] [INFO ] Deduced a trap composed of 292 places in 416 ms of which 4 ms to minimize.
[2024-06-01 16:37:11] [INFO ] Deduced a trap composed of 294 places in 418 ms of which 3 ms to minimize.
[2024-06-01 16:37:12] [INFO ] Deduced a trap composed of 294 places in 462 ms of which 5 ms to minimize.
[2024-06-01 16:37:13] [INFO ] Deduced a trap composed of 300 places in 386 ms of which 3 ms to minimize.
[2024-06-01 16:37:13] [INFO ] Deduced a trap composed of 301 places in 453 ms of which 5 ms to minimize.
[2024-06-01 16:37:14] [INFO ] Deduced a trap composed of 288 places in 404 ms of which 6 ms to minimize.
[2024-06-01 16:37:15] [INFO ] Deduced a trap composed of 308 places in 426 ms of which 5 ms to minimize.
[2024-06-01 16:37:15] [INFO ] Deduced a trap composed of 291 places in 438 ms of which 5 ms to minimize.
[2024-06-01 16:37:16] [INFO ] Deduced a trap composed of 306 places in 445 ms of which 5 ms to minimize.
[2024-06-01 16:37:16] [INFO ] Deduced a trap composed of 297 places in 452 ms of which 5 ms to minimize.
[2024-06-01 16:37:21] [INFO ] Trap strengthening (SAT) tested/added 33/33 trap constraints in 21662 ms
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[4]
Support contains 1 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1578/1578 transitions.
Applied a total of 0 rules in 49 ms. Remains 750 /750 variables (removed 0) and now considering 1578/1578 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 750/750 places, 1578/1578 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1578/1578 transitions.
Applied a total of 0 rules in 41 ms. Remains 750 /750 variables (removed 0) and now considering 1578/1578 (removed 0) transitions.
[2024-06-01 16:37:21] [INFO ] Flow matrix only has 1569 transitions (discarded 9 similar events)
[2024-06-01 16:37:21] [INFO ] Invariant cache hit.
[2024-06-01 16:37:22] [INFO ] Implicit Places using invariants in 669 ms returned []
[2024-06-01 16:37:22] [INFO ] Flow matrix only has 1569 transitions (discarded 9 similar events)
[2024-06-01 16:37:22] [INFO ] Invariant cache hit.
[2024-06-01 16:37:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:37:25] [INFO ] Implicit Places using invariants and state equation in 3798 ms returned []
Implicit Place search using SMT with State Equation took 4468 ms to find 0 implicit places.
[2024-06-01 16:37:25] [INFO ] Redundant transitions in 47 ms returned []
Running 1567 sub problems to find dead transitions.
[2024-06-01 16:37:25] [INFO ] Flow matrix only has 1569 transitions (discarded 9 similar events)
[2024-06-01 16:37:25] [INFO ] Invariant cache hit.
[2024-06-01 16:37:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/740 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/740 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
[2024-06-01 16:37:48] [INFO ] Deduced a trap composed of 191 places in 328 ms of which 5 ms to minimize.
[2024-06-01 16:37:49] [INFO ] Deduced a trap composed of 196 places in 309 ms of which 5 ms to minimize.
[2024-06-01 16:37:49] [INFO ] Deduced a trap composed of 196 places in 266 ms of which 4 ms to minimize.
[2024-06-01 16:37:49] [INFO ] Deduced a trap composed of 201 places in 264 ms of which 4 ms to minimize.
[2024-06-01 16:37:49] [INFO ] Deduced a trap composed of 201 places in 267 ms of which 4 ms to minimize.
[2024-06-01 16:37:50] [INFO ] Deduced a trap composed of 302 places in 247 ms of which 4 ms to minimize.
[2024-06-01 16:37:50] [INFO ] Deduced a trap composed of 236 places in 243 ms of which 4 ms to minimize.
[2024-06-01 16:37:50] [INFO ] Deduced a trap composed of 186 places in 262 ms of which 6 ms to minimize.
[2024-06-01 16:37:51] [INFO ] Deduced a trap composed of 226 places in 278 ms of which 4 ms to minimize.
[2024-06-01 16:37:51] [INFO ] Deduced a trap composed of 231 places in 230 ms of which 4 ms to minimize.
[2024-06-01 16:37:51] [INFO ] Deduced a trap composed of 221 places in 229 ms of which 4 ms to minimize.
[2024-06-01 16:37:51] [INFO ] Deduced a trap composed of 216 places in 229 ms of which 4 ms to minimize.
[2024-06-01 16:37:51] [INFO ] Deduced a trap composed of 196 places in 228 ms of which 4 ms to minimize.
[2024-06-01 16:37:52] [INFO ] Deduced a trap composed of 211 places in 231 ms of which 3 ms to minimize.
[2024-06-01 16:37:52] [INFO ] Deduced a trap composed of 206 places in 226 ms of which 4 ms to minimize.
[2024-06-01 16:37:52] [INFO ] Deduced a trap composed of 216 places in 250 ms of which 3 ms to minimize.
[2024-06-01 16:37:53] [INFO ] Deduced a trap composed of 201 places in 245 ms of which 3 ms to minimize.
[2024-06-01 16:37:53] [INFO ] Deduced a trap composed of 196 places in 235 ms of which 4 ms to minimize.
[2024-06-01 16:37:53] [INFO ] Deduced a trap composed of 206 places in 220 ms of which 4 ms to minimize.
[2024-06-01 16:37:53] [INFO ] Deduced a trap composed of 196 places in 229 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/740 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
[2024-06-01 16:37:56] [INFO ] Deduced a trap composed of 236 places in 319 ms of which 4 ms to minimize.
[2024-06-01 16:37:56] [INFO ] Deduced a trap composed of 236 places in 257 ms of which 4 ms to minimize.
[2024-06-01 16:37:57] [INFO ] Deduced a trap composed of 236 places in 298 ms of which 5 ms to minimize.
[2024-06-01 16:37:57] [INFO ] Deduced a trap composed of 241 places in 289 ms of which 5 ms to minimize.
[2024-06-01 16:37:57] [INFO ] Deduced a trap composed of 236 places in 253 ms of which 4 ms to minimize.
[2024-06-01 16:37:58] [INFO ] Deduced a trap composed of 236 places in 238 ms of which 4 ms to minimize.
[2024-06-01 16:37:58] [INFO ] Deduced a trap composed of 231 places in 247 ms of which 4 ms to minimize.
[2024-06-01 16:37:58] [INFO ] Deduced a trap composed of 206 places in 245 ms of which 4 ms to minimize.
[2024-06-01 16:37:58] [INFO ] Deduced a trap composed of 211 places in 240 ms of which 4 ms to minimize.
[2024-06-01 16:37:59] [INFO ] Deduced a trap composed of 201 places in 239 ms of which 3 ms to minimize.
[2024-06-01 16:37:59] [INFO ] Deduced a trap composed of 201 places in 261 ms of which 4 ms to minimize.
[2024-06-01 16:37:59] [INFO ] Deduced a trap composed of 216 places in 240 ms of which 4 ms to minimize.
[2024-06-01 16:37:59] [INFO ] Deduced a trap composed of 201 places in 241 ms of which 4 ms to minimize.
[2024-06-01 16:38:00] [INFO ] Deduced a trap composed of 196 places in 234 ms of which 3 ms to minimize.
[2024-06-01 16:38:00] [INFO ] Deduced a trap composed of 298 places in 252 ms of which 3 ms to minimize.
[2024-06-01 16:38:00] [INFO ] Deduced a trap composed of 302 places in 229 ms of which 3 ms to minimize.
[2024-06-01 16:38:00] [INFO ] Deduced a trap composed of 151 places in 229 ms of which 4 ms to minimize.
[2024-06-01 16:38:01] [INFO ] Deduced a trap composed of 300 places in 248 ms of which 4 ms to minimize.
[2024-06-01 16:38:01] [INFO ] Deduced a trap composed of 302 places in 231 ms of which 4 ms to minimize.
[2024-06-01 16:38:01] [INFO ] Deduced a trap composed of 300 places in 233 ms of which 4 ms to minimize.
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 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 1.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 (/ 1.0 3.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 (/ 1.0 3.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 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 (/ 1.0 3.0))
(s210 1.0)
(s211 0.0)
(s212 1.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 4.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 9.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 1.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 0.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 0.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 0.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 1.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.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 1.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 1.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 (/ 2.0 3.0))
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/740 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 740/2319 variables, and 132 constraints, problems are : Problem set: 0 solved, 1567 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 86/95 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/750 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1567/1567 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1567 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/740 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/740 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/740 variables, 40/132 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
[2024-06-01 16:38:07] [INFO ] Deduced a trap composed of 282 places in 269 ms of which 4 ms to minimize.
[2024-06-01 16:38:07] [INFO ] Deduced a trap composed of 216 places in 226 ms of which 3 ms to minimize.
[2024-06-01 16:38:07] [INFO ] Deduced a trap composed of 211 places in 293 ms of which 3 ms to minimize.
[2024-06-01 16:38:08] [INFO ] Deduced a trap composed of 221 places in 270 ms of which 3 ms to minimize.
[2024-06-01 16:38:08] [INFO ] Deduced a trap composed of 211 places in 254 ms of which 4 ms to minimize.
[2024-06-01 16:38:08] [INFO ] Deduced a trap composed of 211 places in 245 ms of which 3 ms to minimize.
[2024-06-01 16:38:08] [INFO ] Deduced a trap composed of 226 places in 263 ms of which 5 ms to minimize.
[2024-06-01 16:38:09] [INFO ] Deduced a trap composed of 196 places in 263 ms of which 5 ms to minimize.
[2024-06-01 16:38:09] [INFO ] Deduced a trap composed of 186 places in 253 ms of which 3 ms to minimize.
[2024-06-01 16:38:09] [INFO ] Deduced a trap composed of 196 places in 251 ms of which 3 ms to minimize.
[2024-06-01 16:38:09] [INFO ] Deduced a trap composed of 196 places in 235 ms of which 3 ms to minimize.
[2024-06-01 16:38:10] [INFO ] Deduced a trap composed of 186 places in 275 ms of which 4 ms to minimize.
[2024-06-01 16:38:10] [INFO ] Deduced a trap composed of 201 places in 309 ms of which 4 ms to minimize.
[2024-06-01 16:38:10] [INFO ] Deduced a trap composed of 196 places in 247 ms of which 4 ms to minimize.
[2024-06-01 16:38:11] [INFO ] Deduced a trap composed of 181 places in 254 ms of which 4 ms to minimize.
[2024-06-01 16:38:11] [INFO ] Deduced a trap composed of 211 places in 242 ms of which 3 ms to minimize.
[2024-06-01 16:38:11] [INFO ] Deduced a trap composed of 206 places in 255 ms of which 3 ms to minimize.
[2024-06-01 16:38:11] [INFO ] Deduced a trap composed of 216 places in 229 ms of which 4 ms to minimize.
[2024-06-01 16:38:12] [INFO ] Deduced a trap composed of 216 places in 283 ms of which 5 ms to minimize.
[2024-06-01 16:38:12] [INFO ] Deduced a trap composed of 201 places in 238 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/740 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
[2024-06-01 16:38:14] [INFO ] Deduced a trap composed of 18 places in 244 ms of which 1 ms to minimize.
[2024-06-01 16:38:15] [INFO ] Deduced a trap composed of 226 places in 384 ms of which 5 ms to minimize.
[2024-06-01 16:38:16] [INFO ] Deduced a trap composed of 191 places in 342 ms of which 4 ms to minimize.
[2024-06-01 16:38:16] [INFO ] Deduced a trap composed of 221 places in 386 ms of which 5 ms to minimize.
[2024-06-01 16:38:16] [INFO ] Deduced a trap composed of 181 places in 351 ms of which 4 ms to minimize.
[2024-06-01 16:38:17] [INFO ] Deduced a trap composed of 196 places in 345 ms of which 4 ms to minimize.
[2024-06-01 16:38:17] [INFO ] Deduced a trap composed of 210 places in 387 ms of which 5 ms to minimize.
[2024-06-01 16:38:18] [INFO ] Deduced a trap composed of 186 places in 281 ms of which 4 ms to minimize.
[2024-06-01 16:38:18] [INFO ] Deduced a trap composed of 191 places in 364 ms of which 5 ms to minimize.
[2024-06-01 16:38:18] [INFO ] Deduced a trap composed of 186 places in 376 ms of which 5 ms to minimize.
[2024-06-01 16:38:19] [INFO ] Deduced a trap composed of 191 places in 349 ms of which 4 ms to minimize.
[2024-06-01 16:38:19] [INFO ] Deduced a trap composed of 190 places in 353 ms of which 4 ms to minimize.
[2024-06-01 16:38:20] [INFO ] Deduced a trap composed of 201 places in 360 ms of which 4 ms to minimize.
[2024-06-01 16:38:20] [INFO ] Deduced a trap composed of 206 places in 346 ms of which 4 ms to minimize.
[2024-06-01 16:38:20] [INFO ] Deduced a trap composed of 236 places in 287 ms of which 3 ms to minimize.
[2024-06-01 16:38:21] [INFO ] Deduced a trap composed of 231 places in 348 ms of which 5 ms to minimize.
[2024-06-01 16:38:21] [INFO ] Deduced a trap composed of 201 places in 349 ms of which 3 ms to minimize.
[2024-06-01 16:38:21] [INFO ] Deduced a trap composed of 181 places in 357 ms of which 4 ms to minimize.
[2024-06-01 16:38:22] [INFO ] Deduced a trap composed of 300 places in 425 ms of which 5 ms to minimize.
[2024-06-01 16:38:22] [INFO ] Deduced a trap composed of 220 places in 369 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/740 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
[2024-06-01 16:38:23] [INFO ] Deduced a trap composed of 206 places in 219 ms of which 3 ms to minimize.
[2024-06-01 16:38:23] [INFO ] Deduced a trap composed of 206 places in 225 ms of which 3 ms to minimize.
[2024-06-01 16:38:24] [INFO ] Deduced a trap composed of 304 places in 250 ms of which 3 ms to minimize.
[2024-06-01 16:38:24] [INFO ] Deduced a trap composed of 206 places in 254 ms of which 11 ms to minimize.
[2024-06-01 16:38:24] [INFO ] Deduced a trap composed of 292 places in 243 ms of which 4 ms to minimize.
[2024-06-01 16:38:24] [INFO ] Deduced a trap composed of 186 places in 219 ms of which 3 ms to minimize.
[2024-06-01 16:38:25] [INFO ] Deduced a trap composed of 181 places in 270 ms of which 5 ms to minimize.
[2024-06-01 16:38:25] [INFO ] Deduced a trap composed of 186 places in 261 ms of which 3 ms to minimize.
[2024-06-01 16:38:25] [INFO ] Deduced a trap composed of 308 places in 244 ms of which 3 ms to minimize.
[2024-06-01 16:38:26] [INFO ] Deduced a trap composed of 201 places in 216 ms of which 4 ms to minimize.
[2024-06-01 16:38:26] [INFO ] Deduced a trap composed of 211 places in 234 ms of which 3 ms to minimize.
[2024-06-01 16:38:26] [INFO ] Deduced a trap composed of 201 places in 227 ms of which 3 ms to minimize.
[2024-06-01 16:38:26] [INFO ] Deduced a trap composed of 211 places in 217 ms of which 3 ms to minimize.
[2024-06-01 16:38:27] [INFO ] Deduced a trap composed of 191 places in 231 ms of which 3 ms to minimize.
[2024-06-01 16:38:27] [INFO ] Deduced a trap composed of 191 places in 228 ms of which 3 ms to minimize.
[2024-06-01 16:38:27] [INFO ] Deduced a trap composed of 226 places in 229 ms of which 4 ms to minimize.
[2024-06-01 16:38:27] [INFO ] Deduced a trap composed of 231 places in 252 ms of which 3 ms to minimize.
[2024-06-01 16:38:28] [INFO ] Deduced a trap composed of 231 places in 228 ms of which 4 ms to minimize.
[2024-06-01 16:38:28] [INFO ] Deduced a trap composed of 310 places in 213 ms of which 4 ms to minimize.
[2024-06-01 16:38:28] [INFO ] Deduced a trap composed of 231 places in 210 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/740 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1567 unsolved
[2024-06-01 16:38:29] [INFO ] Deduced a trap composed of 288 places in 211 ms of which 3 ms to minimize.
[2024-06-01 16:38:29] [INFO ] Deduced a trap composed of 315 places in 223 ms of which 3 ms to minimize.
[2024-06-01 16:38:29] [INFO ] Deduced a trap composed of 315 places in 229 ms of which 3 ms to minimize.
[2024-06-01 16:38:30] [INFO ] Deduced a trap composed of 315 places in 227 ms of which 3 ms to minimize.
[2024-06-01 16:38:30] [INFO ] Deduced a trap composed of 300 places in 231 ms of which 4 ms to minimize.
[2024-06-01 16:38:30] [INFO ] Deduced a trap composed of 303 places in 273 ms of which 3 ms to minimize.
[2024-06-01 16:38:30] [INFO ] Deduced a trap composed of 306 places in 214 ms of which 3 ms to minimize.
[2024-06-01 16:38:31] [INFO ] Deduced a trap composed of 309 places in 256 ms of which 4 ms to minimize.
[2024-06-01 16:38:31] [INFO ] Deduced a trap composed of 306 places in 218 ms of which 3 ms to minimize.
[2024-06-01 16:38:31] [INFO ] Deduced a trap composed of 309 places in 218 ms of which 4 ms to minimize.
[2024-06-01 16:38:31] [INFO ] Deduced a trap composed of 309 places in 214 ms of which 4 ms to minimize.
[2024-06-01 16:38:32] [INFO ] Deduced a trap composed of 312 places in 214 ms of which 4 ms to minimize.
[2024-06-01 16:38:32] [INFO ] Deduced a trap composed of 315 places in 220 ms of which 4 ms to minimize.
[2024-06-01 16:38:32] [INFO ] Deduced a trap composed of 312 places in 218 ms of which 3 ms to minimize.
[2024-06-01 16:38:32] [INFO ] Deduced a trap composed of 312 places in 245 ms of which 4 ms to minimize.
[2024-06-01 16:38:33] [INFO ] Deduced a trap composed of 306 places in 216 ms of which 3 ms to minimize.
[2024-06-01 16:38:33] [INFO ] Deduced a trap composed of 306 places in 212 ms of which 4 ms to minimize.
[2024-06-01 16:38:33] [INFO ] Deduced a trap composed of 309 places in 239 ms of which 5 ms to minimize.
SMT process timed out in 67708ms, After SMT, problems are : Problem set: 0 solved, 1567 unsolved
Search for dead transitions found 0 dead transitions in 67733ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72298 ms. Remains : 750/750 places, 1578/1578 transitions.
RANDOM walk for 40000 steps (2926 resets) in 488 ms. (81 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (329 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (326 resets) in 88 ms. (449 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 354757 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :0 out of 2
Probabilistic random walk after 354757 steps, saw 57340 distinct states, run finished after 3002 ms. (steps per millisecond=118 ) properties seen :0
[2024-06-01 16:38:36] [INFO ] Flow matrix only has 1569 transitions (discarded 9 similar events)
[2024-06-01 16:38:36] [INFO ] Invariant cache hit.
[2024-06-01 16:38:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 137/146 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 593/739 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/739 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/740 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/740 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/748 variables, 5/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/748 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/749 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/749 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1569/2318 variables, 749/851 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2318 variables, 1/852 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2318 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/2319 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2319 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/2319 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2319/2319 variables, and 853 constraints, problems are : Problem set: 0 solved, 2 unsolved in 742 ms.
Refiners :[Positive P Invariants (semi-flows): 95/95 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 750/750 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 137/146 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 593/739 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/739 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/740 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/740 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/748 variables, 5/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/748 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/749 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/749 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1569/2318 variables, 749/851 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2318 variables, 1/852 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 16:38:38] [INFO ] Deduced a trap composed of 294 places in 447 ms of which 7 ms to minimize.
[2024-06-01 16:38:39] [INFO ] Deduced a trap composed of 296 places in 400 ms of which 5 ms to minimize.
[2024-06-01 16:38:39] [INFO ] Deduced a trap composed of 292 places in 420 ms of which 5 ms to minimize.
[2024-06-01 16:38:40] [INFO ] Deduced a trap composed of 309 places in 367 ms of which 4 ms to minimize.
[2024-06-01 16:38:40] [INFO ] Deduced a trap composed of 304 places in 381 ms of which 5 ms to minimize.
[2024-06-01 16:38:40] [INFO ] Deduced a trap composed of 305 places in 343 ms of which 4 ms to minimize.
[2024-06-01 16:38:41] [INFO ] Deduced a trap composed of 298 places in 310 ms of which 4 ms to minimize.
[2024-06-01 16:38:41] [INFO ] Deduced a trap composed of 292 places in 357 ms of which 5 ms to minimize.
[2024-06-01 16:38:42] [INFO ] Deduced a trap composed of 300 places in 345 ms of which 5 ms to minimize.
[2024-06-01 16:38:42] [INFO ] Deduced a trap composed of 294 places in 287 ms of which 4 ms to minimize.
[2024-06-01 16:38:42] [INFO ] Deduced a trap composed of 302 places in 294 ms of which 3 ms to minimize.
SMT process timed out in 5953ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1578/1578 transitions.
Applied a total of 0 rules in 27 ms. Remains 750 /750 variables (removed 0) and now considering 1578/1578 (removed 0) transitions.
Running 1567 sub problems to find dead transitions.
[2024-06-01 16:38:42] [INFO ] Flow matrix only has 1569 transitions (discarded 9 similar events)
[2024-06-01 16:38:42] [INFO ] Invariant cache hit.
[2024-06-01 16:38:42] [INFO ] State equation strengthened by 1 read => feed constraints.
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : PolyORBNT-COL-S10J40-UpperBounds-00
Could not compute solution for formula : PolyORBNT-COL-S10J40-UpperBounds-01
Could not compute solution for formula : PolyORBNT-COL-S10J40-UpperBounds-02
Could not compute solution for formula : PolyORBNT-COL-S10J40-UpperBounds-03
Could not compute solution for formula : PolyORBNT-COL-S10J40-UpperBounds-04
Could not compute solution for formula : PolyORBNT-COL-S10J40-UpperBounds-05
Could not compute solution for formula : PolyORBNT-COL-S10J40-UpperBounds-06
Could not compute solution for formula : PolyORBNT-COL-S10J40-UpperBounds-07
Could not compute solution for formula : PolyORBNT-COL-S10J40-UpperBounds-08
Could not compute solution for formula : PolyORBNT-COL-S10J40-UpperBounds-09
Could not compute solution for formula : PolyORBNT-COL-S10J40-UpperBounds-10
Could not compute solution for formula : PolyORBNT-COL-S10J40-UpperBounds-11
Could not compute solution for formula : PolyORBNT-COL-S10J40-UpperBounds-12
Could not compute solution for formula : PolyORBNT-COL-S10J40-UpperBounds-13
Could not compute solution for formula : PolyORBNT-COL-S10J40-UpperBounds-14
Could not compute solution for formula : PolyORBNT-COL-S10J40-UpperBounds-15
BK_STOP 1717259929389
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name PolyORBNT-COL-S10J40-UpperBounds-00
ub formula formula --maxsum=/tmp/2739/ub_0_
ub formula name PolyORBNT-COL-S10J40-UpperBounds-01
ub formula formula --maxsum=/tmp/2739/ub_1_
ub formula name PolyORBNT-COL-S10J40-UpperBounds-02
ub formula formula --maxsum=/tmp/2739/ub_2_
ub formula name PolyORBNT-COL-S10J40-UpperBounds-03
ub formula formula --maxsum=/tmp/2739/ub_3_
ub formula name PolyORBNT-COL-S10J40-UpperBounds-04
ub formula formula --maxsum=/tmp/2739/ub_4_
ub formula name PolyORBNT-COL-S10J40-UpperBounds-05
ub formula formula --maxsum=/tmp/2739/ub_5_
ub formula name PolyORBNT-COL-S10J40-UpperBounds-06
ub formula formula --maxsum=/tmp/2739/ub_6_
ub formula name PolyORBNT-COL-S10J40-UpperBounds-07
ub formula formula --maxsum=/tmp/2739/ub_7_
ub formula name PolyORBNT-COL-S10J40-UpperBounds-08
ub formula formula --maxsum=/tmp/2739/ub_8_
ub formula name PolyORBNT-COL-S10J40-UpperBounds-09
ub formula formula --maxsum=/tmp/2739/ub_9_
ub formula name PolyORBNT-COL-S10J40-UpperBounds-10
ub formula formula --maxsum=/tmp/2739/ub_10_
ub formula name PolyORBNT-COL-S10J40-UpperBounds-11
ub formula formula --maxsum=/tmp/2739/ub_11_
ub formula name PolyORBNT-COL-S10J40-UpperBounds-12
ub formula formula --maxsum=/tmp/2739/ub_12_
ub formula name PolyORBNT-COL-S10J40-UpperBounds-13
ub formula formula --maxsum=/tmp/2739/ub_13_
ub formula name PolyORBNT-COL-S10J40-UpperBounds-14
ub formula formula --maxsum=/tmp/2739/ub_14_
ub formula name PolyORBNT-COL-S10J40-UpperBounds-15
ub formula formula --maxsum=/tmp/2739/ub_15_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-COL-S10J40"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is PolyORBNT-COL-S10J40, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r516-tajo-171654447100421"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J40.tgz
mv PolyORBNT-COL-S10J40 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;