About the Execution of GreatSPN+red for LamportFastMutEx-COL-4
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 493.855 | 246870.00 | 305368.00 | 869.50 | 1 3 4 3 3 4 3 12 1 3 4 4 1 4 4 4 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r223-tall-171649611000221.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is LamportFastMutEx-COL-4, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-171649611000221
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 6.8K Apr 13 07:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 13 07:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 13 07:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 13 07:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 07:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 13 07:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 07:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 13 07:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 40K May 18 16:42 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 LamportFastMutEx-COL-4-UpperBounds-00
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-01
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-02
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-03
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-04
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-05
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-06
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-07
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-08
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-09
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-10
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-11
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-12
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-13
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-14
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716523569080
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-4
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 04:06:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-24 04:06:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 04:06:10] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-24 04:06:10] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-24 04:06:10] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 584 ms
[2024-05-24 04:06:10] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 135 PT places and 285.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2024-05-24 04:06:10] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 4 ms.
[2024-05-24 04:06:10] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
// Phase 1: matrix 17 rows 15 cols
[2024-05-24 04:06:10] [INFO ] Computed 2 invariants in 5 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 4, 0, 0, 4, 0, 0] Max Struct:[1, 4, 4, 4, 4, 4, 4, 16, 1, 4, 4, 4, 4, 4, 4, 4]
FORMULA LamportFastMutEx-COL-4-UpperBounds-13 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-4-UpperBounds-10 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-4-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-4-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-24 04:06:10] [INFO ] Invariant cache hit.
[2024-05-24 04:06:11] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-24 04:06:11] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-24 04:06:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 04:06:11] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 04:06:11] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-24 04:06:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:06:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 04:06:11] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-24 04:06:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 04:06:11] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-24 04:06:11] [INFO ] Added : 7 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 7 ms.
[2024-05-24 04:06:11] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 04:06:11] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-24 04:06:11] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 04:06:11] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 04:06:11] [INFO ] Added : 4 causal constraints over 1 iterations in 23 ms. Result :sat
Minimization took 6 ms.
[2024-05-24 04:06:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:06:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 04:06:11] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-24 04:06:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 04:06:11] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 04:06:11] [INFO ] Added : 4 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 12 ms.
[2024-05-24 04:06:11] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-24 04:06:11] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-24 04:06:11] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 04:06:11] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-24 04:06:11] [INFO ] Added : 5 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 6 ms.
[2024-05-24 04:06:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:06:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 04:06:11] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-24 04:06:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 04:06:11] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 04:06:11] [INFO ] Added : 5 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2024-05-24 04:06:11] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 04:06:11] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-24 04:06:11] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 04:06:11] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 04:06:11] [INFO ] Added : 6 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 5 ms.
[2024-05-24 04:06:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:06:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 04:06:11] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-24 04:06:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 04:06:11] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 04:06:11] [INFO ] Added : 6 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 4 ms.
[2024-05-24 04:06:11] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 04:06:11] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-24 04:06:11] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 04:06:11] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 04:06:11] [INFO ] Added : 4 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 3 ms.
[2024-05-24 04:06:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:06:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-24 04:06:11] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-24 04:06:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 04:06:11] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 04:06:11] [INFO ] Added : 4 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2024-05-24 04:06:11] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 04:06:11] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-24 04:06:11] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-24 04:06:11] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 04:06:11] [INFO ] Added : 9 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 5 ms.
[2024-05-24 04:06:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:06:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 04:06:11] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-24 04:06:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 04:06:11] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-24 04:06:11] [INFO ] Added : 9 causal constraints over 2 iterations in 14 ms. Result :sat
Minimization took 5 ms.
[2024-05-24 04:06:11] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-24 04:06:11] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-24 04:06:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:06:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 04:06:11] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-24 04:06:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 04:06:11] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 04:06:11] [INFO ] Added : 11 causal constraints over 3 iterations in 10 ms. Result :sat
Minimization took 5 ms.
[2024-05-24 04:06:11] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 04:06:11] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-24 04:06:11] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 04:06:11] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 04:06:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:06:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 04:06:11] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-24 04:06:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 04:06:11] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 04:06:11] [INFO ] Added : 6 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 4 ms.
[2024-05-24 04:06:11] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 04:06:11] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-24 04:06:11] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 04:06:11] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 04:06:11] [INFO ] Added : 4 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2024-05-24 04:06:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:06:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 04:06:12] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-24 04:06:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 04:06:12] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 04:06:12] [INFO ] Added : 4 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
[2024-05-24 04:06:12] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 04:06:12] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-24 04:06:12] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 04:06:12] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 04:06:12] [INFO ] Added : 4 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2024-05-24 04:06:12] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 04:06:12] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-24 04:06:12] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 04:06:12] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 04:06:12] [INFO ] Added : 4 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 5 ms.
[2024-05-24 04:06:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:06:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 04:06:12] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-24 04:06:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 04:06:12] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 04:06:12] [INFO ] Added : 4 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
[2024-05-24 04:06:12] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 04:06:12] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-24 04:06:12] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 04:06:12] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 04:06:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:06:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 04:06:12] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-24 04:06:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 04:06:12] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 04:06:12] [INFO ] Added : 5 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[4, 4, 4, 4, 4, 4, 16, 4, 4, 4, 4, 4]
Domain [pid(5), pid(5)] of place P_wait breaks symmetries in sort pid
Symmetric sort wr.t. initial and guards and successors and join/free detected :P_bool
Arc [3:1*[$i, 1]] contains constants of sort P_bool
Transition T_setbi_2 : constants on arcs in [[3:1*[$i, 1]]] introduces in P_bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-24 04:06:12] [INFO ] Unfolded HLPN to a Petri net with 135 places and 230 transitions 990 arcs in 26 ms.
[2024-05-24 04:06:12] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 50 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[4, 4, 4, 4, 4, 4, 16, 4, 4, 4, 4, 4]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[4, 4, 4, 4, 4, 4, 16, 4, 4, 4, 4, 4]
[2024-05-24 04:06:12] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
// Phase 1: matrix 144 rows 102 cols
[2024-05-24 04:06:12] [INFO ] Computed 26 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[4, 4, 4, 4, 4, 4, 16, 4, 4, 4, 4, 4]
RANDOM walk for 10000 steps (2 resets) in 45 ms. (217 steps per ms)
FORMULA LamportFastMutEx-COL-4-UpperBounds-11 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-COL-4-UpperBounds-05 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-COL-4-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90007 steps (18 resets) in 122 ms. (731 steps per ms)
FORMULA LamportFastMutEx-COL-4-UpperBounds-15 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[3, 3, 3, 3, 12, 3, 1, 3] Max Struct:[4, 4, 4, 4, 16, 4, 4, 4]
[2024-05-24 04:06:12] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2024-05-24 04:06:12] [INFO ] Invariant cache hit.
[2024-05-24 04:06:12] [INFO ] [Real]Absence check using 26 positive place invariants in 5 ms returned sat
[2024-05-24 04:06:12] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-24 04:06:12] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-24 04:06:12] [INFO ] [Real]Added 40 Read/Feed constraints in 5 ms returned sat
[2024-05-24 04:06:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:06:12] [INFO ] [Nat]Absence check using 26 positive place invariants in 14 ms returned sat
[2024-05-24 04:06:12] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-24 04:06:12] [INFO ] [Nat]Added 40 Read/Feed constraints in 7 ms returned sat
[2024-05-24 04:06:12] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 11 ms to minimize.
[2024-05-24 04:06:12] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:06:12] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-24 04:06:12] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-24 04:06:12] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-24 04:06:12] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-24 04:06:13] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2024-05-24 04:06:13] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:06:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 425 ms
[2024-05-24 04:06:13] [INFO ] [Real]Absence check using 26 positive place invariants in 5 ms returned sat
[2024-05-24 04:06:13] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-24 04:06:13] [INFO ] [Real]Added 40 Read/Feed constraints in 3 ms returned sat
[2024-05-24 04:06:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:06:13] [INFO ] [Nat]Absence check using 26 positive place invariants in 5 ms returned sat
[2024-05-24 04:06:13] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-24 04:06:13] [INFO ] [Nat]Added 40 Read/Feed constraints in 7 ms returned sat
[2024-05-24 04:06:13] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-24 04:06:13] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-24 04:06:13] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 0 ms to minimize.
[2024-05-24 04:06:13] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-24 04:06:13] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 4 ms to minimize.
[2024-05-24 04:06:13] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-24 04:06:13] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-24 04:06:13] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 6 ms to minimize.
[2024-05-24 04:06:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 358 ms
[2024-05-24 04:06:13] [INFO ] [Real]Absence check using 26 positive place invariants in 7 ms returned sat
[2024-05-24 04:06:13] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-24 04:06:13] [INFO ] [Real]Added 40 Read/Feed constraints in 3 ms returned sat
[2024-05-24 04:06:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:06:13] [INFO ] [Nat]Absence check using 26 positive place invariants in 5 ms returned sat
[2024-05-24 04:06:13] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-24 04:06:13] [INFO ] [Nat]Added 40 Read/Feed constraints in 7 ms returned sat
[2024-05-24 04:06:13] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-24 04:06:13] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-24 04:06:13] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2024-05-24 04:06:13] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-05-24 04:06:13] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-24 04:06:13] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-05-24 04:06:13] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-05-24 04:06:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 248 ms
[2024-05-24 04:06:13] [INFO ] [Real]Absence check using 26 positive place invariants in 5 ms returned sat
[2024-05-24 04:06:14] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-24 04:06:14] [INFO ] [Real]Added 40 Read/Feed constraints in 6 ms returned sat
[2024-05-24 04:06:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:06:14] [INFO ] [Nat]Absence check using 26 positive place invariants in 4 ms returned sat
[2024-05-24 04:06:14] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-24 04:06:14] [INFO ] [Nat]Added 40 Read/Feed constraints in 9 ms returned sat
[2024-05-24 04:06:14] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-05-24 04:06:14] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-24 04:06:14] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-24 04:06:14] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-24 04:06:14] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-24 04:06:14] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-24 04:06:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 197 ms
[2024-05-24 04:06:14] [INFO ] [Real]Absence check using 26 positive place invariants in 5 ms returned sat
[2024-05-24 04:06:14] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2024-05-24 04:06:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:06:14] [INFO ] [Nat]Absence check using 26 positive place invariants in 5 ms returned sat
[2024-05-24 04:06:14] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-24 04:06:14] [INFO ] [Nat]Added 40 Read/Feed constraints in 13 ms returned sat
[2024-05-24 04:06:14] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-24 04:06:14] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-24 04:06:14] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-24 04:06:14] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-24 04:06:14] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2024-05-24 04:06:14] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 4 ms to minimize.
[2024-05-24 04:06:14] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-24 04:06:14] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-24 04:06:14] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-05-24 04:06:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 401 ms
[2024-05-24 04:06:14] [INFO ] [Real]Absence check using 26 positive place invariants in 5 ms returned sat
[2024-05-24 04:06:14] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-24 04:06:14] [INFO ] [Real]Added 40 Read/Feed constraints in 5 ms returned sat
[2024-05-24 04:06:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:06:14] [INFO ] [Nat]Absence check using 26 positive place invariants in 4 ms returned sat
[2024-05-24 04:06:15] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-24 04:06:15] [INFO ] [Nat]Added 40 Read/Feed constraints in 8 ms returned sat
[2024-05-24 04:06:15] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-24 04:06:15] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-24 04:06:15] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-24 04:06:15] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-24 04:06:15] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-24 04:06:15] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2024-05-24 04:06:15] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-24 04:06:15] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2024-05-24 04:06:15] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-05-24 04:06:15] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-24 04:06:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 482 ms
[2024-05-24 04:06:15] [INFO ] [Real]Absence check using 26 positive place invariants in 5 ms returned sat
[2024-05-24 04:06:15] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-24 04:06:15] [INFO ] [Real]Added 40 Read/Feed constraints in 3 ms returned sat
[2024-05-24 04:06:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:06:15] [INFO ] [Nat]Absence check using 26 positive place invariants in 5 ms returned sat
[2024-05-24 04:06:15] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-24 04:06:15] [INFO ] [Nat]Added 40 Read/Feed constraints in 6 ms returned sat
[2024-05-24 04:06:15] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-05-24 04:06:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2024-05-24 04:06:15] [INFO ] Computed and/alt/rep : 128/512/128 causal constraints (skipped 12 transitions) in 9 ms.
[2024-05-24 04:06:15] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-24 04:06:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2024-05-24 04:06:15] [INFO ] Added : 59 causal constraints over 12 iterations in 210 ms. Result :sat
Minimization took 64 ms.
[2024-05-24 04:06:16] [INFO ] [Real]Absence check using 26 positive place invariants in 5 ms returned sat
[2024-05-24 04:06:16] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-24 04:06:16] [INFO ] [Real]Added 40 Read/Feed constraints in 4 ms returned sat
[2024-05-24 04:06:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:06:16] [INFO ] [Nat]Absence check using 26 positive place invariants in 4 ms returned sat
[2024-05-24 04:06:16] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-24 04:06:16] [INFO ] [Nat]Added 40 Read/Feed constraints in 10 ms returned sat
[2024-05-24 04:06:16] [INFO ] Computed and/alt/rep : 128/512/128 causal constraints (skipped 12 transitions) in 9 ms.
[2024-05-24 04:06:16] [INFO ] Added : 45 causal constraints over 9 iterations in 124 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 3, 3, 3, 12, 3, 1, 3] Max Struct:[3, 3, 3, 3, 12, 3, 4, 4]
FORMULA LamportFastMutEx-COL-4-UpperBounds-09 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-4-UpperBounds-07 12 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-4-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-4-UpperBounds-04 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-4-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-4-UpperBounds-01 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 3] Max Struct:[4, 4]
Support contains 8 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 180/180 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 98 transition count 176
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 98 transition count 172
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 94 transition count 172
Applied a total of 16 rules in 70 ms. Remains 94 /102 variables (removed 8) and now considering 172/180 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 94/102 places, 172/180 transitions.
[2024-05-24 04:06:16] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
// Phase 1: matrix 136 rows 94 cols
[2024-05-24 04:06:16] [INFO ] Computed 26 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 3] Max Struct:[4, 4]
RANDOM walk for 1000000 steps (2 resets) in 1516 ms. (659 steps per ms)
FORMULA LamportFastMutEx-COL-4-UpperBounds-14 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 553 ms. (1805 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[4]
[2024-05-24 04:06:18] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
[2024-05-24 04:06:18] [INFO ] Invariant cache hit.
[2024-05-24 04:06:18] [INFO ] [Real]Absence check using 26 positive place invariants in 4 ms returned sat
[2024-05-24 04:06:18] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-24 04:06:18] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-24 04:06:18] [INFO ] [Real]Added 40 Read/Feed constraints in 3 ms returned sat
[2024-05-24 04:06:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:06:18] [INFO ] [Nat]Absence check using 26 positive place invariants in 6 ms returned sat
[2024-05-24 04:06:18] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-24 04:06:18] [INFO ] [Nat]Added 40 Read/Feed constraints in 5 ms returned sat
[2024-05-24 04:06:18] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-24 04:06:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2024-05-24 04:06:18] [INFO ] Computed and/alt/rep : 116/496/116 causal constraints (skipped 16 transitions) in 10 ms.
[2024-05-24 04:06:19] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-24 04:06:19] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-24 04:06:19] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-24 04:06:19] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2024-05-24 04:06:19] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 8 ms to minimize.
[2024-05-24 04:06:19] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-24 04:06:19] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 0 ms to minimize.
[2024-05-24 04:06:19] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 0 ms to minimize.
[2024-05-24 04:06:19] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 5 ms to minimize.
[2024-05-24 04:06:19] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 526 ms
[2024-05-24 04:06:19] [INFO ] Added : 53 causal constraints over 11 iterations in 649 ms. Result :sat
Minimization took 72 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[4]
Support contains 4 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 172/172 transitions.
Applied a total of 0 rules in 7 ms. Remains 94 /94 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 94/94 places, 172/172 transitions.
[2024-05-24 04:06:19] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
[2024-05-24 04:06:19] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[4]
RANDOM walk for 1000000 steps (2 resets) in 1356 ms. (736 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 523 ms. (1908 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[4]
[2024-05-24 04:06:21] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
[2024-05-24 04:06:21] [INFO ] Invariant cache hit.
[2024-05-24 04:06:21] [INFO ] [Real]Absence check using 26 positive place invariants in 5 ms returned sat
[2024-05-24 04:06:21] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-24 04:06:21] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-24 04:06:21] [INFO ] [Real]Added 40 Read/Feed constraints in 4 ms returned sat
[2024-05-24 04:06:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:06:21] [INFO ] [Nat]Absence check using 26 positive place invariants in 6 ms returned sat
[2024-05-24 04:06:21] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-24 04:06:21] [INFO ] [Nat]Added 40 Read/Feed constraints in 4 ms returned sat
[2024-05-24 04:06:21] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2024-05-24 04:06:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2024-05-24 04:06:21] [INFO ] Computed and/alt/rep : 116/496/116 causal constraints (skipped 16 transitions) in 8 ms.
[2024-05-24 04:06:21] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
[2024-05-24 04:06:21] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:06:21] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-24 04:06:22] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 0 ms to minimize.
[2024-05-24 04:06:22] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-24 04:06:22] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:06:22] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-24 04:06:22] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-24 04:06:22] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-24 04:06:22] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 553 ms
[2024-05-24 04:06:22] [INFO ] Added : 53 causal constraints over 11 iterations in 684 ms. Result :sat
Minimization took 70 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[4]
Support contains 4 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 172/172 transitions.
Applied a total of 0 rules in 6 ms. Remains 94 /94 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 94/94 places, 172/172 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 172/172 transitions.
Applied a total of 0 rules in 5 ms. Remains 94 /94 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2024-05-24 04:06:22] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
[2024-05-24 04:06:22] [INFO ] Invariant cache hit.
[2024-05-24 04:06:22] [INFO ] Implicit Places using invariants in 119 ms returned [62, 63, 64, 65]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 121 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 90/94 places, 172/172 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 137 ms. Remains : 90/94 places, 172/172 transitions.
[2024-05-24 04:06:22] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
// Phase 1: matrix 136 rows 90 cols
[2024-05-24 04:06:22] [INFO ] Computed 22 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[4]
RANDOM walk for 1000000 steps (2 resets) in 1283 ms. (778 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 507 ms. (1968 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[4]
[2024-05-24 04:06:24] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
[2024-05-24 04:06:24] [INFO ] Invariant cache hit.
[2024-05-24 04:06:24] [INFO ] [Real]Absence check using 22 positive place invariants in 4 ms returned sat
[2024-05-24 04:06:24] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-24 04:06:24] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-24 04:06:24] [INFO ] [Real]Added 24 Read/Feed constraints in 2 ms returned sat
[2024-05-24 04:06:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:06:24] [INFO ] [Nat]Absence check using 22 positive place invariants in 4 ms returned sat
[2024-05-24 04:06:24] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-24 04:06:24] [INFO ] [Nat]Added 24 Read/Feed constraints in 9 ms returned sat
[2024-05-24 04:06:24] [INFO ] Computed and/alt/rep : 120/496/120 causal constraints (skipped 12 transitions) in 11 ms.
[2024-05-24 04:06:24] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-24 04:06:24] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 0 ms to minimize.
[2024-05-24 04:06:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 127 ms
[2024-05-24 04:06:24] [INFO ] Added : 47 causal constraints over 10 iterations in 232 ms. Result :sat
Minimization took 63 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[4]
Support contains 4 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 172/172 transitions.
Applied a total of 0 rules in 6 ms. Remains 90 /90 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 90/90 places, 172/172 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 172/172 transitions.
Applied a total of 0 rules in 6 ms. Remains 90 /90 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2024-05-24 04:06:24] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
[2024-05-24 04:06:24] [INFO ] Invariant cache hit.
[2024-05-24 04:06:24] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-24 04:06:24] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
[2024-05-24 04:06:24] [INFO ] Invariant cache hit.
[2024-05-24 04:06:25] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-24 04:06:25] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2024-05-24 04:06:25] [INFO ] Redundant transitions in 4 ms returned []
Running 168 sub problems to find dead transitions.
[2024-05-24 04:06:25] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
[2024-05-24 04:06:25] [INFO ] Invariant cache hit.
[2024-05-24 04:06:25] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-24 04:06:25] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-24 04:06:25] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-24 04:06:25] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-24 04:06:25] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
[2024-05-24 04:06:25] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2024-05-24 04:06:26] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-24 04:06:26] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-24 04:06:26] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
[2024-05-24 04:06:26] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-05-24 04:06:26] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-05-24 04:06:26] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-24 04:06:26] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-24 04:06:26] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-24 04:06:26] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:06:26] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-05-24 04:06:26] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-05-24 04:06:26] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
Problem TDEAD43 is UNSAT
[2024-05-24 04:06:26] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-05-24 04:06:26] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-05-24 04:06:26] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD148 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 20/42 constraints. Problems are: Problem set: 20 solved, 148 unsolved
[2024-05-24 04:06:26] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
[2024-05-24 04:06:26] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
[2024-05-24 04:06:26] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-24 04:06:26] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-24 04:06:27] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
Problem TDEAD47 is UNSAT
[2024-05-24 04:06:27] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-24 04:06:27] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-24 04:06:27] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:06:27] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 0 ms to minimize.
[2024-05-24 04:06:27] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:06:27] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2024-05-24 04:06:27] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-05-24 04:06:27] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-24 04:06:27] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 0 ms to minimize.
[2024-05-24 04:06:27] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-24 04:06:27] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 0 ms to minimize.
[2024-05-24 04:06:27] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 0 ms to minimize.
[2024-05-24 04:06:27] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
[2024-05-24 04:06:27] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-24 04:06:27] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
Problem TDEAD47 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD150 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 20/62 constraints. Problems are: Problem set: 24 solved, 144 unsolved
[2024-05-24 04:06:27] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-24 04:06:28] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 1 ms to minimize.
[2024-05-24 04:06:28] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 0 ms to minimize.
[2024-05-24 04:06:28] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-24 04:06:28] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-05-24 04:06:28] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-24 04:06:28] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-24 04:06:28] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-24 04:06:28] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-24 04:06:28] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-24 04:06:28] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-24 04:06:28] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-24 04:06:28] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:06:28] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2024-05-24 04:06:28] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-24 04:06:28] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-24 04:06:28] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-24 04:06:28] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-24 04:06:29] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-24 04:06:29] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 20/82 constraints. Problems are: Problem set: 24 solved, 144 unsolved
[2024-05-24 04:06:29] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-24 04:06:29] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2024-05-24 04:06:29] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2024-05-24 04:06:29] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-24 04:06:29] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-24 04:06:29] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-24 04:06:29] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-24 04:06:29] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:06:29] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-24 04:06:30] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-24 04:06:30] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 11/93 constraints. Problems are: Problem set: 24 solved, 144 unsolved
[2024-05-24 04:06:30] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-24 04:06:30] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:06:30] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-05-24 04:06:30] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 4/97 constraints. Problems are: Problem set: 24 solved, 144 unsolved
[2024-05-24 04:06:30] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-24 04:06:30] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-24 04:06:31] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-24 04:06:31] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-24 04:06:31] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-24 04:06:31] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 6/103 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 0/103 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 8 (OVERLAPS) 136/226 variables, 90/193 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 24/217 constraints. Problems are: Problem set: 24 solved, 144 unsolved
[2024-05-24 04:06:32] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 1/218 constraints. Problems are: Problem set: 24 solved, 144 unsolved
[2024-05-24 04:06:33] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-24 04:06:33] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/226 variables, 2/220 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/226 variables, 0/220 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 13 (OVERLAPS) 0/226 variables, 0/220 constraints. Problems are: Problem set: 24 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 226/226 variables, and 220 constraints, problems are : Problem set: 24 solved, 144 unsolved in 10669 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 90/90 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 84/84 constraints]
Escalating to Integer solving :Problem set: 24 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 6/6 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 57/63 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/63 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 4/90 variables, 16/79 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 27/106 constraints. Problems are: Problem set: 24 solved, 144 unsolved
[2024-05-24 04:06:36] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-24 04:06:36] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 2/108 constraints. Problems are: Problem set: 24 solved, 144 unsolved
[2024-05-24 04:06:37] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 3 ms to minimize.
[2024-05-24 04:06:37] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 2/110 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 0/110 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 8 (OVERLAPS) 136/226 variables, 90/200 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 24/224 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 144/368 constraints. Problems are: Problem set: 24 solved, 144 unsolved
[2024-05-24 04:06:39] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-24 04:06:39] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-24 04:06:39] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-24 04:06:39] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:06:39] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-24 04:06:39] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/226 variables, 6/374 constraints. Problems are: Problem set: 24 solved, 144 unsolved
[2024-05-24 04:06:41] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-05-24 04:06:41] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-24 04:06:41] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-05-24 04:06:41] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-05-24 04:06:41] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2024-05-24 04:06:41] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/226 variables, 6/380 constraints. Problems are: Problem set: 24 solved, 144 unsolved
[2024-05-24 04:06:43] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-24 04:06:43] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-24 04:06:43] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-24 04:06:43] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-24 04:06:43] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:06:43] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-24 04:06:43] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:06:44] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/226 variables, 8/388 constraints. Problems are: Problem set: 24 solved, 144 unsolved
[2024-05-24 04:06:45] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-24 04:06:45] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:06:45] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2024-05-24 04:06:45] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-24 04:06:45] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-24 04:06:46] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-24 04:06:46] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2024-05-24 04:06:46] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-05-24 04:06:46] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/226 variables, 9/397 constraints. Problems are: Problem set: 24 solved, 144 unsolved
[2024-05-24 04:06:48] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-24 04:06:48] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:06:48] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-24 04:06:48] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-24 04:06:48] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/226 variables, 5/402 constraints. Problems are: Problem set: 24 solved, 144 unsolved
[2024-05-24 04:06:51] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/226 variables, 1/403 constraints. Problems are: Problem set: 24 solved, 144 unsolved
[2024-05-24 04:06:53] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-24 04:06:53] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/226 variables, 2/405 constraints. Problems are: Problem set: 24 solved, 144 unsolved
[2024-05-24 04:06:54] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2024-05-24 04:06:55] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-24 04:06:55] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/226 variables, 3/408 constraints. Problems are: Problem set: 24 solved, 144 unsolved
[2024-05-24 04:06:57] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-24 04:06:58] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-24 04:06:58] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/226 variables, 3/411 constraints. Problems are: Problem set: 24 solved, 144 unsolved
[2024-05-24 04:07:00] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-24 04:07:00] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2024-05-24 04:07:00] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-24 04:07:00] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-24 04:07:00] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 0 ms to minimize.
[2024-05-24 04:07:00] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/226 variables, 6/417 constraints. Problems are: Problem set: 24 solved, 144 unsolved
[2024-05-24 04:07:03] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-24 04:07:03] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-24 04:07:03] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-24 04:07:03] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/226 variables, 4/421 constraints. Problems are: Problem set: 24 solved, 144 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 226/226 variables, and 421 constraints, problems are : Problem set: 24 solved, 144 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 90/90 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 144/168 constraints, Known Traps: 141/141 constraints]
After SMT, in 40827ms problems are : Problem set: 24 solved, 144 unsolved
Search for dead transitions found 24 dead transitions in 40838ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 90/90 places, 148/172 transitions.
Applied a total of 0 rules in 7 ms. Remains 90 /90 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2024-05-24 04:07:06] [INFO ] Redundant transitions in 4 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 41118 ms. Remains : 90/90 places, 148/172 transitions.
[2024-05-24 04:07:06] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
// Phase 1: matrix 120 rows 90 cols
[2024-05-24 04:07:06] [INFO ] Computed 22 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[4]
RANDOM walk for 1000000 steps (2 resets) in 1236 ms. (808 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 484 ms. (2061 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[4]
[2024-05-24 04:07:07] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
[2024-05-24 04:07:07] [INFO ] Invariant cache hit.
[2024-05-24 04:07:07] [INFO ] [Real]Absence check using 22 positive place invariants in 4 ms returned sat
[2024-05-24 04:07:07] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-24 04:07:07] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-24 04:07:07] [INFO ] [Real]Added 20 Read/Feed constraints in 3 ms returned sat
[2024-05-24 04:07:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:07:07] [INFO ] [Nat]Absence check using 22 positive place invariants in 5 ms returned sat
[2024-05-24 04:07:07] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-24 04:07:07] [INFO ] [Nat]Added 20 Read/Feed constraints in 4 ms returned sat
[2024-05-24 04:07:07] [INFO ] Computed and/alt/rep : 104/420/104 causal constraints (skipped 12 transitions) in 7 ms.
[2024-05-24 04:07:08] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-24 04:07:08] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
[2024-05-24 04:07:08] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-24 04:07:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 166 ms
[2024-05-24 04:07:08] [INFO ] Added : 44 causal constraints over 10 iterations in 268 ms. Result :sat
Minimization took 61 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[4]
Support contains 4 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 148/148 transitions.
Applied a total of 0 rules in 6 ms. Remains 90 /90 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 90/90 places, 148/148 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 148/148 transitions.
Applied a total of 0 rules in 9 ms. Remains 90 /90 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2024-05-24 04:07:08] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
[2024-05-24 04:07:08] [INFO ] Invariant cache hit.
[2024-05-24 04:07:08] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-24 04:07:08] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
[2024-05-24 04:07:08] [INFO ] Invariant cache hit.
[2024-05-24 04:07:08] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-24 04:07:08] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2024-05-24 04:07:08] [INFO ] Redundant transitions in 4 ms returned []
Running 144 sub problems to find dead transitions.
[2024-05-24 04:07:08] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
[2024-05-24 04:07:08] [INFO ] Invariant cache hit.
[2024-05-24 04:07:08] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (OVERLAPS) 4/90 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:07:09] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-05-24 04:07:09] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-24 04:07:09] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-24 04:07:09] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2024-05-24 04:07:09] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-24 04:07:09] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-24 04:07:09] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
[2024-05-24 04:07:09] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-24 04:07:09] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-24 04:07:09] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-24 04:07:09] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 0 ms to minimize.
[2024-05-24 04:07:09] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-05-24 04:07:09] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-24 04:07:09] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:07:09] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-24 04:07:09] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-24 04:07:09] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-24 04:07:09] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-24 04:07:09] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-24 04:07:09] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:07:10] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-24 04:07:10] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:07:10] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-05-24 04:07:10] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
[2024-05-24 04:07:10] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-24 04:07:10] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-24 04:07:10] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-24 04:07:10] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-24 04:07:10] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-24 04:07:10] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-24 04:07:10] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-24 04:07:10] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-24 04:07:10] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-24 04:07:10] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:07:10] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-24 04:07:10] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 0 ms to minimize.
[2024-05-24 04:07:10] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-24 04:07:10] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:07:10] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-24 04:07:11] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:07:11] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-24 04:07:11] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-24 04:07:11] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-24 04:07:11] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-24 04:07:11] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2024-05-24 04:07:11] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-05-24 04:07:11] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-24 04:07:11] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:07:11] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-24 04:07:11] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-24 04:07:11] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-05-24 04:07:11] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-24 04:07:11] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-24 04:07:11] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:07:11] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-24 04:07:11] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-24 04:07:11] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-24 04:07:11] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-24 04:07:12] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-24 04:07:12] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:07:12] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-24 04:07:12] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-24 04:07:12] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-05-24 04:07:12] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-24 04:07:12] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-24 04:07:12] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-24 04:07:12] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-24 04:07:12] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-24 04:07:12] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2024-05-24 04:07:12] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-24 04:07:12] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:07:12] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-05-24 04:07:12] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-05-24 04:07:12] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-24 04:07:13] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-24 04:07:13] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-24 04:07:13] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-24 04:07:13] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 18/100 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:07:13] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2024-05-24 04:07:13] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-24 04:07:13] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 0 ms to minimize.
[2024-05-24 04:07:13] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-24 04:07:13] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-24 04:07:13] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:07:14] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-05-24 04:07:14] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 8/108 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:07:14] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-24 04:07:14] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-24 04:07:14] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 3/111 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:07:14] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-24 04:07:14] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-24 04:07:14] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2024-05-24 04:07:15] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-24 04:07:15] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-24 04:07:15] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-24 04:07:15] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-24 04:07:15] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-24 04:07:15] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 9/120 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:07:15] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-24 04:07:15] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 0 ms to minimize.
[2024-05-24 04:07:16] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-24 04:07:16] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-24 04:07:16] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/90 variables, 5/125 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:07:16] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/90 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:07:16] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/90 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/90 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 14 (OVERLAPS) 120/210 variables, 90/217 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/210 variables, 20/237 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/210 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 17 (OVERLAPS) 0/210 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 237 constraints, problems are : Problem set: 0 solved, 144 unsolved in 11413 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 90/90 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 105/105 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 71/77 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 4/90 variables, 16/93 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 34/127 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:07:20] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-24 04:07:20] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-24 04:07:20] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-24 04:07:20] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-24 04:07:20] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-24 04:07:20] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-24 04:07:20] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-24 04:07:20] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-24 04:07:20] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-24 04:07:21] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-24 04:07:21] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 11/138 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:07:21] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:07:21] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-24 04:07:21] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:07:22] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 0 ms to minimize.
[2024-05-24 04:07:22] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-24 04:07:22] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 3/144 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:07:22] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2024-05-24 04:07:22] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-24 04:07:22] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-24 04:07:22] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-24 04:07:22] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-05-24 04:07:23] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-24 04:07:23] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:07:23] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-24 04:07:23] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-24 04:07:23] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 0 ms to minimize.
[2024-05-24 04:07:23] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-05-24 04:07:23] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-05-24 04:07:23] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 13/157 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:07:23] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/90 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/90 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 12 (OVERLAPS) 120/210 variables, 90/248 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/210 variables, 20/268 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/210 variables, 144/412 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:07:26] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-24 04:07:26] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-24 04:07:26] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/210 variables, 3/415 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:07:27] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-24 04:07:28] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-24 04:07:28] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-24 04:07:28] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-24 04:07:28] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-24 04:07:29] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-24 04:07:29] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/210 variables, 7/422 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:07:30] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/210 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:07:32] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-24 04:07:33] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2024-05-24 04:07:33] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-24 04:07:33] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-24 04:07:33] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-05-24 04:07:33] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-24 04:07:33] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2024-05-24 04:07:33] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/210 variables, 8/431 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:07:36] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/210 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/210 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:07:41] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
At refinement iteration 21 (OVERLAPS) 0/210 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:07:43] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/210 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:07:45] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 0 ms to minimize.
[2024-05-24 04:07:45] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-05-24 04:07:45] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 2 ms to minimize.
[2024-05-24 04:07:46] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 0 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/210 variables, 4/438 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:07:48] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/210 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 210/210 variables, and 439 constraints, problems are : Problem set: 0 solved, 144 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 90/90 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 163/163 constraints]
After SMT, in 41476ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 41478ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41685 ms. Remains : 90/90 places, 148/148 transitions.
RANDOM walk for 40000 steps (8 resets) in 682 ms. (58 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 138 ms. (287 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 185 ms. (215 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 882660 steps, run timeout after 3001 ms. (steps per millisecond=294 ) properties seen :0 out of 2
Probabilistic random walk after 882660 steps, saw 218556 distinct states, run finished after 3004 ms. (steps per millisecond=293 ) properties seen :0
[2024-05-24 04:07:53] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
[2024-05-24 04:07:53] [INFO ] Invariant cache hit.
[2024-05-24 04:07:53] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 68/72 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 120/192 variables, 72/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 18/210 variables, 18/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/210 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 132 constraints, problems are : Problem set: 0 solved, 2 unsolved in 170 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 90/90 constraints, ReadFeed: 20/20 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 68/72 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 120/192 variables, 72/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 18/210 variables, 18/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:07:53] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:07:53] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-24 04:07:53] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 0 ms to minimize.
[2024-05-24 04:07:53] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-24 04:07:53] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-24 04:07:53] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-24 04:07:53] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2024-05-24 04:07:53] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-24 04:07:54] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-24 04:07:54] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-24 04:07:54] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 10/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:07:54] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:07:54] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-24 04:07:54] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 3/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/210 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/210 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 148 constraints, problems are : Problem set: 0 solved, 2 unsolved in 832 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 90/90 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 14/14 constraints]
After SMT, in 1007ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 92 ms.
Support contains 4 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 148/148 transitions.
Applied a total of 0 rules in 4 ms. Remains 90 /90 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 90/90 places, 148/148 transitions.
RANDOM walk for 40000 steps (8 resets) in 135 ms. (294 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 921361 steps, run timeout after 3001 ms. (steps per millisecond=307 ) properties seen :0 out of 2
Probabilistic random walk after 921361 steps, saw 226814 distinct states, run finished after 3001 ms. (steps per millisecond=307 ) properties seen :0
[2024-05-24 04:07:57] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
[2024-05-24 04:07:57] [INFO ] Invariant cache hit.
[2024-05-24 04:07:57] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 68/72 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 120/192 variables, 72/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 18/210 variables, 18/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/210 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 132 constraints, problems are : Problem set: 0 solved, 2 unsolved in 88 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 90/90 constraints, ReadFeed: 20/20 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 68/72 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 120/192 variables, 72/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 18/210 variables, 18/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:07:57] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:07:57] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2024-05-24 04:07:57] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2024-05-24 04:07:57] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:07:57] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-24 04:07:57] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-24 04:07:57] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-24 04:07:58] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-24 04:07:58] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-24 04:07:58] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-24 04:07:58] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 10/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:07:58] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-24 04:07:58] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:07:58] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 3/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/210 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/210 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 148 constraints, problems are : Problem set: 0 solved, 2 unsolved in 776 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 90/90 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 14/14 constraints]
After SMT, in 876ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 55 ms.
Support contains 4 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 148/148 transitions.
Applied a total of 0 rules in 4 ms. Remains 90 /90 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 90/90 places, 148/148 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 148/148 transitions.
Applied a total of 0 rules in 4 ms. Remains 90 /90 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2024-05-24 04:07:58] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
[2024-05-24 04:07:58] [INFO ] Invariant cache hit.
[2024-05-24 04:07:58] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-24 04:07:58] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
[2024-05-24 04:07:58] [INFO ] Invariant cache hit.
[2024-05-24 04:07:58] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-24 04:07:58] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2024-05-24 04:07:58] [INFO ] Redundant transitions in 1 ms returned []
Running 144 sub problems to find dead transitions.
[2024-05-24 04:07:58] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
[2024-05-24 04:07:58] [INFO ] Invariant cache hit.
[2024-05-24 04:07:58] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (OVERLAPS) 4/90 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:07:59] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
[2024-05-24 04:07:59] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-24 04:07:59] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2024-05-24 04:07:59] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-05-24 04:07:59] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-24 04:07:59] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-24 04:07:59] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
[2024-05-24 04:07:59] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-24 04:07:59] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-05-24 04:07:59] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-24 04:07:59] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-24 04:07:59] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-05-24 04:07:59] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-24 04:07:59] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:07:59] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-24 04:07:59] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-24 04:08:00] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-24 04:08:00] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-24 04:08:00] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-24 04:08:00] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:08:00] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-24 04:08:00] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-24 04:08:00] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-24 04:08:00] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
[2024-05-24 04:08:00] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2024-05-24 04:08:00] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:08:00] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:08:00] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-24 04:08:00] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-24 04:08:00] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-24 04:08:00] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-24 04:08:00] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 0 ms to minimize.
[2024-05-24 04:08:00] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-24 04:08:01] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-24 04:08:01] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-24 04:08:01] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
[2024-05-24 04:08:01] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-05-24 04:08:01] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-24 04:08:01] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-24 04:08:01] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:08:01] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-24 04:08:01] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:08:01] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-24 04:08:01] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-24 04:08:01] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2024-05-24 04:08:01] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-05-24 04:08:01] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-24 04:08:01] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-24 04:08:01] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-24 04:08:01] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-05-24 04:08:01] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-24 04:08:01] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-24 04:08:01] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-24 04:08:02] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-24 04:08:02] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-24 04:08:02] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-24 04:08:02] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:08:02] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-24 04:08:02] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-24 04:08:02] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:08:02] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:08:02] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:08:02] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-05-24 04:08:02] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2024-05-24 04:08:02] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-24 04:08:02] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-24 04:08:02] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-05-24 04:08:02] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-24 04:08:02] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-24 04:08:03] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:08:03] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-24 04:08:03] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-05-24 04:08:03] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-24 04:08:03] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-24 04:08:03] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:08:03] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-24 04:08:03] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-24 04:08:03] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 18/100 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:08:03] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-24 04:08:03] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-24 04:08:04] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-24 04:08:04] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-24 04:08:04] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-24 04:08:04] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-24 04:08:04] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-24 04:08:04] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 8/108 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:08:04] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-24 04:08:04] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
[2024-05-24 04:08:04] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 3/111 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:08:04] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-24 04:08:05] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-24 04:08:05] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-24 04:08:05] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-24 04:08:05] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 0 ms to minimize.
[2024-05-24 04:08:05] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2024-05-24 04:08:05] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-05-24 04:08:05] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-24 04:08:05] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 9/120 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:08:06] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-24 04:08:06] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-24 04:08:06] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-05-24 04:08:06] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-05-24 04:08:06] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/90 variables, 5/125 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:08:06] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/90 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:08:07] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/90 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/90 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 14 (OVERLAPS) 120/210 variables, 90/217 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/210 variables, 20/237 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/210 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 17 (OVERLAPS) 0/210 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 237 constraints, problems are : Problem set: 0 solved, 144 unsolved in 11448 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 90/90 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 105/105 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 71/77 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 4/90 variables, 16/93 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 34/127 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:08:10] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-24 04:08:10] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-24 04:08:10] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-24 04:08:10] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-24 04:08:10] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-24 04:08:11] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-24 04:08:11] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-24 04:08:11] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-24 04:08:11] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-24 04:08:11] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-24 04:08:11] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 11/138 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:08:11] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:08:12] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-05-24 04:08:12] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:08:12] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-24 04:08:12] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-24 04:08:12] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 3/144 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:08:12] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-24 04:08:12] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-24 04:08:13] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-24 04:08:13] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2024-05-24 04:08:13] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-24 04:08:13] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-24 04:08:13] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:08:13] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-24 04:08:13] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-24 04:08:13] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:08:13] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2024-05-24 04:08:13] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:08:13] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 13/157 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:08:13] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/90 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/90 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 12 (OVERLAPS) 120/210 variables, 90/248 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/210 variables, 20/268 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/210 variables, 144/412 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:08:16] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-24 04:08:16] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2024-05-24 04:08:16] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/210 variables, 3/415 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:08:18] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-24 04:08:18] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2024-05-24 04:08:18] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-24 04:08:18] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-24 04:08:19] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2024-05-24 04:08:19] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-24 04:08:19] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/210 variables, 7/422 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:08:21] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/210 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:08:22] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-24 04:08:23] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-24 04:08:23] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-24 04:08:23] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-24 04:08:23] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:08:23] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-24 04:08:23] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2024-05-24 04:08:23] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/210 variables, 8/431 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:08:26] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/210 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/210 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:08:31] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
At refinement iteration 21 (OVERLAPS) 0/210 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:08:33] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 0 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/210 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:08:35] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-24 04:08:36] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-24 04:08:36] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-24 04:08:36] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/210 variables, 4/438 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:08:38] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/210 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 210/210 variables, and 439 constraints, problems are : Problem set: 0 solved, 144 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 90/90 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 163/163 constraints]
After SMT, in 41507ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 41509ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41696 ms. Remains : 90/90 places, 148/148 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 90 transition count 120
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 16 Pre rules applied. Total rules applied 28 place count 90 transition count 104
Deduced a syphon composed of 16 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 1 with 44 rules applied. Total rules applied 72 place count 62 transition count 104
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 80 place count 58 transition count 100
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 88 place count 54 transition count 112
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 92 place count 54 transition count 108
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 96 place count 50 transition count 108
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 100 place count 50 transition count 108
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 104 place count 50 transition count 108
Applied a total of 104 rules in 31 ms. Remains 50 /90 variables (removed 40) and now considering 108/148 (removed 40) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 108 rows 50 cols
[2024-05-24 04:08:40] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 04:08:40] [INFO ] [Real]Absence check using 10 positive place invariants in 1 ms returned sat
[2024-05-24 04:08:40] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 04:08:40] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-24 04:08:40] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-24 04:08:40] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-24 04:08:40] [INFO ] After 71ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 179 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[4]
Starting property specific reduction for LamportFastMutEx-COL-4-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-05-24 04:08:40] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
// Phase 1: matrix 120 rows 90 cols
[2024-05-24 04:08:40] [INFO ] Computed 22 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 10000 steps (2 resets) in 14 ms. (666 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[4]
[2024-05-24 04:08:40] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
[2024-05-24 04:08:40] [INFO ] Invariant cache hit.
[2024-05-24 04:08:40] [INFO ] [Real]Absence check using 22 positive place invariants in 3 ms returned sat
[2024-05-24 04:08:40] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-24 04:08:40] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-24 04:08:40] [INFO ] [Real]Added 20 Read/Feed constraints in 2 ms returned sat
[2024-05-24 04:08:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:08:40] [INFO ] [Nat]Absence check using 22 positive place invariants in 4 ms returned sat
[2024-05-24 04:08:40] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-24 04:08:40] [INFO ] [Nat]Added 20 Read/Feed constraints in 3 ms returned sat
[2024-05-24 04:08:40] [INFO ] Computed and/alt/rep : 104/420/104 causal constraints (skipped 12 transitions) in 7 ms.
[2024-05-24 04:08:40] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-24 04:08:40] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:08:40] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-24 04:08:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 153 ms
[2024-05-24 04:08:40] [INFO ] Added : 44 causal constraints over 10 iterations in 252 ms. Result :sat
Minimization took 64 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[4]
Support contains 4 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 148/148 transitions.
Applied a total of 0 rules in 3 ms. Remains 90 /90 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 90/90 places, 148/148 transitions.
[2024-05-24 04:08:40] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
[2024-05-24 04:08:40] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[4]
RANDOM walk for 1000000 steps (2 resets) in 1241 ms. (805 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 489 ms. (2040 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[4]
[2024-05-24 04:08:42] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
[2024-05-24 04:08:42] [INFO ] Invariant cache hit.
[2024-05-24 04:08:42] [INFO ] [Real]Absence check using 22 positive place invariants in 4 ms returned sat
[2024-05-24 04:08:42] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-24 04:08:42] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-24 04:08:42] [INFO ] [Real]Added 20 Read/Feed constraints in 2 ms returned sat
[2024-05-24 04:08:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 04:08:42] [INFO ] [Nat]Absence check using 22 positive place invariants in 3 ms returned sat
[2024-05-24 04:08:42] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-24 04:08:42] [INFO ] [Nat]Added 20 Read/Feed constraints in 3 ms returned sat
[2024-05-24 04:08:42] [INFO ] Computed and/alt/rep : 104/420/104 causal constraints (skipped 12 transitions) in 8 ms.
[2024-05-24 04:08:42] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-24 04:08:42] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-24 04:08:42] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-24 04:08:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 152 ms
[2024-05-24 04:08:42] [INFO ] Added : 44 causal constraints over 10 iterations in 248 ms. Result :sat
Minimization took 62 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[4]
Support contains 4 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 148/148 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 90/90 places, 148/148 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 148/148 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2024-05-24 04:08:43] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
[2024-05-24 04:08:43] [INFO ] Invariant cache hit.
[2024-05-24 04:08:43] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-24 04:08:43] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
[2024-05-24 04:08:43] [INFO ] Invariant cache hit.
[2024-05-24 04:08:43] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-24 04:08:43] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2024-05-24 04:08:43] [INFO ] Redundant transitions in 1 ms returned []
Running 144 sub problems to find dead transitions.
[2024-05-24 04:08:43] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
[2024-05-24 04:08:43] [INFO ] Invariant cache hit.
[2024-05-24 04:08:43] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (OVERLAPS) 4/90 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:08:43] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 0 ms to minimize.
[2024-05-24 04:08:43] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-24 04:08:43] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-24 04:08:44] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-05-24 04:08:44] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-24 04:08:44] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-24 04:08:44] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
[2024-05-24 04:08:44] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-24 04:08:44] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-24 04:08:44] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-24 04:08:44] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-24 04:08:44] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-05-24 04:08:44] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-24 04:08:44] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-24 04:08:44] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-24 04:08:44] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-24 04:08:44] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:08:44] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-24 04:08:44] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-24 04:08:44] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:08:44] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
[2024-05-24 04:08:44] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-24 04:08:44] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-24 04:08:45] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-05-24 04:08:45] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-24 04:08:45] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-24 04:08:45] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-24 04:08:45] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-24 04:08:45] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:08:45] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-05-24 04:08:45] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2024-05-24 04:08:45] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 0 ms to minimize.
[2024-05-24 04:08:45] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-24 04:08:45] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-24 04:08:45] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-24 04:08:45] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
[2024-05-24 04:08:45] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-05-24 04:08:45] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-24 04:08:45] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:08:45] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:08:45] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-24 04:08:45] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-24 04:08:45] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-05-24 04:08:45] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:08:46] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-24 04:08:46] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:08:46] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-24 04:08:46] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-24 04:08:46] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-24 04:08:46] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-24 04:08:46] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-24 04:08:46] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-24 04:08:46] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-24 04:08:46] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-24 04:08:46] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-24 04:08:46] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-24 04:08:46] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:08:46] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-24 04:08:46] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-24 04:08:46] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:08:46] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2024-05-24 04:08:47] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-05-24 04:08:47] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-24 04:08:47] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-24 04:08:47] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-24 04:08:47] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:08:47] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-24 04:08:47] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-24 04:08:47] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-24 04:08:47] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-24 04:08:47] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-05-24 04:08:47] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-24 04:08:47] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-24 04:08:47] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-24 04:08:47] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-24 04:08:47] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-24 04:08:47] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
[2024-05-24 04:08:47] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 18/100 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:08:48] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-24 04:08:48] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:08:48] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-24 04:08:48] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-24 04:08:48] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-24 04:08:48] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-24 04:08:48] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-24 04:08:48] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 8/108 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:08:49] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 0 ms to minimize.
[2024-05-24 04:08:49] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 0 ms to minimize.
[2024-05-24 04:08:49] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 3/111 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:08:49] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2024-05-24 04:08:49] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-24 04:08:49] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:08:49] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2024-05-24 04:08:49] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-24 04:08:49] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-24 04:08:49] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-05-24 04:08:49] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-24 04:08:49] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 9/120 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:08:50] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-24 04:08:50] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-24 04:08:50] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2024-05-24 04:08:50] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-24 04:08:50] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/90 variables, 5/125 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:08:50] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/90 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:08:51] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/90 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/90 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 14 (OVERLAPS) 120/210 variables, 90/217 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/210 variables, 20/237 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/210 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 17 (OVERLAPS) 0/210 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 237 constraints, problems are : Problem set: 0 solved, 144 unsolved in 11280 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 90/90 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 105/105 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 71/77 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 4/90 variables, 16/93 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 34/127 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:08:55] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2024-05-24 04:08:55] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-24 04:08:55] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-24 04:08:55] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-24 04:08:55] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-24 04:08:55] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-24 04:08:55] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-24 04:08:55] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-24 04:08:55] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-24 04:08:55] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-24 04:08:55] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 11/138 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:08:56] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:08:56] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-24 04:08:56] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:08:56] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-24 04:08:56] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:08:56] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 3/144 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:08:57] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-24 04:08:57] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-24 04:08:57] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-24 04:08:57] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-24 04:08:57] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-24 04:08:57] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-24 04:08:57] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-24 04:08:57] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-24 04:08:57] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-24 04:08:57] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
[2024-05-24 04:08:57] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-05-24 04:08:57] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-24 04:08:58] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 13/157 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:08:58] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/90 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/90 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 12 (OVERLAPS) 120/210 variables, 90/248 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/210 variables, 20/268 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/210 variables, 144/412 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:09:01] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-24 04:09:01] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-24 04:09:01] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/210 variables, 3/415 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:09:02] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
[2024-05-24 04:09:03] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2024-05-24 04:09:03] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-24 04:09:03] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-24 04:09:03] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-24 04:09:03] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-24 04:09:03] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/210 variables, 7/422 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:09:05] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/210 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:09:07] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:09:07] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-24 04:09:08] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 0 ms to minimize.
[2024-05-24 04:09:08] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-24 04:09:08] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-24 04:09:08] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-24 04:09:08] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2024-05-24 04:09:08] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/210 variables, 8/431 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:09:10] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/210 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/210 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:09:15] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
At refinement iteration 21 (OVERLAPS) 0/210 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:09:18] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/210 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:09:20] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-24 04:09:20] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:09:20] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-24 04:09:20] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/210 variables, 4/438 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:09:23] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/210 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 210/210 variables, and 439 constraints, problems are : Problem set: 0 solved, 144 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 90/90 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 163/163 constraints]
After SMT, in 41336ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 41338ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41534 ms. Remains : 90/90 places, 148/148 transitions.
RANDOM walk for 40000 steps (8 resets) in 133 ms. (298 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1029913 steps, run timeout after 3001 ms. (steps per millisecond=343 ) properties seen :0 out of 2
Probabilistic random walk after 1029913 steps, saw 249200 distinct states, run finished after 3001 ms. (steps per millisecond=343 ) properties seen :0
[2024-05-24 04:09:27] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
[2024-05-24 04:09:27] [INFO ] Invariant cache hit.
[2024-05-24 04:09:27] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 68/72 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 120/192 variables, 72/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 18/210 variables, 18/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/210 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 132 constraints, problems are : Problem set: 0 solved, 2 unsolved in 98 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 90/90 constraints, ReadFeed: 20/20 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 68/72 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 120/192 variables, 72/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 18/210 variables, 18/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:09:27] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:09:27] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-24 04:09:28] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-24 04:09:28] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:09:28] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:09:28] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-24 04:09:28] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-24 04:09:28] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-24 04:09:28] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-24 04:09:28] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-24 04:09:28] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 10/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:09:28] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-24 04:09:28] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:09:28] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 3/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/210 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/210 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 148 constraints, problems are : Problem set: 0 solved, 2 unsolved in 714 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 90/90 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 14/14 constraints]
After SMT, in 828ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 59 ms.
Support contains 4 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 148/148 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 90/90 places, 148/148 transitions.
RANDOM walk for 40000 steps (8 resets) in 131 ms. (303 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 28 ms. (1379 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1052728 steps, run timeout after 3001 ms. (steps per millisecond=350 ) properties seen :0 out of 2
Probabilistic random walk after 1052728 steps, saw 254135 distinct states, run finished after 3001 ms. (steps per millisecond=350 ) properties seen :0
[2024-05-24 04:09:31] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
[2024-05-24 04:09:31] [INFO ] Invariant cache hit.
[2024-05-24 04:09:31] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 68/72 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 120/192 variables, 72/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 18/210 variables, 18/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/210 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 132 constraints, problems are : Problem set: 0 solved, 2 unsolved in 98 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 90/90 constraints, ReadFeed: 20/20 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 68/72 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 120/192 variables, 72/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 18/210 variables, 18/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:09:31] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:09:31] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2024-05-24 04:09:32] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
[2024-05-24 04:09:32] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-24 04:09:32] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-24 04:09:32] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-24 04:09:32] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-24 04:09:32] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-24 04:09:32] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-24 04:09:32] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-24 04:09:32] [INFO ] Deduced a trap composed of 9 places in 15 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 10/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:09:32] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 0 ms to minimize.
[2024-05-24 04:09:32] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-05-24 04:09:32] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 3/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/210 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/210 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 148 constraints, problems are : Problem set: 0 solved, 2 unsolved in 743 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 90/90 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 14/14 constraints]
After SMT, in 845ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 113 ms.
Support contains 4 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 148/148 transitions.
Applied a total of 0 rules in 3 ms. Remains 90 /90 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 90/90 places, 148/148 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 148/148 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2024-05-24 04:09:32] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
[2024-05-24 04:09:32] [INFO ] Invariant cache hit.
[2024-05-24 04:09:32] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-24 04:09:32] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
[2024-05-24 04:09:32] [INFO ] Invariant cache hit.
[2024-05-24 04:09:32] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-24 04:09:32] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2024-05-24 04:09:32] [INFO ] Redundant transitions in 1 ms returned []
Running 144 sub problems to find dead transitions.
[2024-05-24 04:09:32] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
[2024-05-24 04:09:32] [INFO ] Invariant cache hit.
[2024-05-24 04:09:32] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (OVERLAPS) 4/90 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:09:33] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-05-24 04:09:33] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-24 04:09:33] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-24 04:09:33] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-24 04:09:33] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-24 04:09:33] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-24 04:09:33] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-05-24 04:09:33] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-24 04:09:33] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-24 04:09:33] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-24 04:09:33] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-24 04:09:33] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-05-24 04:09:33] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-24 04:09:33] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-24 04:09:33] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-24 04:09:34] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-24 04:09:34] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-24 04:09:34] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-24 04:09:34] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-24 04:09:34] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:09:34] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-24 04:09:34] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-24 04:09:34] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-24 04:09:34] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
[2024-05-24 04:09:34] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-05-24 04:09:34] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-24 04:09:34] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
[2024-05-24 04:09:34] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-24 04:09:34] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-24 04:09:34] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-05-24 04:09:34] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-24 04:09:34] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 0 ms to minimize.
[2024-05-24 04:09:34] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-24 04:09:35] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2024-05-24 04:09:35] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-24 04:09:35] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-24 04:09:35] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-05-24 04:09:35] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-24 04:09:35] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 0 ms to minimize.
[2024-05-24 04:09:35] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:09:35] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-24 04:09:35] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-24 04:09:35] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2024-05-24 04:09:35] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:09:35] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-05-24 04:09:35] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2024-05-24 04:09:35] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-24 04:09:35] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-05-24 04:09:35] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-24 04:09:35] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-24 04:09:35] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-24 04:09:35] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-24 04:09:35] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-24 04:09:36] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-24 04:09:36] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:09:36] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-24 04:09:36] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-24 04:09:36] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-24 04:09:36] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-24 04:09:36] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:09:36] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-05-24 04:09:36] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-24 04:09:36] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-24 04:09:36] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-24 04:09:36] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-05-24 04:09:36] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-24 04:09:36] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-05-24 04:09:36] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-24 04:09:37] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-24 04:09:37] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:09:37] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-24 04:09:37] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-05-24 04:09:37] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-24 04:09:37] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-24 04:09:37] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-24 04:09:37] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-24 04:09:37] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-24 04:09:37] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 18/100 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:09:37] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-24 04:09:38] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-05-24 04:09:38] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-24 04:09:38] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-05-24 04:09:38] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-24 04:09:38] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:09:38] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-24 04:09:38] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 8/108 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:09:38] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-24 04:09:38] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-24 04:09:38] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 3/111 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:09:39] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2024-05-24 04:09:39] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-24 04:09:39] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:09:39] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-24 04:09:39] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-24 04:09:39] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-24 04:09:39] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:09:39] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-24 04:09:39] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 9/120 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:09:40] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-24 04:09:40] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-05-24 04:09:40] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-24 04:09:40] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2024-05-24 04:09:40] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/90 variables, 5/125 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:09:40] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/90 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:09:41] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/90 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/90 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 14 (OVERLAPS) 120/210 variables, 90/217 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/210 variables, 20/237 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/210 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 17 (OVERLAPS) 0/210 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 237 constraints, problems are : Problem set: 0 solved, 144 unsolved in 11363 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 90/90 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 105/105 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 71/77 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 4/90 variables, 16/93 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 34/127 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:09:44] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-24 04:09:45] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-24 04:09:45] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-24 04:09:45] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-24 04:09:45] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-24 04:09:45] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:09:45] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-24 04:09:45] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-24 04:09:45] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-24 04:09:45] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-24 04:09:45] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 11/138 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:09:45] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:09:46] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-05-24 04:09:46] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:09:46] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-24 04:09:46] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 2 ms to minimize.
[2024-05-24 04:09:46] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 3/144 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:09:47] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-24 04:09:47] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-24 04:09:47] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-24 04:09:47] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2024-05-24 04:09:47] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-05-24 04:09:47] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-24 04:09:47] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-24 04:09:47] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-24 04:09:47] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-24 04:09:47] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
[2024-05-24 04:09:47] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2024-05-24 04:09:47] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-24 04:09:47] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 13/157 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:09:47] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/90 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/90 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 12 (OVERLAPS) 120/210 variables, 90/248 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/210 variables, 20/268 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/210 variables, 144/412 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:09:50] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-24 04:09:51] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2024-05-24 04:09:51] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/210 variables, 3/415 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:09:52] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-24 04:09:52] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-24 04:09:53] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-24 04:09:53] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-05-24 04:09:53] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-24 04:09:53] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-24 04:09:53] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/210 variables, 7/422 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:09:55] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/210 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:09:57] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-24 04:09:57] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2024-05-24 04:09:57] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-24 04:09:57] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-24 04:09:58] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-24 04:09:58] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-24 04:09:58] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-24 04:09:58] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/210 variables, 8/431 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:10:00] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/210 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/210 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:10:05] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
At refinement iteration 21 (OVERLAPS) 0/210 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:10:08] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/210 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:10:10] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-24 04:10:10] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-24 04:10:10] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-24 04:10:11] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/210 variables, 4/438 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-24 04:10:13] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/210 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 210/210 variables, and 439 constraints, problems are : Problem set: 0 solved, 144 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 90/90 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 163/163 constraints]
After SMT, in 41419ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 41421ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41623 ms. Remains : 90/90 places, 148/148 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 90 transition count 120
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 16 Pre rules applied. Total rules applied 28 place count 90 transition count 104
Deduced a syphon composed of 16 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 1 with 44 rules applied. Total rules applied 72 place count 62 transition count 104
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 80 place count 58 transition count 100
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 88 place count 54 transition count 112
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 92 place count 54 transition count 108
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 96 place count 50 transition count 108
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 100 place count 50 transition count 108
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 104 place count 50 transition count 108
Applied a total of 104 rules in 20 ms. Remains 50 /90 variables (removed 40) and now considering 108/148 (removed 40) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 108 rows 50 cols
[2024-05-24 04:10:14] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 04:10:14] [INFO ] [Real]Absence check using 10 positive place invariants in 1 ms returned sat
[2024-05-24 04:10:14] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 04:10:14] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-24 04:10:14] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-24 04:10:14] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-24 04:10:14] [INFO ] After 73ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 166 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[4]
Ending property specific reduction for LamportFastMutEx-COL-4-UpperBounds-12 in 94138 ms.
[2024-05-24 04:10:14] [INFO ] Flatten gal took : 37 ms
[2024-05-24 04:10:14] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 4 ms.
[2024-05-24 04:10:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 90 places, 148 transitions and 664 arcs took 20 ms.
Total runtime 244386 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running LamportFastMutEx-COL-4
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 90
TRANSITIONS: 148
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.004s, Sys 0.000s]
SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 3638
MODEL NAME: /home/mcc/execution/414/model
90 places, 148 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA LamportFastMutEx-COL-4-UpperBounds-12 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716523815950
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LamportFastMutEx-COL-4"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is LamportFastMutEx-COL-4, 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 r223-tall-171649611000221"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-4.tgz
mv LamportFastMutEx-COL-4 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 ;