About the Execution of 2022-gold for Peterson-COL-6
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16220.023 | 3600000.00 | 2861471.00 | 275180.60 | 7 6 7 7 7 6 6 7 7 7 7 ? 6 6 7 6 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r287-smll-167863553800074.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is Peterson-COL-6, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r287-smll-167863553800074
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 8.3K Feb 25 22:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 25 22:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 22:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 22:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 22:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 25 22:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 25 22:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 25 22:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 46K Mar 5 18:23 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-6-UpperBounds-00
FORMULA_NAME Peterson-COL-6-UpperBounds-01
FORMULA_NAME Peterson-COL-6-UpperBounds-02
FORMULA_NAME Peterson-COL-6-UpperBounds-03
FORMULA_NAME Peterson-COL-6-UpperBounds-04
FORMULA_NAME Peterson-COL-6-UpperBounds-05
FORMULA_NAME Peterson-COL-6-UpperBounds-06
FORMULA_NAME Peterson-COL-6-UpperBounds-07
FORMULA_NAME Peterson-COL-6-UpperBounds-08
FORMULA_NAME Peterson-COL-6-UpperBounds-09
FORMULA_NAME Peterson-COL-6-UpperBounds-10
FORMULA_NAME Peterson-COL-6-UpperBounds-11
FORMULA_NAME Peterson-COL-6-UpperBounds-12
FORMULA_NAME Peterson-COL-6-UpperBounds-13
FORMULA_NAME Peterson-COL-6-UpperBounds-14
FORMULA_NAME Peterson-COL-6-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678918714095
Running Version 202205111006
[2023-03-15 22:18:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-15 22:18:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 22:18:36] [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.
[2023-03-15 22:18:37] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 22:18:38] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1444 ms
[2023-03-15 22:18:38] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 1372 PT places and 2247.0 transition bindings in 32 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
[2023-03-15 22:18:38] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 9 ms.
[2023-03-15 22:18:38] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Reduce places removed 2 places and 0 transitions.
// Phase 1: matrix 14 rows 9 cols
[2023-03-15 22:18:38] [INFO ] Computed 1 place invariants in 6 ms
FORMULA Peterson-COL-6-UpperBounds-13 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-6-UpperBounds-10 7 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-6-UpperBounds-06 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-6-UpperBounds-05 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-6-UpperBounds-02 7 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
// Phase 1: matrix 14 rows 9 cols
[2023-03-15 22:18:38] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-15 22:18:38] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-15 22:18:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:18:38] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2023-03-15 22:18:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:18:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:18:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:18:38] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-15 22:18:38] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-15 22:18:38] [INFO ] Added : 11 causal constraints over 3 iterations in 51 ms. Result :sat
Minimization took 13 ms.
[2023-03-15 22:18:38] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:18:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:18:38] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-15 22:18:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:18:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-15 22:18:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:18:39] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-15 22:18:39] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-15 22:18:39] [INFO ] Added : 11 causal constraints over 4 iterations in 36 ms. Result :sat
Minimization took 8 ms.
[2023-03-15 22:18:39] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-15 22:18:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:18:39] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-15 22:18:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:18:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:18:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:18:39] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-15 22:18:39] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-15 22:18:39] [INFO ] Added : 11 causal constraints over 4 iterations in 48 ms. Result :sat
Minimization took 35 ms.
[2023-03-15 22:18:39] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:18:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:18:39] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-15 22:18:39] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-15 22:18:39] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Minimization took 7 ms.
[2023-03-15 22:18:39] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:18:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:18:39] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-15 22:18:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:18:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:18:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:18:39] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-15 22:18:39] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 22:18:39] [INFO ] Added : 11 causal constraints over 4 iterations in 24 ms. Result :sat
Minimization took 8 ms.
[2023-03-15 22:18:39] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:18:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:18:39] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-15 22:18:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:18:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:18:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:18:39] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-15 22:18:39] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 22:18:39] [INFO ] Added : 11 causal constraints over 4 iterations in 44 ms. Result :sat
Minimization took 9 ms.
[2023-03-15 22:18:39] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:18:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:18:39] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-15 22:18:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:18:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:18:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:18:39] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-15 22:18:39] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-15 22:18:39] [INFO ] Added : 11 causal constraints over 3 iterations in 34 ms. Result :sat
Minimization took 8 ms.
[2023-03-15 22:18:39] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-15 22:18:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:18:39] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-15 22:18:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:18:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:18:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:18:39] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-15 22:18:39] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-15 22:18:39] [INFO ] Added : 11 causal constraints over 3 iterations in 16 ms. Result :sat
Minimization took 6 ms.
[2023-03-15 22:18:39] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:18:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:18:39] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-15 22:18:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:18:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:18:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:18:39] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-15 22:18:39] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 22:18:39] [INFO ] Added : 11 causal constraints over 4 iterations in 16 ms. Result :sat
Minimization took 5 ms.
[2023-03-15 22:18:40] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:18:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:18:40] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-15 22:18:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:18:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:18:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:18:40] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-15 22:18:40] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-15 22:18:40] [INFO ] Added : 11 causal constraints over 4 iterations in 18 ms. Result :sat
Minimization took 5 ms.
[2023-03-15 22:18:40] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-15 22:18:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:18:40] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-15 22:18:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:18:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:18:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:18:40] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-15 22:18:40] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-15 22:18:40] [INFO ] Added : 11 causal constraints over 4 iterations in 14 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7]
Domain [Process(7), Tour(6), Process(7)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 6)]] 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.
[2023-03-15 22:18:40] [INFO ] Unfolded HLPN to a Petri net with 1372 places and 2114 transitions 6608 arcs in 67 ms.
[2023-03-15 22:18:40] [INFO ] Unfolded 11 HLPN properties in 0 ms.
Deduced a syphon composed of 42 places in 21 ms
Reduce places removed 42 places and 84 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 574 ms. (steps per millisecond=17 ) properties (out of 11) seen :57
FORMULA Peterson-COL-6-UpperBounds-14 7 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-UpperBounds-08 7 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 9) seen :34
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :30
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 9) seen :25
FORMULA Peterson-COL-6-UpperBounds-07 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-6-UpperBounds-03 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 7) seen :23
FORMULA Peterson-COL-6-UpperBounds-09 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :25
[2023-03-15 22:18:41] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2023-03-15 22:18:41] [INFO ] Computed 27 place invariants in 26 ms
[2023-03-15 22:18:41] [INFO ] [Real]Absence check using 20 positive place invariants in 39 ms returned sat
[2023-03-15 22:18:41] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 25 ms returned sat
[2023-03-15 22:18:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:18:42] [INFO ] [Real]Absence check using state equation in 961 ms returned sat
[2023-03-15 22:18:42] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 22:18:42] [INFO ] [Real]Added 330 Read/Feed constraints in 69 ms returned sat
[2023-03-15 22:18:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:18:43] [INFO ] [Nat]Absence check using 20 positive place invariants in 60 ms returned sat
[2023-03-15 22:18:43] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-15 22:18:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:18:44] [INFO ] [Nat]Absence check using state equation in 907 ms returned sat
[2023-03-15 22:18:44] [INFO ] [Nat]Added 330 Read/Feed constraints in 148 ms returned sat
[2023-03-15 22:18:45] [INFO ] Deduced a trap composed of 40 places in 1348 ms of which 6 ms to minimize.
[2023-03-15 22:18:47] [INFO ] Deduced a trap composed of 156 places in 1242 ms of which 4 ms to minimize.
[2023-03-15 22:18:48] [INFO ] Deduced a trap composed of 50 places in 1291 ms of which 4 ms to minimize.
[2023-03-15 22:18:48] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 22:18:49] [INFO ] [Real]Absence check using 20 positive place invariants in 51 ms returned sat
[2023-03-15 22:18:49] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 14 ms returned sat
[2023-03-15 22:18:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:18:50] [INFO ] [Real]Absence check using state equation in 959 ms returned sat
[2023-03-15 22:18:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:18:50] [INFO ] [Nat]Absence check using 20 positive place invariants in 56 ms returned sat
[2023-03-15 22:18:50] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 19 ms returned sat
[2023-03-15 22:18:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:18:51] [INFO ] [Nat]Absence check using state equation in 1121 ms returned sat
[2023-03-15 22:18:52] [INFO ] [Nat]Added 330 Read/Feed constraints in 298 ms returned sat
[2023-03-15 22:18:53] [INFO ] Deduced a trap composed of 32 places in 1123 ms of which 3 ms to minimize.
[2023-03-15 22:18:54] [INFO ] Deduced a trap composed of 31 places in 1121 ms of which 1 ms to minimize.
[2023-03-15 22:18:55] [INFO ] Deduced a trap composed of 31 places in 1109 ms of which 2 ms to minimize.
[2023-03-15 22:18:55] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 22:18:56] [INFO ] [Real]Absence check using 20 positive place invariants in 56 ms returned sat
[2023-03-15 22:18:56] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-15 22:18:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:18:57] [INFO ] [Real]Absence check using state equation in 1004 ms returned sat
[2023-03-15 22:18:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:18:57] [INFO ] [Nat]Absence check using 20 positive place invariants in 56 ms returned sat
[2023-03-15 22:18:57] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 21 ms returned sat
[2023-03-15 22:18:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:18:58] [INFO ] [Nat]Absence check using state equation in 1001 ms returned sat
[2023-03-15 22:18:58] [INFO ] [Nat]Added 330 Read/Feed constraints in 112 ms returned sat
[2023-03-15 22:18:59] [INFO ] Computed and/alt/rep : 1729/3542/1729 causal constraints (skipped 84 transitions) in 231 ms.
[2023-03-15 22:18:59] [INFO ] Added : 0 causal constraints over 0 iterations in 664 ms. Result :sat
Minimization took 806 ms.
[2023-03-15 22:19:00] [INFO ] [Real]Absence check using 20 positive place invariants in 54 ms returned sat
[2023-03-15 22:19:00] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-15 22:19:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:19:01] [INFO ] [Real]Absence check using state equation in 1019 ms returned sat
[2023-03-15 22:19:01] [INFO ] [Real]Added 330 Read/Feed constraints in 75 ms returned sat
[2023-03-15 22:19:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:19:02] [INFO ] [Nat]Absence check using 20 positive place invariants in 52 ms returned sat
[2023-03-15 22:19:02] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 25 ms returned sat
[2023-03-15 22:19:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:19:03] [INFO ] [Nat]Absence check using state equation in 1141 ms returned sat
[2023-03-15 22:19:03] [INFO ] [Nat]Added 330 Read/Feed constraints in 198 ms returned sat
[2023-03-15 22:19:05] [INFO ] Deduced a trap composed of 40 places in 1216 ms of which 1 ms to minimize.
[2023-03-15 22:19:06] [INFO ] Deduced a trap composed of 156 places in 1084 ms of which 1 ms to minimize.
[2023-03-15 22:19:07] [INFO ] Deduced a trap composed of 50 places in 986 ms of which 2 ms to minimize.
[2023-03-15 22:19:07] [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 3
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 22:19:07] [INFO ] [Real]Absence check using 20 positive place invariants in 33 ms returned sat
[2023-03-15 22:19:07] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 15 ms returned sat
[2023-03-15 22:19:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:19:08] [INFO ] [Real]Absence check using state equation in 883 ms returned sat
[2023-03-15 22:19:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:19:08] [INFO ] [Nat]Absence check using 20 positive place invariants in 39 ms returned sat
[2023-03-15 22:19:08] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-15 22:19:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:19:09] [INFO ] [Nat]Absence check using state equation in 968 ms returned sat
[2023-03-15 22:19:10] [INFO ] [Nat]Added 330 Read/Feed constraints in 224 ms returned sat
[2023-03-15 22:19:11] [INFO ] Deduced a trap composed of 32 places in 1100 ms of which 2 ms to minimize.
[2023-03-15 22:19:12] [INFO ] Deduced a trap composed of 31 places in 1151 ms of which 4 ms to minimize.
[2023-03-15 22:19:13] [INFO ] Deduced a trap composed of 31 places in 1270 ms of which 3 ms to minimize.
[2023-03-15 22:19:13] [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 4
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 22:19:14] [INFO ] [Real]Absence check using 20 positive place invariants in 34 ms returned sat
[2023-03-15 22:19:14] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 13 ms returned sat
[2023-03-15 22:19:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:19:15] [INFO ] [Real]Absence check using state equation in 982 ms returned sat
[2023-03-15 22:19:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:19:15] [INFO ] [Nat]Absence check using 20 positive place invariants in 50 ms returned sat
[2023-03-15 22:19:15] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-15 22:19:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:19:16] [INFO ] [Nat]Absence check using state equation in 1080 ms returned sat
[2023-03-15 22:19:16] [INFO ] [Nat]Added 330 Read/Feed constraints in 304 ms returned sat
[2023-03-15 22:19:18] [INFO ] Deduced a trap composed of 32 places in 1085 ms of which 1 ms to minimize.
[2023-03-15 22:19:19] [INFO ] Deduced a trap composed of 31 places in 990 ms of which 3 ms to minimize.
[2023-03-15 22:19:20] [INFO ] Deduced a trap composed of 31 places in 1002 ms of which 1 ms to minimize.
[2023-03-15 22:19:21] [INFO ] Deduced a trap composed of 2 places in 939 ms of which 2 ms to minimize.
[2023-03-15 22:19:21] [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 5
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [7, 7, 7, 7, 7, 7] Max seen :[4, 6, 6, 4, 6, 6]
FORMULA Peterson-COL-6-UpperBounds-04 7 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 336 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions removed 252 transitions
Trivial Post-agglo rules discarded 252 transitions
Performed 252 trivial Post agglomeration. Transition count delta: 252
Iterating post reduction 0 with 252 rules applied. Total rules applied 252 place count 1330 transition count 1778
Reduce places removed 252 places and 0 transitions.
Performed 252 Post agglomeration using F-continuation condition.Transition count delta: 252
Iterating post reduction 1 with 504 rules applied. Total rules applied 756 place count 1078 transition count 1526
Reduce places removed 252 places and 0 transitions.
Iterating post reduction 2 with 252 rules applied. Total rules applied 1008 place count 826 transition count 1526
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 1008 place count 826 transition count 1484
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 1092 place count 784 transition count 1484
Applied a total of 1092 rules in 371 ms. Remains 784 /1330 variables (removed 546) and now considering 1484/2030 (removed 546) transitions.
Finished structural reductions, in 1 iterations. Remains : 784/1330 places, 1484/2030 transitions.
Normalized transition count is 1274 out of 1484 initially.
// Phase 1: matrix 1274 rows 784 cols
[2023-03-15 22:19:21] [INFO ] Computed 27 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 16244 ms. (steps per millisecond=61 ) properties (out of 5) seen :24
Finished Best-First random walk after 723802 steps, including 2 resets, run visited all 5 properties in 5001 ms. (steps per millisecond=144 )
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2780 ms. (steps per millisecond=359 ) properties (out of 5) seen :20
Finished Best-First random walk after 817722 steps, including 2 resets, run visited all 5 properties in 5001 ms. (steps per millisecond=163 )
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2901 ms. (steps per millisecond=344 ) properties (out of 5) seen :22
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3289 ms. (steps per millisecond=304 ) properties (out of 5) seen :20
[2023-03-15 22:19:56] [INFO ] Flow matrix only has 1274 transitions (discarded 210 similar events)
// Phase 1: matrix 1274 rows 784 cols
[2023-03-15 22:19:56] [INFO ] Computed 27 place invariants in 7 ms
[2023-03-15 22:19:57] [INFO ] [Real]Absence check using 20 positive place invariants in 24 ms returned sat
[2023-03-15 22:19:57] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-15 22:19:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:19:57] [INFO ] [Real]Absence check using state equation in 662 ms returned sat
[2023-03-15 22:19:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:19:57] [INFO ] [Nat]Absence check using 20 positive place invariants in 32 ms returned sat
[2023-03-15 22:19:57] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 12 ms returned sat
[2023-03-15 22:19:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:19:58] [INFO ] [Nat]Absence check using state equation in 538 ms returned sat
[2023-03-15 22:19:58] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 22:19:58] [INFO ] [Nat]Added 330 Read/Feed constraints in 123 ms returned sat
[2023-03-15 22:19:59] [INFO ] Deduced a trap composed of 64 places in 704 ms of which 1 ms to minimize.
[2023-03-15 22:20:00] [INFO ] Deduced a trap composed of 71 places in 583 ms of which 1 ms to minimize.
[2023-03-15 22:20:00] [INFO ] Deduced a trap composed of 96 places in 712 ms of which 1 ms to minimize.
[2023-03-15 22:20:01] [INFO ] Deduced a trap composed of 55 places in 783 ms of which 1 ms to minimize.
[2023-03-15 22:20:02] [INFO ] Deduced a trap composed of 102 places in 696 ms of which 1 ms to minimize.
[2023-03-15 22:20:03] [INFO ] Deduced a trap composed of 114 places in 584 ms of which 2 ms to minimize.
[2023-03-15 22:20:03] [INFO ] Deduced a trap composed of 128 places in 595 ms of which 1 ms to minimize.
[2023-03-15 22:20:04] [INFO ] Deduced a trap composed of 96 places in 609 ms of which 1 ms to minimize.
[2023-03-15 22:20:05] [INFO ] Deduced a trap composed of 104 places in 809 ms of which 1 ms to minimize.
[2023-03-15 22:20:06] [INFO ] Deduced a trap composed of 10 places in 751 ms of which 1 ms to minimize.
[2023-03-15 22:20:07] [INFO ] Deduced a trap composed of 40 places in 811 ms of which 1 ms to minimize.
[2023-03-15 22:20:07] [INFO ] Deduced a trap composed of 113 places in 721 ms of which 1 ms to minimize.
[2023-03-15 22:20:08] [INFO ] Deduced a trap composed of 30 places in 683 ms of which 2 ms to minimize.
[2023-03-15 22:20:09] [INFO ] Deduced a trap composed of 20 places in 704 ms of which 1 ms to minimize.
[2023-03-15 22:20:09] [INFO ] Deduced a trap composed of 91 places in 517 ms of which 1 ms to minimize.
[2023-03-15 22:20:10] [INFO ] Deduced a trap composed of 114 places in 602 ms of which 1 ms to minimize.
[2023-03-15 22:20:11] [INFO ] Deduced a trap composed of 34 places in 637 ms of which 2 ms to minimize.
[2023-03-15 22:20:12] [INFO ] Deduced a trap composed of 38 places in 631 ms of which 1 ms to minimize.
[2023-03-15 22:20:12] [INFO ] Deduced a trap composed of 90 places in 659 ms of which 6 ms to minimize.
[2023-03-15 22:20:13] [INFO ] Deduced a trap composed of 16 places in 711 ms of which 1 ms to minimize.
[2023-03-15 22:20:14] [INFO ] Deduced a trap composed of 72 places in 464 ms of which 1 ms to minimize.
[2023-03-15 22:20:14] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 15507 ms
[2023-03-15 22:20:14] [INFO ] Computed and/alt/rep : 1183/2996/1183 causal constraints (skipped 84 transitions) in 112 ms.
[2023-03-15 22:20:22] [INFO ] Deduced a trap composed of 58 places in 851 ms of which 1 ms to minimize.
[2023-03-15 22:20:22] [INFO ] Deduced a trap composed of 40 places in 811 ms of which 2 ms to minimize.
[2023-03-15 22:20:23] [INFO ] Deduced a trap composed of 82 places in 769 ms of which 2 ms to minimize.
[2023-03-15 22:20:24] [INFO ] Deduced a trap composed of 10 places in 803 ms of which 1 ms to minimize.
[2023-03-15 22:20:25] [INFO ] Deduced a trap composed of 10 places in 589 ms of which 1 ms to minimize.
[2023-03-15 22:20:26] [INFO ] Deduced a trap composed of 114 places in 662 ms of which 2 ms to minimize.
[2023-03-15 22:20:27] [INFO ] Deduced a trap composed of 85 places in 544 ms of which 1 ms to minimize.
[2023-03-15 22:20:27] [INFO ] Deduced a trap composed of 61 places in 559 ms of which 1 ms to minimize.
[2023-03-15 22:20:28] [INFO ] Deduced a trap composed of 55 places in 593 ms of which 1 ms to minimize.
[2023-03-15 22:20:29] [INFO ] Deduced a trap composed of 69 places in 551 ms of which 1 ms to minimize.
[2023-03-15 22:20:30] [INFO ] Deduced a trap composed of 61 places in 570 ms of which 2 ms to minimize.
[2023-03-15 22:20:31] [INFO ] Deduced a trap composed of 38 places in 481 ms of which 1 ms to minimize.
[2023-03-15 22:20:32] [INFO ] Deduced a trap composed of 118 places in 589 ms of which 2 ms to minimize.
[2023-03-15 22:20:32] [INFO ] Deduced a trap composed of 103 places in 438 ms of which 2 ms to minimize.
[2023-03-15 22:20:33] [INFO ] Deduced a trap composed of 33 places in 475 ms of which 1 ms to minimize.
[2023-03-15 22:20:34] [INFO ] Deduced a trap composed of 33 places in 575 ms of which 1 ms to minimize.
[2023-03-15 22:20:35] [INFO ] Deduced a trap composed of 127 places in 606 ms of which 1 ms to minimize.
[2023-03-15 22:20:35] [INFO ] Deduced a trap composed of 112 places in 680 ms of which 2 ms to minimize.
[2023-03-15 22:20:36] [INFO ] Deduced a trap composed of 31 places in 693 ms of which 4 ms to minimize.
[2023-03-15 22:20:37] [INFO ] Deduced a trap composed of 41 places in 740 ms of which 2 ms to minimize.
[2023-03-15 22:20:38] [INFO ] Deduced a trap composed of 36 places in 879 ms of which 2 ms to minimize.
[2023-03-15 22:20:39] [INFO ] Deduced a trap composed of 10 places in 731 ms of which 2 ms to minimize.
[2023-03-15 22:20:40] [INFO ] Deduced a trap composed of 52 places in 548 ms of which 2 ms to minimize.
[2023-03-15 22:20:40] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 19084 ms
[2023-03-15 22:20:40] [INFO ] Added : 248 causal constraints over 50 iterations in 26251 ms.(timeout) Result :sat
Minimization took 742 ms.
[2023-03-15 22:20:41] [INFO ] [Real]Absence check using 20 positive place invariants in 35 ms returned sat
[2023-03-15 22:20:41] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 14 ms returned sat
[2023-03-15 22:20:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:20:42] [INFO ] [Real]Absence check using state equation in 684 ms returned sat
[2023-03-15 22:20:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:20:42] [INFO ] [Nat]Absence check using 20 positive place invariants in 31 ms returned sat
[2023-03-15 22:20:42] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 11 ms returned sat
[2023-03-15 22:20:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:20:42] [INFO ] [Nat]Absence check using state equation in 554 ms returned sat
[2023-03-15 22:20:43] [INFO ] [Nat]Added 330 Read/Feed constraints in 93 ms returned sat
[2023-03-15 22:20:43] [INFO ] Deduced a trap composed of 20 places in 622 ms of which 2 ms to minimize.
[2023-03-15 22:20:44] [INFO ] Deduced a trap composed of 20 places in 742 ms of which 1 ms to minimize.
[2023-03-15 22:20:45] [INFO ] Deduced a trap composed of 20 places in 650 ms of which 2 ms to minimize.
[2023-03-15 22:20:46] [INFO ] Deduced a trap composed of 20 places in 746 ms of which 1 ms to minimize.
[2023-03-15 22:20:46] [INFO ] Deduced a trap composed of 20 places in 720 ms of which 2 ms to minimize.
[2023-03-15 22:20:47] [INFO ] Deduced a trap composed of 14 places in 671 ms of which 3 ms to minimize.
[2023-03-15 22:20:48] [INFO ] Deduced a trap composed of 22 places in 654 ms of which 3 ms to minimize.
[2023-03-15 22:20:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 5264 ms
[2023-03-15 22:20:48] [INFO ] [Real]Absence check using 20 positive place invariants in 32 ms returned sat
[2023-03-15 22:20:48] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 13 ms returned sat
[2023-03-15 22:20:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:20:49] [INFO ] [Real]Absence check using state equation in 611 ms returned sat
[2023-03-15 22:20:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:20:49] [INFO ] [Nat]Absence check using 20 positive place invariants in 32 ms returned sat
[2023-03-15 22:20:49] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 12 ms returned sat
[2023-03-15 22:20:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:20:49] [INFO ] [Nat]Absence check using state equation in 568 ms returned sat
[2023-03-15 22:20:50] [INFO ] [Nat]Added 330 Read/Feed constraints in 115 ms returned sat
[2023-03-15 22:20:50] [INFO ] Deduced a trap composed of 64 places in 562 ms of which 1 ms to minimize.
[2023-03-15 22:20:51] [INFO ] Deduced a trap composed of 71 places in 573 ms of which 1 ms to minimize.
[2023-03-15 22:20:52] [INFO ] Deduced a trap composed of 96 places in 852 ms of which 2 ms to minimize.
[2023-03-15 22:20:53] [INFO ] Deduced a trap composed of 55 places in 842 ms of which 2 ms to minimize.
[2023-03-15 22:20:54] [INFO ] Deduced a trap composed of 102 places in 797 ms of which 1 ms to minimize.
[2023-03-15 22:20:54] [INFO ] Deduced a trap composed of 114 places in 585 ms of which 1 ms to minimize.
[2023-03-15 22:20:55] [INFO ] Deduced a trap composed of 128 places in 791 ms of which 2 ms to minimize.
[2023-03-15 22:20:56] [INFO ] Deduced a trap composed of 96 places in 733 ms of which 1 ms to minimize.
[2023-03-15 22:20:57] [INFO ] Deduced a trap composed of 104 places in 701 ms of which 2 ms to minimize.
[2023-03-15 22:20:57] [INFO ] Deduced a trap composed of 10 places in 666 ms of which 2 ms to minimize.
[2023-03-15 22:20:58] [INFO ] Deduced a trap composed of 40 places in 706 ms of which 1 ms to minimize.
[2023-03-15 22:20:59] [INFO ] Deduced a trap composed of 113 places in 850 ms of which 2 ms to minimize.
[2023-03-15 22:21:00] [INFO ] Deduced a trap composed of 30 places in 847 ms of which 1 ms to minimize.
[2023-03-15 22:21:01] [INFO ] Deduced a trap composed of 20 places in 714 ms of which 1 ms to minimize.
[2023-03-15 22:21:01] [INFO ] Deduced a trap composed of 91 places in 520 ms of which 1 ms to minimize.
[2023-03-15 22:21:02] [INFO ] Deduced a trap composed of 114 places in 542 ms of which 1 ms to minimize.
[2023-03-15 22:21:03] [INFO ] Deduced a trap composed of 34 places in 666 ms of which 1 ms to minimize.
[2023-03-15 22:21:03] [INFO ] Deduced a trap composed of 38 places in 632 ms of which 1 ms to minimize.
[2023-03-15 22:21:04] [INFO ] Deduced a trap composed of 90 places in 580 ms of which 1 ms to minimize.
[2023-03-15 22:21:05] [INFO ] Deduced a trap composed of 16 places in 759 ms of which 1 ms to minimize.
[2023-03-15 22:21:06] [INFO ] Deduced a trap composed of 72 places in 754 ms of which 1 ms to minimize.
[2023-03-15 22:21:06] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 16303 ms
[2023-03-15 22:21:06] [INFO ] Computed and/alt/rep : 1183/2996/1183 causal constraints (skipped 84 transitions) in 99 ms.
[2023-03-15 22:21:13] [INFO ] Deduced a trap composed of 58 places in 619 ms of which 2 ms to minimize.
[2023-03-15 22:21:14] [INFO ] Deduced a trap composed of 40 places in 898 ms of which 1 ms to minimize.
[2023-03-15 22:21:15] [INFO ] Deduced a trap composed of 82 places in 760 ms of which 1 ms to minimize.
[2023-03-15 22:21:16] [INFO ] Deduced a trap composed of 10 places in 778 ms of which 2 ms to minimize.
[2023-03-15 22:21:17] [INFO ] Deduced a trap composed of 10 places in 777 ms of which 1 ms to minimize.
[2023-03-15 22:21:18] [INFO ] Deduced a trap composed of 114 places in 722 ms of which 2 ms to minimize.
[2023-03-15 22:21:19] [INFO ] Deduced a trap composed of 85 places in 720 ms of which 1 ms to minimize.
[2023-03-15 22:21:20] [INFO ] Deduced a trap composed of 61 places in 745 ms of which 1 ms to minimize.
[2023-03-15 22:21:21] [INFO ] Deduced a trap composed of 55 places in 749 ms of which 2 ms to minimize.
[2023-03-15 22:21:22] [INFO ] Deduced a trap composed of 69 places in 612 ms of which 1 ms to minimize.
[2023-03-15 22:21:22] [INFO ] Deduced a trap composed of 61 places in 605 ms of which 1 ms to minimize.
[2023-03-15 22:21:24] [INFO ] Deduced a trap composed of 38 places in 535 ms of which 2 ms to minimize.
[2023-03-15 22:21:25] [INFO ] Deduced a trap composed of 118 places in 585 ms of which 1 ms to minimize.
[2023-03-15 22:21:25] [INFO ] Deduced a trap composed of 103 places in 682 ms of which 1 ms to minimize.
[2023-03-15 22:21:26] [INFO ] Deduced a trap composed of 33 places in 558 ms of which 1 ms to minimize.
[2023-03-15 22:21:27] [INFO ] Deduced a trap composed of 33 places in 574 ms of which 1 ms to minimize.
[2023-03-15 22:21:27] [INFO ] Deduced a trap composed of 127 places in 422 ms of which 2 ms to minimize.
[2023-03-15 22:21:28] [INFO ] Deduced a trap composed of 112 places in 542 ms of which 1 ms to minimize.
[2023-03-15 22:21:29] [INFO ] Deduced a trap composed of 31 places in 600 ms of which 2 ms to minimize.
[2023-03-15 22:21:30] [INFO ] Deduced a trap composed of 41 places in 734 ms of which 1 ms to minimize.
[2023-03-15 22:21:31] [INFO ] Deduced a trap composed of 36 places in 699 ms of which 1 ms to minimize.
[2023-03-15 22:21:31] [INFO ] Deduced a trap composed of 10 places in 661 ms of which 1 ms to minimize.
[2023-03-15 22:21:32] [INFO ] Deduced a trap composed of 52 places in 366 ms of which 1 ms to minimize.
[2023-03-15 22:21:32] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 19407 ms
[2023-03-15 22:21:32] [INFO ] Added : 248 causal constraints over 50 iterations in 26328 ms.(timeout) Result :sat
Minimization took 567 ms.
[2023-03-15 22:21:33] [INFO ] [Real]Absence check using 20 positive place invariants in 30 ms returned sat
[2023-03-15 22:21:33] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 12 ms returned sat
[2023-03-15 22:21:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:21:34] [INFO ] [Real]Absence check using state equation in 676 ms returned sat
[2023-03-15 22:21:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:21:34] [INFO ] [Nat]Absence check using 20 positive place invariants in 25 ms returned sat
[2023-03-15 22:21:34] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-15 22:21:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:21:35] [INFO ] [Nat]Absence check using state equation in 543 ms returned sat
[2023-03-15 22:21:35] [INFO ] [Nat]Added 330 Read/Feed constraints in 87 ms returned sat
[2023-03-15 22:21:35] [INFO ] Deduced a trap composed of 20 places in 762 ms of which 2 ms to minimize.
[2023-03-15 22:21:36] [INFO ] Deduced a trap composed of 20 places in 766 ms of which 2 ms to minimize.
[2023-03-15 22:21:37] [INFO ] Deduced a trap composed of 20 places in 658 ms of which 2 ms to minimize.
[2023-03-15 22:21:38] [INFO ] Deduced a trap composed of 20 places in 526 ms of which 2 ms to minimize.
[2023-03-15 22:21:38] [INFO ] Deduced a trap composed of 20 places in 650 ms of which 2 ms to minimize.
[2023-03-15 22:21:39] [INFO ] Deduced a trap composed of 14 places in 478 ms of which 1 ms to minimize.
[2023-03-15 22:21:39] [INFO ] Deduced a trap composed of 22 places in 468 ms of which 2 ms to minimize.
[2023-03-15 22:21:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 4764 ms
[2023-03-15 22:21:40] [INFO ] [Real]Absence check using 20 positive place invariants in 34 ms returned sat
[2023-03-15 22:21:40] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 14 ms returned sat
[2023-03-15 22:21:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:21:40] [INFO ] [Real]Absence check using state equation in 686 ms returned sat
[2023-03-15 22:21:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:21:41] [INFO ] [Nat]Absence check using 20 positive place invariants in 20 ms returned sat
[2023-03-15 22:21:41] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-15 22:21:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:21:41] [INFO ] [Nat]Absence check using state equation in 499 ms returned sat
[2023-03-15 22:21:41] [INFO ] [Nat]Added 330 Read/Feed constraints in 117 ms returned sat
[2023-03-15 22:21:42] [INFO ] Deduced a trap composed of 20 places in 605 ms of which 1 ms to minimize.
[2023-03-15 22:21:42] [INFO ] Deduced a trap composed of 20 places in 505 ms of which 1 ms to minimize.
[2023-03-15 22:21:43] [INFO ] Deduced a trap composed of 20 places in 487 ms of which 1 ms to minimize.
[2023-03-15 22:21:44] [INFO ] Deduced a trap composed of 20 places in 554 ms of which 1 ms to minimize.
[2023-03-15 22:21:44] [INFO ] Deduced a trap composed of 20 places in 734 ms of which 1 ms to minimize.
[2023-03-15 22:21:45] [INFO ] Deduced a trap composed of 14 places in 463 ms of which 1 ms to minimize.
[2023-03-15 22:21:46] [INFO ] Deduced a trap composed of 22 places in 599 ms of which 1 ms to minimize.
[2023-03-15 22:21:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 4383 ms
Current structural bounds on expressions (after SMT) : [7, 6, 7, 6, 6] Max seen :[6, 6, 6, 6, 6]
FORMULA Peterson-COL-6-UpperBounds-15 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-COL-6-UpperBounds-12 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-COL-6-UpperBounds-01 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 294 out of 784 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 784/784 places, 1484/1484 transitions.
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 42 Pre rules applied. Total rules applied 0 place count 784 transition count 1442
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 0 with 84 rules applied. Total rules applied 84 place count 742 transition count 1442
Applied a total of 84 rules in 64 ms. Remains 742 /784 variables (removed 42) and now considering 1442/1484 (removed 42) transitions.
Finished structural reductions, in 1 iterations. Remains : 742/784 places, 1442/1484 transitions.
Normalized transition count is 1232 out of 1442 initially.
// Phase 1: matrix 1232 rows 742 cols
[2023-03-15 22:21:47] [INFO ] Computed 27 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 12928 ms. (steps per millisecond=77 ) properties (out of 2) seen :12
Finished Best-First random walk after 794882 steps, including 2 resets, run visited all 2 properties in 5001 ms. (steps per millisecond=158 )
Finished Best-First random walk after 802130 steps, including 2 resets, run visited all 2 properties in 5001 ms. (steps per millisecond=160 )
[2023-03-15 22:22:10] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 742 cols
[2023-03-15 22:22:10] [INFO ] Computed 27 place invariants in 6 ms
[2023-03-15 22:22:10] [INFO ] [Real]Absence check using 20 positive place invariants in 21 ms returned sat
[2023-03-15 22:22:10] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-15 22:22:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:22:11] [INFO ] [Real]Absence check using state equation in 517 ms returned sat
[2023-03-15 22:22:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:22:11] [INFO ] [Nat]Absence check using 20 positive place invariants in 24 ms returned sat
[2023-03-15 22:22:11] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-15 22:22:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:22:12] [INFO ] [Nat]Absence check using state equation in 669 ms returned sat
[2023-03-15 22:22:12] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 22:22:12] [INFO ] [Nat]Added 330 Read/Feed constraints in 165 ms returned sat
[2023-03-15 22:22:12] [INFO ] Deduced a trap composed of 58 places in 622 ms of which 1 ms to minimize.
[2023-03-15 22:22:13] [INFO ] Deduced a trap composed of 180 places in 678 ms of which 1 ms to minimize.
[2023-03-15 22:22:14] [INFO ] Deduced a trap composed of 146 places in 832 ms of which 2 ms to minimize.
[2023-03-15 22:22:15] [INFO ] Deduced a trap composed of 118 places in 814 ms of which 1 ms to minimize.
[2023-03-15 22:22:16] [INFO ] Deduced a trap composed of 131 places in 711 ms of which 1 ms to minimize.
[2023-03-15 22:22:17] [INFO ] Deduced a trap composed of 125 places in 660 ms of which 1 ms to minimize.
[2023-03-15 22:22:17] [INFO ] Deduced a trap composed of 85 places in 591 ms of which 2 ms to minimize.
[2023-03-15 22:22:18] [INFO ] Deduced a trap composed of 77 places in 580 ms of which 1 ms to minimize.
[2023-03-15 22:22:19] [INFO ] Deduced a trap composed of 74 places in 711 ms of which 2 ms to minimize.
[2023-03-15 22:22:19] [INFO ] Deduced a trap composed of 154 places in 716 ms of which 2 ms to minimize.
[2023-03-15 22:22:20] [INFO ] Deduced a trap composed of 173 places in 821 ms of which 1 ms to minimize.
[2023-03-15 22:22:21] [INFO ] Deduced a trap composed of 128 places in 757 ms of which 1 ms to minimize.
[2023-03-15 22:22:22] [INFO ] Deduced a trap composed of 121 places in 696 ms of which 2 ms to minimize.
[2023-03-15 22:22:23] [INFO ] Deduced a trap composed of 130 places in 834 ms of which 1 ms to minimize.
[2023-03-15 22:22:24] [INFO ] Deduced a trap composed of 105 places in 790 ms of which 2 ms to minimize.
[2023-03-15 22:22:25] [INFO ] Deduced a trap composed of 104 places in 798 ms of which 1 ms to minimize.
[2023-03-15 22:22:25] [INFO ] Deduced a trap composed of 52 places in 706 ms of which 2 ms to minimize.
[2023-03-15 22:22:26] [INFO ] Deduced a trap composed of 125 places in 816 ms of which 2 ms to minimize.
[2023-03-15 22:22:27] [INFO ] Deduced a trap composed of 90 places in 822 ms of which 1 ms to minimize.
[2023-03-15 22:22:28] [INFO ] Deduced a trap composed of 82 places in 610 ms of which 2 ms to minimize.
[2023-03-15 22:22:28] [INFO ] Deduced a trap composed of 12 places in 613 ms of which 1 ms to minimize.
[2023-03-15 22:22:29] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 16862 ms
[2023-03-15 22:22:29] [INFO ] Computed and/alt/rep : 1141/3164/1141 causal constraints (skipped 84 transitions) in 154 ms.
[2023-03-15 22:22:31] [INFO ] Deduced a trap composed of 27 places in 787 ms of which 1 ms to minimize.
[2023-03-15 22:22:32] [INFO ] Deduced a trap composed of 155 places in 778 ms of which 2 ms to minimize.
[2023-03-15 22:22:33] [INFO ] Deduced a trap composed of 27 places in 780 ms of which 2 ms to minimize.
[2023-03-15 22:22:34] [INFO ] Deduced a trap composed of 95 places in 642 ms of which 1 ms to minimize.
[2023-03-15 22:22:35] [INFO ] Deduced a trap composed of 53 places in 598 ms of which 1 ms to minimize.
[2023-03-15 22:22:35] [INFO ] Deduced a trap composed of 39 places in 571 ms of which 1 ms to minimize.
[2023-03-15 22:22:36] [INFO ] Deduced a trap composed of 67 places in 512 ms of which 1 ms to minimize.
[2023-03-15 22:22:36] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 5779 ms
[2023-03-15 22:22:38] [INFO ] Added : 150 causal constraints over 31 iterations in 9852 ms. Result :sat
Minimization took 731 ms.
[2023-03-15 22:22:39] [INFO ] [Real]Absence check using 20 positive place invariants in 30 ms returned sat
[2023-03-15 22:22:39] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 12 ms returned sat
[2023-03-15 22:22:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:22:40] [INFO ] [Real]Absence check using state equation in 587 ms returned sat
[2023-03-15 22:22:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:22:40] [INFO ] [Nat]Absence check using 20 positive place invariants in 31 ms returned sat
[2023-03-15 22:22:40] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 12 ms returned sat
[2023-03-15 22:22:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:22:41] [INFO ] [Nat]Absence check using state equation in 574 ms returned sat
[2023-03-15 22:22:41] [INFO ] [Nat]Added 330 Read/Feed constraints in 104 ms returned sat
[2023-03-15 22:22:42] [INFO ] Deduced a trap composed of 58 places in 614 ms of which 1 ms to minimize.
[2023-03-15 22:22:42] [INFO ] Deduced a trap composed of 180 places in 683 ms of which 1 ms to minimize.
[2023-03-15 22:22:43] [INFO ] Deduced a trap composed of 146 places in 504 ms of which 1 ms to minimize.
[2023-03-15 22:22:44] [INFO ] Deduced a trap composed of 118 places in 731 ms of which 2 ms to minimize.
[2023-03-15 22:22:45] [INFO ] Deduced a trap composed of 131 places in 792 ms of which 1 ms to minimize.
[2023-03-15 22:22:45] [INFO ] Deduced a trap composed of 125 places in 601 ms of which 1 ms to minimize.
[2023-03-15 22:22:46] [INFO ] Deduced a trap composed of 85 places in 848 ms of which 1 ms to minimize.
[2023-03-15 22:22:47] [INFO ] Deduced a trap composed of 77 places in 826 ms of which 1 ms to minimize.
[2023-03-15 22:22:48] [INFO ] Deduced a trap composed of 74 places in 835 ms of which 1 ms to minimize.
[2023-03-15 22:22:49] [INFO ] Deduced a trap composed of 154 places in 809 ms of which 1 ms to minimize.
[2023-03-15 22:22:50] [INFO ] Deduced a trap composed of 173 places in 807 ms of which 2 ms to minimize.
[2023-03-15 22:22:51] [INFO ] Deduced a trap composed of 128 places in 849 ms of which 2 ms to minimize.
[2023-03-15 22:22:52] [INFO ] Deduced a trap composed of 121 places in 892 ms of which 1 ms to minimize.
[2023-03-15 22:22:52] [INFO ] Deduced a trap composed of 130 places in 657 ms of which 1 ms to minimize.
[2023-03-15 22:22:53] [INFO ] Deduced a trap composed of 105 places in 835 ms of which 1 ms to minimize.
[2023-03-15 22:22:54] [INFO ] Deduced a trap composed of 104 places in 629 ms of which 1 ms to minimize.
[2023-03-15 22:22:55] [INFO ] Deduced a trap composed of 52 places in 621 ms of which 1 ms to minimize.
[2023-03-15 22:22:55] [INFO ] Deduced a trap composed of 125 places in 613 ms of which 1 ms to minimize.
[2023-03-15 22:22:56] [INFO ] Deduced a trap composed of 90 places in 724 ms of which 2 ms to minimize.
[2023-03-15 22:22:57] [INFO ] Deduced a trap composed of 82 places in 677 ms of which 1 ms to minimize.
[2023-03-15 22:22:58] [INFO ] Deduced a trap composed of 12 places in 609 ms of which 1 ms to minimize.
[2023-03-15 22:22:58] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 16765 ms
[2023-03-15 22:22:58] [INFO ] Computed and/alt/rep : 1141/3164/1141 causal constraints (skipped 84 transitions) in 113 ms.
[2023-03-15 22:23:00] [INFO ] Deduced a trap composed of 27 places in 673 ms of which 1 ms to minimize.
[2023-03-15 22:23:01] [INFO ] Deduced a trap composed of 155 places in 566 ms of which 2 ms to minimize.
[2023-03-15 22:23:01] [INFO ] Deduced a trap composed of 27 places in 649 ms of which 1 ms to minimize.
[2023-03-15 22:23:02] [INFO ] Deduced a trap composed of 95 places in 539 ms of which 1 ms to minimize.
[2023-03-15 22:23:03] [INFO ] Deduced a trap composed of 53 places in 668 ms of which 1 ms to minimize.
[2023-03-15 22:23:03] [INFO ] Deduced a trap composed of 39 places in 480 ms of which 1 ms to minimize.
[2023-03-15 22:23:04] [INFO ] Deduced a trap composed of 67 places in 570 ms of which 1 ms to minimize.
[2023-03-15 22:23:04] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4988 ms
[2023-03-15 22:23:06] [INFO ] Added : 150 causal constraints over 31 iterations in 8509 ms. Result :sat
Minimization took 661 ms.
Current structural bounds on expressions (after SMT) : [7, 7] Max seen :[6, 6]
Support contains 294 out of 742 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 742/742 places, 1442/1442 transitions.
Applied a total of 0 rules in 34 ms. Remains 742 /742 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 742/742 places, 1442/1442 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 742/742 places, 1442/1442 transitions.
Applied a total of 0 rules in 32 ms. Remains 742 /742 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
[2023-03-15 22:23:08] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 742 cols
[2023-03-15 22:23:08] [INFO ] Computed 27 place invariants in 5 ms
[2023-03-15 22:23:08] [INFO ] Implicit Places using invariants in 712 ms returned [0, 1, 2, 3, 4, 5, 6]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 718 ms to find 7 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 735/742 places, 1442/1442 transitions.
Applied a total of 0 rules in 49 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 735/742 places, 1442/1442 transitions.
Normalized transition count is 1232 out of 1442 initially.
// Phase 1: matrix 1232 rows 735 cols
[2023-03-15 22:23:09] [INFO ] Computed 20 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 12849 ms. (steps per millisecond=77 ) properties (out of 2) seen :12
Finished Best-First random walk after 809986 steps, including 2 resets, run visited all 2 properties in 5001 ms. (steps per millisecond=161 )
Finished Best-First random walk after 816946 steps, including 2 resets, run visited all 2 properties in 5001 ms. (steps per millisecond=163 )
[2023-03-15 22:23:31] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2023-03-15 22:23:31] [INFO ] Computed 20 place invariants in 7 ms
[2023-03-15 22:23:32] [INFO ] [Real]Absence check using 20 positive place invariants in 25 ms returned sat
[2023-03-15 22:23:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:23:32] [INFO ] [Real]Absence check using state equation in 594 ms returned sat
[2023-03-15 22:23:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:23:32] [INFO ] [Nat]Absence check using 20 positive place invariants in 26 ms returned sat
[2023-03-15 22:23:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:23:33] [INFO ] [Nat]Absence check using state equation in 526 ms returned sat
[2023-03-15 22:23:33] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 22:23:33] [INFO ] [Nat]Added 330 Read/Feed constraints in 101 ms returned sat
[2023-03-15 22:23:34] [INFO ] Deduced a trap composed of 29 places in 580 ms of which 1 ms to minimize.
[2023-03-15 22:23:34] [INFO ] Deduced a trap composed of 38 places in 681 ms of which 1 ms to minimize.
[2023-03-15 22:23:35] [INFO ] Deduced a trap composed of 20 places in 558 ms of which 1 ms to minimize.
[2023-03-15 22:23:36] [INFO ] Deduced a trap composed of 56 places in 624 ms of which 1 ms to minimize.
[2023-03-15 22:23:36] [INFO ] Deduced a trap composed of 46 places in 684 ms of which 1 ms to minimize.
[2023-03-15 22:23:37] [INFO ] Deduced a trap composed of 42 places in 543 ms of which 3 ms to minimize.
[2023-03-15 22:23:38] [INFO ] Deduced a trap composed of 52 places in 645 ms of which 1 ms to minimize.
[2023-03-15 22:23:39] [INFO ] Deduced a trap composed of 46 places in 670 ms of which 1 ms to minimize.
[2023-03-15 22:23:39] [INFO ] Deduced a trap composed of 43 places in 626 ms of which 2 ms to minimize.
[2023-03-15 22:23:40] [INFO ] Deduced a trap composed of 27 places in 714 ms of which 1 ms to minimize.
[2023-03-15 22:23:41] [INFO ] Deduced a trap composed of 92 places in 817 ms of which 2 ms to minimize.
[2023-03-15 22:23:42] [INFO ] Deduced a trap composed of 121 places in 793 ms of which 1 ms to minimize.
[2023-03-15 22:23:43] [INFO ] Deduced a trap composed of 165 places in 805 ms of which 1 ms to minimize.
[2023-03-15 22:23:43] [INFO ] Deduced a trap composed of 190 places in 667 ms of which 1 ms to minimize.
[2023-03-15 22:23:44] [INFO ] Deduced a trap composed of 125 places in 596 ms of which 1 ms to minimize.
[2023-03-15 22:23:45] [INFO ] Deduced a trap composed of 12 places in 624 ms of which 1 ms to minimize.
[2023-03-15 22:23:46] [INFO ] Deduced a trap composed of 34 places in 615 ms of which 2 ms to minimize.
[2023-03-15 22:23:46] [INFO ] Deduced a trap composed of 52 places in 629 ms of which 1 ms to minimize.
[2023-03-15 22:23:47] [INFO ] Deduced a trap composed of 21 places in 824 ms of which 2 ms to minimize.
[2023-03-15 22:23:48] [INFO ] Deduced a trap composed of 119 places in 677 ms of which 1 ms to minimize.
[2023-03-15 22:23:49] [INFO ] Deduced a trap composed of 84 places in 613 ms of which 2 ms to minimize.
[2023-03-15 22:23:50] [INFO ] Deduced a trap composed of 99 places in 798 ms of which 2 ms to minimize.
[2023-03-15 22:23:50] [INFO ] Deduced a trap composed of 20 places in 581 ms of which 1 ms to minimize.
[2023-03-15 22:23:51] [INFO ] Deduced a trap composed of 87 places in 570 ms of which 1 ms to minimize.
[2023-03-15 22:23:52] [INFO ] Deduced a trap composed of 102 places in 774 ms of which 1 ms to minimize.
[2023-03-15 22:23:52] [INFO ] Deduced a trap composed of 43 places in 668 ms of which 0 ms to minimize.
[2023-03-15 22:23:53] [INFO ] Deduced a trap composed of 37 places in 516 ms of which 1 ms to minimize.
[2023-03-15 22:23:54] [INFO ] Deduced a trap composed of 32 places in 523 ms of which 1 ms to minimize.
[2023-03-15 22:23:54] [INFO ] Deduced a trap composed of 36 places in 445 ms of which 1 ms to minimize.
[2023-03-15 22:23:54] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 21098 ms
[2023-03-15 22:23:54] [INFO ] Computed and/alt/rep : 1141/3164/1141 causal constraints (skipped 84 transitions) in 105 ms.
[2023-03-15 22:23:58] [INFO ] Deduced a trap composed of 61 places in 551 ms of which 1 ms to minimize.
[2023-03-15 22:23:59] [INFO ] Deduced a trap composed of 34 places in 448 ms of which 1 ms to minimize.
[2023-03-15 22:23:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1553 ms
[2023-03-15 22:24:00] [INFO ] Added : 140 causal constraints over 29 iterations in 5594 ms. Result :sat
Minimization took 554 ms.
[2023-03-15 22:24:01] [INFO ] [Real]Absence check using 20 positive place invariants in 17 ms returned sat
[2023-03-15 22:24:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:24:01] [INFO ] [Real]Absence check using state equation in 485 ms returned sat
[2023-03-15 22:24:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:24:01] [INFO ] [Nat]Absence check using 20 positive place invariants in 27 ms returned sat
[2023-03-15 22:24:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:24:02] [INFO ] [Nat]Absence check using state equation in 668 ms returned sat
[2023-03-15 22:24:02] [INFO ] [Nat]Added 330 Read/Feed constraints in 155 ms returned sat
[2023-03-15 22:24:03] [INFO ] Deduced a trap composed of 29 places in 806 ms of which 1 ms to minimize.
[2023-03-15 22:24:04] [INFO ] Deduced a trap composed of 38 places in 608 ms of which 1 ms to minimize.
[2023-03-15 22:24:04] [INFO ] Deduced a trap composed of 20 places in 603 ms of which 1 ms to minimize.
[2023-03-15 22:24:05] [INFO ] Deduced a trap composed of 56 places in 506 ms of which 1 ms to minimize.
[2023-03-15 22:24:06] [INFO ] Deduced a trap composed of 46 places in 812 ms of which 2 ms to minimize.
[2023-03-15 22:24:06] [INFO ] Deduced a trap composed of 42 places in 589 ms of which 1 ms to minimize.
[2023-03-15 22:24:07] [INFO ] Deduced a trap composed of 52 places in 613 ms of which 1 ms to minimize.
[2023-03-15 22:24:08] [INFO ] Deduced a trap composed of 46 places in 610 ms of which 1 ms to minimize.
[2023-03-15 22:24:09] [INFO ] Deduced a trap composed of 43 places in 607 ms of which 2 ms to minimize.
[2023-03-15 22:24:09] [INFO ] Deduced a trap composed of 27 places in 631 ms of which 1 ms to minimize.
[2023-03-15 22:24:10] [INFO ] Deduced a trap composed of 92 places in 533 ms of which 1 ms to minimize.
[2023-03-15 22:24:11] [INFO ] Deduced a trap composed of 121 places in 589 ms of which 1 ms to minimize.
[2023-03-15 22:24:11] [INFO ] Deduced a trap composed of 165 places in 763 ms of which 2 ms to minimize.
[2023-03-15 22:24:12] [INFO ] Deduced a trap composed of 190 places in 496 ms of which 1 ms to minimize.
[2023-03-15 22:24:13] [INFO ] Deduced a trap composed of 125 places in 696 ms of which 1 ms to minimize.
[2023-03-15 22:24:14] [INFO ] Deduced a trap composed of 12 places in 793 ms of which 2 ms to minimize.
[2023-03-15 22:24:14] [INFO ] Deduced a trap composed of 34 places in 618 ms of which 2 ms to minimize.
[2023-03-15 22:24:15] [INFO ] Deduced a trap composed of 52 places in 724 ms of which 1 ms to minimize.
[2023-03-15 22:24:16] [INFO ] Deduced a trap composed of 21 places in 547 ms of which 1 ms to minimize.
[2023-03-15 22:24:17] [INFO ] Deduced a trap composed of 119 places in 825 ms of which 1 ms to minimize.
[2023-03-15 22:24:17] [INFO ] Deduced a trap composed of 84 places in 679 ms of which 1 ms to minimize.
[2023-03-15 22:24:18] [INFO ] Deduced a trap composed of 99 places in 591 ms of which 2 ms to minimize.
[2023-03-15 22:24:19] [INFO ] Deduced a trap composed of 20 places in 755 ms of which 1 ms to minimize.
[2023-03-15 22:24:20] [INFO ] Deduced a trap composed of 87 places in 740 ms of which 1 ms to minimize.
[2023-03-15 22:24:21] [INFO ] Deduced a trap composed of 102 places in 775 ms of which 1 ms to minimize.
[2023-03-15 22:24:21] [INFO ] Deduced a trap composed of 43 places in 550 ms of which 1 ms to minimize.
[2023-03-15 22:24:22] [INFO ] Deduced a trap composed of 37 places in 513 ms of which 1 ms to minimize.
[2023-03-15 22:24:22] [INFO ] Deduced a trap composed of 32 places in 555 ms of which 1 ms to minimize.
[2023-03-15 22:24:23] [INFO ] Deduced a trap composed of 36 places in 463 ms of which 1 ms to minimize.
[2023-03-15 22:24:23] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 21055 ms
[2023-03-15 22:24:23] [INFO ] Computed and/alt/rep : 1141/3164/1141 causal constraints (skipped 84 transitions) in 147 ms.
[2023-03-15 22:24:28] [INFO ] Deduced a trap composed of 61 places in 481 ms of which 1 ms to minimize.
[2023-03-15 22:24:29] [INFO ] Deduced a trap composed of 34 places in 615 ms of which 1 ms to minimize.
[2023-03-15 22:24:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1667 ms
[2023-03-15 22:24:29] [INFO ] Added : 140 causal constraints over 29 iterations in 6289 ms. Result :sat
Minimization took 556 ms.
Current structural bounds on expressions (after SMT) : [7, 7] Max seen :[6, 6]
Support contains 294 out of 735 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 31 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 735/735 places, 1442/1442 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 28 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
[2023-03-15 22:24:31] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2023-03-15 22:24:31] [INFO ] Computed 20 place invariants in 5 ms
[2023-03-15 22:24:32] [INFO ] Implicit Places using invariants in 444 ms returned []
[2023-03-15 22:24:32] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2023-03-15 22:24:32] [INFO ] Computed 20 place invariants in 5 ms
[2023-03-15 22:24:33] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 22:24:37] [INFO ] Implicit Places using invariants and state equation in 5364 ms returned []
Implicit Place search using SMT with State Equation took 5810 ms to find 0 implicit places.
[2023-03-15 22:24:37] [INFO ] Redundant transitions in 216 ms returned []
[2023-03-15 22:24:37] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2023-03-15 22:24:37] [INFO ] Computed 20 place invariants in 5 ms
[2023-03-15 22:24:39] [INFO ] Dead Transitions using invariants and state equation in 1532 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 735/735 places, 1442/1442 transitions.
Starting property specific reduction for Peterson-COL-6-UpperBounds-00
Normalized transition count is 1232 out of 1442 initially.
// Phase 1: matrix 1232 rows 735 cols
[2023-03-15 22:24:39] [INFO ] Computed 20 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :1
[2023-03-15 22:24:39] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2023-03-15 22:24:39] [INFO ] Computed 20 place invariants in 3 ms
[2023-03-15 22:24:39] [INFO ] [Real]Absence check using 20 positive place invariants in 17 ms returned sat
[2023-03-15 22:24:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:24:40] [INFO ] [Real]Absence check using state equation in 563 ms returned sat
[2023-03-15 22:24:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:24:40] [INFO ] [Nat]Absence check using 20 positive place invariants in 27 ms returned sat
[2023-03-15 22:24:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:24:41] [INFO ] [Nat]Absence check using state equation in 640 ms returned sat
[2023-03-15 22:24:41] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 22:24:41] [INFO ] [Nat]Added 330 Read/Feed constraints in 128 ms returned sat
[2023-03-15 22:24:41] [INFO ] Deduced a trap composed of 52 places in 621 ms of which 5 ms to minimize.
[2023-03-15 22:24:42] [INFO ] Deduced a trap composed of 18 places in 532 ms of which 1 ms to minimize.
[2023-03-15 22:24:43] [INFO ] Deduced a trap composed of 12 places in 761 ms of which 2 ms to minimize.
[2023-03-15 22:24:44] [INFO ] Deduced a trap composed of 35 places in 692 ms of which 1 ms to minimize.
[2023-03-15 22:24:44] [INFO ] Deduced a trap composed of 52 places in 614 ms of which 3 ms to minimize.
[2023-03-15 22:24:44] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3646 ms
[2023-03-15 22:24:45] [INFO ] Computed and/alt/rep : 1141/3164/1141 causal constraints (skipped 84 transitions) in 137 ms.
[2023-03-15 22:24:46] [INFO ] Deduced a trap composed of 2 places in 728 ms of which 2 ms to minimize.
[2023-03-15 22:24:46] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [294] Max seen :[3]
Support contains 294 out of 735 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 27 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 735/735 places, 1442/1442 transitions.
Normalized transition count is 1232 out of 1442 initially.
// Phase 1: matrix 1232 rows 735 cols
[2023-03-15 22:24:46] [INFO ] Computed 20 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 7870 ms. (steps per millisecond=127 ) properties (out of 1) seen :6
Finished Best-First random walk after 892914 steps, including 2 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=178 )
[2023-03-15 22:24:58] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2023-03-15 22:24:58] [INFO ] Computed 20 place invariants in 6 ms
[2023-03-15 22:24:59] [INFO ] [Real]Absence check using 20 positive place invariants in 26 ms returned sat
[2023-03-15 22:24:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:24:59] [INFO ] [Real]Absence check using state equation in 590 ms returned sat
[2023-03-15 22:24:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:25:00] [INFO ] [Nat]Absence check using 20 positive place invariants in 28 ms returned sat
[2023-03-15 22:25:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:25:00] [INFO ] [Nat]Absence check using state equation in 638 ms returned sat
[2023-03-15 22:25:00] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 22:25:00] [INFO ] [Nat]Added 330 Read/Feed constraints in 146 ms returned sat
[2023-03-15 22:25:01] [INFO ] Deduced a trap composed of 29 places in 593 ms of which 2 ms to minimize.
[2023-03-15 22:25:02] [INFO ] Deduced a trap composed of 38 places in 642 ms of which 2 ms to minimize.
[2023-03-15 22:25:02] [INFO ] Deduced a trap composed of 20 places in 750 ms of which 1 ms to minimize.
[2023-03-15 22:25:03] [INFO ] Deduced a trap composed of 56 places in 712 ms of which 1 ms to minimize.
[2023-03-15 22:25:04] [INFO ] Deduced a trap composed of 46 places in 685 ms of which 2 ms to minimize.
[2023-03-15 22:25:05] [INFO ] Deduced a trap composed of 42 places in 567 ms of which 2 ms to minimize.
[2023-03-15 22:25:05] [INFO ] Deduced a trap composed of 52 places in 616 ms of which 1 ms to minimize.
[2023-03-15 22:25:06] [INFO ] Deduced a trap composed of 46 places in 809 ms of which 2 ms to minimize.
[2023-03-15 22:25:07] [INFO ] Deduced a trap composed of 43 places in 767 ms of which 1 ms to minimize.
[2023-03-15 22:25:08] [INFO ] Deduced a trap composed of 27 places in 713 ms of which 1 ms to minimize.
[2023-03-15 22:25:08] [INFO ] Deduced a trap composed of 92 places in 432 ms of which 1 ms to minimize.
[2023-03-15 22:25:09] [INFO ] Deduced a trap composed of 121 places in 606 ms of which 1 ms to minimize.
[2023-03-15 22:25:10] [INFO ] Deduced a trap composed of 165 places in 767 ms of which 1 ms to minimize.
[2023-03-15 22:25:11] [INFO ] Deduced a trap composed of 190 places in 767 ms of which 2 ms to minimize.
[2023-03-15 22:25:12] [INFO ] Deduced a trap composed of 125 places in 828 ms of which 3 ms to minimize.
[2023-03-15 22:25:13] [INFO ] Deduced a trap composed of 12 places in 825 ms of which 1 ms to minimize.
[2023-03-15 22:25:13] [INFO ] Deduced a trap composed of 34 places in 716 ms of which 1 ms to minimize.
[2023-03-15 22:25:14] [INFO ] Deduced a trap composed of 52 places in 782 ms of which 2 ms to minimize.
[2023-03-15 22:25:15] [INFO ] Deduced a trap composed of 21 places in 728 ms of which 1 ms to minimize.
[2023-03-15 22:25:16] [INFO ] Deduced a trap composed of 119 places in 820 ms of which 1 ms to minimize.
[2023-03-15 22:25:16] [INFO ] Deduced a trap composed of 84 places in 527 ms of which 1 ms to minimize.
[2023-03-15 22:25:17] [INFO ] Deduced a trap composed of 99 places in 575 ms of which 1 ms to minimize.
[2023-03-15 22:25:18] [INFO ] Deduced a trap composed of 20 places in 487 ms of which 1 ms to minimize.
[2023-03-15 22:25:18] [INFO ] Deduced a trap composed of 87 places in 549 ms of which 1 ms to minimize.
[2023-03-15 22:25:19] [INFO ] Deduced a trap composed of 102 places in 557 ms of which 1 ms to minimize.
[2023-03-15 22:25:20] [INFO ] Deduced a trap composed of 43 places in 585 ms of which 1 ms to minimize.
[2023-03-15 22:25:20] [INFO ] Deduced a trap composed of 37 places in 756 ms of which 2 ms to minimize.
[2023-03-15 22:25:21] [INFO ] Deduced a trap composed of 32 places in 728 ms of which 2 ms to minimize.
[2023-03-15 22:25:22] [INFO ] Deduced a trap composed of 36 places in 638 ms of which 1 ms to minimize.
[2023-03-15 22:25:22] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 21742 ms
[2023-03-15 22:25:22] [INFO ] Computed and/alt/rep : 1141/3164/1141 causal constraints (skipped 84 transitions) in 159 ms.
[2023-03-15 22:25:27] [INFO ] Deduced a trap composed of 61 places in 649 ms of which 1 ms to minimize.
[2023-03-15 22:25:28] [INFO ] Deduced a trap composed of 34 places in 600 ms of which 1 ms to minimize.
[2023-03-15 22:25:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1807 ms
[2023-03-15 22:25:28] [INFO ] Added : 140 causal constraints over 29 iterations in 6377 ms. Result :sat
Minimization took 559 ms.
Current structural bounds on expressions (after SMT) : [294] Max seen :[6]
Support contains 294 out of 735 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 31 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 735/735 places, 1442/1442 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 29 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
[2023-03-15 22:25:30] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2023-03-15 22:25:30] [INFO ] Computed 20 place invariants in 3 ms
[2023-03-15 22:25:30] [INFO ] Implicit Places using invariants in 703 ms returned []
[2023-03-15 22:25:30] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2023-03-15 22:25:30] [INFO ] Computed 20 place invariants in 3 ms
[2023-03-15 22:25:31] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 22:25:35] [INFO ] Implicit Places using invariants and state equation in 4835 ms returned []
Implicit Place search using SMT with State Equation took 5546 ms to find 0 implicit places.
[2023-03-15 22:25:35] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-15 22:25:35] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2023-03-15 22:25:35] [INFO ] Computed 20 place invariants in 4 ms
[2023-03-15 22:25:36] [INFO ] Dead Transitions using invariants and state equation in 1326 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 735/735 places, 1442/1442 transitions.
Normalized transition count is 1232 out of 1442 initially.
// Phase 1: matrix 1232 rows 735 cols
[2023-03-15 22:25:36] [INFO ] Computed 20 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 7631 ms. (steps per millisecond=131 ) properties (out of 1) seen :6
Finished Best-First random walk after 813930 steps, including 2 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=162 )
[2023-03-15 22:25:49] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2023-03-15 22:25:49] [INFO ] Computed 20 place invariants in 11 ms
[2023-03-15 22:25:49] [INFO ] [Real]Absence check using 20 positive place invariants in 21 ms returned sat
[2023-03-15 22:25:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:25:50] [INFO ] [Real]Absence check using state equation in 535 ms returned sat
[2023-03-15 22:25:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:25:50] [INFO ] [Nat]Absence check using 20 positive place invariants in 29 ms returned sat
[2023-03-15 22:25:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:25:51] [INFO ] [Nat]Absence check using state equation in 685 ms returned sat
[2023-03-15 22:25:51] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 22:25:51] [INFO ] [Nat]Added 330 Read/Feed constraints in 160 ms returned sat
[2023-03-15 22:25:52] [INFO ] Deduced a trap composed of 29 places in 832 ms of which 1 ms to minimize.
[2023-03-15 22:25:52] [INFO ] Deduced a trap composed of 38 places in 566 ms of which 1 ms to minimize.
[2023-03-15 22:25:53] [INFO ] Deduced a trap composed of 20 places in 780 ms of which 2 ms to minimize.
[2023-03-15 22:25:54] [INFO ] Deduced a trap composed of 56 places in 596 ms of which 1 ms to minimize.
[2023-03-15 22:25:55] [INFO ] Deduced a trap composed of 46 places in 633 ms of which 1 ms to minimize.
[2023-03-15 22:25:55] [INFO ] Deduced a trap composed of 42 places in 613 ms of which 2 ms to minimize.
[2023-03-15 22:25:56] [INFO ] Deduced a trap composed of 52 places in 629 ms of which 3 ms to minimize.
[2023-03-15 22:25:57] [INFO ] Deduced a trap composed of 46 places in 625 ms of which 2 ms to minimize.
[2023-03-15 22:25:58] [INFO ] Deduced a trap composed of 43 places in 811 ms of which 1 ms to minimize.
[2023-03-15 22:25:58] [INFO ] Deduced a trap composed of 27 places in 622 ms of which 1 ms to minimize.
[2023-03-15 22:25:59] [INFO ] Deduced a trap composed of 92 places in 839 ms of which 1 ms to minimize.
[2023-03-15 22:26:00] [INFO ] Deduced a trap composed of 121 places in 742 ms of which 1 ms to minimize.
[2023-03-15 22:26:01] [INFO ] Deduced a trap composed of 165 places in 889 ms of which 1 ms to minimize.
[2023-03-15 22:26:02] [INFO ] Deduced a trap composed of 190 places in 886 ms of which 2 ms to minimize.
[2023-03-15 22:26:03] [INFO ] Deduced a trap composed of 125 places in 656 ms of which 1 ms to minimize.
[2023-03-15 22:26:04] [INFO ] Deduced a trap composed of 12 places in 857 ms of which 2 ms to minimize.
[2023-03-15 22:26:05] [INFO ] Deduced a trap composed of 34 places in 839 ms of which 1 ms to minimize.
[2023-03-15 22:26:06] [INFO ] Deduced a trap composed of 52 places in 811 ms of which 1 ms to minimize.
[2023-03-15 22:26:06] [INFO ] Deduced a trap composed of 21 places in 676 ms of which 1 ms to minimize.
[2023-03-15 22:26:07] [INFO ] Deduced a trap composed of 119 places in 632 ms of which 2 ms to minimize.
[2023-03-15 22:26:08] [INFO ] Deduced a trap composed of 84 places in 866 ms of which 2 ms to minimize.
[2023-03-15 22:26:09] [INFO ] Deduced a trap composed of 99 places in 825 ms of which 1 ms to minimize.
[2023-03-15 22:26:10] [INFO ] Deduced a trap composed of 20 places in 591 ms of which 1 ms to minimize.
[2023-03-15 22:26:10] [INFO ] Deduced a trap composed of 87 places in 669 ms of which 1 ms to minimize.
[2023-03-15 22:26:11] [INFO ] Deduced a trap composed of 102 places in 508 ms of which 1 ms to minimize.
[2023-03-15 22:26:12] [INFO ] Deduced a trap composed of 43 places in 555 ms of which 1 ms to minimize.
[2023-03-15 22:26:12] [INFO ] Deduced a trap composed of 37 places in 552 ms of which 2 ms to minimize.
[2023-03-15 22:26:13] [INFO ] Deduced a trap composed of 32 places in 692 ms of which 1 ms to minimize.
[2023-03-15 22:26:14] [INFO ] Deduced a trap composed of 36 places in 599 ms of which 1 ms to minimize.
[2023-03-15 22:26:14] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 22827 ms
[2023-03-15 22:26:14] [INFO ] Computed and/alt/rep : 1141/3164/1141 causal constraints (skipped 84 transitions) in 139 ms.
[2023-03-15 22:26:19] [INFO ] Deduced a trap composed of 61 places in 636 ms of which 1 ms to minimize.
[2023-03-15 22:26:19] [INFO ] Deduced a trap composed of 34 places in 416 ms of which 1 ms to minimize.
[2023-03-15 22:26:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1611 ms
[2023-03-15 22:26:20] [INFO ] Added : 140 causal constraints over 29 iterations in 6132 ms. Result :sat
Minimization took 548 ms.
Current structural bounds on expressions (after SMT) : [294] Max seen :[6]
Support contains 294 out of 735 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 49 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 735/735 places, 1442/1442 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 41 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
[2023-03-15 22:26:21] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2023-03-15 22:26:21] [INFO ] Computed 20 place invariants in 5 ms
[2023-03-15 22:26:22] [INFO ] Implicit Places using invariants in 708 ms returned []
[2023-03-15 22:26:22] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2023-03-15 22:26:22] [INFO ] Computed 20 place invariants in 5 ms
[2023-03-15 22:26:23] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 22:26:26] [INFO ] Implicit Places using invariants and state equation in 4132 ms returned []
Implicit Place search using SMT with State Equation took 4842 ms to find 0 implicit places.
[2023-03-15 22:26:26] [INFO ] Redundant transitions in 129 ms returned []
[2023-03-15 22:26:26] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2023-03-15 22:26:26] [INFO ] Computed 20 place invariants in 5 ms
[2023-03-15 22:26:28] [INFO ] Dead Transitions using invariants and state equation in 1566 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 735/735 places, 1442/1442 transitions.
Normalized transition count is 1232 out of 1442 initially.
// Phase 1: matrix 1232 rows 735 cols
[2023-03-15 22:26:28] [INFO ] Computed 20 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 7329 ms. (steps per millisecond=136 ) properties (out of 1) seen :6
Finished Best-First random walk after 896810 steps, including 2 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=179 )
[2023-03-15 22:26:40] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2023-03-15 22:26:40] [INFO ] Computed 20 place invariants in 5 ms
[2023-03-15 22:26:40] [INFO ] [Real]Absence check using 20 positive place invariants in 27 ms returned unsat
Current structural bounds on expressions (after SMT) : [7] Max seen :[7]
FORMULA Peterson-COL-6-UpperBounds-00 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for Peterson-COL-6-UpperBounds-00 in 121305 ms.
Starting property specific reduction for Peterson-COL-6-UpperBounds-11
Normalized transition count is 1232 out of 1442 initially.
// Phase 1: matrix 1232 rows 735 cols
[2023-03-15 22:26:40] [INFO ] Computed 20 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :2
[2023-03-15 22:26:40] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2023-03-15 22:26:40] [INFO ] Computed 20 place invariants in 5 ms
[2023-03-15 22:26:41] [INFO ] [Real]Absence check using 20 positive place invariants in 26 ms returned sat
[2023-03-15 22:26:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:26:41] [INFO ] [Real]Absence check using state equation in 519 ms returned sat
[2023-03-15 22:26:41] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 22:26:41] [INFO ] [Real]Added 330 Read/Feed constraints in 52 ms returned sat
[2023-03-15 22:26:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:26:41] [INFO ] [Nat]Absence check using 20 positive place invariants in 17 ms returned sat
[2023-03-15 22:26:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:26:42] [INFO ] [Nat]Absence check using state equation in 562 ms returned sat
[2023-03-15 22:26:42] [INFO ] [Nat]Added 330 Read/Feed constraints in 91 ms returned sat
[2023-03-15 22:26:43] [INFO ] Deduced a trap composed of 77 places in 577 ms of which 1 ms to minimize.
[2023-03-15 22:26:43] [INFO ] Deduced a trap composed of 32 places in 567 ms of which 1 ms to minimize.
[2023-03-15 22:26:44] [INFO ] Deduced a trap composed of 66 places in 675 ms of which 2 ms to minimize.
[2023-03-15 22:26:45] [INFO ] Deduced a trap composed of 89 places in 745 ms of which 1 ms to minimize.
[2023-03-15 22:26:46] [INFO ] Deduced a trap composed of 35 places in 791 ms of which 1 ms to minimize.
[2023-03-15 22:26:46] [INFO ] Deduced a trap composed of 27 places in 546 ms of which 1 ms to minimize.
[2023-03-15 22:26:46] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [294] Max seen :[4]
Support contains 294 out of 735 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 22 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 735/735 places, 1442/1442 transitions.
Normalized transition count is 1232 out of 1442 initially.
// Phase 1: matrix 1232 rows 735 cols
[2023-03-15 22:26:46] [INFO ] Computed 20 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 7291 ms. (steps per millisecond=137 ) properties (out of 1) seen :6
Finished Best-First random walk after 899538 steps, including 2 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=179 )
[2023-03-15 22:26:59] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2023-03-15 22:26:59] [INFO ] Computed 20 place invariants in 5 ms
[2023-03-15 22:26:59] [INFO ] [Real]Absence check using 20 positive place invariants in 26 ms returned sat
[2023-03-15 22:26:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:26:59] [INFO ] [Real]Absence check using state equation in 574 ms returned sat
[2023-03-15 22:26:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:27:00] [INFO ] [Nat]Absence check using 20 positive place invariants in 17 ms returned sat
[2023-03-15 22:27:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:27:00] [INFO ] [Nat]Absence check using state equation in 423 ms returned sat
[2023-03-15 22:27:00] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 22:27:00] [INFO ] [Nat]Added 330 Read/Feed constraints in 98 ms returned sat
[2023-03-15 22:27:01] [INFO ] Deduced a trap composed of 29 places in 655 ms of which 1 ms to minimize.
[2023-03-15 22:27:02] [INFO ] Deduced a trap composed of 38 places in 667 ms of which 1 ms to minimize.
[2023-03-15 22:27:02] [INFO ] Deduced a trap composed of 20 places in 629 ms of which 2 ms to minimize.
[2023-03-15 22:27:03] [INFO ] Deduced a trap composed of 56 places in 784 ms of which 1 ms to minimize.
[2023-03-15 22:27:04] [INFO ] Deduced a trap composed of 46 places in 810 ms of which 1 ms to minimize.
[2023-03-15 22:27:05] [INFO ] Deduced a trap composed of 42 places in 767 ms of which 2 ms to minimize.
[2023-03-15 22:27:06] [INFO ] Deduced a trap composed of 52 places in 821 ms of which 2 ms to minimize.
[2023-03-15 22:27:06] [INFO ] Deduced a trap composed of 46 places in 711 ms of which 2 ms to minimize.
[2023-03-15 22:27:07] [INFO ] Deduced a trap composed of 43 places in 518 ms of which 1 ms to minimize.
[2023-03-15 22:27:07] [INFO ] Deduced a trap composed of 27 places in 530 ms of which 0 ms to minimize.
[2023-03-15 22:27:08] [INFO ] Deduced a trap composed of 92 places in 521 ms of which 1 ms to minimize.
[2023-03-15 22:27:09] [INFO ] Deduced a trap composed of 121 places in 611 ms of which 2 ms to minimize.
[2023-03-15 22:27:09] [INFO ] Deduced a trap composed of 165 places in 669 ms of which 1 ms to minimize.
[2023-03-15 22:27:10] [INFO ] Deduced a trap composed of 190 places in 602 ms of which 1 ms to minimize.
[2023-03-15 22:27:11] [INFO ] Deduced a trap composed of 125 places in 664 ms of which 1 ms to minimize.
[2023-03-15 22:27:11] [INFO ] Deduced a trap composed of 12 places in 429 ms of which 1 ms to minimize.
[2023-03-15 22:27:12] [INFO ] Deduced a trap composed of 34 places in 588 ms of which 2 ms to minimize.
[2023-03-15 22:27:13] [INFO ] Deduced a trap composed of 52 places in 684 ms of which 1 ms to minimize.
[2023-03-15 22:27:14] [INFO ] Deduced a trap composed of 21 places in 581 ms of which 2 ms to minimize.
[2023-03-15 22:27:14] [INFO ] Deduced a trap composed of 119 places in 827 ms of which 2 ms to minimize.
[2023-03-15 22:27:15] [INFO ] Deduced a trap composed of 84 places in 661 ms of which 1 ms to minimize.
[2023-03-15 22:27:16] [INFO ] Deduced a trap composed of 99 places in 632 ms of which 1 ms to minimize.
[2023-03-15 22:27:17] [INFO ] Deduced a trap composed of 20 places in 802 ms of which 1 ms to minimize.
[2023-03-15 22:27:18] [INFO ] Deduced a trap composed of 87 places in 794 ms of which 1 ms to minimize.
[2023-03-15 22:27:19] [INFO ] Deduced a trap composed of 102 places in 764 ms of which 1 ms to minimize.
[2023-03-15 22:27:19] [INFO ] Deduced a trap composed of 43 places in 768 ms of which 2 ms to minimize.
[2023-03-15 22:27:20] [INFO ] Deduced a trap composed of 37 places in 635 ms of which 2 ms to minimize.
[2023-03-15 22:27:21] [INFO ] Deduced a trap composed of 32 places in 660 ms of which 2 ms to minimize.
[2023-03-15 22:27:22] [INFO ] Deduced a trap composed of 36 places in 619 ms of which 2 ms to minimize.
[2023-03-15 22:27:22] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 21552 ms
[2023-03-15 22:27:22] [INFO ] Computed and/alt/rep : 1141/3164/1141 causal constraints (skipped 84 transitions) in 107 ms.
[2023-03-15 22:27:26] [INFO ] Deduced a trap composed of 61 places in 544 ms of which 2 ms to minimize.
[2023-03-15 22:27:26] [INFO ] Deduced a trap composed of 34 places in 417 ms of which 1 ms to minimize.
[2023-03-15 22:27:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1491 ms
[2023-03-15 22:27:27] [INFO ] Added : 140 causal constraints over 29 iterations in 5481 ms. Result :sat
Minimization took 548 ms.
Current structural bounds on expressions (after SMT) : [294] Max seen :[6]
Support contains 294 out of 735 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 33 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 735/735 places, 1442/1442 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 32 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
[2023-03-15 22:27:28] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2023-03-15 22:27:28] [INFO ] Computed 20 place invariants in 7 ms
[2023-03-15 22:27:29] [INFO ] Implicit Places using invariants in 850 ms returned []
[2023-03-15 22:27:29] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2023-03-15 22:27:29] [INFO ] Computed 20 place invariants in 5 ms
[2023-03-15 22:27:30] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 22:27:34] [INFO ] Implicit Places using invariants and state equation in 4843 ms returned []
Implicit Place search using SMT with State Equation took 5695 ms to find 0 implicit places.
[2023-03-15 22:27:34] [INFO ] Redundant transitions in 36 ms returned []
[2023-03-15 22:27:34] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2023-03-15 22:27:34] [INFO ] Computed 20 place invariants in 4 ms
[2023-03-15 22:27:35] [INFO ] Dead Transitions using invariants and state equation in 1456 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 735/735 places, 1442/1442 transitions.
Normalized transition count is 1232 out of 1442 initially.
// Phase 1: matrix 1232 rows 735 cols
[2023-03-15 22:27:35] [INFO ] Computed 20 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 7389 ms. (steps per millisecond=135 ) properties (out of 1) seen :6
Finished Best-First random walk after 894466 steps, including 2 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=178 )
[2023-03-15 22:27:48] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2023-03-15 22:27:48] [INFO ] Computed 20 place invariants in 4 ms
[2023-03-15 22:27:48] [INFO ] [Real]Absence check using 20 positive place invariants in 17 ms returned sat
[2023-03-15 22:27:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:27:49] [INFO ] [Real]Absence check using state equation in 501 ms returned sat
[2023-03-15 22:27:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:27:49] [INFO ] [Nat]Absence check using 20 positive place invariants in 21 ms returned sat
[2023-03-15 22:27:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:27:49] [INFO ] [Nat]Absence check using state equation in 525 ms returned sat
[2023-03-15 22:27:49] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 22:27:49] [INFO ] [Nat]Added 330 Read/Feed constraints in 161 ms returned sat
[2023-03-15 22:27:50] [INFO ] Deduced a trap composed of 29 places in 629 ms of which 1 ms to minimize.
[2023-03-15 22:27:51] [INFO ] Deduced a trap composed of 38 places in 623 ms of which 1 ms to minimize.
[2023-03-15 22:27:52] [INFO ] Deduced a trap composed of 20 places in 631 ms of which 1 ms to minimize.
[2023-03-15 22:27:52] [INFO ] Deduced a trap composed of 56 places in 827 ms of which 2 ms to minimize.
[2023-03-15 22:27:53] [INFO ] Deduced a trap composed of 46 places in 725 ms of which 1 ms to minimize.
[2023-03-15 22:27:54] [INFO ] Deduced a trap composed of 42 places in 730 ms of which 2 ms to minimize.
[2023-03-15 22:27:55] [INFO ] Deduced a trap composed of 52 places in 713 ms of which 2 ms to minimize.
[2023-03-15 22:27:56] [INFO ] Deduced a trap composed of 46 places in 707 ms of which 1 ms to minimize.
[2023-03-15 22:27:56] [INFO ] Deduced a trap composed of 43 places in 742 ms of which 1 ms to minimize.
[2023-03-15 22:27:57] [INFO ] Deduced a trap composed of 27 places in 555 ms of which 1 ms to minimize.
[2023-03-15 22:27:58] [INFO ] Deduced a trap composed of 92 places in 631 ms of which 2 ms to minimize.
[2023-03-15 22:27:58] [INFO ] Deduced a trap composed of 121 places in 559 ms of which 1 ms to minimize.
[2023-03-15 22:27:59] [INFO ] Deduced a trap composed of 165 places in 845 ms of which 1 ms to minimize.
[2023-03-15 22:28:00] [INFO ] Deduced a trap composed of 190 places in 640 ms of which 1 ms to minimize.
[2023-03-15 22:28:01] [INFO ] Deduced a trap composed of 125 places in 811 ms of which 1 ms to minimize.
[2023-03-15 22:28:02] [INFO ] Deduced a trap composed of 12 places in 799 ms of which 1 ms to minimize.
[2023-03-15 22:28:03] [INFO ] Deduced a trap composed of 34 places in 596 ms of which 1 ms to minimize.
[2023-03-15 22:28:03] [INFO ] Deduced a trap composed of 52 places in 813 ms of which 1 ms to minimize.
[2023-03-15 22:28:04] [INFO ] Deduced a trap composed of 21 places in 803 ms of which 1 ms to minimize.
[2023-03-15 22:28:05] [INFO ] Deduced a trap composed of 119 places in 828 ms of which 1 ms to minimize.
[2023-03-15 22:28:06] [INFO ] Deduced a trap composed of 84 places in 833 ms of which 2 ms to minimize.
[2023-03-15 22:28:07] [INFO ] Deduced a trap composed of 99 places in 793 ms of which 1 ms to minimize.
[2023-03-15 22:28:08] [INFO ] Deduced a trap composed of 20 places in 707 ms of which 2 ms to minimize.
[2023-03-15 22:28:09] [INFO ] Deduced a trap composed of 87 places in 783 ms of which 1 ms to minimize.
[2023-03-15 22:28:10] [INFO ] Deduced a trap composed of 102 places in 755 ms of which 1 ms to minimize.
[2023-03-15 22:28:10] [INFO ] Deduced a trap composed of 43 places in 779 ms of which 1 ms to minimize.
[2023-03-15 22:28:11] [INFO ] Deduced a trap composed of 37 places in 743 ms of which 1 ms to minimize.
[2023-03-15 22:28:12] [INFO ] Deduced a trap composed of 32 places in 756 ms of which 1 ms to minimize.
[2023-03-15 22:28:13] [INFO ] Deduced a trap composed of 36 places in 623 ms of which 2 ms to minimize.
[2023-03-15 22:28:13] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 23431 ms
[2023-03-15 22:28:13] [INFO ] Computed and/alt/rep : 1141/3164/1141 causal constraints (skipped 84 transitions) in 139 ms.
[2023-03-15 22:28:18] [INFO ] Deduced a trap composed of 61 places in 664 ms of which 1 ms to minimize.
[2023-03-15 22:28:18] [INFO ] Deduced a trap composed of 34 places in 559 ms of which 2 ms to minimize.
[2023-03-15 22:28:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1749 ms
[2023-03-15 22:28:19] [INFO ] Added : 140 causal constraints over 29 iterations in 6232 ms. Result :sat
Minimization took 532 ms.
Current structural bounds on expressions (after SMT) : [294] Max seen :[6]
Support contains 294 out of 735 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 34 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 735/735 places, 1442/1442 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 32 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
[2023-03-15 22:28:20] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2023-03-15 22:28:20] [INFO ] Computed 20 place invariants in 5 ms
[2023-03-15 22:28:21] [INFO ] Implicit Places using invariants in 560 ms returned []
[2023-03-15 22:28:21] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2023-03-15 22:28:21] [INFO ] Computed 20 place invariants in 5 ms
[2023-03-15 22:28:22] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 22:28:26] [INFO ] Implicit Places using invariants and state equation in 4970 ms returned []
Implicit Place search using SMT with State Equation took 5536 ms to find 0 implicit places.
[2023-03-15 22:28:26] [INFO ] Redundant transitions in 38 ms returned []
[2023-03-15 22:28:26] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2023-03-15 22:28:26] [INFO ] Computed 20 place invariants in 5 ms
[2023-03-15 22:28:27] [INFO ] Dead Transitions using invariants and state equation in 1430 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 735/735 places, 1442/1442 transitions.
Ending property specific reduction for Peterson-COL-6-UpperBounds-11 in 107086 ms.
[2023-03-15 22:28:28] [INFO ] Flatten gal took : 263 ms
[2023-03-15 22:28:28] [INFO ] Applying decomposition
[2023-03-15 22:28:28] [INFO ] Flatten gal took : 171 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1183600488570334327.txt' '-o' '/tmp/graph1183600488570334327.bin' '-w' '/tmp/graph1183600488570334327.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1183600488570334327.bin' '-l' '-1' '-v' '-w' '/tmp/graph1183600488570334327.weights' '-q' '0' '-e' '0.001'
[2023-03-15 22:28:28] [INFO ] Decomposing Gal with order
[2023-03-15 22:28:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 22:28:29] [INFO ] Removed a total of 2000 redundant transitions.
[2023-03-15 22:28:29] [INFO ] Flatten gal took : 233 ms
[2023-03-15 22:28:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 57 ms.
[2023-03-15 22:28:29] [INFO ] Time to serialize gal into /tmp/UpperBounds11411415897804652047.gal : 43 ms
[2023-03-15 22:28:29] [INFO ] Time to serialize properties into /tmp/UpperBounds15072216220771696144.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds11411415897804652047.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15072216220771696144.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...297
Loading property file /tmp/UpperBounds15072216220771696144.prop.
Detected timeout of ITS tools.
[2023-03-15 22:51:57] [INFO ] Applying decomposition
[2023-03-15 22:51:58] [INFO ] Flatten gal took : 1016 ms
[2023-03-15 22:52:04] [INFO ] Decomposing Gal with order
[2023-03-15 22:52:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 22:52:06] [INFO ] Removed a total of 2121 redundant transitions.
[2023-03-15 22:52:06] [INFO ] Flatten gal took : 1144 ms
[2023-03-15 22:52:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 28 ms.
[2023-03-15 22:52:06] [INFO ] Time to serialize gal into /tmp/UpperBounds16661997324660350345.gal : 59 ms
[2023-03-15 22:52:07] [INFO ] Time to serialize properties into /tmp/UpperBounds5073503654554468536.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds16661997324660350345.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5073503654554468536.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...296
Loading property file /tmp/UpperBounds5073503654554468536.prop.
Detected timeout of ITS tools.
[2023-03-15 23:15:30] [INFO ] Flatten gal took : 1725 ms
[2023-03-15 23:15:32] [INFO ] Input system was already deterministic with 1442 transitions.
[2023-03-15 23:15:32] [INFO ] Transformed 735 places.
[2023-03-15 23:15:32] [INFO ] Transformed 1442 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-15 23:15:33] [INFO ] Time to serialize gal into /tmp/UpperBounds13157789587471631283.gal : 17 ms
[2023-03-15 23:15:33] [INFO ] Time to serialize properties into /tmp/UpperBounds16147538321580763556.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds13157789587471631283.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16147538321580763556.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...342
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds16147538321580763556.prop.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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-6"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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-5348"
echo " Executing tool gold2022"
echo " Input is Peterson-COL-6, 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 r287-smll-167863553800074"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-6.tgz
mv Peterson-COL-6 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 ;