About the Execution of LTSMin+red for Peterson-COL-7
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2315.355 | 1184851.00 | 1274675.00 | 3033.90 | 8 ? ? 8 8 7 ? 7 ? 8 8 8 8 ? ? 8 | 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.r512-smll-171654407200245.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 ltsminxred
Input is Peterson-COL-7, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654407200245
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 8.3K Apr 12 03:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 12 03:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 12 03:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 12 03:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 04:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Apr 12 04:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 04:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Apr 12 04:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 47K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Peterson-COL-7-UpperBounds-00
FORMULA_NAME Peterson-COL-7-UpperBounds-01
FORMULA_NAME Peterson-COL-7-UpperBounds-02
FORMULA_NAME Peterson-COL-7-UpperBounds-03
FORMULA_NAME Peterson-COL-7-UpperBounds-04
FORMULA_NAME Peterson-COL-7-UpperBounds-05
FORMULA_NAME Peterson-COL-7-UpperBounds-06
FORMULA_NAME Peterson-COL-7-UpperBounds-07
FORMULA_NAME Peterson-COL-7-UpperBounds-08
FORMULA_NAME Peterson-COL-7-UpperBounds-09
FORMULA_NAME Peterson-COL-7-UpperBounds-10
FORMULA_NAME Peterson-COL-7-UpperBounds-11
FORMULA_NAME Peterson-COL-7-UpperBounds-12
FORMULA_NAME Peterson-COL-7-UpperBounds-13
FORMULA_NAME Peterson-COL-7-UpperBounds-14
FORMULA_NAME Peterson-COL-7-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717267644109
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-COL-7
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 18:47:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 18:47:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 18:47:26] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 18:47:27] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 18:47:28] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1338 ms
[2024-06-01 18:47:28] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 2048 PT places and 3384.0 transition bindings in 43 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Reduction of identical properties reduced properties to check from 16 to 9
[2024-06-01 18:47:28] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 8 ms.
[2024-06-01 18:47:28] [INFO ] Skeletonized 9 HLPN properties in 0 ms.
Reduce places removed 2 places and 0 transitions.
// Phase 1: matrix 14 rows 9 cols
[2024-06-01 18:47:28] [INFO ] Computed 1 invariants in 8 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 8, 0, 7, 0, 0, 0] Max Struct:[8, 8, 8, 8, 8, 7, 8, 8, 8]
FORMULA Peterson-COL-7-UpperBounds-07 7 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-7-UpperBounds-05 7 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-7-UpperBounds-09 8 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-7-UpperBounds-03 8 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-06-01 18:47:28] [INFO ] Invariant cache hit.
[2024-06-01 18:47:28] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2024-06-01 18:47:28] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-06-01 18:47:28] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 29 ms.
[2024-06-01 18:47:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:47:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 18:47:29] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-06-01 18:47:29] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 18:47:29] [INFO ] Added : 11 causal constraints over 3 iterations in 40 ms. Result :sat
Minimization took 15 ms.
[2024-06-01 18:47:29] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 18:47:29] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-06-01 18:47:29] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 18:47:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:47:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 18:47:29] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-06-01 18:47:29] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 18:47:29] [INFO ] Added : 11 causal constraints over 3 iterations in 28 ms. Result :sat
Minimization took 13 ms.
[2024-06-01 18:47:29] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 18:47:29] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-06-01 18:47:29] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 10 ms.
[2024-06-01 18:47:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:47:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 18:47:29] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-06-01 18:47:29] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 18:47:29] [INFO ] Added : 12 causal constraints over 4 iterations in 33 ms. Result :sat
Minimization took 9 ms.
[2024-06-01 18:47:29] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 18:47:29] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-06-01 18:47:29] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 18:47:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:47:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 18:47:29] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-06-01 18:47:29] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 18:47:29] [INFO ] Added : 11 causal constraints over 3 iterations in 32 ms. Result :sat
Minimization took 10 ms.
[2024-06-01 18:47:29] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 18:47:29] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-06-01 18:47:29] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 18:47:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:47:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 18:47:29] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-06-01 18:47:29] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 18:47:29] [INFO ] Added : 11 causal constraints over 4 iterations in 28 ms. Result :sat
Minimization took 9 ms.
[2024-06-01 18:47:29] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 18:47:30] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-06-01 18:47:30] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 18:47:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:47:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 18:47:30] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-06-01 18:47:30] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 18:47:30] [INFO ] Added : 11 causal constraints over 5 iterations in 27 ms. Result :sat
Minimization took 9 ms.
[2024-06-01 18:47:30] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 18:47:30] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 18:47:30] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 18:47:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:47:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 18:47:30] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-06-01 18:47:30] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 18:47:30] [INFO ] Added : 11 causal constraints over 5 iterations in 35 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[8, 8, 8, 8, 8, 8, 8]
Domain [Process(8), Tour(7), Process(8)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 7)]] contains successor/predecessor on variables of sort Tour
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-06-01 18:47:30] [INFO ] Unfolded HLPN to a Petri net with 2048 places and 3208 transitions 10032 arcs in 185 ms.
[2024-06-01 18:47:30] [INFO ] Unfolded 7 HLPN properties in 1 ms.
Deduced a syphon composed of 56 places in 43 ms
Reduce places removed 56 places and 112 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+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] Max Struct:[8, 8, 8, 8, 8, 8, 8]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[8, 8, 8, 8, 8, 8, 8]
[2024-06-01 18:47:30] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2024-06-01 18:47:30] [INFO ] Computed 31 invariants in 77 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[8, 8, 8, 8, 8, 8, 8]
RANDOM walk for 10000 steps (2 resets) in 563 ms. (17 steps per ms)
FORMULA Peterson-COL-7-UpperBounds-11 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-7-UpperBounds-00 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-7-UpperBounds-04 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-7-UpperBounds-10 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50005 steps (10 resets) in 695 ms. (71 steps per ms)
FORMULA Peterson-COL-7-UpperBounds-15 8 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[2, 1, 6] Max Struct:[8, 8, 8]
[2024-06-01 18:47:32] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-06-01 18:47:32] [INFO ] Invariant cache hit.
[2024-06-01 18:47:32] [INFO ] [Real]Absence check using 23 positive place invariants in 83 ms returned sat
[2024-06-01 18:47:32] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 29 ms returned sat
[2024-06-01 18:47:34] [INFO ] [Real]Absence check using state equation in 1626 ms returned sat
[2024-06-01 18:47:34] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-06-01 18:47:34] [INFO ] [Real]Added 497 Read/Feed constraints in 78 ms returned sat
[2024-06-01 18:47:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:47:35] [INFO ] [Nat]Absence check using 23 positive place invariants in 85 ms returned sat
[2024-06-01 18:47:35] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 28 ms returned sat
[2024-06-01 18:47:36] [INFO ] [Nat]Absence check using state equation in 1257 ms returned sat
[2024-06-01 18:47:36] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 18:47:37] [INFO ] [Nat]Added 497 Read/Feed constraints in 755 ms returned sat
[2024-06-01 18:47:37] [INFO ] Computed and/alt/rep : 2640/5840/2640 causal constraints (skipped 112 transitions) in 445 ms.
[2024-06-01 18:47:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 18:47:40] [INFO ] [Real]Absence check using 23 positive place invariants in 83 ms returned sat
[2024-06-01 18:47:40] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 32 ms returned sat
[2024-06-01 18:47:41] [INFO ] [Real]Absence check using state equation in 1756 ms returned sat
[2024-06-01 18:47:42] [INFO ] [Real]Added 497 Read/Feed constraints in 318 ms returned sat
[2024-06-01 18:47:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:47:43] [INFO ] [Nat]Absence check using 23 positive place invariants in 79 ms returned sat
[2024-06-01 18:47:43] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 30 ms returned sat
[2024-06-01 18:47:45] [INFO ] [Nat]Absence check using state equation in 1905 ms returned sat
[2024-06-01 18:47:45] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 18:47:46] [INFO ] [Nat]Added 497 Read/Feed constraints in 1074 ms returned unknown
[2024-06-01 18:47:46] [INFO ] [Real]Absence check using 23 positive place invariants in 48 ms returned sat
[2024-06-01 18:47:46] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 20 ms returned sat
[2024-06-01 18:47:48] [INFO ] [Real]Absence check using state equation in 2249 ms returned sat
[2024-06-01 18:47:49] [INFO ] [Real]Added 497 Read/Feed constraints in 298 ms returned sat
[2024-06-01 18:47:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:47:49] [INFO ] [Nat]Absence check using 23 positive place invariants in 84 ms returned sat
[2024-06-01 18:47:49] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 30 ms returned sat
[2024-06-01 18:47:52] [INFO ] [Nat]Absence check using state equation in 2566 ms returned sat
[2024-06-01 18:47:53] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 18:47:53] [INFO ] [Nat]Added 497 Read/Feed constraints in 1052 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[2, 1, 6] Max Struct:[8, 8, 8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 1, 6] Max Struct:[8, 8, 8]
Support contains 512 out of 1992 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 392 transitions
Trivial Post-agglo rules discarded 392 transitions
Performed 392 trivial Post agglomeration. Transition count delta: 392
Iterating post reduction 0 with 392 rules applied. Total rules applied 392 place count 1992 transition count 2704
Reduce places removed 392 places and 0 transitions.
Performed 392 Post agglomeration using F-continuation condition.Transition count delta: 392
Iterating post reduction 1 with 784 rules applied. Total rules applied 1176 place count 1600 transition count 2312
Reduce places removed 392 places and 0 transitions.
Iterating post reduction 2 with 392 rules applied. Total rules applied 1568 place count 1208 transition count 2312
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 1568 place count 1208 transition count 2256
Deduced a syphon composed of 56 places in 7 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 1680 place count 1152 transition count 2256
Applied a total of 1680 rules in 619 ms. Remains 1152 /1992 variables (removed 840) and now considering 2256/3096 (removed 840) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 639 ms. Remains : 1152/1992 places, 2256/3096 transitions.
[2024-06-01 18:47:54] [INFO ] Flow matrix only has 1920 transitions (discarded 336 similar events)
// Phase 1: matrix 1920 rows 1152 cols
[2024-06-01 18:47:54] [INFO ] Computed 31 invariants in 27 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2, 1, 6] Max Struct:[8, 8, 8]
RANDOM walk for 1000000 steps (2 resets) in 12987 ms. (76 steps per ms)
BEST_FIRST walk for 2566688 steps (5 resets) in 9284 ms. (276 steps per ms)
FORMULA Peterson-COL-7-UpperBounds-12 8 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[6, 1] Max Struct:[8, 8]
[2024-06-01 18:48:16] [INFO ] Flow matrix only has 1920 transitions (discarded 336 similar events)
[2024-06-01 18:48:16] [INFO ] Invariant cache hit.
[2024-06-01 18:48:16] [INFO ] [Real]Absence check using 23 positive place invariants in 29 ms returned sat
[2024-06-01 18:48:16] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 13 ms returned sat
[2024-06-01 18:48:17] [INFO ] [Real]Absence check using state equation in 931 ms returned sat
[2024-06-01 18:48:17] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-06-01 18:48:17] [INFO ] [Real]Added 497 Read/Feed constraints in 170 ms returned sat
[2024-06-01 18:48:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:48:18] [INFO ] [Nat]Absence check using 23 positive place invariants in 47 ms returned sat
[2024-06-01 18:48:18] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 20 ms returned sat
[2024-06-01 18:48:19] [INFO ] [Nat]Absence check using state equation in 1059 ms returned sat
[2024-06-01 18:48:19] [INFO ] [Nat]Added 497 Read/Feed constraints in 395 ms returned sat
[2024-06-01 18:48:20] [INFO ] Computed and/alt/rep : 1800/5000/1800 causal constraints (skipped 112 transitions) in 218 ms.
[2024-06-01 18:48:30] [INFO ] Deduced a trap composed of 141 places in 1249 ms of which 104 ms to minimize.
[2024-06-01 18:48:31] [INFO ] Deduced a trap composed of 85 places in 841 ms of which 18 ms to minimize.
[2024-06-01 18:48:33] [INFO ] Deduced a trap composed of 162 places in 1478 ms of which 16 ms to minimize.
[2024-06-01 18:48:35] [INFO ] Deduced a trap composed of 36 places in 1022 ms of which 9 ms to minimize.
[2024-06-01 18:48:36] [INFO ] Deduced a trap composed of 130 places in 1363 ms of which 16 ms to minimize.
[2024-06-01 18:48:38] [INFO ] Deduced a trap composed of 143 places in 1053 ms of which 10 ms to minimize.
[2024-06-01 18:48:40] [INFO ] Deduced a trap composed of 108 places in 1260 ms of which 10 ms to minimize.
[2024-06-01 18:48:41] [INFO ] Deduced a trap composed of 90 places in 1293 ms of which 13 ms to minimize.
[2024-06-01 18:48:43] [INFO ] Deduced a trap composed of 62 places in 1021 ms of which 9 ms to minimize.
[2024-06-01 18:48:44] [INFO ] Deduced a trap composed of 72 places in 800 ms of which 8 ms to minimize.
[2024-06-01 18:48:45] [INFO ] Deduced a trap composed of 102 places in 809 ms of which 8 ms to minimize.
[2024-06-01 18:48:45] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 15741 ms
[2024-06-01 18:48:45] [INFO ] Added : 208 causal constraints over 42 iterations in 25905 ms.(timeout) Result :sat
Minimization took 1484 ms.
[2024-06-01 18:48:47] [INFO ] [Real]Absence check using 23 positive place invariants in 28 ms returned sat
[2024-06-01 18:48:47] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 13 ms returned sat
[2024-06-01 18:48:48] [INFO ] [Real]Absence check using state equation in 833 ms returned sat
[2024-06-01 18:48:48] [INFO ] [Real]Added 497 Read/Feed constraints in 71 ms returned sat
[2024-06-01 18:48:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:48:48] [INFO ] [Nat]Absence check using 23 positive place invariants in 28 ms returned sat
[2024-06-01 18:48:48] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 13 ms returned sat
[2024-06-01 18:48:49] [INFO ] [Nat]Absence check using state equation in 775 ms returned sat
[2024-06-01 18:48:50] [INFO ] [Nat]Added 497 Read/Feed constraints in 583 ms returned sat
[2024-06-01 18:48:51] [INFO ] Deduced a trap composed of 28 places in 1347 ms of which 15 ms to minimize.
[2024-06-01 18:48:53] [INFO ] Deduced a trap composed of 13 places in 1204 ms of which 13 ms to minimize.
[2024-06-01 18:48:54] [INFO ] Deduced a trap composed of 73 places in 1390 ms of which 15 ms to minimize.
[2024-06-01 18:48:56] [INFO ] Deduced a trap composed of 44 places in 1374 ms of which 15 ms to minimize.
[2024-06-01 18:48:57] [INFO ] Deduced a trap composed of 114 places in 1388 ms of which 14 ms to minimize.
[2024-06-01 18:48:58] [INFO ] Deduced a trap composed of 13 places in 1283 ms of which 15 ms to minimize.
[2024-06-01 18:49:00] [INFO ] Deduced a trap composed of 51 places in 1250 ms of which 15 ms to minimize.
[2024-06-01 18:49:01] [INFO ] Deduced a trap composed of 80 places in 1351 ms of which 14 ms to minimize.
[2024-06-01 18:49:03] [INFO ] Deduced a trap composed of 140 places in 1055 ms of which 10 ms to minimize.
[2024-06-01 18:49:04] [INFO ] Deduced a trap composed of 70 places in 1166 ms of which 9 ms to minimize.
[2024-06-01 18:49:05] [INFO ] Deduced a trap composed of 34 places in 1316 ms of which 14 ms to minimize.
[2024-06-01 18:49:07] [INFO ] Deduced a trap composed of 32 places in 1353 ms of which 14 ms to minimize.
[2024-06-01 18:49:08] [INFO ] Deduced a trap composed of 43 places in 1428 ms of which 15 ms to minimize.
[2024-06-01 18:49:10] [INFO ] Deduced a trap composed of 67 places in 1262 ms of which 14 ms to minimize.
[2024-06-01 18:49:11] [INFO ] Deduced a trap composed of 32 places in 1394 ms of which 14 ms to minimize.
[2024-06-01 18:49:13] [INFO ] Deduced a trap composed of 68 places in 1235 ms of which 14 ms to minimize.
[2024-06-01 18:49:15] [INFO ] Deduced a trap composed of 56 places in 1403 ms of which 14 ms to minimize.
[2024-06-01 18:49:16] [INFO ] Deduced a trap composed of 41 places in 1403 ms of which 14 ms to minimize.
[2024-06-01 18:49:18] [INFO ] Deduced a trap composed of 26 places in 1425 ms of which 15 ms to minimize.
[2024-06-01 18:49:19] [INFO ] Deduced a trap composed of 17 places in 1410 ms of which 14 ms to minimize.
[2024-06-01 18:49:20] [INFO ] Deduced a trap composed of 42 places in 983 ms of which 8 ms to minimize.
[2024-06-01 18:49:22] [INFO ] Deduced a trap composed of 15 places in 1084 ms of which 13 ms to minimize.
[2024-06-01 18:49:23] [INFO ] Deduced a trap composed of 125 places in 1297 ms of which 14 ms to minimize.
[2024-06-01 18:49:24] [INFO ] Deduced a trap composed of 60 places in 1291 ms of which 15 ms to minimize.
[2024-06-01 18:49:26] [INFO ] Deduced a trap composed of 34 places in 1357 ms of which 15 ms to minimize.
[2024-06-01 18:49:27] [INFO ] Deduced a trap composed of 49 places in 1340 ms of which 14 ms to minimize.
[2024-06-01 18:49:29] [INFO ] Deduced a trap composed of 73 places in 1223 ms of which 13 ms to minimize.
[2024-06-01 18:49:30] [INFO ] Deduced a trap composed of 35 places in 1200 ms of which 13 ms to minimize.
[2024-06-01 18:49:31] [INFO ] Deduced a trap composed of 136 places in 1166 ms of which 13 ms to minimize.
[2024-06-01 18:49:33] [INFO ] Deduced a trap composed of 34 places in 1199 ms of which 14 ms to minimize.
[2024-06-01 18:49:34] [INFO ] Deduced a trap composed of 25 places in 1163 ms of which 14 ms to minimize.
[2024-06-01 18:49:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[6, 1] Max Struct:[8, 8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6, 1] Max Struct:[8, 8]
Support contains 456 out of 1152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1152/1152 places, 2256/2256 transitions.
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 48 Pre rules applied. Total rules applied 0 place count 1152 transition count 2208
Deduced a syphon composed of 48 places in 3 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 0 with 96 rules applied. Total rules applied 96 place count 1104 transition count 2208
Applied a total of 96 rules in 133 ms. Remains 1104 /1152 variables (removed 48) and now considering 2208/2256 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 1104/1152 places, 2208/2256 transitions.
[2024-06-01 18:49:38] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1104 cols
[2024-06-01 18:49:38] [INFO ] Computed 31 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[6, 1] Max Struct:[8, 8]
RANDOM walk for 1000000 steps (2 resets) in 10649 ms. (93 steps per ms)
BEST_FIRST walk for 1630443 steps (3 resets) in 6684 ms. (243 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7, 1] Max Struct:[8, 8]
[2024-06-01 18:49:56] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2024-06-01 18:49:56] [INFO ] Invariant cache hit.
[2024-06-01 18:49:56] [INFO ] [Real]Absence check using 23 positive place invariants in 30 ms returned sat
[2024-06-01 18:49:56] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 12 ms returned sat
[2024-06-01 18:49:56] [INFO ] [Real]Absence check using state equation in 737 ms returned sat
[2024-06-01 18:49:57] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-06-01 18:49:57] [INFO ] [Real]Added 497 Read/Feed constraints in 165 ms returned sat
[2024-06-01 18:49:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:49:57] [INFO ] [Nat]Absence check using 23 positive place invariants in 29 ms returned sat
[2024-06-01 18:49:57] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 11 ms returned sat
[2024-06-01 18:49:58] [INFO ] [Nat]Absence check using state equation in 720 ms returned sat
[2024-06-01 18:49:58] [INFO ] [Nat]Added 497 Read/Feed constraints in 251 ms returned sat
[2024-06-01 18:49:59] [INFO ] Deduced a trap composed of 57 places in 1000 ms of which 10 ms to minimize.
[2024-06-01 18:50:00] [INFO ] Deduced a trap composed of 50 places in 861 ms of which 9 ms to minimize.
[2024-06-01 18:50:01] [INFO ] Deduced a trap composed of 67 places in 930 ms of which 10 ms to minimize.
[2024-06-01 18:50:02] [INFO ] Deduced a trap composed of 164 places in 874 ms of which 9 ms to minimize.
[2024-06-01 18:50:03] [INFO ] Deduced a trap composed of 164 places in 1019 ms of which 15 ms to minimize.
[2024-06-01 18:50:04] [INFO ] Deduced a trap composed of 100 places in 805 ms of which 12 ms to minimize.
[2024-06-01 18:50:04] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 6120 ms
[2024-06-01 18:50:04] [INFO ] Computed and/alt/rep : 1752/5288/1752 causal constraints (skipped 112 transitions) in 224 ms.
[2024-06-01 18:50:11] [INFO ] Deduced a trap composed of 51 places in 962 ms of which 9 ms to minimize.
[2024-06-01 18:50:12] [INFO ] Deduced a trap composed of 27 places in 998 ms of which 10 ms to minimize.
[2024-06-01 18:50:13] [INFO ] Deduced a trap composed of 62 places in 932 ms of which 10 ms to minimize.
[2024-06-01 18:50:14] [INFO ] Deduced a trap composed of 42 places in 962 ms of which 14 ms to minimize.
[2024-06-01 18:50:15] [INFO ] Deduced a trap composed of 118 places in 1011 ms of which 10 ms to minimize.
[2024-06-01 18:50:16] [INFO ] Deduced a trap composed of 75 places in 994 ms of which 10 ms to minimize.
[2024-06-01 18:50:18] [INFO ] Deduced a trap composed of 25 places in 986 ms of which 14 ms to minimize.
[2024-06-01 18:50:19] [INFO ] Deduced a trap composed of 67 places in 699 ms of which 10 ms to minimize.
[2024-06-01 18:50:19] [INFO ] Deduced a trap composed of 121 places in 568 ms of which 7 ms to minimize.
[2024-06-01 18:50:20] [INFO ] Deduced a trap composed of 91 places in 597 ms of which 7 ms to minimize.
[2024-06-01 18:50:21] [INFO ] Deduced a trap composed of 15 places in 1021 ms of which 14 ms to minimize.
[2024-06-01 18:50:22] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 11859 ms
[2024-06-01 18:50:22] [INFO ] Added : 200 causal constraints over 41 iterations in 17769 ms. Result :sat
Minimization took 1034 ms.
[2024-06-01 18:50:23] [INFO ] [Real]Absence check using 23 positive place invariants in 31 ms returned sat
[2024-06-01 18:50:23] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 12 ms returned sat
[2024-06-01 18:50:24] [INFO ] [Real]Absence check using state equation in 762 ms returned sat
[2024-06-01 18:50:24] [INFO ] [Real]Added 497 Read/Feed constraints in 84 ms returned sat
[2024-06-01 18:50:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:50:24] [INFO ] [Nat]Absence check using 23 positive place invariants in 29 ms returned sat
[2024-06-01 18:50:24] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 12 ms returned sat
[2024-06-01 18:50:25] [INFO ] [Nat]Absence check using state equation in 737 ms returned sat
[2024-06-01 18:50:26] [INFO ] [Nat]Added 497 Read/Feed constraints in 513 ms returned sat
[2024-06-01 18:50:27] [INFO ] Deduced a trap composed of 39 places in 840 ms of which 9 ms to minimize.
[2024-06-01 18:50:27] [INFO ] Deduced a trap composed of 15 places in 831 ms of which 13 ms to minimize.
[2024-06-01 18:50:29] [INFO ] Deduced a trap composed of 89 places in 1035 ms of which 12 ms to minimize.
[2024-06-01 18:50:30] [INFO ] Deduced a trap composed of 127 places in 871 ms of which 8 ms to minimize.
[2024-06-01 18:50:31] [INFO ] Deduced a trap composed of 64 places in 863 ms of which 9 ms to minimize.
[2024-06-01 18:50:32] [INFO ] Deduced a trap composed of 50 places in 885 ms of which 12 ms to minimize.
[2024-06-01 18:50:33] [INFO ] Deduced a trap composed of 56 places in 989 ms of which 13 ms to minimize.
[2024-06-01 18:50:34] [INFO ] Deduced a trap composed of 67 places in 864 ms of which 8 ms to minimize.
[2024-06-01 18:50:35] [INFO ] Deduced a trap composed of 49 places in 897 ms of which 12 ms to minimize.
[2024-06-01 18:50:36] [INFO ] Deduced a trap composed of 46 places in 950 ms of which 14 ms to minimize.
[2024-06-01 18:50:37] [INFO ] Deduced a trap composed of 49 places in 849 ms of which 8 ms to minimize.
[2024-06-01 18:50:38] [INFO ] Deduced a trap composed of 130 places in 897 ms of which 13 ms to minimize.
[2024-06-01 18:50:39] [INFO ] Deduced a trap composed of 13 places in 859 ms of which 9 ms to minimize.
[2024-06-01 18:50:40] [INFO ] Deduced a trap composed of 49 places in 861 ms of which 13 ms to minimize.
[2024-06-01 18:50:41] [INFO ] Deduced a trap composed of 34 places in 876 ms of which 13 ms to minimize.
[2024-06-01 18:50:42] [INFO ] Deduced a trap composed of 59 places in 830 ms of which 8 ms to minimize.
[2024-06-01 18:50:42] [INFO ] Deduced a trap composed of 46 places in 764 ms of which 8 ms to minimize.
[2024-06-01 18:50:43] [INFO ] Deduced a trap composed of 31 places in 739 ms of which 8 ms to minimize.
[2024-06-01 18:50:44] [INFO ] Deduced a trap composed of 85 places in 712 ms of which 8 ms to minimize.
[2024-06-01 18:50:45] [INFO ] Deduced a trap composed of 31 places in 786 ms of which 9 ms to minimize.
[2024-06-01 18:50:46] [INFO ] Deduced a trap composed of 67 places in 776 ms of which 8 ms to minimize.
[2024-06-01 18:50:47] [INFO ] Deduced a trap composed of 30 places in 785 ms of which 9 ms to minimize.
[2024-06-01 18:50:47] [INFO ] Deduced a trap composed of 14 places in 776 ms of which 8 ms to minimize.
[2024-06-01 18:50:48] [INFO ] Deduced a trap composed of 41 places in 820 ms of which 9 ms to minimize.
[2024-06-01 18:50:49] [INFO ] Deduced a trap composed of 57 places in 866 ms of which 8 ms to minimize.
[2024-06-01 18:50:50] [INFO ] Deduced a trap composed of 20 places in 975 ms of which 9 ms to minimize.
[2024-06-01 18:50:51] [INFO ] Deduced a trap composed of 46 places in 812 ms of which 10 ms to minimize.
[2024-06-01 18:50:53] [INFO ] Deduced a trap composed of 11 places in 944 ms of which 12 ms to minimize.
[2024-06-01 18:50:54] [INFO ] Deduced a trap composed of 35 places in 856 ms of which 9 ms to minimize.
[2024-06-01 18:50:55] [INFO ] Deduced a trap composed of 33 places in 834 ms of which 9 ms to minimize.
[2024-06-01 18:50:56] [INFO ] Deduced a trap composed of 119 places in 847 ms of which 12 ms to minimize.
[2024-06-01 18:50:57] [INFO ] Deduced a trap composed of 47 places in 900 ms of which 13 ms to minimize.
[2024-06-01 18:50:58] [INFO ] Deduced a trap composed of 83 places in 784 ms of which 8 ms to minimize.
[2024-06-01 18:50:59] [INFO ] Deduced a trap composed of 56 places in 813 ms of which 8 ms to minimize.
[2024-06-01 18:51:00] [INFO ] Deduced a trap composed of 34 places in 784 ms of which 9 ms to minimize.
[2024-06-01 18:51:01] [INFO ] Deduced a trap composed of 57 places in 818 ms of which 8 ms to minimize.
[2024-06-01 18:51:02] [INFO ] Deduced a trap composed of 30 places in 858 ms of which 12 ms to minimize.
[2024-06-01 18:51:07] [INFO ] Deduced a trap composed of 23 places in 854 ms of which 9 ms to minimize.
[2024-06-01 18:51:08] [INFO ] Deduced a trap composed of 20 places in 852 ms of which 12 ms to minimize.
[2024-06-01 18:51:09] [INFO ] Deduced a trap composed of 50 places in 1002 ms of which 13 ms to minimize.
[2024-06-01 18:51:09] [INFO ] Trap strengthening (SAT) tested/added 40/40 trap constraints in 43540 ms
Current structural bounds on expressions (after SMT) : Max Seen:[7, 1] Max Struct:[8, 8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7, 1] Max Struct:[8, 8]
Support contains 456 out of 1104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1104/1104 places, 2208/2208 transitions.
Applied a total of 0 rules in 53 ms. Remains 1104 /1104 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 1104/1104 places, 2208/2208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1104/1104 places, 2208/2208 transitions.
Applied a total of 0 rules in 43 ms. Remains 1104 /1104 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
[2024-06-01 18:51:10] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2024-06-01 18:51:10] [INFO ] Invariant cache hit.
[2024-06-01 18:51:11] [INFO ] Implicit Places using invariants in 729 ms returned [0, 1, 2, 3, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 734 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1096/1104 places, 2208/2208 transitions.
Applied a total of 0 rules in 41 ms. Remains 1096 /1096 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 823 ms. Remains : 1096/1104 places, 2208/2208 transitions.
[2024-06-01 18:51:11] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1096 cols
[2024-06-01 18:51:11] [INFO ] Computed 23 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[7, 1] Max Struct:[8, 8]
RANDOM walk for 1000000 steps (2 resets) in 10677 ms. (93 steps per ms)
BEST_FIRST walk for 1520157 steps (3 resets) in 6753 ms. (225 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7, 1] Max Struct:[8, 8]
[2024-06-01 18:51:29] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2024-06-01 18:51:29] [INFO ] Invariant cache hit.
[2024-06-01 18:51:29] [INFO ] [Real]Absence check using 23 positive place invariants in 24 ms returned sat
[2024-06-01 18:51:30] [INFO ] [Real]Absence check using state equation in 730 ms returned sat
[2024-06-01 18:51:30] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-06-01 18:51:30] [INFO ] [Real]Added 497 Read/Feed constraints in 117 ms returned sat
[2024-06-01 18:51:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:51:30] [INFO ] [Nat]Absence check using 23 positive place invariants in 27 ms returned sat
[2024-06-01 18:51:31] [INFO ] [Nat]Absence check using state equation in 733 ms returned sat
[2024-06-01 18:51:31] [INFO ] [Nat]Added 497 Read/Feed constraints in 243 ms returned sat
[2024-06-01 18:51:32] [INFO ] Deduced a trap composed of 11 places in 877 ms of which 9 ms to minimize.
[2024-06-01 18:51:33] [INFO ] Deduced a trap composed of 88 places in 973 ms of which 10 ms to minimize.
[2024-06-01 18:51:34] [INFO ] Deduced a trap composed of 87 places in 936 ms of which 10 ms to minimize.
[2024-06-01 18:51:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3227 ms
[2024-06-01 18:51:34] [INFO ] Computed and/alt/rep : 1752/5288/1752 causal constraints (skipped 112 transitions) in 156 ms.
[2024-06-01 18:51:40] [INFO ] Deduced a trap composed of 53 places in 1033 ms of which 10 ms to minimize.
[2024-06-01 18:51:41] [INFO ] Deduced a trap composed of 40 places in 669 ms of which 8 ms to minimize.
[2024-06-01 18:51:42] [INFO ] Deduced a trap composed of 27 places in 685 ms of which 8 ms to minimize.
[2024-06-01 18:51:43] [INFO ] Deduced a trap composed of 31 places in 683 ms of which 10 ms to minimize.
[2024-06-01 18:51:43] [INFO ] Deduced a trap composed of 31 places in 682 ms of which 8 ms to minimize.
[2024-06-01 18:51:44] [INFO ] Deduced a trap composed of 33 places in 961 ms of which 10 ms to minimize.
[2024-06-01 18:51:46] [INFO ] Deduced a trap composed of 17 places in 944 ms of which 10 ms to minimize.
[2024-06-01 18:51:47] [INFO ] Deduced a trap composed of 24 places in 1130 ms of which 14 ms to minimize.
[2024-06-01 18:51:48] [INFO ] Deduced a trap composed of 29 places in 1054 ms of which 15 ms to minimize.
[2024-06-01 18:51:49] [INFO ] Deduced a trap composed of 116 places in 946 ms of which 10 ms to minimize.
[2024-06-01 18:51:51] [INFO ] Deduced a trap composed of 20 places in 1109 ms of which 14 ms to minimize.
[2024-06-01 18:51:53] [INFO ] Deduced a trap composed of 23 places in 1051 ms of which 14 ms to minimize.
[2024-06-01 18:51:54] [INFO ] Deduced a trap composed of 32 places in 1070 ms of which 14 ms to minimize.
[2024-06-01 18:51:55] [INFO ] Deduced a trap composed of 38 places in 1014 ms of which 10 ms to minimize.
[2024-06-01 18:51:56] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 16466 ms
[2024-06-01 18:51:56] [INFO ] Added : 174 causal constraints over 36 iterations in 21637 ms.(timeout) Result :sat
Minimization took 779 ms.
[2024-06-01 18:51:57] [INFO ] [Real]Absence check using 23 positive place invariants in 23 ms returned sat
[2024-06-01 18:51:58] [INFO ] [Real]Absence check using state equation in 734 ms returned sat
[2024-06-01 18:51:58] [INFO ] [Real]Added 497 Read/Feed constraints in 71 ms returned sat
[2024-06-01 18:51:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:51:58] [INFO ] [Nat]Absence check using 23 positive place invariants in 24 ms returned sat
[2024-06-01 18:51:59] [INFO ] [Nat]Absence check using state equation in 719 ms returned sat
[2024-06-01 18:51:59] [INFO ] [Nat]Added 497 Read/Feed constraints in 518 ms returned sat
[2024-06-01 18:52:00] [INFO ] Deduced a trap composed of 104 places in 842 ms of which 9 ms to minimize.
[2024-06-01 18:52:01] [INFO ] Deduced a trap composed of 51 places in 916 ms of which 13 ms to minimize.
[2024-06-01 18:52:02] [INFO ] Deduced a trap composed of 15 places in 851 ms of which 9 ms to minimize.
[2024-06-01 18:52:03] [INFO ] Deduced a trap composed of 96 places in 848 ms of which 8 ms to minimize.
[2024-06-01 18:52:04] [INFO ] Deduced a trap composed of 54 places in 856 ms of which 8 ms to minimize.
[2024-06-01 18:52:05] [INFO ] Deduced a trap composed of 40 places in 857 ms of which 8 ms to minimize.
[2024-06-01 18:52:06] [INFO ] Deduced a trap composed of 77 places in 846 ms of which 9 ms to minimize.
[2024-06-01 18:52:07] [INFO ] Deduced a trap composed of 56 places in 974 ms of which 13 ms to minimize.
[2024-06-01 18:52:08] [INFO ] Deduced a trap composed of 31 places in 996 ms of which 13 ms to minimize.
[2024-06-01 18:52:09] [INFO ] Deduced a trap composed of 28 places in 960 ms of which 13 ms to minimize.
[2024-06-01 18:52:10] [INFO ] Deduced a trap composed of 24 places in 873 ms of which 9 ms to minimize.
[2024-06-01 18:52:11] [INFO ] Deduced a trap composed of 15 places in 887 ms of which 12 ms to minimize.
[2024-06-01 18:52:12] [INFO ] Deduced a trap composed of 24 places in 964 ms of which 13 ms to minimize.
[2024-06-01 18:52:13] [INFO ] Deduced a trap composed of 29 places in 854 ms of which 9 ms to minimize.
[2024-06-01 18:52:14] [INFO ] Deduced a trap composed of 31 places in 805 ms of which 8 ms to minimize.
[2024-06-01 18:52:15] [INFO ] Deduced a trap composed of 26 places in 814 ms of which 8 ms to minimize.
[2024-06-01 18:52:16] [INFO ] Deduced a trap composed of 33 places in 807 ms of which 8 ms to minimize.
[2024-06-01 18:52:17] [INFO ] Deduced a trap composed of 66 places in 781 ms of which 8 ms to minimize.
[2024-06-01 18:52:18] [INFO ] Deduced a trap composed of 48 places in 780 ms of which 8 ms to minimize.
[2024-06-01 18:52:19] [INFO ] Deduced a trap composed of 49 places in 823 ms of which 8 ms to minimize.
[2024-06-01 18:52:20] [INFO ] Deduced a trap composed of 13 places in 1021 ms of which 12 ms to minimize.
[2024-06-01 18:52:21] [INFO ] Deduced a trap composed of 74 places in 932 ms of which 12 ms to minimize.
[2024-06-01 18:52:22] [INFO ] Deduced a trap composed of 50 places in 820 ms of which 9 ms to minimize.
[2024-06-01 18:52:23] [INFO ] Deduced a trap composed of 71 places in 860 ms of which 8 ms to minimize.
[2024-06-01 18:52:24] [INFO ] Deduced a trap composed of 50 places in 865 ms of which 12 ms to minimize.
[2024-06-01 18:52:25] [INFO ] Deduced a trap composed of 29 places in 925 ms of which 9 ms to minimize.
[2024-06-01 18:52:26] [INFO ] Deduced a trap composed of 37 places in 807 ms of which 8 ms to minimize.
[2024-06-01 18:52:28] [INFO ] Deduced a trap composed of 13 places in 979 ms of which 13 ms to minimize.
[2024-06-01 18:52:29] [INFO ] Deduced a trap composed of 80 places in 870 ms of which 9 ms to minimize.
[2024-06-01 18:52:30] [INFO ] Deduced a trap composed of 72 places in 894 ms of which 13 ms to minimize.
[2024-06-01 18:52:31] [INFO ] Deduced a trap composed of 123 places in 828 ms of which 9 ms to minimize.
[2024-06-01 18:52:31] [INFO ] Deduced a trap composed of 19 places in 839 ms of which 13 ms to minimize.
[2024-06-01 18:52:32] [INFO ] Deduced a trap composed of 135 places in 878 ms of which 9 ms to minimize.
[2024-06-01 18:52:33] [INFO ] Deduced a trap composed of 97 places in 834 ms of which 11 ms to minimize.
[2024-06-01 18:52:34] [INFO ] Deduced a trap composed of 140 places in 809 ms of which 8 ms to minimize.
[2024-06-01 18:52:35] [INFO ] Deduced a trap composed of 46 places in 778 ms of which 8 ms to minimize.
[2024-06-01 18:52:36] [INFO ] Deduced a trap composed of 93 places in 741 ms of which 8 ms to minimize.
[2024-06-01 18:52:37] [INFO ] Deduced a trap composed of 73 places in 793 ms of which 9 ms to minimize.
[2024-06-01 18:52:38] [INFO ] Deduced a trap composed of 48 places in 885 ms of which 9 ms to minimize.
[2024-06-01 18:52:39] [INFO ] Deduced a trap composed of 48 places in 770 ms of which 8 ms to minimize.
[2024-06-01 18:52:40] [INFO ] Deduced a trap composed of 83 places in 765 ms of which 9 ms to minimize.
[2024-06-01 18:52:40] [INFO ] Deduced a trap composed of 110 places in 828 ms of which 12 ms to minimize.
[2024-06-01 18:52:41] [INFO ] Deduced a trap composed of 51 places in 929 ms of which 12 ms to minimize.
[2024-06-01 18:52:42] [INFO ] Deduced a trap composed of 134 places in 861 ms of which 9 ms to minimize.
[2024-06-01 18:52:43] [INFO ] Deduced a trap composed of 71 places in 756 ms of which 8 ms to minimize.
[2024-06-01 18:52:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[7, 1] Max Struct:[8, 8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7, 1] Max Struct:[8, 8]
Support contains 456 out of 1096 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1096/1096 places, 2208/2208 transitions.
Applied a total of 0 rules in 40 ms. Remains 1096 /1096 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 1096/1096 places, 2208/2208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1096/1096 places, 2208/2208 transitions.
Applied a total of 0 rules in 39 ms. Remains 1096 /1096 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
[2024-06-01 18:52:45] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2024-06-01 18:52:45] [INFO ] Invariant cache hit.
[2024-06-01 18:52:46] [INFO ] Implicit Places using invariants in 725 ms returned []
[2024-06-01 18:52:46] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2024-06-01 18:52:46] [INFO ] Invariant cache hit.
[2024-06-01 18:52:47] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-06-01 18:52:52] [INFO ] Implicit Places using invariants and state equation in 6361 ms returned []
Implicit Place search using SMT with State Equation took 7090 ms to find 0 implicit places.
[2024-06-01 18:52:53] [INFO ] Redundant transitions in 181 ms returned []
Running 2200 sub problems to find dead transitions.
[2024-06-01 18:52:53] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2024-06-01 18:52:53] [INFO ] Invariant cache hit.
[2024-06-01 18:52:53] [INFO ] State equation strengthened by 497 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1096 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 2200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1096/2968 variables, and 23 constraints, problems are : Problem set: 0 solved, 2200 unsolved in 30100 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/1096 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 2200/2200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1096 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 2200 unsolved
[2024-06-01 18:53:27] [INFO ] Deduced a trap composed of 66 places in 776 ms of which 9 ms to minimize.
[2024-06-01 18:53:28] [INFO ] Deduced a trap composed of 17 places in 808 ms of which 8 ms to minimize.
[2024-06-01 18:53:29] [INFO ] Deduced a trap composed of 55 places in 914 ms of which 12 ms to minimize.
[2024-06-01 18:53:30] [INFO ] Deduced a trap composed of 75 places in 1070 ms of which 14 ms to minimize.
[2024-06-01 18:53:31] [INFO ] Deduced a trap composed of 19 places in 1079 ms of which 14 ms to minimize.
[2024-06-01 18:53:32] [INFO ] Deduced a trap composed of 68 places in 884 ms of which 8 ms to minimize.
[2024-06-01 18:53:33] [INFO ] Deduced a trap composed of 28 places in 884 ms of which 9 ms to minimize.
[2024-06-01 18:53:34] [INFO ] Deduced a trap composed of 71 places in 812 ms of which 9 ms to minimize.
[2024-06-01 18:53:35] [INFO ] Deduced a trap composed of 64 places in 809 ms of which 9 ms to minimize.
[2024-06-01 18:53:35] [INFO ] Deduced a trap composed of 76 places in 811 ms of which 9 ms to minimize.
[2024-06-01 18:53:36] [INFO ] Deduced a trap composed of 70 places in 832 ms of which 9 ms to minimize.
[2024-06-01 18:53:37] [INFO ] Deduced a trap composed of 80 places in 830 ms of which 9 ms to minimize.
[2024-06-01 18:53:38] [INFO ] Deduced a trap composed of 51 places in 837 ms of which 8 ms to minimize.
[2024-06-01 18:53:39] [INFO ] Deduced a trap composed of 28 places in 864 ms of which 9 ms to minimize.
[2024-06-01 18:53:40] [INFO ] Deduced a trap composed of 37 places in 850 ms of which 9 ms to minimize.
[2024-06-01 18:53:41] [INFO ] Deduced a trap composed of 80 places in 873 ms of which 9 ms to minimize.
[2024-06-01 18:53:42] [INFO ] Deduced a trap composed of 38 places in 957 ms of which 13 ms to minimize.
[2024-06-01 18:53:43] [INFO ] Deduced a trap composed of 62 places in 929 ms of which 8 ms to minimize.
[2024-06-01 18:53:44] [INFO ] Deduced a trap composed of 49 places in 933 ms of which 13 ms to minimize.
[2024-06-01 18:53:44] [INFO ] Deduced a trap composed of 40 places in 914 ms of which 9 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1096 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 2200 unsolved
[2024-06-01 18:53:46] [INFO ] Deduced a trap composed of 59 places in 690 ms of which 7 ms to minimize.
[2024-06-01 18:53:47] [INFO ] Deduced a trap composed of 49 places in 675 ms of which 8 ms to minimize.
[2024-06-01 18:53:48] [INFO ] Deduced a trap composed of 49 places in 682 ms of which 7 ms to minimize.
[2024-06-01 18:53:48] [INFO ] Deduced a trap composed of 78 places in 680 ms of which 7 ms to minimize.
[2024-06-01 18:53:49] [INFO ] Deduced a trap composed of 56 places in 690 ms of which 7 ms to minimize.
[2024-06-01 18:53:50] [INFO ] Deduced a trap composed of 80 places in 671 ms of which 7 ms to minimize.
[2024-06-01 18:53:50] [INFO ] Deduced a trap composed of 96 places in 647 ms of which 8 ms to minimize.
[2024-06-01 18:53:51] [INFO ] Deduced a trap composed of 77 places in 693 ms of which 8 ms to minimize.
[2024-06-01 18:53:52] [INFO ] Deduced a trap composed of 17 places in 689 ms of which 7 ms to minimize.
[2024-06-01 18:53:53] [INFO ] Deduced a trap composed of 39 places in 654 ms of which 7 ms to minimize.
[2024-06-01 18:53:53] [INFO ] Deduced a trap composed of 35 places in 669 ms of which 7 ms to minimize.
[2024-06-01 18:53:54] [INFO ] Deduced a trap composed of 17 places in 601 ms of which 7 ms to minimize.
[2024-06-01 18:53:55] [INFO ] Deduced a trap composed of 104 places in 735 ms of which 8 ms to minimize.
SMT process timed out in 61996ms, After SMT, problems are : Problem set: 0 solved, 2200 unsolved
Search for dead transitions found 0 dead transitions in 62071ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69410 ms. Remains : 1096/1096 places, 2208/2208 transitions.
RANDOM walk for 40000 steps (8 resets) in 1535 ms. (26 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 817 ms. (48 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 915 ms. (43 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 400 ms. (99 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 347 ms. (114 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 89820 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :0 out of 4
Probabilistic random walk after 89820 steps, saw 46377 distinct states, run finished after 3008 ms. (steps per millisecond=29 ) properties seen :0
[2024-06-01 18:53:59] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2024-06-01 18:53:59] [INFO ] Invariant cache hit.
[2024-06-01 18:53:59] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 576/1032 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 18:54:00] [INFO ] Deduced a trap composed of 90 places in 905 ms of which 9 ms to minimize.
[2024-06-01 18:54:01] [INFO ] Deduced a trap composed of 160 places in 876 ms of which 9 ms to minimize.
[2024-06-01 18:54:02] [INFO ] Deduced a trap composed of 62 places in 1010 ms of which 10 ms to minimize.
[2024-06-01 18:54:03] [INFO ] Deduced a trap composed of 132 places in 402 ms of which 5 ms to minimize.
[2024-06-01 18:54:03] [INFO ] Deduced a trap composed of 118 places in 399 ms of which 5 ms to minimize.
[2024-06-01 18:54:03] [INFO ] Deduced a trap composed of 146 places in 305 ms of which 4 ms to minimize.
[2024-06-01 18:54:04] [INFO ] Deduced a trap composed of 201 places in 200 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1032 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1032 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 8/1040 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1040/2968 variables, and 23 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 16/23 constraints, State Equation: 0/1096 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 576/1032 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1032 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1032 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 8/1040 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1040 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1872/2912 variables, 1040/1063 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2912 variables, 497/1560 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2912 variables, 4/1564 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2912/2968 variables, and 1564 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 16/23 constraints, State Equation: 1040/1096 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 7/7 constraints]
After SMT, in 10343ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 456 out of 1096 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1096/1096 places, 2208/2208 transitions.
Applied a total of 0 rules in 39 ms. Remains 1096 /1096 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 1096/1096 places, 2208/2208 transitions.
RANDOM walk for 40000 steps (8 resets) in 2193 ms. (18 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 843 ms. (47 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 813 ms. (49 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 226 ms. (176 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 99234 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :0 out of 4
Probabilistic random walk after 99234 steps, saw 47449 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
[2024-06-01 18:54:13] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2024-06-01 18:54:13] [INFO ] Invariant cache hit.
[2024-06-01 18:54:13] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 576/1032 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 18:54:15] [INFO ] Deduced a trap composed of 90 places in 949 ms of which 10 ms to minimize.
[2024-06-01 18:54:16] [INFO ] Deduced a trap composed of 160 places in 894 ms of which 9 ms to minimize.
[2024-06-01 18:54:17] [INFO ] Deduced a trap composed of 62 places in 916 ms of which 9 ms to minimize.
[2024-06-01 18:54:17] [INFO ] Deduced a trap composed of 132 places in 391 ms of which 5 ms to minimize.
[2024-06-01 18:54:18] [INFO ] Deduced a trap composed of 118 places in 392 ms of which 5 ms to minimize.
[2024-06-01 18:54:18] [INFO ] Deduced a trap composed of 146 places in 267 ms of which 4 ms to minimize.
[2024-06-01 18:54:18] [INFO ] Deduced a trap composed of 201 places in 170 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1032 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1032 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 8/1040 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 18:54:19] [INFO ] Deduced a trap composed of 146 places in 432 ms of which 5 ms to minimize.
[2024-06-01 18:54:19] [INFO ] Deduced a trap composed of 90 places in 400 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1040 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1040 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1872/2912 variables, 1040/1065 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2912 variables, 497/1562 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2912 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 56/2968 variables, 56/1618 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2968 variables, 7/1625 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/2968 variables, 0/1625 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/2968 variables, 0/1625 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2968/2968 variables, and 1625 constraints, problems are : Problem set: 0 solved, 4 unsolved in 8266 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 1096/1096 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 576/1032 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1032 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1032 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 8/1040 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1040 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1872/2912 variables, 1040/1065 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2912 variables, 497/1562 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2912 variables, 4/1566 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 18:54:26] [INFO ] Deduced a trap composed of 220 places in 174 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2912 variables, 1/1567 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 18:54:31] [INFO ] Deduced a trap composed of 174 places in 277 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2912 variables, 1/1568 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2912 variables, 0/1568 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 56/2968 variables, 56/1624 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2968 variables, 7/1631 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 18:54:42] [INFO ] Deduced a trap composed of 71 places in 1015 ms of which 10 ms to minimize.
[2024-06-01 18:54:43] [INFO ] Deduced a trap composed of 13 places in 979 ms of which 9 ms to minimize.
[2024-06-01 18:54:44] [INFO ] Deduced a trap composed of 39 places in 911 ms of which 10 ms to minimize.
[2024-06-01 18:54:46] [INFO ] Deduced a trap composed of 80 places in 1006 ms of which 10 ms to minimize.
[2024-06-01 18:54:47] [INFO ] Deduced a trap composed of 33 places in 945 ms of which 10 ms to minimize.
[2024-06-01 18:54:48] [INFO ] Deduced a trap composed of 21 places in 946 ms of which 9 ms to minimize.
[2024-06-01 18:54:49] [INFO ] Deduced a trap composed of 13 places in 853 ms of which 10 ms to minimize.
[2024-06-01 18:54:50] [INFO ] Deduced a trap composed of 66 places in 916 ms of which 10 ms to minimize.
[2024-06-01 18:54:52] [INFO ] Deduced a trap composed of 49 places in 945 ms of which 9 ms to minimize.
[2024-06-01 18:54:53] [INFO ] Deduced a trap composed of 15 places in 939 ms of which 10 ms to minimize.
[2024-06-01 18:54:54] [INFO ] Deduced a trap composed of 25 places in 1041 ms of which 10 ms to minimize.
[2024-06-01 18:54:55] [INFO ] Deduced a trap composed of 25 places in 915 ms of which 10 ms to minimize.
[2024-06-01 18:54:57] [INFO ] Deduced a trap composed of 135 places in 1032 ms of which 10 ms to minimize.
[2024-06-01 18:54:58] [INFO ] Deduced a trap composed of 73 places in 919 ms of which 9 ms to minimize.
[2024-06-01 18:54:59] [INFO ] Deduced a trap composed of 41 places in 871 ms of which 9 ms to minimize.
[2024-06-01 18:55:00] [INFO ] Deduced a trap composed of 11 places in 1022 ms of which 10 ms to minimize.
[2024-06-01 18:55:02] [INFO ] Deduced a trap composed of 13 places in 948 ms of which 10 ms to minimize.
[2024-06-01 18:55:03] [INFO ] Deduced a trap composed of 67 places in 1011 ms of which 10 ms to minimize.
[2024-06-01 18:55:04] [INFO ] Deduced a trap composed of 62 places in 984 ms of which 10 ms to minimize.
[2024-06-01 18:55:06] [INFO ] Deduced a trap composed of 110 places in 1020 ms of which 10 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2968 variables, 20/1651 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2968/2968 variables, and 1651 constraints, problems are : Problem set: 0 solved, 4 unsolved in 45015 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 1096/1096 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 31/31 constraints]
After SMT, in 53563ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 456 out of 1096 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1096/1096 places, 2208/2208 transitions.
Applied a total of 0 rules in 40 ms. Remains 1096 /1096 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 1096/1096 places, 2208/2208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1096/1096 places, 2208/2208 transitions.
Applied a total of 0 rules in 40 ms. Remains 1096 /1096 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
[2024-06-01 18:55:07] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2024-06-01 18:55:07] [INFO ] Invariant cache hit.
[2024-06-01 18:55:08] [INFO ] Implicit Places using invariants in 754 ms returned []
[2024-06-01 18:55:08] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2024-06-01 18:55:08] [INFO ] Invariant cache hit.
[2024-06-01 18:55:09] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-06-01 18:55:14] [INFO ] Implicit Places using invariants and state equation in 6302 ms returned []
Implicit Place search using SMT with State Equation took 7059 ms to find 0 implicit places.
[2024-06-01 18:55:14] [INFO ] Redundant transitions in 178 ms returned []
Running 2200 sub problems to find dead transitions.
[2024-06-01 18:55:14] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2024-06-01 18:55:14] [INFO ] Invariant cache hit.
[2024-06-01 18:55:14] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1096 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 2200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1096/2968 variables, and 23 constraints, problems are : Problem set: 0 solved, 2200 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/1096 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 2200/2200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1096 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 2200 unsolved
[2024-06-01 18:55:49] [INFO ] Deduced a trap composed of 66 places in 843 ms of which 9 ms to minimize.
[2024-06-01 18:55:50] [INFO ] Deduced a trap composed of 17 places in 874 ms of which 11 ms to minimize.
[2024-06-01 18:55:51] [INFO ] Deduced a trap composed of 55 places in 869 ms of which 9 ms to minimize.
[2024-06-01 18:55:51] [INFO ] Deduced a trap composed of 75 places in 914 ms of which 9 ms to minimize.
[2024-06-01 18:55:53] [INFO ] Deduced a trap composed of 19 places in 1039 ms of which 10 ms to minimize.
[2024-06-01 18:55:53] [INFO ] Deduced a trap composed of 68 places in 872 ms of which 9 ms to minimize.
[2024-06-01 18:55:54] [INFO ] Deduced a trap composed of 28 places in 779 ms of which 9 ms to minimize.
[2024-06-01 18:55:55] [INFO ] Deduced a trap composed of 71 places in 847 ms of which 9 ms to minimize.
[2024-06-01 18:55:56] [INFO ] Deduced a trap composed of 64 places in 769 ms of which 9 ms to minimize.
[2024-06-01 18:55:57] [INFO ] Deduced a trap composed of 76 places in 837 ms of which 9 ms to minimize.
[2024-06-01 18:55:58] [INFO ] Deduced a trap composed of 70 places in 837 ms of which 9 ms to minimize.
[2024-06-01 18:55:58] [INFO ] Deduced a trap composed of 80 places in 864 ms of which 9 ms to minimize.
[2024-06-01 18:55:59] [INFO ] Deduced a trap composed of 51 places in 712 ms of which 9 ms to minimize.
[2024-06-01 18:56:00] [INFO ] Deduced a trap composed of 28 places in 906 ms of which 9 ms to minimize.
[2024-06-01 18:56:01] [INFO ] Deduced a trap composed of 37 places in 899 ms of which 10 ms to minimize.
[2024-06-01 18:56:02] [INFO ] Deduced a trap composed of 80 places in 839 ms of which 9 ms to minimize.
[2024-06-01 18:56:03] [INFO ] Deduced a trap composed of 38 places in 854 ms of which 12 ms to minimize.
[2024-06-01 18:56:04] [INFO ] Deduced a trap composed of 62 places in 855 ms of which 8 ms to minimize.
[2024-06-01 18:56:05] [INFO ] Deduced a trap composed of 49 places in 899 ms of which 9 ms to minimize.
[2024-06-01 18:56:05] [INFO ] Deduced a trap composed of 40 places in 844 ms of which 9 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1096 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 2200 unsolved
[2024-06-01 18:56:07] [INFO ] Deduced a trap composed of 59 places in 685 ms of which 7 ms to minimize.
[2024-06-01 18:56:08] [INFO ] Deduced a trap composed of 49 places in 681 ms of which 8 ms to minimize.
[2024-06-01 18:56:09] [INFO ] Deduced a trap composed of 49 places in 688 ms of which 8 ms to minimize.
[2024-06-01 18:56:09] [INFO ] Deduced a trap composed of 78 places in 681 ms of which 8 ms to minimize.
[2024-06-01 18:56:10] [INFO ] Deduced a trap composed of 56 places in 683 ms of which 8 ms to minimize.
[2024-06-01 18:56:11] [INFO ] Deduced a trap composed of 80 places in 692 ms of which 7 ms to minimize.
[2024-06-01 18:56:11] [INFO ] Deduced a trap composed of 96 places in 686 ms of which 8 ms to minimize.
[2024-06-01 18:56:12] [INFO ] Deduced a trap composed of 77 places in 694 ms of which 8 ms to minimize.
[2024-06-01 18:56:13] [INFO ] Deduced a trap composed of 17 places in 687 ms of which 8 ms to minimize.
[2024-06-01 18:56:13] [INFO ] Deduced a trap composed of 39 places in 647 ms of which 7 ms to minimize.
[2024-06-01 18:56:14] [INFO ] Deduced a trap composed of 35 places in 629 ms of which 8 ms to minimize.
[2024-06-01 18:56:15] [INFO ] Deduced a trap composed of 17 places in 637 ms of which 8 ms to minimize.
[2024-06-01 18:56:16] [INFO ] Deduced a trap composed of 104 places in 737 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1096/2968 variables, and 56 constraints, problems are : Problem set: 0 solved, 2200 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/1096 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 0/2200 constraints, Known Traps: 33/33 constraints]
After SMT, in 61149ms problems are : Problem set: 0 solved, 2200 unsolved
Search for dead transitions found 0 dead transitions in 61180ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68472 ms. Remains : 1096/1096 places, 2208/2208 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[7, 1] Max Struct:[8, 8]
Starting property specific reduction for Peterson-COL-7-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[8]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[8]
[2024-06-01 18:56:16] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2024-06-01 18:56:16] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[8]
RANDOM walk for 10000 steps (2 resets) in 104 ms. (95 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 102 ms. (97 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[8]
[2024-06-01 18:56:16] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2024-06-01 18:56:16] [INFO ] Invariant cache hit.
[2024-06-01 18:56:16] [INFO ] [Real]Absence check using 23 positive place invariants in 24 ms returned sat
[2024-06-01 18:56:17] [INFO ] [Real]Absence check using state equation in 721 ms returned sat
[2024-06-01 18:56:17] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-06-01 18:56:17] [INFO ] [Real]Added 497 Read/Feed constraints in 75 ms returned sat
[2024-06-01 18:56:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:56:17] [INFO ] [Nat]Absence check using 23 positive place invariants in 26 ms returned sat
[2024-06-01 18:56:18] [INFO ] [Nat]Absence check using state equation in 708 ms returned sat
[2024-06-01 18:56:18] [INFO ] [Nat]Added 497 Read/Feed constraints in 250 ms returned sat
[2024-06-01 18:56:19] [INFO ] Deduced a trap composed of 32 places in 934 ms of which 9 ms to minimize.
[2024-06-01 18:56:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1095 ms
[2024-06-01 18:56:19] [INFO ] Computed and/alt/rep : 1752/5288/1752 causal constraints (skipped 112 transitions) in 170 ms.
[2024-06-01 18:56:22] [INFO ] Added : 70 causal constraints over 15 iterations in 2662 ms. Result :sat
Minimization took 75 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[8]
Support contains 448 out of 1096 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1096/1096 places, 2208/2208 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 1096 transition count 2200
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 1088 transition count 2200
Applied a total of 16 rules in 58 ms. Remains 1088 /1096 variables (removed 8) and now considering 2200/2208 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 1088/1096 places, 2200/2208 transitions.
[2024-06-01 18:56:22] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2024-06-01 18:56:22] [INFO ] Computed 23 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[8]
RANDOM walk for 1000000 steps (2 resets) in 10505 ms. (95 steps per ms)
BEST_FIRST walk for 500329 steps (1 resets) in 5001 ms. (100 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7] Max Struct:[8]
[2024-06-01 18:56:38] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
[2024-06-01 18:56:38] [INFO ] Invariant cache hit.
[2024-06-01 18:56:38] [INFO ] [Real]Absence check using 23 positive place invariants in 27 ms returned sat
[2024-06-01 18:56:38] [INFO ] [Real]Absence check using state equation in 718 ms returned sat
[2024-06-01 18:56:39] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-06-01 18:56:39] [INFO ] [Real]Added 497 Read/Feed constraints in 171 ms returned sat
[2024-06-01 18:56:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:56:39] [INFO ] [Nat]Absence check using 23 positive place invariants in 26 ms returned sat
[2024-06-01 18:56:40] [INFO ] [Nat]Absence check using state equation in 740 ms returned sat
[2024-06-01 18:56:40] [INFO ] [Nat]Added 497 Read/Feed constraints in 269 ms returned sat
[2024-06-01 18:56:40] [INFO ] Computed and/alt/rep : 1744/5280/1744 causal constraints (skipped 112 transitions) in 147 ms.
[2024-06-01 18:56:46] [INFO ] Deduced a trap composed of 53 places in 848 ms of which 12 ms to minimize.
[2024-06-01 18:56:47] [INFO ] Deduced a trap composed of 88 places in 927 ms of which 13 ms to minimize.
[2024-06-01 18:56:49] [INFO ] Deduced a trap composed of 56 places in 878 ms of which 11 ms to minimize.
[2024-06-01 18:56:50] [INFO ] Deduced a trap composed of 72 places in 969 ms of which 10 ms to minimize.
[2024-06-01 18:56:51] [INFO ] Deduced a trap composed of 15 places in 908 ms of which 9 ms to minimize.
[2024-06-01 18:56:52] [INFO ] Deduced a trap composed of 28 places in 916 ms of which 9 ms to minimize.
[2024-06-01 18:56:53] [INFO ] Deduced a trap composed of 24 places in 906 ms of which 9 ms to minimize.
[2024-06-01 18:56:54] [INFO ] Deduced a trap composed of 11 places in 897 ms of which 9 ms to minimize.
[2024-06-01 18:56:55] [INFO ] Deduced a trap composed of 55 places in 782 ms of which 12 ms to minimize.
[2024-06-01 18:56:56] [INFO ] Deduced a trap composed of 49 places in 821 ms of which 8 ms to minimize.
[2024-06-01 18:56:57] [INFO ] Deduced a trap composed of 58 places in 755 ms of which 8 ms to minimize.
[2024-06-01 18:56:57] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 11592 ms
[2024-06-01 18:56:58] [INFO ] Added : 206 causal constraints over 42 iterations in 17572 ms. Result :sat
Minimization took 767 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[7] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7] Max Struct:[8]
Support contains 448 out of 1088 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 44 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 1088/1088 places, 2200/2200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 55 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
[2024-06-01 18:56:59] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
[2024-06-01 18:56:59] [INFO ] Invariant cache hit.
[2024-06-01 18:57:00] [INFO ] Implicit Places using invariants in 715 ms returned []
[2024-06-01 18:57:00] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
[2024-06-01 18:57:00] [INFO ] Invariant cache hit.
[2024-06-01 18:57:01] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-06-01 18:57:07] [INFO ] Implicit Places using invariants and state equation in 6898 ms returned []
Implicit Place search using SMT with State Equation took 7616 ms to find 0 implicit places.
[2024-06-01 18:57:07] [INFO ] Redundant transitions in 55 ms returned []
Running 2192 sub problems to find dead transitions.
[2024-06-01 18:57:07] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
[2024-06-01 18:57:07] [INFO ] Invariant cache hit.
[2024-06-01 18:57:07] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1088 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 2192 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1088/2952 variables, and 23 constraints, problems are : Problem set: 0 solved, 2192 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/1088 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 2192/2192 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2192 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1088 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 2192 unsolved
[2024-06-01 18:57:42] [INFO ] Deduced a trap composed of 17 places in 981 ms of which 9 ms to minimize.
[2024-06-01 18:57:42] [INFO ] Deduced a trap composed of 19 places in 807 ms of which 8 ms to minimize.
[2024-06-01 18:57:43] [INFO ] Deduced a trap composed of 97 places in 814 ms of which 8 ms to minimize.
[2024-06-01 18:57:44] [INFO ] Deduced a trap composed of 28 places in 846 ms of which 9 ms to minimize.
[2024-06-01 18:57:45] [INFO ] Deduced a trap composed of 24 places in 831 ms of which 9 ms to minimize.
[2024-06-01 18:57:46] [INFO ] Deduced a trap composed of 137 places in 904 ms of which 13 ms to minimize.
[2024-06-01 18:57:47] [INFO ] Deduced a trap composed of 60 places in 980 ms of which 9 ms to minimize.
[2024-06-01 18:57:48] [INFO ] Deduced a trap composed of 75 places in 854 ms of which 12 ms to minimize.
[2024-06-01 18:57:49] [INFO ] Deduced a trap composed of 75 places in 1005 ms of which 13 ms to minimize.
[2024-06-01 18:57:50] [INFO ] Deduced a trap composed of 114 places in 1016 ms of which 13 ms to minimize.
[2024-06-01 18:57:51] [INFO ] Deduced a trap composed of 28 places in 984 ms of which 9 ms to minimize.
[2024-06-01 18:57:52] [INFO ] Deduced a trap composed of 79 places in 750 ms of which 7 ms to minimize.
[2024-06-01 18:57:53] [INFO ] Deduced a trap composed of 122 places in 786 ms of which 11 ms to minimize.
[2024-06-01 18:57:53] [INFO ] Deduced a trap composed of 65 places in 789 ms of which 7 ms to minimize.
[2024-06-01 18:57:54] [INFO ] Deduced a trap composed of 39 places in 650 ms of which 7 ms to minimize.
[2024-06-01 18:57:55] [INFO ] Deduced a trap composed of 33 places in 691 ms of which 7 ms to minimize.
[2024-06-01 18:57:56] [INFO ] Deduced a trap composed of 44 places in 748 ms of which 8 ms to minimize.
[2024-06-01 18:57:56] [INFO ] Deduced a trap composed of 44 places in 699 ms of which 7 ms to minimize.
[2024-06-01 18:57:57] [INFO ] Deduced a trap composed of 31 places in 748 ms of which 9 ms to minimize.
[2024-06-01 18:57:58] [INFO ] Deduced a trap composed of 17 places in 826 ms of which 9 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1088 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 2192 unsolved
[2024-06-01 18:58:00] [INFO ] Deduced a trap composed of 28 places in 849 ms of which 8 ms to minimize.
[2024-06-01 18:58:00] [INFO ] Deduced a trap composed of 28 places in 802 ms of which 8 ms to minimize.
[2024-06-01 18:58:01] [INFO ] Deduced a trap composed of 23 places in 793 ms of which 8 ms to minimize.
[2024-06-01 18:58:02] [INFO ] Deduced a trap composed of 43 places in 984 ms of which 9 ms to minimize.
[2024-06-01 18:58:03] [INFO ] Deduced a trap composed of 47 places in 901 ms of which 8 ms to minimize.
[2024-06-01 18:58:04] [INFO ] Deduced a trap composed of 25 places in 873 ms of which 10 ms to minimize.
[2024-06-01 18:58:05] [INFO ] Deduced a trap composed of 78 places in 921 ms of which 13 ms to minimize.
[2024-06-01 18:58:06] [INFO ] Deduced a trap composed of 49 places in 805 ms of which 9 ms to minimize.
[2024-06-01 18:58:07] [INFO ] Deduced a trap composed of 28 places in 831 ms of which 9 ms to minimize.
[2024-06-01 18:58:08] [INFO ] Deduced a trap composed of 46 places in 835 ms of which 9 ms to minimize.
[2024-06-01 18:58:09] [INFO ] Deduced a trap composed of 47 places in 862 ms of which 9 ms to minimize.
SMT process timed out in 61708ms, After SMT, problems are : Problem set: 0 solved, 2192 unsolved
Search for dead transitions found 0 dead transitions in 61737ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69473 ms. Remains : 1088/1088 places, 2200/2200 transitions.
[2024-06-01 18:58:09] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
[2024-06-01 18:58:09] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[7] Max Struct:[8]
RANDOM walk for 1000000 steps (2 resets) in 10539 ms. (94 steps per ms)
BEST_FIRST walk for 498151 steps (1 resets) in 5001 ms. (99 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7] Max Struct:[8]
[2024-06-01 18:58:24] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
[2024-06-01 18:58:24] [INFO ] Invariant cache hit.
[2024-06-01 18:58:24] [INFO ] [Real]Absence check using 23 positive place invariants in 25 ms returned sat
[2024-06-01 18:58:25] [INFO ] [Real]Absence check using state equation in 715 ms returned sat
[2024-06-01 18:58:25] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-06-01 18:58:25] [INFO ] [Real]Added 497 Read/Feed constraints in 183 ms returned sat
[2024-06-01 18:58:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:58:26] [INFO ] [Nat]Absence check using 23 positive place invariants in 28 ms returned sat
[2024-06-01 18:58:26] [INFO ] [Nat]Absence check using state equation in 721 ms returned sat
[2024-06-01 18:58:27] [INFO ] [Nat]Added 497 Read/Feed constraints in 271 ms returned sat
[2024-06-01 18:58:27] [INFO ] Computed and/alt/rep : 1744/5280/1744 causal constraints (skipped 112 transitions) in 150 ms.
[2024-06-01 18:58:33] [INFO ] Deduced a trap composed of 53 places in 714 ms of which 8 ms to minimize.
[2024-06-01 18:58:34] [INFO ] Deduced a trap composed of 88 places in 768 ms of which 9 ms to minimize.
[2024-06-01 18:58:34] [INFO ] Deduced a trap composed of 56 places in 762 ms of which 9 ms to minimize.
[2024-06-01 18:58:36] [INFO ] Deduced a trap composed of 72 places in 968 ms of which 10 ms to minimize.
[2024-06-01 18:58:37] [INFO ] Deduced a trap composed of 15 places in 1036 ms of which 14 ms to minimize.
[2024-06-01 18:58:38] [INFO ] Deduced a trap composed of 28 places in 925 ms of which 9 ms to minimize.
[2024-06-01 18:58:39] [INFO ] Deduced a trap composed of 24 places in 948 ms of which 11 ms to minimize.
[2024-06-01 18:58:40] [INFO ] Deduced a trap composed of 11 places in 930 ms of which 9 ms to minimize.
[2024-06-01 18:58:41] [INFO ] Deduced a trap composed of 55 places in 693 ms of which 8 ms to minimize.
[2024-06-01 18:58:42] [INFO ] Deduced a trap composed of 49 places in 720 ms of which 8 ms to minimize.
[2024-06-01 18:58:43] [INFO ] Deduced a trap composed of 58 places in 751 ms of which 8 ms to minimize.
[2024-06-01 18:58:43] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 10986 ms
[2024-06-01 18:58:43] [INFO ] Added : 206 causal constraints over 42 iterations in 16655 ms. Result :sat
Minimization took 775 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[7] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7] Max Struct:[8]
Support contains 448 out of 1088 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 36 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 1088/1088 places, 2200/2200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 34 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
[2024-06-01 18:58:45] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
[2024-06-01 18:58:45] [INFO ] Invariant cache hit.
[2024-06-01 18:58:46] [INFO ] Implicit Places using invariants in 891 ms returned []
[2024-06-01 18:58:46] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
[2024-06-01 18:58:46] [INFO ] Invariant cache hit.
[2024-06-01 18:58:47] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-06-01 18:58:53] [INFO ] Implicit Places using invariants and state equation in 6818 ms returned []
Implicit Place search using SMT with State Equation took 7712 ms to find 0 implicit places.
[2024-06-01 18:58:53] [INFO ] Redundant transitions in 57 ms returned []
Running 2192 sub problems to find dead transitions.
[2024-06-01 18:58:53] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
[2024-06-01 18:58:53] [INFO ] Invariant cache hit.
[2024-06-01 18:58:53] [INFO ] State equation strengthened by 497 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1088 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 2192 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1088/2952 variables, and 23 constraints, problems are : Problem set: 0 solved, 2192 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/1088 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 2192/2192 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2192 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1088 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 2192 unsolved
[2024-06-01 18:59:27] [INFO ] Deduced a trap composed of 17 places in 816 ms of which 8 ms to minimize.
[2024-06-01 18:59:28] [INFO ] Deduced a trap composed of 19 places in 862 ms of which 8 ms to minimize.
[2024-06-01 18:59:29] [INFO ] Deduced a trap composed of 97 places in 861 ms of which 9 ms to minimize.
[2024-06-01 18:59:29] [INFO ] Deduced a trap composed of 28 places in 942 ms of which 13 ms to minimize.
[2024-06-01 18:59:31] [INFO ] Deduced a trap composed of 24 places in 1065 ms of which 14 ms to minimize.
[2024-06-01 18:59:31] [INFO ] Deduced a trap composed of 137 places in 791 ms of which 8 ms to minimize.
[2024-06-01 18:59:32] [INFO ] Deduced a trap composed of 60 places in 877 ms of which 8 ms to minimize.
[2024-06-01 18:59:33] [INFO ] Deduced a trap composed of 75 places in 1001 ms of which 11 ms to minimize.
[2024-06-01 18:59:34] [INFO ] Deduced a trap composed of 75 places in 853 ms of which 8 ms to minimize.
[2024-06-01 18:59:35] [INFO ] Deduced a trap composed of 114 places in 840 ms of which 8 ms to minimize.
[2024-06-01 18:59:36] [INFO ] Deduced a trap composed of 28 places in 925 ms of which 13 ms to minimize.
[2024-06-01 18:59:37] [INFO ] Deduced a trap composed of 79 places in 874 ms of which 12 ms to minimize.
[2024-06-01 18:59:38] [INFO ] Deduced a trap composed of 122 places in 854 ms of which 8 ms to minimize.
[2024-06-01 18:59:39] [INFO ] Deduced a trap composed of 65 places in 832 ms of which 7 ms to minimize.
[2024-06-01 18:59:39] [INFO ] Deduced a trap composed of 39 places in 636 ms of which 11 ms to minimize.
[2024-06-01 18:59:40] [INFO ] Deduced a trap composed of 33 places in 857 ms of which 8 ms to minimize.
[2024-06-01 18:59:41] [INFO ] Deduced a trap composed of 44 places in 671 ms of which 8 ms to minimize.
[2024-06-01 18:59:42] [INFO ] Deduced a trap composed of 44 places in 721 ms of which 7 ms to minimize.
[2024-06-01 18:59:43] [INFO ] Deduced a trap composed of 31 places in 875 ms of which 9 ms to minimize.
[2024-06-01 18:59:44] [INFO ] Deduced a trap composed of 17 places in 950 ms of which 13 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1088 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 2192 unsolved
[2024-06-01 18:59:45] [INFO ] Deduced a trap composed of 28 places in 864 ms of which 9 ms to minimize.
[2024-06-01 18:59:46] [INFO ] Deduced a trap composed of 28 places in 854 ms of which 8 ms to minimize.
[2024-06-01 18:59:47] [INFO ] Deduced a trap composed of 23 places in 766 ms of which 8 ms to minimize.
[2024-06-01 18:59:48] [INFO ] Deduced a trap composed of 43 places in 715 ms of which 8 ms to minimize.
[2024-06-01 18:59:49] [INFO ] Deduced a trap composed of 47 places in 826 ms of which 8 ms to minimize.
[2024-06-01 18:59:50] [INFO ] Deduced a trap composed of 25 places in 900 ms of which 12 ms to minimize.
[2024-06-01 18:59:51] [INFO ] Deduced a trap composed of 78 places in 970 ms of which 13 ms to minimize.
[2024-06-01 18:59:52] [INFO ] Deduced a trap composed of 49 places in 1007 ms of which 13 ms to minimize.
[2024-06-01 18:59:53] [INFO ] Deduced a trap composed of 28 places in 953 ms of which 13 ms to minimize.
[2024-06-01 18:59:54] [INFO ] Deduced a trap composed of 46 places in 916 ms of which 9 ms to minimize.
[2024-06-01 18:59:54] [INFO ] Deduced a trap composed of 47 places in 873 ms of which 13 ms to minimize.
SMT process timed out in 61806ms, After SMT, problems are : Problem set: 0 solved, 2192 unsolved
Search for dead transitions found 0 dead transitions in 61835ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69650 ms. Remains : 1088/1088 places, 2200/2200 transitions.
RANDOM walk for 40000 steps (8 resets) in 1381 ms. (28 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 533 ms. (74 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 532 ms. (75 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 133425 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :0 out of 2
Probabilistic random walk after 133425 steps, saw 58133 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
[2024-06-01 18:59:58] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
[2024-06-01 18:59:58] [INFO ] Invariant cache hit.
[2024-06-01 18:59:58] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 576/1024 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:00:00] [INFO ] Deduced a trap composed of 60 places in 873 ms of which 9 ms to minimize.
[2024-06-01 19:00:00] [INFO ] Deduced a trap composed of 88 places in 714 ms of which 8 ms to minimize.
[2024-06-01 19:00:01] [INFO ] Deduced a trap composed of 239 places in 556 ms of which 7 ms to minimize.
[2024-06-01 19:00:01] [INFO ] Deduced a trap composed of 144 places in 590 ms of which 7 ms to minimize.
[2024-06-01 19:00:02] [INFO ] Deduced a trap composed of 221 places in 478 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1024 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1024 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 8/1032 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1032 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1864/2896 variables, 1032/1053 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2896 variables, 497/1550 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2896 variables, 0/1550 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 56/2952 variables, 56/1606 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2952 variables, 7/1613 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2952/2952 variables, and 1613 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 1088/1088 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 576/1024 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1024 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:00:04] [INFO ] Deduced a trap composed of 200 places in 597 ms of which 7 ms to minimize.
[2024-06-01 19:00:05] [INFO ] Deduced a trap composed of 214 places in 538 ms of which 7 ms to minimize.
[2024-06-01 19:00:05] [INFO ] Deduced a trap composed of 130 places in 595 ms of which 8 ms to minimize.
[2024-06-01 19:00:06] [INFO ] Deduced a trap composed of 102 places in 539 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1024 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1024 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/1032 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1032 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1864/2896 variables, 1032/1057 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2896 variables, 497/1554 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2896 variables, 2/1556 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2896/2952 variables, and 1556 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 16/23 constraints, State Equation: 1032/1088 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 9/9 constraints]
After SMT, in 10312ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 448 out of 1088 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 31 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 1088/1088 places, 2200/2200 transitions.
RANDOM walk for 40000 steps (8 resets) in 1893 ms. (21 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 546 ms. (73 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 548 ms. (72 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 132552 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :0 out of 2
Probabilistic random walk after 132552 steps, saw 58001 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
[2024-06-01 19:00:12] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
[2024-06-01 19:00:12] [INFO ] Invariant cache hit.
[2024-06-01 19:00:12] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 576/1024 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:00:14] [INFO ] Deduced a trap composed of 60 places in 878 ms of which 9 ms to minimize.
[2024-06-01 19:00:15] [INFO ] Deduced a trap composed of 88 places in 734 ms of which 8 ms to minimize.
[2024-06-01 19:00:15] [INFO ] Deduced a trap composed of 239 places in 610 ms of which 7 ms to minimize.
[2024-06-01 19:00:16] [INFO ] Deduced a trap composed of 144 places in 631 ms of which 6 ms to minimize.
[2024-06-01 19:00:16] [INFO ] Deduced a trap composed of 221 places in 489 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1024 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1024 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 8/1032 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1032 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1864/2896 variables, 1032/1053 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2896 variables, 497/1550 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2896 variables, 0/1550 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 56/2952 variables, 56/1606 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2952 variables, 7/1613 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2952 variables, 0/1613 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/2952 variables, 0/1613 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2952/2952 variables, and 1613 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5409 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 1088/1088 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 576/1024 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1024 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:00:19] [INFO ] Deduced a trap composed of 200 places in 549 ms of which 6 ms to minimize.
[2024-06-01 19:00:19] [INFO ] Deduced a trap composed of 214 places in 613 ms of which 7 ms to minimize.
[2024-06-01 19:00:20] [INFO ] Deduced a trap composed of 130 places in 598 ms of which 7 ms to minimize.
[2024-06-01 19:00:21] [INFO ] Deduced a trap composed of 102 places in 619 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1024 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1024 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/1032 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1032 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1864/2896 variables, 1032/1057 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2896 variables, 497/1554 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2896 variables, 2/1556 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2896 variables, 0/1556 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 56/2952 variables, 56/1612 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2952 variables, 7/1619 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:00:28] [INFO ] Deduced a trap composed of 13 places in 992 ms of which 10 ms to minimize.
[2024-06-01 19:00:30] [INFO ] Deduced a trap composed of 13 places in 1030 ms of which 10 ms to minimize.
[2024-06-01 19:00:31] [INFO ] Deduced a trap composed of 33 places in 1003 ms of which 14 ms to minimize.
[2024-06-01 19:00:32] [INFO ] Deduced a trap composed of 15 places in 999 ms of which 9 ms to minimize.
[2024-06-01 19:00:33] [INFO ] Deduced a trap composed of 61 places in 837 ms of which 9 ms to minimize.
[2024-06-01 19:00:35] [INFO ] Deduced a trap composed of 58 places in 897 ms of which 12 ms to minimize.
[2024-06-01 19:00:36] [INFO ] Deduced a trap composed of 137 places in 856 ms of which 11 ms to minimize.
[2024-06-01 19:00:37] [INFO ] Deduced a trap composed of 129 places in 750 ms of which 9 ms to minimize.
[2024-06-01 19:00:38] [INFO ] Deduced a trap composed of 77 places in 904 ms of which 12 ms to minimize.
[2024-06-01 19:00:39] [INFO ] Deduced a trap composed of 79 places in 845 ms of which 9 ms to minimize.
[2024-06-01 19:00:41] [INFO ] Deduced a trap composed of 80 places in 960 ms of which 13 ms to minimize.
[2024-06-01 19:00:42] [INFO ] Deduced a trap composed of 99 places in 844 ms of which 8 ms to minimize.
[2024-06-01 19:00:43] [INFO ] Deduced a trap composed of 75 places in 882 ms of which 12 ms to minimize.
[2024-06-01 19:00:44] [INFO ] Deduced a trap composed of 70 places in 859 ms of which 8 ms to minimize.
[2024-06-01 19:00:45] [INFO ] Deduced a trap composed of 53 places in 733 ms of which 8 ms to minimize.
[2024-06-01 19:00:46] [INFO ] Deduced a trap composed of 80 places in 711 ms of which 8 ms to minimize.
[2024-06-01 19:00:48] [INFO ] Deduced a trap composed of 175 places in 910 ms of which 13 ms to minimize.
[2024-06-01 19:00:49] [INFO ] Deduced a trap composed of 67 places in 863 ms of which 12 ms to minimize.
[2024-06-01 19:00:50] [INFO ] Deduced a trap composed of 62 places in 867 ms of which 8 ms to minimize.
[2024-06-01 19:00:51] [INFO ] Deduced a trap composed of 40 places in 915 ms of which 13 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2952 variables, 20/1639 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:00:54] [INFO ] Deduced a trap composed of 216 places in 915 ms of which 12 ms to minimize.
[2024-06-01 19:00:55] [INFO ] Deduced a trap composed of 34 places in 688 ms of which 8 ms to minimize.
[2024-06-01 19:00:56] [INFO ] Deduced a trap composed of 61 places in 722 ms of which 8 ms to minimize.
[2024-06-01 19:00:57] [INFO ] Deduced a trap composed of 154 places in 773 ms of which 8 ms to minimize.
[2024-06-01 19:00:58] [INFO ] Deduced a trap composed of 53 places in 838 ms of which 8 ms to minimize.
[2024-06-01 19:00:59] [INFO ] Deduced a trap composed of 41 places in 681 ms of which 9 ms to minimize.
[2024-06-01 19:01:00] [INFO ] Deduced a trap composed of 33 places in 696 ms of which 8 ms to minimize.
[2024-06-01 19:01:02] [INFO ] Deduced a trap composed of 69 places in 818 ms of which 12 ms to minimize.
[2024-06-01 19:01:03] [INFO ] Deduced a trap composed of 51 places in 779 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2952/2952 variables, and 1648 constraints, problems are : Problem set: 0 solved, 2 unsolved in 45014 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 1088/1088 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 38/38 constraints]
After SMT, in 50664ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 448 out of 1088 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 46 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 1088/1088 places, 2200/2200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 44 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
[2024-06-01 19:01:03] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
[2024-06-01 19:01:03] [INFO ] Invariant cache hit.
[2024-06-01 19:01:04] [INFO ] Implicit Places using invariants in 959 ms returned []
[2024-06-01 19:01:04] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
[2024-06-01 19:01:04] [INFO ] Invariant cache hit.
[2024-06-01 19:01:05] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-06-01 19:01:11] [INFO ] Implicit Places using invariants and state equation in 6870 ms returned []
Implicit Place search using SMT with State Equation took 7831 ms to find 0 implicit places.
[2024-06-01 19:01:11] [INFO ] Redundant transitions in 55 ms returned []
Running 2192 sub problems to find dead transitions.
[2024-06-01 19:01:11] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
[2024-06-01 19:01:11] [INFO ] Invariant cache hit.
[2024-06-01 19:01:11] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1088 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 2192 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1088/2952 variables, and 23 constraints, problems are : Problem set: 0 solved, 2192 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/1088 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 2192/2192 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2192 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1088 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 2192 unsolved
[2024-06-01 19:01:45] [INFO ] Deduced a trap composed of 17 places in 677 ms of which 8 ms to minimize.
[2024-06-01 19:01:46] [INFO ] Deduced a trap composed of 19 places in 734 ms of which 8 ms to minimize.
[2024-06-01 19:01:47] [INFO ] Deduced a trap composed of 97 places in 783 ms of which 9 ms to minimize.
[2024-06-01 19:01:48] [INFO ] Deduced a trap composed of 28 places in 875 ms of which 9 ms to minimize.
[2024-06-01 19:01:49] [INFO ] Deduced a trap composed of 24 places in 837 ms of which 9 ms to minimize.
[2024-06-01 19:01:49] [INFO ] Deduced a trap composed of 137 places in 874 ms of which 13 ms to minimize.
[2024-06-01 19:01:51] [INFO ] Deduced a trap composed of 60 places in 1031 ms of which 13 ms to minimize.
[2024-06-01 19:01:51] [INFO ] Deduced a trap composed of 75 places in 875 ms of which 8 ms to minimize.
[2024-06-01 19:01:52] [INFO ] Deduced a trap composed of 75 places in 803 ms of which 8 ms to minimize.
[2024-06-01 19:01:53] [INFO ] Deduced a trap composed of 114 places in 820 ms of which 8 ms to minimize.
[2024-06-01 19:01:54] [INFO ] Deduced a trap composed of 28 places in 876 ms of which 9 ms to minimize.
[2024-06-01 19:01:55] [INFO ] Deduced a trap composed of 79 places in 738 ms of which 8 ms to minimize.
[2024-06-01 19:01:55] [INFO ] Deduced a trap composed of 122 places in 740 ms of which 8 ms to minimize.
[2024-06-01 19:01:56] [INFO ] Deduced a trap composed of 65 places in 691 ms of which 8 ms to minimize.
[2024-06-01 19:01:57] [INFO ] Deduced a trap composed of 39 places in 595 ms of which 7 ms to minimize.
[2024-06-01 19:01:58] [INFO ] Deduced a trap composed of 33 places in 682 ms of which 8 ms to minimize.
[2024-06-01 19:01:58] [INFO ] Deduced a trap composed of 44 places in 719 ms of which 8 ms to minimize.
[2024-06-01 19:01:59] [INFO ] Deduced a trap composed of 44 places in 694 ms of which 8 ms to minimize.
[2024-06-01 19:02:00] [INFO ] Deduced a trap composed of 31 places in 882 ms of which 9 ms to minimize.
[2024-06-01 19:02:01] [INFO ] Deduced a trap composed of 17 places in 849 ms of which 8 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1088 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 2192 unsolved
[2024-06-01 19:02:03] [INFO ] Deduced a trap composed of 28 places in 841 ms of which 8 ms to minimize.
[2024-06-01 19:02:04] [INFO ] Deduced a trap composed of 28 places in 916 ms of which 13 ms to minimize.
[2024-06-01 19:02:04] [INFO ] Deduced a trap composed of 23 places in 856 ms of which 8 ms to minimize.
[2024-06-01 19:02:05] [INFO ] Deduced a trap composed of 43 places in 709 ms of which 8 ms to minimize.
[2024-06-01 19:02:06] [INFO ] Deduced a trap composed of 47 places in 830 ms of which 8 ms to minimize.
[2024-06-01 19:02:07] [INFO ] Deduced a trap composed of 25 places in 790 ms of which 8 ms to minimize.
[2024-06-01 19:02:08] [INFO ] Deduced a trap composed of 78 places in 847 ms of which 8 ms to minimize.
[2024-06-01 19:02:09] [INFO ] Deduced a trap composed of 49 places in 880 ms of which 9 ms to minimize.
[2024-06-01 19:02:10] [INFO ] Deduced a trap composed of 28 places in 891 ms of which 12 ms to minimize.
[2024-06-01 19:02:11] [INFO ] Deduced a trap composed of 46 places in 946 ms of which 8 ms to minimize.
[2024-06-01 19:02:11] [INFO ] Deduced a trap composed of 47 places in 857 ms of which 13 ms to minimize.
[2024-06-01 19:02:12] [INFO ] Deduced a trap composed of 39 places in 998 ms of which 12 ms to minimize.
SMT process timed out in 61371ms, After SMT, problems are : Problem set: 0 solved, 2192 unsolved
Search for dead transitions found 0 dead transitions in 61397ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69339 ms. Remains : 1088/1088 places, 2200/2200 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[7] Max Struct:[8]
Ending property specific reduction for Peterson-COL-7-UpperBounds-01 in 356881 ms.
Starting property specific reduction for Peterson-COL-7-UpperBounds-02
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:[8]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[8]
[2024-06-01 19:02:12] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1096 cols
[2024-06-01 19:02:12] [INFO ] Computed 23 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[8]
RANDOM walk for 10000 steps (2 resets) in 37 ms. (263 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 15 ms. (625 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[8]
[2024-06-01 19:02:13] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2024-06-01 19:02:13] [INFO ] Invariant cache hit.
[2024-06-01 19:02:13] [INFO ] [Real]Absence check using 23 positive place invariants in 33 ms returned sat
[2024-06-01 19:02:14] [INFO ] [Real]Absence check using state equation in 723 ms returned sat
[2024-06-01 19:02:14] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-06-01 19:02:14] [INFO ] [Real]Added 497 Read/Feed constraints in 78 ms returned sat
[2024-06-01 19:02:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 19:02:14] [INFO ] [Nat]Absence check using 23 positive place invariants in 27 ms returned sat
[2024-06-01 19:02:15] [INFO ] [Nat]Absence check using state equation in 745 ms returned sat
[2024-06-01 19:02:15] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 19:02:15] [INFO ] [Nat]Added 497 Read/Feed constraints in 614 ms returned sat
[2024-06-01 19:02:16] [INFO ] Deduced a trap composed of 104 places in 829 ms of which 8 ms to minimize.
[2024-06-01 19:02:17] [INFO ] Deduced a trap composed of 51 places in 796 ms of which 8 ms to minimize.
[2024-06-01 19:02:18] [INFO ] Deduced a trap composed of 69 places in 785 ms of which 9 ms to minimize.
[2024-06-01 19:02:19] [INFO ] Deduced a trap composed of 140 places in 788 ms of which 8 ms to minimize.
[2024-06-01 19:02:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:929)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[8]
Support contains 8 out of 1096 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1096/1096 places, 2208/2208 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 1096 transition count 2103
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 210 place count 991 transition count 2103
Performed 343 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 343 Pre rules applied. Total rules applied 210 place count 991 transition count 1760
Deduced a syphon composed of 343 places in 1 ms
Reduce places removed 343 places and 0 transitions.
Iterating global reduction 2 with 686 rules applied. Total rules applied 896 place count 648 transition count 1760
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 1008 place count 592 transition count 1704
Applied a total of 1008 rules in 140 ms. Remains 592 /1096 variables (removed 504) and now considering 1704/2208 (removed 504) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 592/1096 places, 1704/2208 transitions.
[2024-06-01 19:02:19] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 592 cols
[2024-06-01 19:02:19] [INFO ] Computed 23 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[8]
RANDOM walk for 1000000 steps (2 resets) in 2632 ms. (379 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 898 ms. (1112 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[8]
[2024-06-01 19:02:22] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2024-06-01 19:02:22] [INFO ] Invariant cache hit.
[2024-06-01 19:02:23] [INFO ] [Real]Absence check using 23 positive place invariants in 15 ms returned sat
[2024-06-01 19:02:23] [INFO ] [Real]Absence check using state equation in 429 ms returned sat
[2024-06-01 19:02:23] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-06-01 19:02:23] [INFO ] [Real]Added 497 Read/Feed constraints in 61 ms returned sat
[2024-06-01 19:02:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 19:02:23] [INFO ] [Nat]Absence check using 23 positive place invariants in 15 ms returned sat
[2024-06-01 19:02:24] [INFO ] [Nat]Absence check using state equation in 430 ms returned sat
[2024-06-01 19:02:24] [INFO ] [Nat]Added 497 Read/Feed constraints in 183 ms returned sat
[2024-06-01 19:02:24] [INFO ] Deduced a trap composed of 22 places in 443 ms of which 5 ms to minimize.
[2024-06-01 19:02:25] [INFO ] Deduced a trap composed of 13 places in 377 ms of which 5 ms to minimize.
[2024-06-01 19:02:25] [INFO ] Deduced a trap composed of 19 places in 427 ms of which 5 ms to minimize.
[2024-06-01 19:02:26] [INFO ] Deduced a trap composed of 36 places in 452 ms of which 5 ms to minimize.
[2024-06-01 19:02:26] [INFO ] Deduced a trap composed of 45 places in 446 ms of which 5 ms to minimize.
[2024-06-01 19:02:27] [INFO ] Deduced a trap composed of 36 places in 454 ms of which 5 ms to minimize.
[2024-06-01 19:02:27] [INFO ] Deduced a trap composed of 36 places in 434 ms of which 4 ms to minimize.
[2024-06-01 19:02:28] [INFO ] Deduced a trap composed of 12 places in 432 ms of which 4 ms to minimize.
[2024-06-01 19:02:28] [INFO ] Deduced a trap composed of 48 places in 446 ms of which 5 ms to minimize.
[2024-06-01 19:02:29] [INFO ] Deduced a trap composed of 60 places in 453 ms of which 5 ms to minimize.
[2024-06-01 19:02:29] [INFO ] Deduced a trap composed of 36 places in 435 ms of which 4 ms to minimize.
[2024-06-01 19:02:30] [INFO ] Deduced a trap composed of 45 places in 434 ms of which 5 ms to minimize.
[2024-06-01 19:02:30] [INFO ] Deduced a trap composed of 22 places in 437 ms of which 5 ms to minimize.
[2024-06-01 19:02:31] [INFO ] Deduced a trap composed of 48 places in 439 ms of which 4 ms to minimize.
[2024-06-01 19:02:31] [INFO ] Deduced a trap composed of 67 places in 427 ms of which 5 ms to minimize.
[2024-06-01 19:02:32] [INFO ] Deduced a trap composed of 65 places in 406 ms of which 5 ms to minimize.
[2024-06-01 19:02:32] [INFO ] Deduced a trap composed of 22 places in 413 ms of which 5 ms to minimize.
[2024-06-01 19:02:33] [INFO ] Deduced a trap composed of 32 places in 422 ms of which 5 ms to minimize.
[2024-06-01 19:02:33] [INFO ] Deduced a trap composed of 62 places in 416 ms of which 5 ms to minimize.
[2024-06-01 19:02:34] [INFO ] Deduced a trap composed of 22 places in 420 ms of which 5 ms to minimize.
[2024-06-01 19:02:34] [INFO ] Deduced a trap composed of 14 places in 418 ms of which 5 ms to minimize.
[2024-06-01 19:02:35] [INFO ] Deduced a trap composed of 12 places in 411 ms of which 5 ms to minimize.
[2024-06-01 19:02:35] [INFO ] Deduced a trap composed of 25 places in 383 ms of which 5 ms to minimize.
[2024-06-01 19:02:35] [INFO ] Deduced a trap composed of 19 places in 387 ms of which 4 ms to minimize.
[2024-06-01 19:02:36] [INFO ] Deduced a trap composed of 21 places in 391 ms of which 5 ms to minimize.
[2024-06-01 19:02:36] [INFO ] Deduced a trap composed of 31 places in 376 ms of which 4 ms to minimize.
[2024-06-01 19:02:37] [INFO ] Deduced a trap composed of 21 places in 394 ms of which 5 ms to minimize.
[2024-06-01 19:02:37] [INFO ] Deduced a trap composed of 59 places in 398 ms of which 5 ms to minimize.
[2024-06-01 19:02:38] [INFO ] Deduced a trap composed of 39 places in 362 ms of which 5 ms to minimize.
[2024-06-01 19:02:38] [INFO ] Deduced a trap composed of 31 places in 400 ms of which 4 ms to minimize.
[2024-06-01 19:02:39] [INFO ] Deduced a trap composed of 68 places in 428 ms of which 5 ms to minimize.
[2024-06-01 19:02:39] [INFO ] Deduced a trap composed of 64 places in 414 ms of which 5 ms to minimize.
[2024-06-01 19:02:40] [INFO ] Deduced a trap composed of 83 places in 419 ms of which 4 ms to minimize.
[2024-06-01 19:02:40] [INFO ] Deduced a trap composed of 48 places in 425 ms of which 5 ms to minimize.
[2024-06-01 19:02:41] [INFO ] Deduced a trap composed of 42 places in 430 ms of which 5 ms to minimize.
[2024-06-01 19:02:41] [INFO ] Deduced a trap composed of 47 places in 419 ms of which 5 ms to minimize.
[2024-06-01 19:02:41] [INFO ] Deduced a trap composed of 33 places in 408 ms of which 5 ms to minimize.
[2024-06-01 19:02:42] [INFO ] Deduced a trap composed of 41 places in 392 ms of which 5 ms to minimize.
[2024-06-01 19:02:42] [INFO ] Deduced a trap composed of 31 places in 413 ms of which 4 ms to minimize.
[2024-06-01 19:02:43] [INFO ] Deduced a trap composed of 29 places in 405 ms of which 5 ms to minimize.
[2024-06-01 19:02:44] [INFO ] Deduced a trap composed of 47 places in 418 ms of which 5 ms to minimize.
[2024-06-01 19:02:44] [INFO ] Deduced a trap composed of 49 places in 406 ms of which 4 ms to minimize.
[2024-06-01 19:02:45] [INFO ] Deduced a trap composed of 20 places in 400 ms of which 5 ms to minimize.
[2024-06-01 19:02:48] [INFO ] Deduced a trap composed of 30 places in 414 ms of which 4 ms to minimize.
[2024-06-01 19:02:48] [INFO ] Deduced a trap composed of 30 places in 408 ms of which 5 ms to minimize.
[2024-06-01 19:02:53] [INFO ] Deduced a trap composed of 11 places in 435 ms of which 5 ms to minimize.
[2024-06-01 19:02:53] [INFO ] Deduced a trap composed of 58 places in 315 ms of which 4 ms to minimize.
[2024-06-01 19:02:53] [INFO ] Deduced a trap composed of 68 places in 368 ms of which 5 ms to minimize.
[2024-06-01 19:02:54] [INFO ] Deduced a trap composed of 103 places in 319 ms of which 4 ms to minimize.
[2024-06-01 19:02:54] [INFO ] Deduced a trap composed of 65 places in 374 ms of which 4 ms to minimize.
[2024-06-01 19:02:55] [INFO ] Deduced a trap composed of 60 places in 406 ms of which 4 ms to minimize.
[2024-06-01 19:02:55] [INFO ] Deduced a trap composed of 39 places in 377 ms of which 5 ms to minimize.
[2024-06-01 19:02:56] [INFO ] Deduced a trap composed of 29 places in 365 ms of which 4 ms to minimize.
[2024-06-01 19:02:57] [INFO ] Deduced a trap composed of 64 places in 380 ms of which 4 ms to minimize.
[2024-06-01 19:02:59] [INFO ] Deduced a trap composed of 58 places in 371 ms of which 4 ms to minimize.
[2024-06-01 19:03:00] [INFO ] Deduced a trap composed of 61 places in 391 ms of which 4 ms to minimize.
[2024-06-01 19:03:00] [INFO ] Deduced a trap composed of 45 places in 354 ms of which 4 ms to minimize.
[2024-06-01 19:03:03] [INFO ] Deduced a trap composed of 58 places in 409 ms of which 5 ms to minimize.
[2024-06-01 19:03:04] [INFO ] Deduced a trap composed of 42 places in 375 ms of which 4 ms to minimize.
[2024-06-01 19:03:04] [INFO ] Deduced a trap composed of 33 places in 391 ms of which 5 ms to minimize.
[2024-06-01 19:03:05] [INFO ] Deduced a trap composed of 46 places in 377 ms of which 4 ms to minimize.
[2024-06-01 19:03:05] [INFO ] Deduced a trap composed of 42 places in 362 ms of which 4 ms to minimize.
[2024-06-01 19:03:06] [INFO ] Deduced a trap composed of 29 places in 387 ms of which 5 ms to minimize.
[2024-06-01 19:03:06] [INFO ] Deduced a trap composed of 42 places in 349 ms of which 4 ms to minimize.
[2024-06-01 19:03:06] [INFO ] Deduced a trap composed of 83 places in 369 ms of which 5 ms to minimize.
[2024-06-01 19:03:07] [INFO ] Deduced a trap composed of 58 places in 375 ms of which 5 ms to minimize.
[2024-06-01 19:03:07] [INFO ] Deduced a trap composed of 78 places in 370 ms of which 5 ms to minimize.
[2024-06-01 19:03:08] [INFO ] Deduced a trap composed of 42 places in 359 ms of which 5 ms to minimize.
[2024-06-01 19:03:08] [INFO ] Trap strengthening (SAT) tested/added 68/68 trap constraints in 44276 ms
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[8]
Support contains 8 out of 592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 30 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 592/592 places, 1704/1704 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 24 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2024-06-01 19:03:08] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2024-06-01 19:03:08] [INFO ] Invariant cache hit.
[2024-06-01 19:03:09] [INFO ] Implicit Places using invariants in 749 ms returned []
[2024-06-01 19:03:09] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2024-06-01 19:03:09] [INFO ] Invariant cache hit.
[2024-06-01 19:03:10] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-06-01 19:03:13] [INFO ] Implicit Places using invariants and state equation in 3886 ms returned []
Implicit Place search using SMT with State Equation took 4637 ms to find 0 implicit places.
[2024-06-01 19:03:13] [INFO ] Redundant transitions in 34 ms returned []
Running 1696 sub problems to find dead transitions.
[2024-06-01 19:03:13] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2024-06-01 19:03:13] [INFO ] Invariant cache hit.
[2024-06-01 19:03:13] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2024-06-01 19:03:34] [INFO ] Deduced a trap composed of 79 places in 502 ms of which 6 ms to minimize.
[2024-06-01 19:03:35] [INFO ] Deduced a trap composed of 41 places in 466 ms of which 5 ms to minimize.
[2024-06-01 19:03:35] [INFO ] Deduced a trap composed of 53 places in 471 ms of which 5 ms to minimize.
[2024-06-01 19:03:36] [INFO ] Deduced a trap composed of 37 places in 461 ms of which 5 ms to minimize.
[2024-06-01 19:03:36] [INFO ] Deduced a trap composed of 14 places in 426 ms of which 5 ms to minimize.
[2024-06-01 19:03:37] [INFO ] Deduced a trap composed of 42 places in 402 ms of which 4 ms to minimize.
[2024-06-01 19:03:37] [INFO ] Deduced a trap composed of 81 places in 406 ms of which 5 ms to minimize.
[2024-06-01 19:03:37] [INFO ] Deduced a trap composed of 65 places in 461 ms of which 7 ms to minimize.
[2024-06-01 19:03:38] [INFO ] Deduced a trap composed of 61 places in 509 ms of which 5 ms to minimize.
[2024-06-01 19:03:38] [INFO ] Deduced a trap composed of 35 places in 405 ms of which 5 ms to minimize.
[2024-06-01 19:03:39] [INFO ] Deduced a trap composed of 39 places in 446 ms of which 8 ms to minimize.
[2024-06-01 19:03:39] [INFO ] Deduced a trap composed of 68 places in 438 ms of which 5 ms to minimize.
[2024-06-01 19:03:40] [INFO ] Deduced a trap composed of 81 places in 437 ms of which 5 ms to minimize.
[2024-06-01 19:03:40] [INFO ] Deduced a trap composed of 41 places in 444 ms of which 5 ms to minimize.
[2024-06-01 19:03:41] [INFO ] Deduced a trap composed of 109 places in 431 ms of which 5 ms to minimize.
[2024-06-01 19:03:41] [INFO ] Deduced a trap composed of 59 places in 423 ms of which 5 ms to minimize.
[2024-06-01 19:03:42] [INFO ] Deduced a trap composed of 41 places in 437 ms of which 5 ms to minimize.
[2024-06-01 19:03:42] [INFO ] Deduced a trap composed of 43 places in 494 ms of which 5 ms to minimize.
[2024-06-01 19:03:43] [INFO ] Deduced a trap composed of 54 places in 478 ms of which 5 ms to minimize.
[2024-06-01 19:03:43] [INFO ] Deduced a trap composed of 32 places in 465 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/1960 variables, and 43 constraints, problems are : Problem set: 0 solved, 1696 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/592 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 1696/1696 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1696 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2024-06-01 19:03:47] [INFO ] Deduced a trap composed of 32 places in 485 ms of which 5 ms to minimize.
[2024-06-01 19:03:48] [INFO ] Deduced a trap composed of 59 places in 473 ms of which 5 ms to minimize.
[2024-06-01 19:03:48] [INFO ] Deduced a trap composed of 44 places in 470 ms of which 5 ms to minimize.
[2024-06-01 19:03:49] [INFO ] Deduced a trap composed of 44 places in 466 ms of which 5 ms to minimize.
[2024-06-01 19:03:49] [INFO ] Deduced a trap composed of 24 places in 476 ms of which 5 ms to minimize.
[2024-06-01 19:03:49] [INFO ] Deduced a trap composed of 41 places in 480 ms of which 5 ms to minimize.
[2024-06-01 19:03:50] [INFO ] Deduced a trap composed of 35 places in 468 ms of which 5 ms to minimize.
[2024-06-01 19:03:50] [INFO ] Deduced a trap composed of 37 places in 492 ms of which 5 ms to minimize.
[2024-06-01 19:03:51] [INFO ] Deduced a trap composed of 39 places in 504 ms of which 5 ms to minimize.
[2024-06-01 19:03:51] [INFO ] Deduced a trap composed of 29 places in 484 ms of which 5 ms to minimize.
[2024-06-01 19:03:52] [INFO ] Deduced a trap composed of 55 places in 471 ms of which 5 ms to minimize.
[2024-06-01 19:03:52] [INFO ] Deduced a trap composed of 96 places in 475 ms of which 5 ms to minimize.
[2024-06-01 19:03:53] [INFO ] Deduced a trap composed of 69 places in 479 ms of which 6 ms to minimize.
[2024-06-01 19:03:53] [INFO ] Deduced a trap composed of 50 places in 469 ms of which 5 ms to minimize.
[2024-06-01 19:03:54] [INFO ] Deduced a trap composed of 52 places in 480 ms of which 5 ms to minimize.
[2024-06-01 19:03:54] [INFO ] Deduced a trap composed of 69 places in 477 ms of which 6 ms to minimize.
[2024-06-01 19:03:55] [INFO ] Deduced a trap composed of 14 places in 432 ms of which 5 ms to minimize.
[2024-06-01 19:03:55] [INFO ] Deduced a trap composed of 15 places in 404 ms of which 4 ms to minimize.
[2024-06-01 19:03:56] [INFO ] Deduced a trap composed of 106 places in 433 ms of which 5 ms to minimize.
[2024-06-01 19:03:56] [INFO ] Deduced a trap composed of 98 places in 454 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2024-06-01 19:03:57] [INFO ] Deduced a trap composed of 73 places in 460 ms of which 6 ms to minimize.
[2024-06-01 19:03:58] [INFO ] Deduced a trap composed of 25 places in 464 ms of which 5 ms to minimize.
[2024-06-01 19:03:58] [INFO ] Deduced a trap composed of 21 places in 535 ms of which 5 ms to minimize.
[2024-06-01 19:03:59] [INFO ] Deduced a trap composed of 31 places in 411 ms of which 5 ms to minimize.
[2024-06-01 19:03:59] [INFO ] Deduced a trap composed of 30 places in 397 ms of which 5 ms to minimize.
[2024-06-01 19:04:00] [INFO ] Deduced a trap composed of 44 places in 409 ms of which 5 ms to minimize.
[2024-06-01 19:04:00] [INFO ] Deduced a trap composed of 56 places in 408 ms of which 5 ms to minimize.
[2024-06-01 19:04:01] [INFO ] Deduced a trap composed of 41 places in 388 ms of which 5 ms to minimize.
[2024-06-01 19:04:01] [INFO ] Deduced a trap composed of 29 places in 380 ms of which 5 ms to minimize.
[2024-06-01 19:04:01] [INFO ] Deduced a trap composed of 35 places in 389 ms of which 5 ms to minimize.
[2024-06-01 19:04:02] [INFO ] Deduced a trap composed of 44 places in 379 ms of which 5 ms to minimize.
[2024-06-01 19:04:02] [INFO ] Deduced a trap composed of 26 places in 404 ms of which 5 ms to minimize.
[2024-06-01 19:04:03] [INFO ] Deduced a trap composed of 51 places in 387 ms of which 4 ms to minimize.
[2024-06-01 19:04:03] [INFO ] Deduced a trap composed of 44 places in 400 ms of which 5 ms to minimize.
[2024-06-01 19:04:03] [INFO ] Deduced a trap composed of 25 places in 385 ms of which 5 ms to minimize.
[2024-06-01 19:04:04] [INFO ] Deduced a trap composed of 25 places in 350 ms of which 5 ms to minimize.
[2024-06-01 19:04:04] [INFO ] Deduced a trap composed of 32 places in 404 ms of which 5 ms to minimize.
[2024-06-01 19:04:05] [INFO ] Deduced a trap composed of 31 places in 437 ms of which 5 ms to minimize.
[2024-06-01 19:04:05] [INFO ] Deduced a trap composed of 13 places in 280 ms of which 4 ms to minimize.
[2024-06-01 19:04:05] [INFO ] Deduced a trap composed of 32 places in 449 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2024-06-01 19:04:06] [INFO ] Deduced a trap composed of 17 places in 442 ms of which 5 ms to minimize.
[2024-06-01 19:04:07] [INFO ] Deduced a trap composed of 52 places in 438 ms of which 5 ms to minimize.
[2024-06-01 19:04:07] [INFO ] Deduced a trap composed of 23 places in 441 ms of which 5 ms to minimize.
[2024-06-01 19:04:08] [INFO ] Deduced a trap composed of 11 places in 376 ms of which 5 ms to minimize.
[2024-06-01 19:04:08] [INFO ] Deduced a trap composed of 58 places in 468 ms of which 5 ms to minimize.
[2024-06-01 19:04:09] [INFO ] Deduced a trap composed of 49 places in 469 ms of which 5 ms to minimize.
[2024-06-01 19:04:09] [INFO ] Deduced a trap composed of 45 places in 480 ms of which 5 ms to minimize.
[2024-06-01 19:04:10] [INFO ] Deduced a trap composed of 22 places in 474 ms of which 5 ms to minimize.
[2024-06-01 19:04:10] [INFO ] Deduced a trap composed of 53 places in 431 ms of which 5 ms to minimize.
[2024-06-01 19:04:11] [INFO ] Deduced a trap composed of 28 places in 446 ms of which 5 ms to minimize.
[2024-06-01 19:04:11] [INFO ] Deduced a trap composed of 70 places in 482 ms of which 5 ms to minimize.
[2024-06-01 19:04:12] [INFO ] Deduced a trap composed of 49 places in 481 ms of which 5 ms to minimize.
[2024-06-01 19:04:12] [INFO ] Deduced a trap composed of 51 places in 496 ms of which 6 ms to minimize.
[2024-06-01 19:04:13] [INFO ] Deduced a trap composed of 47 places in 412 ms of which 5 ms to minimize.
[2024-06-01 19:04:13] [INFO ] Deduced a trap composed of 57 places in 364 ms of which 5 ms to minimize.
[2024-06-01 19:04:13] [INFO ] Deduced a trap composed of 39 places in 501 ms of which 5 ms to minimize.
[2024-06-01 19:04:14] [INFO ] Deduced a trap composed of 68 places in 380 ms of which 5 ms to minimize.
SMT process timed out in 60851ms, After SMT, problems are : Problem set: 0 solved, 1696 unsolved
Search for dead transitions found 0 dead transitions in 60871ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65578 ms. Remains : 592/592 places, 1704/1704 transitions.
RANDOM walk for 40000 steps (8 resets) in 193 ms. (206 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 286794 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :0 out of 2
Probabilistic random walk after 286794 steps, saw 51166 distinct states, run finished after 3001 ms. (steps per millisecond=95 ) properties seen :0
[2024-06-01 19:04:17] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2024-06-01 19:04:17] [INFO ] Invariant cache hit.
[2024-06-01 19:04:17] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 520/528 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/536 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1368/1904 variables, 536/552 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1904 variables, 497/1049 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1904 variables, 0/1049 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 56/1960 variables, 56/1105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1960 variables, 7/1112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1960 variables, 0/1112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1960 variables, 0/1112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1960/1960 variables, and 1112 constraints, problems are : Problem set: 0 solved, 2 unsolved in 944 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 592/592 constraints, ReadFeed: 497/497 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 520/528 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/536 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1368/1904 variables, 536/552 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1904 variables, 497/1049 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1904 variables, 2/1051 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1904 variables, 0/1051 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 56/1960 variables, 56/1107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1960 variables, 7/1114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:04:20] [INFO ] Deduced a trap composed of 24 places in 455 ms of which 4 ms to minimize.
[2024-06-01 19:04:20] [INFO ] Deduced a trap composed of 57 places in 478 ms of which 6 ms to minimize.
[2024-06-01 19:04:21] [INFO ] Deduced a trap composed of 25 places in 459 ms of which 5 ms to minimize.
[2024-06-01 19:04:21] [INFO ] Deduced a trap composed of 12 places in 336 ms of which 4 ms to minimize.
[2024-06-01 19:04:21] [INFO ] Deduced a trap composed of 32 places in 455 ms of which 5 ms to minimize.
[2024-06-01 19:04:22] [INFO ] Deduced a trap composed of 21 places in 375 ms of which 5 ms to minimize.
[2024-06-01 19:04:22] [INFO ] Deduced a trap composed of 38 places in 457 ms of which 5 ms to minimize.
[2024-06-01 19:04:23] [INFO ] Deduced a trap composed of 12 places in 435 ms of which 5 ms to minimize.
[2024-06-01 19:04:23] [INFO ] Deduced a trap composed of 12 places in 441 ms of which 5 ms to minimize.
SMT process timed out in 6264ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 25 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 592/592 places, 1704/1704 transitions.
RANDOM walk for 40000 steps (8 resets) in 626 ms. (63 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 283032 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :0 out of 2
Probabilistic random walk after 283032 steps, saw 50805 distinct states, run finished after 3004 ms. (steps per millisecond=94 ) properties seen :0
[2024-06-01 19:04:27] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2024-06-01 19:04:27] [INFO ] Invariant cache hit.
[2024-06-01 19:04:27] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 520/528 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/536 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1368/1904 variables, 536/552 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1904 variables, 497/1049 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1904 variables, 0/1049 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 56/1960 variables, 56/1105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1960 variables, 7/1112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1960 variables, 0/1112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1960 variables, 0/1112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1960/1960 variables, and 1112 constraints, problems are : Problem set: 0 solved, 2 unsolved in 970 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 592/592 constraints, ReadFeed: 497/497 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 520/528 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/536 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1368/1904 variables, 536/552 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1904 variables, 497/1049 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1904 variables, 2/1051 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1904 variables, 0/1051 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 56/1960 variables, 56/1107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1960 variables, 7/1114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:04:29] [INFO ] Deduced a trap composed of 24 places in 448 ms of which 5 ms to minimize.
[2024-06-01 19:04:30] [INFO ] Deduced a trap composed of 57 places in 458 ms of which 5 ms to minimize.
[2024-06-01 19:04:30] [INFO ] Deduced a trap composed of 25 places in 453 ms of which 5 ms to minimize.
[2024-06-01 19:04:31] [INFO ] Deduced a trap composed of 12 places in 454 ms of which 5 ms to minimize.
[2024-06-01 19:04:31] [INFO ] Deduced a trap composed of 32 places in 443 ms of which 5 ms to minimize.
[2024-06-01 19:04:32] [INFO ] Deduced a trap composed of 21 places in 442 ms of which 5 ms to minimize.
[2024-06-01 19:04:32] [INFO ] Deduced a trap composed of 38 places in 448 ms of which 5 ms to minimize.
[2024-06-01 19:04:33] [INFO ] Deduced a trap composed of 12 places in 444 ms of which 4 ms to minimize.
[2024-06-01 19:04:33] [INFO ] Deduced a trap composed of 12 places in 442 ms of which 5 ms to minimize.
[2024-06-01 19:04:34] [INFO ] Deduced a trap composed of 109 places in 451 ms of which 5 ms to minimize.
[2024-06-01 19:04:34] [INFO ] Deduced a trap composed of 56 places in 444 ms of which 5 ms to minimize.
[2024-06-01 19:04:34] [INFO ] Deduced a trap composed of 35 places in 443 ms of which 6 ms to minimize.
[2024-06-01 19:04:35] [INFO ] Deduced a trap composed of 46 places in 446 ms of which 5 ms to minimize.
[2024-06-01 19:04:35] [INFO ] Deduced a trap composed of 40 places in 450 ms of which 5 ms to minimize.
[2024-06-01 19:04:36] [INFO ] Deduced a trap composed of 26 places in 445 ms of which 5 ms to minimize.
[2024-06-01 19:04:36] [INFO ] Deduced a trap composed of 15 places in 439 ms of which 5 ms to minimize.
[2024-06-01 19:04:37] [INFO ] Deduced a trap composed of 68 places in 443 ms of which 5 ms to minimize.
[2024-06-01 19:04:37] [INFO ] Deduced a trap composed of 30 places in 436 ms of which 5 ms to minimize.
[2024-06-01 19:04:38] [INFO ] Deduced a trap composed of 54 places in 446 ms of which 5 ms to minimize.
[2024-06-01 19:04:38] [INFO ] Deduced a trap composed of 62 places in 433 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1960 variables, 20/1134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:04:39] [INFO ] Deduced a trap composed of 38 places in 439 ms of which 5 ms to minimize.
[2024-06-01 19:04:39] [INFO ] Deduced a trap composed of 100 places in 440 ms of which 5 ms to minimize.
[2024-06-01 19:04:40] [INFO ] Deduced a trap composed of 60 places in 440 ms of which 5 ms to minimize.
[2024-06-01 19:04:40] [INFO ] Deduced a trap composed of 46 places in 456 ms of which 5 ms to minimize.
[2024-06-01 19:04:41] [INFO ] Deduced a trap composed of 30 places in 444 ms of which 5 ms to minimize.
[2024-06-01 19:04:41] [INFO ] Deduced a trap composed of 56 places in 449 ms of which 5 ms to minimize.
[2024-06-01 19:04:42] [INFO ] Deduced a trap composed of 23 places in 442 ms of which 5 ms to minimize.
[2024-06-01 19:04:42] [INFO ] Deduced a trap composed of 12 places in 465 ms of which 5 ms to minimize.
[2024-06-01 19:04:43] [INFO ] Deduced a trap composed of 57 places in 454 ms of which 5 ms to minimize.
[2024-06-01 19:04:43] [INFO ] Deduced a trap composed of 17 places in 441 ms of which 5 ms to minimize.
[2024-06-01 19:04:44] [INFO ] Deduced a trap composed of 12 places in 442 ms of which 4 ms to minimize.
[2024-06-01 19:04:44] [INFO ] Deduced a trap composed of 83 places in 466 ms of which 5 ms to minimize.
[2024-06-01 19:04:45] [INFO ] Deduced a trap composed of 24 places in 422 ms of which 5 ms to minimize.
[2024-06-01 19:04:45] [INFO ] Deduced a trap composed of 45 places in 417 ms of which 4 ms to minimize.
[2024-06-01 19:04:46] [INFO ] Deduced a trap composed of 96 places in 454 ms of which 5 ms to minimize.
[2024-06-01 19:04:46] [INFO ] Deduced a trap composed of 129 places in 427 ms of which 5 ms to minimize.
[2024-06-01 19:04:46] [INFO ] Deduced a trap composed of 73 places in 420 ms of which 5 ms to minimize.
[2024-06-01 19:04:47] [INFO ] Deduced a trap composed of 53 places in 411 ms of which 5 ms to minimize.
[2024-06-01 19:04:47] [INFO ] Deduced a trap composed of 58 places in 412 ms of which 5 ms to minimize.
[2024-06-01 19:04:48] [INFO ] Deduced a trap composed of 45 places in 389 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1960 variables, 20/1154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:04:48] [INFO ] Deduced a trap composed of 44 places in 450 ms of which 5 ms to minimize.
[2024-06-01 19:04:49] [INFO ] Deduced a trap composed of 92 places in 431 ms of which 5 ms to minimize.
[2024-06-01 19:04:49] [INFO ] Deduced a trap composed of 22 places in 432 ms of which 5 ms to minimize.
[2024-06-01 19:04:50] [INFO ] Deduced a trap composed of 21 places in 427 ms of which 5 ms to minimize.
[2024-06-01 19:04:50] [INFO ] Deduced a trap composed of 24 places in 424 ms of which 5 ms to minimize.
[2024-06-01 19:04:51] [INFO ] Deduced a trap composed of 46 places in 428 ms of which 5 ms to minimize.
[2024-06-01 19:04:51] [INFO ] Deduced a trap composed of 20 places in 433 ms of which 5 ms to minimize.
[2024-06-01 19:04:52] [INFO ] Deduced a trap composed of 37 places in 418 ms of which 5 ms to minimize.
[2024-06-01 19:04:52] [INFO ] Deduced a trap composed of 41 places in 438 ms of which 5 ms to minimize.
[2024-06-01 19:04:53] [INFO ] Deduced a trap composed of 78 places in 428 ms of which 5 ms to minimize.
[2024-06-01 19:04:53] [INFO ] Deduced a trap composed of 34 places in 422 ms of which 5 ms to minimize.
Problem MAX0 is UNSAT
[2024-06-01 19:04:54] [INFO ] Deduced a trap composed of 15 places in 456 ms of which 5 ms to minimize.
[2024-06-01 19:04:54] [INFO ] Deduced a trap composed of 81 places in 387 ms of which 4 ms to minimize.
[2024-06-01 19:04:54] [INFO ] Deduced a trap composed of 68 places in 365 ms of which 4 ms to minimize.
[2024-06-01 19:04:55] [INFO ] Deduced a trap composed of 68 places in 377 ms of which 4 ms to minimize.
[2024-06-01 19:04:55] [INFO ] Deduced a trap composed of 55 places in 379 ms of which 5 ms to minimize.
[2024-06-01 19:04:56] [INFO ] Deduced a trap composed of 47 places in 380 ms of which 5 ms to minimize.
[2024-06-01 19:04:56] [INFO ] Deduced a trap composed of 35 places in 397 ms of which 5 ms to minimize.
[2024-06-01 19:04:57] [INFO ] Deduced a trap composed of 45 places in 387 ms of which 5 ms to minimize.
[2024-06-01 19:04:57] [INFO ] Deduced a trap composed of 21 places in 316 ms of which 4 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 13 (INCLUDED_ONLY) 0/1960 variables, 20/1174 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 19:04:58] [INFO ] Deduced a trap composed of 14 places in 445 ms of which 5 ms to minimize.
[2024-06-01 19:04:58] [INFO ] Deduced a trap composed of 16 places in 446 ms of which 6 ms to minimize.
[2024-06-01 19:04:58] [INFO ] Deduced a trap composed of 65 places in 389 ms of which 5 ms to minimize.
[2024-06-01 19:04:59] [INFO ] Deduced a trap composed of 29 places in 328 ms of which 5 ms to minimize.
[2024-06-01 19:04:59] [INFO ] Deduced a trap composed of 102 places in 397 ms of which 5 ms to minimize.
[2024-06-01 19:05:00] [INFO ] Deduced a trap composed of 75 places in 410 ms of which 5 ms to minimize.
[2024-06-01 19:05:00] [INFO ] Deduced a trap composed of 40 places in 390 ms of which 4 ms to minimize.
[2024-06-01 19:05:01] [INFO ] Deduced a trap composed of 56 places in 386 ms of which 5 ms to minimize.
[2024-06-01 19:05:01] [INFO ] Deduced a trap composed of 31 places in 344 ms of which 5 ms to minimize.
[2024-06-01 19:05:01] [INFO ] Deduced a trap composed of 51 places in 395 ms of which 5 ms to minimize.
[2024-06-01 19:05:02] [INFO ] Deduced a trap composed of 76 places in 391 ms of which 4 ms to minimize.
[2024-06-01 19:05:02] [INFO ] Deduced a trap composed of 71 places in 342 ms of which 4 ms to minimize.
[2024-06-01 19:05:03] [INFO ] Deduced a trap composed of 29 places in 393 ms of which 5 ms to minimize.
[2024-06-01 19:05:03] [INFO ] Deduced a trap composed of 45 places in 337 ms of which 4 ms to minimize.
[2024-06-01 19:05:03] [INFO ] Deduced a trap composed of 43 places in 333 ms of which 5 ms to minimize.
[2024-06-01 19:05:04] [INFO ] Deduced a trap composed of 55 places in 355 ms of which 5 ms to minimize.
[2024-06-01 19:05:04] [INFO ] Deduced a trap composed of 33 places in 430 ms of which 5 ms to minimize.
[2024-06-01 19:05:05] [INFO ] Deduced a trap composed of 50 places in 394 ms of which 4 ms to minimize.
[2024-06-01 19:05:05] [INFO ] Deduced a trap composed of 44 places in 384 ms of which 5 ms to minimize.
[2024-06-01 19:05:06] [INFO ] Deduced a trap composed of 85 places in 430 ms of which 10 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1960 variables, 20/1194 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 19:05:06] [INFO ] Deduced a trap composed of 20 places in 394 ms of which 4 ms to minimize.
[2024-06-01 19:05:07] [INFO ] Deduced a trap composed of 20 places in 358 ms of which 5 ms to minimize.
[2024-06-01 19:05:07] [INFO ] Deduced a trap composed of 85 places in 395 ms of which 5 ms to minimize.
[2024-06-01 19:05:07] [INFO ] Deduced a trap composed of 74 places in 398 ms of which 5 ms to minimize.
[2024-06-01 19:05:08] [INFO ] Deduced a trap composed of 67 places in 409 ms of which 5 ms to minimize.
[2024-06-01 19:05:08] [INFO ] Deduced a trap composed of 39 places in 400 ms of which 5 ms to minimize.
[2024-06-01 19:05:09] [INFO ] Deduced a trap composed of 40 places in 341 ms of which 5 ms to minimize.
[2024-06-01 19:05:09] [INFO ] Deduced a trap composed of 14 places in 445 ms of which 5 ms to minimize.
[2024-06-01 19:05:10] [INFO ] Deduced a trap composed of 16 places in 438 ms of which 5 ms to minimize.
[2024-06-01 19:05:10] [INFO ] Deduced a trap composed of 25 places in 422 ms of which 5 ms to minimize.
[2024-06-01 19:05:11] [INFO ] Deduced a trap composed of 26 places in 418 ms of which 5 ms to minimize.
[2024-06-01 19:05:11] [INFO ] Deduced a trap composed of 50 places in 388 ms of which 5 ms to minimize.
[2024-06-01 19:05:12] [INFO ] Deduced a trap composed of 61 places in 368 ms of which 5 ms to minimize.
[2024-06-01 19:05:12] [INFO ] Deduced a trap composed of 82 places in 362 ms of which 5 ms to minimize.
[2024-06-01 19:05:12] [INFO ] Deduced a trap composed of 52 places in 367 ms of which 5 ms to minimize.
[2024-06-01 19:05:13] [INFO ] Deduced a trap composed of 38 places in 292 ms of which 4 ms to minimize.
SMT process timed out in 46257ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 25 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 592/592 places, 1704/1704 transitions.
RANDOM walk for 40000 steps (8 resets) in 164 ms. (242 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 381960 steps, run timeout after 3001 ms. (steps per millisecond=127 ) properties seen :0 out of 1
Probabilistic random walk after 381960 steps, saw 62105 distinct states, run finished after 3001 ms. (steps per millisecond=127 ) properties seen :0
[2024-06-01 19:05:16] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2024-06-01 19:05:16] [INFO ] Invariant cache hit.
[2024-06-01 19:05:16] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 520/528 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/536 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1368/1904 variables, 536/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1904 variables, 497/1049 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1904 variables, 0/1049 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 56/1960 variables, 56/1105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1960 variables, 7/1112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1960 variables, 0/1112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1960 variables, 0/1112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1960/1960 variables, and 1112 constraints, problems are : Problem set: 0 solved, 1 unsolved in 671 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 592/592 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 520/528 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:05:17] [INFO ] Deduced a trap composed of 89 places in 90 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/536 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/536 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1368/1904 variables, 536/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1904 variables, 497/1050 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1904 variables, 1/1051 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1904 variables, 0/1051 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 56/1960 variables, 56/1107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1960 variables, 7/1114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:05:18] [INFO ] Deduced a trap composed of 27 places in 454 ms of which 5 ms to minimize.
[2024-06-01 19:05:18] [INFO ] Deduced a trap composed of 36 places in 429 ms of which 5 ms to minimize.
[2024-06-01 19:05:19] [INFO ] Deduced a trap composed of 34 places in 352 ms of which 5 ms to minimize.
[2024-06-01 19:05:19] [INFO ] Deduced a trap composed of 42 places in 424 ms of which 5 ms to minimize.
[2024-06-01 19:05:20] [INFO ] Deduced a trap composed of 20 places in 434 ms of which 5 ms to minimize.
[2024-06-01 19:05:20] [INFO ] Deduced a trap composed of 11 places in 416 ms of which 4 ms to minimize.
[2024-06-01 19:05:21] [INFO ] Deduced a trap composed of 33 places in 421 ms of which 5 ms to minimize.
[2024-06-01 19:05:21] [INFO ] Deduced a trap composed of 28 places in 436 ms of which 5 ms to minimize.
[2024-06-01 19:05:22] [INFO ] Deduced a trap composed of 25 places in 443 ms of which 6 ms to minimize.
[2024-06-01 19:05:22] [INFO ] Deduced a trap composed of 19 places in 412 ms of which 4 ms to minimize.
[2024-06-01 19:05:23] [INFO ] Deduced a trap composed of 25 places in 438 ms of which 5 ms to minimize.
[2024-06-01 19:05:23] [INFO ] Deduced a trap composed of 14 places in 429 ms of which 5 ms to minimize.
[2024-06-01 19:05:24] [INFO ] Deduced a trap composed of 13 places in 440 ms of which 5 ms to minimize.
[2024-06-01 19:05:24] [INFO ] Deduced a trap composed of 35 places in 424 ms of which 5 ms to minimize.
[2024-06-01 19:05:24] [INFO ] Deduced a trap composed of 38 places in 409 ms of which 5 ms to minimize.
[2024-06-01 19:05:25] [INFO ] Deduced a trap composed of 28 places in 421 ms of which 5 ms to minimize.
[2024-06-01 19:05:25] [INFO ] Deduced a trap composed of 65 places in 415 ms of which 5 ms to minimize.
[2024-06-01 19:05:26] [INFO ] Deduced a trap composed of 57 places in 411 ms of which 5 ms to minimize.
[2024-06-01 19:05:26] [INFO ] Deduced a trap composed of 45 places in 406 ms of which 5 ms to minimize.
[2024-06-01 19:05:27] [INFO ] Deduced a trap composed of 70 places in 408 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1960 variables, 20/1134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:05:27] [INFO ] Deduced a trap composed of 63 places in 389 ms of which 4 ms to minimize.
[2024-06-01 19:05:28] [INFO ] Deduced a trap composed of 74 places in 404 ms of which 5 ms to minimize.
[2024-06-01 19:05:29] [INFO ] Deduced a trap composed of 33 places in 429 ms of which 4 ms to minimize.
[2024-06-01 19:05:29] [INFO ] Deduced a trap composed of 31 places in 433 ms of which 5 ms to minimize.
[2024-06-01 19:05:30] [INFO ] Deduced a trap composed of 34 places in 353 ms of which 5 ms to minimize.
[2024-06-01 19:05:30] [INFO ] Deduced a trap composed of 32 places in 387 ms of which 4 ms to minimize.
[2024-06-01 19:05:31] [INFO ] Deduced a trap composed of 69 places in 388 ms of which 5 ms to minimize.
[2024-06-01 19:05:31] [INFO ] Deduced a trap composed of 34 places in 390 ms of which 5 ms to minimize.
[2024-06-01 19:05:32] [INFO ] Deduced a trap composed of 53 places in 413 ms of which 5 ms to minimize.
[2024-06-01 19:05:32] [INFO ] Deduced a trap composed of 78 places in 412 ms of which 5 ms to minimize.
[2024-06-01 19:05:33] [INFO ] Deduced a trap composed of 23 places in 397 ms of which 4 ms to minimize.
[2024-06-01 19:05:33] [INFO ] Deduced a trap composed of 61 places in 401 ms of which 5 ms to minimize.
[2024-06-01 19:05:34] [INFO ] Deduced a trap composed of 33 places in 428 ms of which 5 ms to minimize.
[2024-06-01 19:05:34] [INFO ] Deduced a trap composed of 20 places in 409 ms of which 4 ms to minimize.
[2024-06-01 19:05:35] [INFO ] Deduced a trap composed of 32 places in 401 ms of which 5 ms to minimize.
[2024-06-01 19:05:35] [INFO ] Deduced a trap composed of 27 places in 364 ms of which 5 ms to minimize.
[2024-06-01 19:05:35] [INFO ] Deduced a trap composed of 85 places in 392 ms of which 5 ms to minimize.
[2024-06-01 19:05:36] [INFO ] Deduced a trap composed of 47 places in 391 ms of which 4 ms to minimize.
[2024-06-01 19:05:36] [INFO ] Deduced a trap composed of 30 places in 392 ms of which 5 ms to minimize.
[2024-06-01 19:05:37] [INFO ] Deduced a trap composed of 21 places in 413 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1960 variables, 20/1154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:05:38] [INFO ] Deduced a trap composed of 30 places in 425 ms of which 5 ms to minimize.
[2024-06-01 19:05:38] [INFO ] Deduced a trap composed of 15 places in 415 ms of which 5 ms to minimize.
[2024-06-01 19:05:39] [INFO ] Deduced a trap composed of 47 places in 387 ms of which 5 ms to minimize.
[2024-06-01 19:05:39] [INFO ] Deduced a trap composed of 57 places in 373 ms of which 5 ms to minimize.
[2024-06-01 19:05:39] [INFO ] Deduced a trap composed of 25 places in 360 ms of which 5 ms to minimize.
[2024-06-01 19:05:40] [INFO ] Deduced a trap composed of 29 places in 389 ms of which 4 ms to minimize.
[2024-06-01 19:05:40] [INFO ] Deduced a trap composed of 22 places in 440 ms of which 5 ms to minimize.
[2024-06-01 19:05:41] [INFO ] Deduced a trap composed of 13 places in 446 ms of which 5 ms to minimize.
[2024-06-01 19:05:41] [INFO ] Deduced a trap composed of 27 places in 413 ms of which 5 ms to minimize.
[2024-06-01 19:05:42] [INFO ] Deduced a trap composed of 26 places in 416 ms of which 4 ms to minimize.
[2024-06-01 19:05:42] [INFO ] Deduced a trap composed of 21 places in 440 ms of which 5 ms to minimize.
[2024-06-01 19:05:43] [INFO ] Deduced a trap composed of 26 places in 427 ms of which 5 ms to minimize.
[2024-06-01 19:05:43] [INFO ] Deduced a trap composed of 14 places in 406 ms of which 4 ms to minimize.
[2024-06-01 19:05:44] [INFO ] Deduced a trap composed of 51 places in 397 ms of which 4 ms to minimize.
[2024-06-01 19:05:44] [INFO ] Deduced a trap composed of 68 places in 400 ms of which 4 ms to minimize.
[2024-06-01 19:05:45] [INFO ] Deduced a trap composed of 53 places in 401 ms of which 5 ms to minimize.
[2024-06-01 19:05:45] [INFO ] Deduced a trap composed of 52 places in 400 ms of which 5 ms to minimize.
[2024-06-01 19:05:45] [INFO ] Deduced a trap composed of 29 places in 405 ms of which 5 ms to minimize.
[2024-06-01 19:05:46] [INFO ] Deduced a trap composed of 77 places in 376 ms of which 5 ms to minimize.
[2024-06-01 19:05:46] [INFO ] Deduced a trap composed of 66 places in 376 ms of which 5 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1960 variables, 20/1174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:05:47] [INFO ] Deduced a trap composed of 62 places in 366 ms of which 5 ms to minimize.
[2024-06-01 19:05:47] [INFO ] Deduced a trap composed of 61 places in 368 ms of which 4 ms to minimize.
[2024-06-01 19:05:48] [INFO ] Deduced a trap composed of 54 places in 365 ms of which 5 ms to minimize.
[2024-06-01 19:05:48] [INFO ] Deduced a trap composed of 101 places in 338 ms of which 4 ms to minimize.
[2024-06-01 19:05:48] [INFO ] Deduced a trap composed of 41 places in 358 ms of which 5 ms to minimize.
[2024-06-01 19:05:49] [INFO ] Deduced a trap composed of 25 places in 284 ms of which 4 ms to minimize.
[2024-06-01 19:05:49] [INFO ] Deduced a trap composed of 22 places in 376 ms of which 5 ms to minimize.
[2024-06-01 19:05:50] [INFO ] Deduced a trap composed of 20 places in 323 ms of which 5 ms to minimize.
[2024-06-01 19:05:50] [INFO ] Deduced a trap composed of 20 places in 362 ms of which 5 ms to minimize.
[2024-06-01 19:05:51] [INFO ] Deduced a trap composed of 11 places in 403 ms of which 4 ms to minimize.
[2024-06-01 19:05:51] [INFO ] Deduced a trap composed of 21 places in 388 ms of which 5 ms to minimize.
[2024-06-01 19:05:51] [INFO ] Deduced a trap composed of 28 places in 351 ms of which 4 ms to minimize.
[2024-06-01 19:05:52] [INFO ] Deduced a trap composed of 29 places in 328 ms of which 4 ms to minimize.
[2024-06-01 19:05:52] [INFO ] Deduced a trap composed of 27 places in 340 ms of which 5 ms to minimize.
[2024-06-01 19:05:53] [INFO ] Deduced a trap composed of 44 places in 355 ms of which 4 ms to minimize.
[2024-06-01 19:05:53] [INFO ] Deduced a trap composed of 29 places in 350 ms of which 4 ms to minimize.
[2024-06-01 19:05:54] [INFO ] Deduced a trap composed of 71 places in 367 ms of which 4 ms to minimize.
[2024-06-01 19:05:54] [INFO ] Deduced a trap composed of 39 places in 363 ms of which 5 ms to minimize.
[2024-06-01 19:05:54] [INFO ] Deduced a trap composed of 30 places in 363 ms of which 4 ms to minimize.
[2024-06-01 19:05:55] [INFO ] Deduced a trap composed of 87 places in 366 ms of which 5 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1960 variables, 20/1194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:05:55] [INFO ] Deduced a trap composed of 63 places in 362 ms of which 4 ms to minimize.
[2024-06-01 19:05:56] [INFO ] Deduced a trap composed of 78 places in 391 ms of which 4 ms to minimize.
[2024-06-01 19:05:56] [INFO ] Deduced a trap composed of 66 places in 362 ms of which 4 ms to minimize.
[2024-06-01 19:05:57] [INFO ] Deduced a trap composed of 39 places in 352 ms of which 5 ms to minimize.
[2024-06-01 19:05:57] [INFO ] Deduced a trap composed of 41 places in 356 ms of which 4 ms to minimize.
[2024-06-01 19:05:57] [INFO ] Deduced a trap composed of 30 places in 353 ms of which 5 ms to minimize.
[2024-06-01 19:05:58] [INFO ] Deduced a trap composed of 25 places in 363 ms of which 4 ms to minimize.
[2024-06-01 19:05:59] [INFO ] Deduced a trap composed of 56 places in 392 ms of which 4 ms to minimize.
[2024-06-01 19:05:59] [INFO ] Deduced a trap composed of 31 places in 380 ms of which 4 ms to minimize.
[2024-06-01 19:06:00] [INFO ] Deduced a trap composed of 40 places in 416 ms of which 5 ms to minimize.
[2024-06-01 19:06:01] [INFO ] Deduced a trap composed of 51 places in 358 ms of which 4 ms to minimize.
[2024-06-01 19:06:01] [INFO ] Deduced a trap composed of 41 places in 361 ms of which 5 ms to minimize.
[2024-06-01 19:06:02] [INFO ] Deduced a trap composed of 54 places in 370 ms of which 5 ms to minimize.
[2024-06-01 19:06:02] [INFO ] Deduced a trap composed of 33 places in 416 ms of which 5 ms to minimize.
[2024-06-01 19:06:03] [INFO ] Deduced a trap composed of 47 places in 396 ms of which 5 ms to minimize.
[2024-06-01 19:06:03] [INFO ] Deduced a trap composed of 74 places in 379 ms of which 5 ms to minimize.
[2024-06-01 19:06:04] [INFO ] Deduced a trap composed of 108 places in 370 ms of which 4 ms to minimize.
[2024-06-01 19:06:04] [INFO ] Deduced a trap composed of 65 places in 381 ms of which 4 ms to minimize.
[2024-06-01 19:06:05] [INFO ] Deduced a trap composed of 47 places in 384 ms of which 5 ms to minimize.
[2024-06-01 19:06:09] [INFO ] Deduced a trap composed of 31 places in 346 ms of which 4 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1960 variables, 20/1214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:06:10] [INFO ] Deduced a trap composed of 24 places in 351 ms of which 4 ms to minimize.
[2024-06-01 19:06:10] [INFO ] Deduced a trap composed of 14 places in 334 ms of which 4 ms to minimize.
[2024-06-01 19:06:11] [INFO ] Deduced a trap composed of 29 places in 317 ms of which 4 ms to minimize.
[2024-06-01 19:06:11] [INFO ] Deduced a trap composed of 32 places in 388 ms of which 5 ms to minimize.
[2024-06-01 19:06:12] [INFO ] Deduced a trap composed of 59 places in 397 ms of which 5 ms to minimize.
[2024-06-01 19:06:13] [INFO ] Deduced a trap composed of 33 places in 378 ms of which 4 ms to minimize.
[2024-06-01 19:06:13] [INFO ] Deduced a trap composed of 33 places in 378 ms of which 4 ms to minimize.
[2024-06-01 19:06:14] [INFO ] Deduced a trap composed of 60 places in 364 ms of which 5 ms to minimize.
[2024-06-01 19:06:14] [INFO ] Deduced a trap composed of 40 places in 346 ms of which 4 ms to minimize.
[2024-06-01 19:06:14] [INFO ] Deduced a trap composed of 59 places in 363 ms of which 5 ms to minimize.
[2024-06-01 19:06:15] [INFO ] Deduced a trap composed of 29 places in 367 ms of which 5 ms to minimize.
[2024-06-01 19:06:15] [INFO ] Deduced a trap composed of 66 places in 336 ms of which 4 ms to minimize.
[2024-06-01 19:06:16] [INFO ] Deduced a trap composed of 82 places in 345 ms of which 4 ms to minimize.
[2024-06-01 19:06:17] [INFO ] Deduced a trap composed of 34 places in 336 ms of which 4 ms to minimize.
[2024-06-01 19:06:17] [INFO ] Deduced a trap composed of 49 places in 336 ms of which 4 ms to minimize.
[2024-06-01 19:06:18] [INFO ] Deduced a trap composed of 34 places in 326 ms of which 5 ms to minimize.
[2024-06-01 19:06:18] [INFO ] Deduced a trap composed of 48 places in 321 ms of which 5 ms to minimize.
[2024-06-01 19:06:18] [INFO ] Deduced a trap composed of 49 places in 324 ms of which 4 ms to minimize.
[2024-06-01 19:06:19] [INFO ] Deduced a trap composed of 34 places in 335 ms of which 4 ms to minimize.
[2024-06-01 19:06:20] [INFO ] Deduced a trap composed of 35 places in 302 ms of which 4 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1960 variables, 20/1234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:06:20] [INFO ] Deduced a trap composed of 21 places in 392 ms of which 5 ms to minimize.
[2024-06-01 19:06:21] [INFO ] Deduced a trap composed of 38 places in 326 ms of which 4 ms to minimize.
[2024-06-01 19:06:21] [INFO ] Deduced a trap composed of 38 places in 303 ms of which 4 ms to minimize.
[2024-06-01 19:06:22] [INFO ] Deduced a trap composed of 39 places in 315 ms of which 4 ms to minimize.
[2024-06-01 19:06:22] [INFO ] Deduced a trap composed of 41 places in 331 ms of which 4 ms to minimize.
[2024-06-01 19:06:23] [INFO ] Deduced a trap composed of 48 places in 287 ms of which 4 ms to minimize.
[2024-06-01 19:06:23] [INFO ] Deduced a trap composed of 63 places in 357 ms of which 5 ms to minimize.
[2024-06-01 19:06:24] [INFO ] Deduced a trap composed of 42 places in 334 ms of which 4 ms to minimize.
[2024-06-01 19:06:24] [INFO ] Deduced a trap composed of 52 places in 311 ms of which 4 ms to minimize.
[2024-06-01 19:06:25] [INFO ] Deduced a trap composed of 31 places in 284 ms of which 4 ms to minimize.
[2024-06-01 19:06:25] [INFO ] Deduced a trap composed of 47 places in 331 ms of which 4 ms to minimize.
[2024-06-01 19:06:26] [INFO ] Deduced a trap composed of 38 places in 336 ms of which 4 ms to minimize.
[2024-06-01 19:06:27] [INFO ] Deduced a trap composed of 56 places in 310 ms of which 4 ms to minimize.
[2024-06-01 19:06:27] [INFO ] Deduced a trap composed of 38 places in 338 ms of which 4 ms to minimize.
[2024-06-01 19:06:29] [INFO ] Deduced a trap composed of 23 places in 341 ms of which 4 ms to minimize.
[2024-06-01 19:06:30] [INFO ] Deduced a trap composed of 42 places in 283 ms of which 4 ms to minimize.
[2024-06-01 19:06:30] [INFO ] Deduced a trap composed of 47 places in 285 ms of which 4 ms to minimize.
[2024-06-01 19:06:30] [INFO ] Deduced a trap composed of 73 places in 289 ms of which 4 ms to minimize.
[2024-06-01 19:06:31] [INFO ] Deduced a trap composed of 22 places in 353 ms of which 4 ms to minimize.
[2024-06-01 19:06:31] [INFO ] Deduced a trap composed of 58 places in 292 ms of which 4 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1960 variables, 20/1254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:06:31] [INFO ] Deduced a trap composed of 55 places in 283 ms of which 3 ms to minimize.
[2024-06-01 19:06:32] [INFO ] Deduced a trap composed of 47 places in 270 ms of which 8 ms to minimize.
SMT process timed out in 75711ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 31 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 592/592 places, 1704/1704 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 27 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2024-06-01 19:06:32] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2024-06-01 19:06:32] [INFO ] Invariant cache hit.
[2024-06-01 19:06:33] [INFO ] Implicit Places using invariants in 866 ms returned []
[2024-06-01 19:06:33] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2024-06-01 19:06:33] [INFO ] Invariant cache hit.
[2024-06-01 19:06:33] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-06-01 19:06:37] [INFO ] Implicit Places using invariants and state equation in 3929 ms returned []
Implicit Place search using SMT with State Equation took 4798 ms to find 0 implicit places.
[2024-06-01 19:06:37] [INFO ] Redundant transitions in 34 ms returned []
Running 1696 sub problems to find dead transitions.
[2024-06-01 19:06:37] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2024-06-01 19:06:37] [INFO ] Invariant cache hit.
[2024-06-01 19:06:37] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2024-06-01 19:06:58] [INFO ] Deduced a trap composed of 79 places in 481 ms of which 6 ms to minimize.
[2024-06-01 19:06:58] [INFO ] Deduced a trap composed of 41 places in 489 ms of which 5 ms to minimize.
[2024-06-01 19:06:59] [INFO ] Deduced a trap composed of 53 places in 468 ms of which 5 ms to minimize.
[2024-06-01 19:06:59] [INFO ] Deduced a trap composed of 37 places in 493 ms of which 5 ms to minimize.
[2024-06-01 19:07:00] [INFO ] Deduced a trap composed of 14 places in 443 ms of which 5 ms to minimize.
[2024-06-01 19:07:00] [INFO ] Deduced a trap composed of 42 places in 424 ms of which 4 ms to minimize.
[2024-06-01 19:07:00] [INFO ] Deduced a trap composed of 81 places in 414 ms of which 5 ms to minimize.
[2024-06-01 19:07:01] [INFO ] Deduced a trap composed of 65 places in 405 ms of which 5 ms to minimize.
[2024-06-01 19:07:01] [INFO ] Deduced a trap composed of 61 places in 409 ms of which 4 ms to minimize.
[2024-06-01 19:07:02] [INFO ] Deduced a trap composed of 35 places in 394 ms of which 5 ms to minimize.
[2024-06-01 19:07:02] [INFO ] Deduced a trap composed of 39 places in 465 ms of which 5 ms to minimize.
[2024-06-01 19:07:03] [INFO ] Deduced a trap composed of 68 places in 456 ms of which 5 ms to minimize.
[2024-06-01 19:07:03] [INFO ] Deduced a trap composed of 81 places in 441 ms of which 5 ms to minimize.
[2024-06-01 19:07:03] [INFO ] Deduced a trap composed of 41 places in 441 ms of which 5 ms to minimize.
[2024-06-01 19:07:04] [INFO ] Deduced a trap composed of 109 places in 410 ms of which 5 ms to minimize.
[2024-06-01 19:07:04] [INFO ] Deduced a trap composed of 59 places in 411 ms of which 5 ms to minimize.
[2024-06-01 19:07:05] [INFO ] Deduced a trap composed of 41 places in 418 ms of which 5 ms to minimize.
[2024-06-01 19:07:06] [INFO ] Deduced a trap composed of 43 places in 739 ms of which 10 ms to minimize.
[2024-06-01 19:07:06] [INFO ] Deduced a trap composed of 54 places in 469 ms of which 6 ms to minimize.
[2024-06-01 19:07:06] [INFO ] Deduced a trap composed of 32 places in 404 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2024-06-01 19:07:08] [INFO ] Deduced a trap composed of 13 places in 482 ms of which 5 ms to minimize.
SMT process timed out in 30976ms, After SMT, problems are : Problem set: 0 solved, 1696 unsolved
Search for dead transitions found 0 dead transitions in 30997ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35866 ms. Remains : 592/592 places, 1704/1704 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[8]
Ending property specific reduction for Peterson-COL-7-UpperBounds-02 in 295140 ms.
[2024-06-01 19:07:08] [INFO ] Flatten gal took : 402 ms
[2024-06-01 19:07:08] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 4 ms.
[2024-06-01 19:07:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1096 places, 2208 transitions and 7792 arcs took 21 ms.
Total runtime 1182039 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : Peterson-COL-7-UpperBounds-01
Could not compute solution for formula : Peterson-COL-7-UpperBounds-02
BK_STOP 1717268828960
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name Peterson-COL-7-UpperBounds-01
ub formula formula --maxsum=/tmp/3416/ub_0_
ub formula name Peterson-COL-7-UpperBounds-02
ub formula formula --maxsum=/tmp/3416/ub_1_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Peterson-COL-7"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is Peterson-COL-7, 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 r512-smll-171654407200245"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-7.tgz
mv Peterson-COL-7 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 ;