About the Execution of ITS-Tools for Peterson-COL-5
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16216.823 | 3600000.00 | 2778498.00 | 493413.70 | 6 5 6 6 6 6 5 6 6 6 ? 6 6 6 5 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/mcc2022-input.r168-tall-165277016100029.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Peterson-COL-5, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016100029
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 256K
-rw-r--r-- 1 mcc users 7.3K Apr 30 09:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 30 09:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Apr 30 09:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 30 09:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 45K May 10 09:34 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-5-UpperBounds-00
FORMULA_NAME Peterson-COL-5-UpperBounds-01
FORMULA_NAME Peterson-COL-5-UpperBounds-02
FORMULA_NAME Peterson-COL-5-UpperBounds-03
FORMULA_NAME Peterson-COL-5-UpperBounds-04
FORMULA_NAME Peterson-COL-5-UpperBounds-05
FORMULA_NAME Peterson-COL-5-UpperBounds-06
FORMULA_NAME Peterson-COL-5-UpperBounds-07
FORMULA_NAME Peterson-COL-5-UpperBounds-08
FORMULA_NAME Peterson-COL-5-UpperBounds-09
FORMULA_NAME Peterson-COL-5-UpperBounds-10
FORMULA_NAME Peterson-COL-5-UpperBounds-11
FORMULA_NAME Peterson-COL-5-UpperBounds-12
FORMULA_NAME Peterson-COL-5-UpperBounds-13
FORMULA_NAME Peterson-COL-5-UpperBounds-14
FORMULA_NAME Peterson-COL-5-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1652772091616
Running Version 202205111006
[2022-05-17 07:21:32] [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]
[2022-05-17 07:21:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 07:21:32] [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.
[2022-05-17 07:21:33] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-17 07:21:33] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 596 ms
[2022-05-17 07:21:33] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 864 PT places and 1398.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2022-05-17 07:21:33] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 6 ms.
[2022-05-17 07:21:33] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 2 places and 0 transitions.
// Phase 1: matrix 14 rows 9 cols
[2022-05-17 07:21:33] [INFO ] Computed 1 place invariants in 4 ms
FORMULA Peterson-COL-5-UpperBounds-15 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-5-UpperBounds-14 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-5-UpperBounds-12 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-5-UpperBounds-04 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-5-UpperBounds-00 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
// Phase 1: matrix 14 rows 9 cols
[2022-05-17 07:21:33] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 07:21:33] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-17 07:21:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:21:33] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-17 07:21:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:21:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-17 07:21:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:21:33] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-17 07:21:33] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-17 07:21:33] [INFO ] Added : 11 causal constraints over 4 iterations in 29 ms. Result :sat
Minimization took 5 ms.
[2022-05-17 07:21:33] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 07:21:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:21:33] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-17 07:21:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:21:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 07:21:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:21:33] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-17 07:21:33] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 07:21:33] [INFO ] Added : 11 causal constraints over 3 iterations in 14 ms. Result :sat
Minimization took 3 ms.
[2022-05-17 07:21:33] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 07:21:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:21:33] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-17 07:21:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:21:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 07:21:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:21:33] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-17 07:21:33] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 07:21:33] [INFO ] Added : 11 causal constraints over 3 iterations in 14 ms. Result :sat
Minimization took 6 ms.
[2022-05-17 07:21:33] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 07:21:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:21:33] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-17 07:21:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:21:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 07:21:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:21:33] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-17 07:21:33] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 07:21:34] [INFO ] Added : 11 causal constraints over 3 iterations in 22 ms. Result :sat
Minimization took 3 ms.
[2022-05-17 07:21:34] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 07:21:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:21:34] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-17 07:21:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:21:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 07:21:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:21:34] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-17 07:21:34] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 07:21:34] [INFO ] Added : 11 causal constraints over 4 iterations in 24 ms. Result :sat
Minimization took 7 ms.
[2022-05-17 07:21:34] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 07:21:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:21:34] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-17 07:21:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:21:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 07:21:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:21:34] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-17 07:21:34] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 07:21:34] [INFO ] Added : 11 causal constraints over 3 iterations in 11 ms. Result :sat
Minimization took 4 ms.
[2022-05-17 07:21:34] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 07:21:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:21:34] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-17 07:21:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:21:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 07:21:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:21:34] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-17 07:21:34] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 07:21:34] [INFO ] Added : 11 causal constraints over 4 iterations in 8 ms. Result :sat
Minimization took 3 ms.
[2022-05-17 07:21:34] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 07:21:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:21:34] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-17 07:21:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:21:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-05-17 07:21:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:21:34] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-17 07:21:34] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 07:21:34] [INFO ] Added : 11 causal constraints over 3 iterations in 16 ms. Result :sat
Minimization took 4 ms.
[2022-05-17 07:21:34] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 07:21:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:21:34] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-17 07:21:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:21:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 07:21:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:21:34] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-17 07:21:34] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 07:21:34] [INFO ] Added : 12 causal constraints over 4 iterations in 17 ms. Result :sat
Minimization took 4 ms.
[2022-05-17 07:21:34] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 07:21:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:21:34] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-17 07:21:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:21:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 07:21:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:21:34] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-17 07:21:34] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 07:21:34] [INFO ] Added : 11 causal constraints over 4 iterations in 16 ms. Result :sat
Minimization took 5 ms.
[2022-05-17 07:21:34] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 07:21:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:21:34] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-17 07:21:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:21:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 07:21:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:21:34] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-17 07:21:34] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 07:21:34] [INFO ] Added : 11 causal constraints over 3 iterations in 8 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6]
Domain [Process(6), Tour(5), Process(6)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 5)]] 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.
[2022-05-17 07:21:34] [INFO ] Unfolded HLPN to a Petri net with 864 places and 1302 transitions 4068 arcs in 37 ms.
[2022-05-17 07:21:34] [INFO ] Unfolded 11 HLPN properties in 1 ms.
Deduced a syphon composed of 30 places in 11 ms
Reduce places removed 30 places and 60 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 11) seen :42
FORMULA Peterson-COL-5-UpperBounds-13 6 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-5-UpperBounds-03 6 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-5-UpperBounds-02 6 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :18
FORMULA Peterson-COL-5-UpperBounds-11 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-5-UpperBounds-08 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :12
[2022-05-17 07:21:34] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 07:21:35] [INFO ] Computed 23 place invariants in 16 ms
[2022-05-17 07:21:35] [INFO ] [Real]Absence check using 17 positive place invariants in 17 ms returned sat
[2022-05-17 07:21:35] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2022-05-17 07:21:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:21:35] [INFO ] [Real]Absence check using state equation in 312 ms returned sat
[2022-05-17 07:21:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:21:35] [INFO ] [Nat]Absence check using 17 positive place invariants in 14 ms returned sat
[2022-05-17 07:21:35] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2022-05-17 07:21:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:21:35] [INFO ] [Nat]Absence check using state equation in 293 ms returned sat
[2022-05-17 07:21:35] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 07:21:35] [INFO ] [Nat]Added 205 Read/Feed constraints in 56 ms returned sat
[2022-05-17 07:21:36] [INFO ] Deduced a trap composed of 15 places in 254 ms of which 3 ms to minimize.
[2022-05-17 07:21:36] [INFO ] Deduced a trap composed of 15 places in 275 ms of which 2 ms to minimize.
[2022-05-17 07:21:36] [INFO ] Deduced a trap composed of 15 places in 250 ms of which 1 ms to minimize.
[2022-05-17 07:21:37] [INFO ] Deduced a trap composed of 22 places in 268 ms of which 1 ms to minimize.
[2022-05-17 07:21:37] [INFO ] Deduced a trap composed of 16 places in 261 ms of which 1 ms to minimize.
[2022-05-17 07:21:37] [INFO ] Deduced a trap composed of 15 places in 221 ms of which 1 ms to minimize.
[2022-05-17 07:21:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 1809 ms
[2022-05-17 07:21:37] [INFO ] [Real]Absence check using 17 positive place invariants in 19 ms returned sat
[2022-05-17 07:21:37] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2022-05-17 07:21:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:21:38] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2022-05-17 07:21:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:21:38] [INFO ] [Nat]Absence check using 17 positive place invariants in 17 ms returned sat
[2022-05-17 07:21:38] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2022-05-17 07:21:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:21:38] [INFO ] [Nat]Absence check using state equation in 296 ms returned sat
[2022-05-17 07:21:38] [INFO ] [Nat]Added 205 Read/Feed constraints in 51 ms returned sat
[2022-05-17 07:21:38] [INFO ] Deduced a trap composed of 109 places in 239 ms of which 1 ms to minimize.
[2022-05-17 07:21:39] [INFO ] Deduced a trap composed of 123 places in 243 ms of which 0 ms to minimize.
[2022-05-17 07:21:39] [INFO ] Deduced a trap composed of 82 places in 239 ms of which 1 ms to minimize.
[2022-05-17 07:21:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 912 ms
[2022-05-17 07:21:39] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 74 ms.
[2022-05-17 07:21:41] [INFO ] Deduced a trap composed of 103 places in 222 ms of which 1 ms to minimize.
[2022-05-17 07:21:41] [INFO ] Deduced a trap composed of 159 places in 236 ms of which 1 ms to minimize.
[2022-05-17 07:21:42] [INFO ] Deduced a trap composed of 73 places in 223 ms of which 1 ms to minimize.
[2022-05-17 07:21:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 943 ms
[2022-05-17 07:21:42] [INFO ] Added : 129 causal constraints over 27 iterations in 2939 ms. Result :sat
Minimization took 370 ms.
[2022-05-17 07:21:43] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned sat
[2022-05-17 07:21:43] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2022-05-17 07:21:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:21:43] [INFO ] [Real]Absence check using state equation in 274 ms returned sat
[2022-05-17 07:21:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:21:43] [INFO ] [Nat]Absence check using 17 positive place invariants in 14 ms returned sat
[2022-05-17 07:21:43] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2022-05-17 07:21:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:21:43] [INFO ] [Nat]Absence check using state equation in 274 ms returned sat
[2022-05-17 07:21:43] [INFO ] [Nat]Added 205 Read/Feed constraints in 56 ms returned sat
[2022-05-17 07:21:44] [INFO ] Deduced a trap composed of 15 places in 237 ms of which 1 ms to minimize.
[2022-05-17 07:21:44] [INFO ] Deduced a trap composed of 15 places in 223 ms of which 0 ms to minimize.
[2022-05-17 07:21:44] [INFO ] Deduced a trap composed of 15 places in 217 ms of which 1 ms to minimize.
[2022-05-17 07:21:44] [INFO ] Deduced a trap composed of 22 places in 221 ms of which 1 ms to minimize.
[2022-05-17 07:21:45] [INFO ] Deduced a trap composed of 16 places in 233 ms of which 1 ms to minimize.
[2022-05-17 07:21:45] [INFO ] Deduced a trap composed of 15 places in 216 ms of which 1 ms to minimize.
[2022-05-17 07:21:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 1616 ms
[2022-05-17 07:21:45] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2022-05-17 07:21:45] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2022-05-17 07:21:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:21:45] [INFO ] [Real]Absence check using state equation in 267 ms returned sat
[2022-05-17 07:21:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:21:45] [INFO ] [Nat]Absence check using 17 positive place invariants in 13 ms returned sat
[2022-05-17 07:21:45] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2022-05-17 07:21:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:21:46] [INFO ] [Nat]Absence check using state equation in 261 ms returned sat
[2022-05-17 07:21:46] [INFO ] [Nat]Added 205 Read/Feed constraints in 52 ms returned sat
[2022-05-17 07:21:46] [INFO ] Deduced a trap composed of 109 places in 231 ms of which 0 ms to minimize.
[2022-05-17 07:21:46] [INFO ] Deduced a trap composed of 123 places in 226 ms of which 0 ms to minimize.
[2022-05-17 07:21:47] [INFO ] Deduced a trap composed of 82 places in 233 ms of which 1 ms to minimize.
[2022-05-17 07:21:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 886 ms
[2022-05-17 07:21:47] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 72 ms.
[2022-05-17 07:21:49] [INFO ] Deduced a trap composed of 103 places in 226 ms of which 0 ms to minimize.
[2022-05-17 07:21:49] [INFO ] Deduced a trap composed of 159 places in 225 ms of which 1 ms to minimize.
[2022-05-17 07:21:49] [INFO ] Deduced a trap composed of 73 places in 207 ms of which 0 ms to minimize.
[2022-05-17 07:21:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 938 ms
[2022-05-17 07:21:50] [INFO ] Added : 129 causal constraints over 27 iterations in 2928 ms. Result :sat
Minimization took 375 ms.
[2022-05-17 07:21:50] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2022-05-17 07:21:50] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2022-05-17 07:21:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:21:50] [INFO ] [Real]Absence check using state equation in 264 ms returned sat
[2022-05-17 07:21:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:21:50] [INFO ] [Nat]Absence check using 17 positive place invariants in 13 ms returned sat
[2022-05-17 07:21:50] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2022-05-17 07:21:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:21:51] [INFO ] [Nat]Absence check using state equation in 281 ms returned sat
[2022-05-17 07:21:51] [INFO ] [Nat]Added 205 Read/Feed constraints in 52 ms returned sat
[2022-05-17 07:21:51] [INFO ] Deduced a trap composed of 109 places in 224 ms of which 0 ms to minimize.
[2022-05-17 07:21:51] [INFO ] Deduced a trap composed of 123 places in 231 ms of which 0 ms to minimize.
[2022-05-17 07:21:52] [INFO ] Deduced a trap composed of 82 places in 236 ms of which 3 ms to minimize.
[2022-05-17 07:21:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 888 ms
[2022-05-17 07:21:52] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 66 ms.
[2022-05-17 07:21:54] [INFO ] Deduced a trap composed of 103 places in 228 ms of which 1 ms to minimize.
[2022-05-17 07:21:54] [INFO ] Deduced a trap composed of 159 places in 238 ms of which 1 ms to minimize.
[2022-05-17 07:21:54] [INFO ] Deduced a trap composed of 73 places in 202 ms of which 1 ms to minimize.
[2022-05-17 07:21:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 916 ms
[2022-05-17 07:21:55] [INFO ] Added : 129 causal constraints over 27 iterations in 2907 ms. Result :sat
Minimization took 367 ms.
[2022-05-17 07:21:55] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2022-05-17 07:21:55] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2022-05-17 07:21:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:21:55] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2022-05-17 07:21:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:21:56] [INFO ] [Nat]Absence check using 17 positive place invariants in 13 ms returned sat
[2022-05-17 07:21:56] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 15 ms returned sat
[2022-05-17 07:21:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:21:56] [INFO ] [Nat]Absence check using state equation in 266 ms returned sat
[2022-05-17 07:21:56] [INFO ] [Nat]Added 205 Read/Feed constraints in 81 ms returned sat
[2022-05-17 07:21:56] [INFO ] Deduced a trap composed of 36 places in 218 ms of which 1 ms to minimize.
[2022-05-17 07:21:56] [INFO ] Deduced a trap composed of 15 places in 220 ms of which 1 ms to minimize.
[2022-05-17 07:21:57] [INFO ] Deduced a trap composed of 136 places in 233 ms of which 0 ms to minimize.
[2022-05-17 07:21:57] [INFO ] Deduced a trap composed of 36 places in 226 ms of which 1 ms to minimize.
[2022-05-17 07:21:57] [INFO ] Deduced a trap composed of 32 places in 231 ms of which 3 ms to minimize.
[2022-05-17 07:21:58] [INFO ] Deduced a trap composed of 93 places in 217 ms of which 1 ms to minimize.
[2022-05-17 07:21:58] [INFO ] Deduced a trap composed of 41 places in 211 ms of which 1 ms to minimize.
[2022-05-17 07:21:58] [INFO ] Deduced a trap composed of 18 places in 232 ms of which 0 ms to minimize.
[2022-05-17 07:21:58] [INFO ] Deduced a trap composed of 14 places in 225 ms of which 0 ms to minimize.
[2022-05-17 07:21:59] [INFO ] Deduced a trap composed of 63 places in 211 ms of which 0 ms to minimize.
[2022-05-17 07:21:59] [INFO ] Deduced a trap composed of 41 places in 218 ms of which 1 ms to minimize.
[2022-05-17 07:21:59] [INFO ] Deduced a trap composed of 28 places in 216 ms of which 1 ms to minimize.
[2022-05-17 07:22:00] [INFO ] Deduced a trap composed of 20 places in 213 ms of which 1 ms to minimize.
[2022-05-17 07:22:00] [INFO ] Deduced a trap composed of 11 places in 215 ms of which 0 ms to minimize.
[2022-05-17 07:22:00] [INFO ] Deduced a trap composed of 58 places in 196 ms of which 1 ms to minimize.
[2022-05-17 07:22:00] [INFO ] Deduced a trap composed of 120 places in 201 ms of which 0 ms to minimize.
[2022-05-17 07:22:01] [INFO ] Deduced a trap composed of 89 places in 205 ms of which 0 ms to minimize.
[2022-05-17 07:22:01] [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) : [5, 6, 5, 6, 6, 6] Max seen :[5, 3, 5, 3, 3, 1]
FORMULA Peterson-COL-5-UpperBounds-06 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-COL-5-UpperBounds-01 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 186 out of 834 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 150 transitions
Trivial Post-agglo rules discarded 150 transitions
Performed 150 trivial Post agglomeration. Transition count delta: 150
Iterating post reduction 0 with 150 rules applied. Total rules applied 150 place count 834 transition count 1092
Reduce places removed 150 places and 0 transitions.
Performed 150 Post agglomeration using F-continuation condition.Transition count delta: 150
Iterating post reduction 1 with 300 rules applied. Total rules applied 450 place count 684 transition count 942
Reduce places removed 150 places and 0 transitions.
Iterating post reduction 2 with 150 rules applied. Total rules applied 600 place count 534 transition count 942
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 54 Pre rules applied. Total rules applied 600 place count 534 transition count 888
Deduced a syphon composed of 54 places in 2 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 708 place count 480 transition count 888
Applied a total of 708 rules in 113 ms. Remains 480 /834 variables (removed 354) and now considering 888/1242 (removed 354) transitions.
Finished structural reductions, in 1 iterations. Remains : 480/834 places, 888/1242 transitions.
Normalized transition count is 768 out of 888 initially.
// Phase 1: matrix 768 rows 480 cols
[2022-05-17 07:22:03] [INFO ] Computed 23 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 8357 ms. (steps per millisecond=119 ) properties (out of 4) seen :16
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2860 ms. (steps per millisecond=349 ) properties (out of 4) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3237 ms. (steps per millisecond=308 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3220 ms. (steps per millisecond=310 ) properties (out of 4) seen :7
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1523 ms. (steps per millisecond=656 ) properties (out of 4) seen :4
[2022-05-17 07:22:22] [INFO ] Flow matrix only has 768 transitions (discarded 120 similar events)
// Phase 1: matrix 768 rows 480 cols
[2022-05-17 07:22:22] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-17 07:22:22] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2022-05-17 07:22:22] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2022-05-17 07:22:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:22:22] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2022-05-17 07:22:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:22:22] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2022-05-17 07:22:22] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-17 07:22:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:22:22] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2022-05-17 07:22:22] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 07:22:22] [INFO ] [Nat]Added 205 Read/Feed constraints in 39 ms returned sat
[2022-05-17 07:22:23] [INFO ] Deduced a trap composed of 29 places in 143 ms of which 0 ms to minimize.
[2022-05-17 07:22:23] [INFO ] Deduced a trap composed of 41 places in 143 ms of which 0 ms to minimize.
[2022-05-17 07:22:23] [INFO ] Deduced a trap composed of 53 places in 141 ms of which 1 ms to minimize.
[2022-05-17 07:22:23] [INFO ] Deduced a trap composed of 114 places in 161 ms of which 1 ms to minimize.
[2022-05-17 07:22:23] [INFO ] Deduced a trap composed of 47 places in 144 ms of which 0 ms to minimize.
[2022-05-17 07:22:23] [INFO ] Deduced a trap composed of 58 places in 144 ms of which 1 ms to minimize.
[2022-05-17 07:22:24] [INFO ] Deduced a trap composed of 74 places in 131 ms of which 0 ms to minimize.
[2022-05-17 07:22:24] [INFO ] Deduced a trap composed of 104 places in 136 ms of which 0 ms to minimize.
[2022-05-17 07:22:24] [INFO ] Deduced a trap composed of 69 places in 137 ms of which 2 ms to minimize.
[2022-05-17 07:22:24] [INFO ] Deduced a trap composed of 67 places in 134 ms of which 0 ms to minimize.
[2022-05-17 07:22:24] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 0 ms to minimize.
[2022-05-17 07:22:24] [INFO ] Deduced a trap composed of 85 places in 137 ms of which 0 ms to minimize.
[2022-05-17 07:22:25] [INFO ] Deduced a trap composed of 110 places in 160 ms of which 0 ms to minimize.
[2022-05-17 07:22:25] [INFO ] Deduced a trap composed of 76 places in 136 ms of which 0 ms to minimize.
[2022-05-17 07:22:25] [INFO ] Deduced a trap composed of 52 places in 134 ms of which 0 ms to minimize.
[2022-05-17 07:22:25] [INFO ] Deduced a trap composed of 57 places in 135 ms of which 0 ms to minimize.
[2022-05-17 07:22:25] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 0 ms to minimize.
[2022-05-17 07:22:25] [INFO ] Deduced a trap composed of 76 places in 115 ms of which 0 ms to minimize.
[2022-05-17 07:22:25] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 3059 ms
[2022-05-17 07:22:25] [INFO ] Computed and/alt/rep : 702/1758/702 causal constraints (skipped 60 transitions) in 46 ms.
[2022-05-17 07:22:27] [INFO ] Deduced a trap composed of 124 places in 157 ms of which 2 ms to minimize.
[2022-05-17 07:22:27] [INFO ] Deduced a trap composed of 104 places in 149 ms of which 2 ms to minimize.
[2022-05-17 07:22:27] [INFO ] Deduced a trap composed of 39 places in 145 ms of which 3 ms to minimize.
[2022-05-17 07:22:28] [INFO ] Deduced a trap composed of 39 places in 146 ms of which 1 ms to minimize.
[2022-05-17 07:22:28] [INFO ] Deduced a trap composed of 28 places in 145 ms of which 1 ms to minimize.
[2022-05-17 07:22:28] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 0 ms to minimize.
[2022-05-17 07:22:28] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 1 ms to minimize.
[2022-05-17 07:22:28] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 1 ms to minimize.
[2022-05-17 07:22:29] [INFO ] Deduced a trap composed of 21 places in 144 ms of which 1 ms to minimize.
[2022-05-17 07:22:29] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 0 ms to minimize.
[2022-05-17 07:22:29] [INFO ] Deduced a trap composed of 49 places in 128 ms of which 0 ms to minimize.
[2022-05-17 07:22:29] [INFO ] Deduced a trap composed of 61 places in 118 ms of which 1 ms to minimize.
[2022-05-17 07:22:29] [INFO ] Deduced a trap composed of 52 places in 115 ms of which 0 ms to minimize.
[2022-05-17 07:22:29] [INFO ] Deduced a trap composed of 41 places in 112 ms of which 0 ms to minimize.
[2022-05-17 07:22:30] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 0 ms to minimize.
[2022-05-17 07:22:30] [INFO ] Deduced a trap composed of 87 places in 124 ms of which 1 ms to minimize.
[2022-05-17 07:22:30] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 0 ms to minimize.
[2022-05-17 07:22:30] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 0 ms to minimize.
[2022-05-17 07:22:30] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 1 ms to minimize.
[2022-05-17 07:22:30] [INFO ] Deduced a trap composed of 35 places in 143 ms of which 0 ms to minimize.
[2022-05-17 07:22:31] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 1 ms to minimize.
[2022-05-17 07:22:31] [INFO ] Deduced a trap composed of 93 places in 119 ms of which 0 ms to minimize.
[2022-05-17 07:22:31] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 1 ms to minimize.
[2022-05-17 07:22:31] [INFO ] Deduced a trap composed of 49 places in 120 ms of which 1 ms to minimize.
[2022-05-17 07:22:31] [INFO ] Deduced a trap composed of 85 places in 120 ms of which 0 ms to minimize.
[2022-05-17 07:22:31] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 4447 ms
[2022-05-17 07:22:31] [INFO ] Added : 160 causal constraints over 33 iterations in 6071 ms. Result :sat
Minimization took 172 ms.
[2022-05-17 07:22:32] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2022-05-17 07:22:32] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2022-05-17 07:22:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:22:32] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2022-05-17 07:22:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:22:32] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2022-05-17 07:22:32] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-17 07:22:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:22:32] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2022-05-17 07:22:32] [INFO ] [Nat]Added 205 Read/Feed constraints in 37 ms returned sat
[2022-05-17 07:22:32] [INFO ] Deduced a trap composed of 29 places in 137 ms of which 0 ms to minimize.
[2022-05-17 07:22:33] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 0 ms to minimize.
[2022-05-17 07:22:33] [INFO ] Deduced a trap composed of 53 places in 143 ms of which 0 ms to minimize.
[2022-05-17 07:22:33] [INFO ] Deduced a trap composed of 114 places in 145 ms of which 1 ms to minimize.
[2022-05-17 07:22:33] [INFO ] Deduced a trap composed of 47 places in 137 ms of which 0 ms to minimize.
[2022-05-17 07:22:33] [INFO ] Deduced a trap composed of 58 places in 150 ms of which 0 ms to minimize.
[2022-05-17 07:22:33] [INFO ] Deduced a trap composed of 74 places in 135 ms of which 0 ms to minimize.
[2022-05-17 07:22:34] [INFO ] Deduced a trap composed of 104 places in 131 ms of which 0 ms to minimize.
[2022-05-17 07:22:34] [INFO ] Deduced a trap composed of 69 places in 135 ms of which 1 ms to minimize.
[2022-05-17 07:22:34] [INFO ] Deduced a trap composed of 67 places in 129 ms of which 1 ms to minimize.
[2022-05-17 07:22:34] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 0 ms to minimize.
[2022-05-17 07:22:34] [INFO ] Deduced a trap composed of 85 places in 136 ms of which 1 ms to minimize.
[2022-05-17 07:22:34] [INFO ] Deduced a trap composed of 110 places in 133 ms of which 0 ms to minimize.
[2022-05-17 07:22:35] [INFO ] Deduced a trap composed of 76 places in 136 ms of which 1 ms to minimize.
[2022-05-17 07:22:35] [INFO ] Deduced a trap composed of 52 places in 132 ms of which 0 ms to minimize.
[2022-05-17 07:22:35] [INFO ] Deduced a trap composed of 57 places in 129 ms of which 0 ms to minimize.
[2022-05-17 07:22:35] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 0 ms to minimize.
[2022-05-17 07:22:35] [INFO ] Deduced a trap composed of 76 places in 117 ms of which 1 ms to minimize.
[2022-05-17 07:22:35] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2981 ms
[2022-05-17 07:22:35] [INFO ] Computed and/alt/rep : 702/1758/702 causal constraints (skipped 60 transitions) in 34 ms.
[2022-05-17 07:22:37] [INFO ] Deduced a trap composed of 124 places in 147 ms of which 1 ms to minimize.
[2022-05-17 07:22:37] [INFO ] Deduced a trap composed of 104 places in 152 ms of which 1 ms to minimize.
[2022-05-17 07:22:37] [INFO ] Deduced a trap composed of 39 places in 142 ms of which 1 ms to minimize.
[2022-05-17 07:22:37] [INFO ] Deduced a trap composed of 39 places in 146 ms of which 0 ms to minimize.
[2022-05-17 07:22:37] [INFO ] Deduced a trap composed of 28 places in 152 ms of which 0 ms to minimize.
[2022-05-17 07:22:38] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 0 ms to minimize.
[2022-05-17 07:22:38] [INFO ] Deduced a trap composed of 27 places in 150 ms of which 0 ms to minimize.
[2022-05-17 07:22:38] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 0 ms to minimize.
[2022-05-17 07:22:38] [INFO ] Deduced a trap composed of 21 places in 153 ms of which 0 ms to minimize.
[2022-05-17 07:22:38] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 1 ms to minimize.
[2022-05-17 07:22:39] [INFO ] Deduced a trap composed of 49 places in 120 ms of which 0 ms to minimize.
[2022-05-17 07:22:39] [INFO ] Deduced a trap composed of 61 places in 117 ms of which 0 ms to minimize.
[2022-05-17 07:22:39] [INFO ] Deduced a trap composed of 52 places in 116 ms of which 1 ms to minimize.
[2022-05-17 07:22:39] [INFO ] Deduced a trap composed of 41 places in 113 ms of which 0 ms to minimize.
[2022-05-17 07:22:39] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 1 ms to minimize.
[2022-05-17 07:22:39] [INFO ] Deduced a trap composed of 87 places in 116 ms of which 0 ms to minimize.
[2022-05-17 07:22:40] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 1 ms to minimize.
[2022-05-17 07:22:40] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 0 ms to minimize.
[2022-05-17 07:22:40] [INFO ] Deduced a trap composed of 30 places in 135 ms of which 1 ms to minimize.
[2022-05-17 07:22:40] [INFO ] Deduced a trap composed of 35 places in 138 ms of which 0 ms to minimize.
[2022-05-17 07:22:40] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 0 ms to minimize.
[2022-05-17 07:22:40] [INFO ] Deduced a trap composed of 93 places in 120 ms of which 1 ms to minimize.
[2022-05-17 07:22:41] [INFO ] Deduced a trap composed of 36 places in 118 ms of which 1 ms to minimize.
[2022-05-17 07:22:41] [INFO ] Deduced a trap composed of 49 places in 116 ms of which 0 ms to minimize.
[2022-05-17 07:22:41] [INFO ] Deduced a trap composed of 85 places in 122 ms of which 0 ms to minimize.
[2022-05-17 07:22:41] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 4478 ms
[2022-05-17 07:22:41] [INFO ] Added : 160 causal constraints over 33 iterations in 6018 ms. Result :sat
Minimization took 175 ms.
[2022-05-17 07:22:41] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2022-05-17 07:22:41] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-17 07:22:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:22:42] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2022-05-17 07:22:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:22:42] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2022-05-17 07:22:42] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-17 07:22:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:22:42] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2022-05-17 07:22:42] [INFO ] [Nat]Added 205 Read/Feed constraints in 34 ms returned sat
[2022-05-17 07:22:42] [INFO ] Deduced a trap composed of 29 places in 158 ms of which 0 ms to minimize.
[2022-05-17 07:22:42] [INFO ] Deduced a trap composed of 41 places in 148 ms of which 0 ms to minimize.
[2022-05-17 07:22:42] [INFO ] Deduced a trap composed of 53 places in 144 ms of which 0 ms to minimize.
[2022-05-17 07:22:43] [INFO ] Deduced a trap composed of 114 places in 141 ms of which 0 ms to minimize.
[2022-05-17 07:22:43] [INFO ] Deduced a trap composed of 47 places in 145 ms of which 0 ms to minimize.
[2022-05-17 07:22:43] [INFO ] Deduced a trap composed of 58 places in 146 ms of which 1 ms to minimize.
[2022-05-17 07:22:43] [INFO ] Deduced a trap composed of 74 places in 133 ms of which 0 ms to minimize.
[2022-05-17 07:22:43] [INFO ] Deduced a trap composed of 104 places in 134 ms of which 0 ms to minimize.
[2022-05-17 07:22:43] [INFO ] Deduced a trap composed of 69 places in 130 ms of which 0 ms to minimize.
[2022-05-17 07:22:44] [INFO ] Deduced a trap composed of 67 places in 131 ms of which 0 ms to minimize.
[2022-05-17 07:22:44] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 1 ms to minimize.
[2022-05-17 07:22:44] [INFO ] Deduced a trap composed of 85 places in 138 ms of which 0 ms to minimize.
[2022-05-17 07:22:44] [INFO ] Deduced a trap composed of 110 places in 131 ms of which 0 ms to minimize.
[2022-05-17 07:22:44] [INFO ] Deduced a trap composed of 76 places in 138 ms of which 1 ms to minimize.
[2022-05-17 07:22:44] [INFO ] Deduced a trap composed of 52 places in 138 ms of which 0 ms to minimize.
[2022-05-17 07:22:45] [INFO ] Deduced a trap composed of 57 places in 133 ms of which 1 ms to minimize.
[2022-05-17 07:22:45] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 0 ms to minimize.
[2022-05-17 07:22:45] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 1 ms to minimize.
[2022-05-17 07:22:45] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 3013 ms
[2022-05-17 07:22:45] [INFO ] Computed and/alt/rep : 702/1758/702 causal constraints (skipped 60 transitions) in 33 ms.
[2022-05-17 07:22:46] [INFO ] Deduced a trap composed of 124 places in 144 ms of which 1 ms to minimize.
[2022-05-17 07:22:47] [INFO ] Deduced a trap composed of 104 places in 139 ms of which 0 ms to minimize.
[2022-05-17 07:22:47] [INFO ] Deduced a trap composed of 39 places in 141 ms of which 1 ms to minimize.
[2022-05-17 07:22:47] [INFO ] Deduced a trap composed of 39 places in 139 ms of which 0 ms to minimize.
[2022-05-17 07:22:47] [INFO ] Deduced a trap composed of 28 places in 148 ms of which 0 ms to minimize.
[2022-05-17 07:22:47] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 1 ms to minimize.
[2022-05-17 07:22:48] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 0 ms to minimize.
[2022-05-17 07:22:48] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 1 ms to minimize.
[2022-05-17 07:22:48] [INFO ] Deduced a trap composed of 21 places in 142 ms of which 1 ms to minimize.
[2022-05-17 07:22:48] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 0 ms to minimize.
[2022-05-17 07:22:48] [INFO ] Deduced a trap composed of 49 places in 118 ms of which 1 ms to minimize.
[2022-05-17 07:22:48] [INFO ] Deduced a trap composed of 61 places in 120 ms of which 1 ms to minimize.
[2022-05-17 07:22:49] [INFO ] Deduced a trap composed of 52 places in 129 ms of which 0 ms to minimize.
[2022-05-17 07:22:49] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 0 ms to minimize.
[2022-05-17 07:22:49] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 0 ms to minimize.
[2022-05-17 07:22:49] [INFO ] Deduced a trap composed of 87 places in 115 ms of which 0 ms to minimize.
[2022-05-17 07:22:49] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 0 ms to minimize.
[2022-05-17 07:22:49] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 0 ms to minimize.
[2022-05-17 07:22:50] [INFO ] Deduced a trap composed of 30 places in 135 ms of which 1 ms to minimize.
[2022-05-17 07:22:50] [INFO ] Deduced a trap composed of 35 places in 137 ms of which 0 ms to minimize.
[2022-05-17 07:22:50] [INFO ] Deduced a trap composed of 32 places in 138 ms of which 0 ms to minimize.
[2022-05-17 07:22:50] [INFO ] Deduced a trap composed of 93 places in 124 ms of which 1 ms to minimize.
[2022-05-17 07:22:50] [INFO ] Deduced a trap composed of 36 places in 119 ms of which 1 ms to minimize.
[2022-05-17 07:22:50] [INFO ] Deduced a trap composed of 49 places in 117 ms of which 0 ms to minimize.
[2022-05-17 07:22:51] [INFO ] Deduced a trap composed of 85 places in 116 ms of which 1 ms to minimize.
[2022-05-17 07:22:51] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 4357 ms
[2022-05-17 07:22:51] [INFO ] Added : 160 causal constraints over 33 iterations in 5885 ms. Result :sat
Minimization took 167 ms.
[2022-05-17 07:22:51] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2022-05-17 07:22:51] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2022-05-17 07:22:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:22:51] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2022-05-17 07:22:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:22:51] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2022-05-17 07:22:51] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-17 07:22:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:22:51] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2022-05-17 07:22:51] [INFO ] [Nat]Added 205 Read/Feed constraints in 42 ms returned sat
[2022-05-17 07:22:52] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 0 ms to minimize.
[2022-05-17 07:22:52] [INFO ] Deduced a trap composed of 58 places in 117 ms of which 0 ms to minimize.
[2022-05-17 07:22:52] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 0 ms to minimize.
[2022-05-17 07:22:52] [INFO ] Deduced a trap composed of 60 places in 120 ms of which 0 ms to minimize.
[2022-05-17 07:22:52] [INFO ] Deduced a trap composed of 53 places in 119 ms of which 1 ms to minimize.
[2022-05-17 07:22:52] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 0 ms to minimize.
[2022-05-17 07:22:53] [INFO ] Deduced a trap composed of 45 places in 118 ms of which 0 ms to minimize.
[2022-05-17 07:22:53] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 0 ms to minimize.
[2022-05-17 07:22:53] [INFO ] Deduced a trap composed of 60 places in 121 ms of which 1 ms to minimize.
[2022-05-17 07:22:53] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 1 ms to minimize.
[2022-05-17 07:22:53] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 1 ms to minimize.
[2022-05-17 07:22:53] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 0 ms to minimize.
[2022-05-17 07:22:53] [INFO ] Deduced a trap composed of 53 places in 113 ms of which 1 ms to minimize.
[2022-05-17 07:22:54] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 0 ms to minimize.
[2022-05-17 07:22:54] [INFO ] Deduced a trap composed of 57 places in 115 ms of which 0 ms to minimize.
[2022-05-17 07:22:54] [INFO ] Deduced a trap composed of 43 places in 119 ms of which 0 ms to minimize.
[2022-05-17 07:22:54] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 0 ms to minimize.
[2022-05-17 07:22:54] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 1 ms to minimize.
[2022-05-17 07:22:54] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 0 ms to minimize.
[2022-05-17 07:22:54] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 0 ms to minimize.
[2022-05-17 07:22:55] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 1 ms to minimize.
[2022-05-17 07:22:55] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 1 ms to minimize.
[2022-05-17 07:22:55] [INFO ] Deduced a trap composed of 69 places in 111 ms of which 0 ms to minimize.
[2022-05-17 07:22:55] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 0 ms to minimize.
[2022-05-17 07:22:55] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 0 ms to minimize.
[2022-05-17 07:22:55] [INFO ] Deduced a trap composed of 51 places in 116 ms of which 0 ms to minimize.
[2022-05-17 07:22:55] [INFO ] Deduced a trap composed of 55 places in 117 ms of which 0 ms to minimize.
[2022-05-17 07:22:56] [INFO ] Deduced a trap composed of 52 places in 113 ms of which 1 ms to minimize.
[2022-05-17 07:22:56] [INFO ] Deduced a trap composed of 28 places in 110 ms of which 1 ms to minimize.
[2022-05-17 07:22:56] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 0 ms to minimize.
[2022-05-17 07:22:56] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 0 ms to minimize.
[2022-05-17 07:22:56] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 0 ms to minimize.
[2022-05-17 07:22:56] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 0 ms to minimize.
[2022-05-17 07:22:57] [INFO ] Deduced a trap composed of 71 places in 119 ms of which 1 ms to minimize.
[2022-05-17 07:22:57] [INFO ] Deduced a trap composed of 69 places in 118 ms of which 0 ms to minimize.
[2022-05-17 07:22:57] [INFO ] Deduced a trap composed of 86 places in 124 ms of which 0 ms to minimize.
[2022-05-17 07:22:57] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 1 ms to minimize.
[2022-05-17 07:22:57] [INFO ] Deduced a trap composed of 72 places in 116 ms of which 0 ms to minimize.
[2022-05-17 07:22:57] [INFO ] Deduced a trap composed of 65 places in 133 ms of which 0 ms to minimize.
[2022-05-17 07:22:57] [INFO ] Deduced a trap composed of 43 places in 116 ms of which 1 ms to minimize.
[2022-05-17 07:22:59] [INFO ] Deduced a trap composed of 143 places in 117 ms of which 0 ms to minimize.
[2022-05-17 07:22:59] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 0 ms to minimize.
[2022-05-17 07:22:59] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 1 ms to minimize.
[2022-05-17 07:22:59] [INFO ] Deduced a trap composed of 67 places in 120 ms of which 1 ms to minimize.
[2022-05-17 07:22:59] [INFO ] Deduced a trap composed of 89 places in 125 ms of which 0 ms to minimize.
[2022-05-17 07:23:00] [INFO ] Deduced a trap composed of 120 places in 124 ms of which 0 ms to minimize.
[2022-05-17 07:23:00] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 0 ms to minimize.
[2022-05-17 07:23:00] [INFO ] Deduced a trap composed of 123 places in 121 ms of which 0 ms to minimize.
[2022-05-17 07:23:00] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 1 ms to minimize.
[2022-05-17 07:23:00] [INFO ] Deduced a trap composed of 66 places in 119 ms of which 0 ms to minimize.
[2022-05-17 07:23:00] [INFO ] Deduced a trap composed of 55 places in 126 ms of which 0 ms to minimize.
[2022-05-17 07:23:01] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 0 ms to minimize.
[2022-05-17 07:23:01] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 1 ms to minimize.
[2022-05-17 07:23:01] [INFO ] Deduced a trap composed of 55 places in 118 ms of which 0 ms to minimize.
[2022-05-17 07:23:01] [INFO ] Deduced a trap composed of 64 places in 117 ms of which 0 ms to minimize.
[2022-05-17 07:23:01] [INFO ] Deduced a trap composed of 48 places in 117 ms of which 1 ms to minimize.
[2022-05-17 07:23:02] [INFO ] Deduced a trap composed of 75 places in 112 ms of which 0 ms to minimize.
[2022-05-17 07:23:02] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 1 ms to minimize.
[2022-05-17 07:23:02] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 0 ms to minimize.
[2022-05-17 07:23:02] [INFO ] Deduced a trap composed of 61 places in 115 ms of which 0 ms to minimize.
[2022-05-17 07:23:04] [INFO ] Deduced a trap composed of 105 places in 118 ms of which 0 ms to minimize.
[2022-05-17 07:23:04] [INFO ] Deduced a trap composed of 102 places in 116 ms of which 0 ms to minimize.
[2022-05-17 07:23:04] [INFO ] Deduced a trap composed of 172 places in 122 ms of which 0 ms to minimize.
[2022-05-17 07:23:04] [INFO ] Deduced a trap composed of 109 places in 120 ms of which 1 ms to minimize.
[2022-05-17 07:23:05] [INFO ] Deduced a trap composed of 82 places in 113 ms of which 0 ms to minimize.
[2022-05-17 07:23:05] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 1 ms to minimize.
[2022-05-17 07:23:05] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 0 ms to minimize.
[2022-05-17 07:23:05] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 0 ms to minimize.
[2022-05-17 07:23:05] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 1 ms to minimize.
[2022-05-17 07:23:05] [INFO ] Deduced a trap composed of 83 places in 109 ms of which 0 ms to minimize.
[2022-05-17 07:23:06] [INFO ] Deduced a trap composed of 64 places in 111 ms of which 0 ms to minimize.
[2022-05-17 07:23:06] [INFO ] Deduced a trap composed of 59 places in 109 ms of which 1 ms to minimize.
[2022-05-17 07:23:06] [INFO ] Deduced a trap composed of 45 places in 111 ms of which 0 ms to minimize.
[2022-05-17 07:23:06] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 0 ms to minimize.
[2022-05-17 07:23:06] [INFO ] Deduced a trap composed of 75 places in 117 ms of which 0 ms to minimize.
[2022-05-17 07:23:06] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 0 ms to minimize.
[2022-05-17 07:23:07] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 1 ms to minimize.
[2022-05-17 07:23:07] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 1 ms to minimize.
[2022-05-17 07:23:07] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 1 ms to minimize.
[2022-05-17 07:23:07] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 2 ms to minimize.
[2022-05-17 07:23:07] [INFO ] Deduced a trap composed of 73 places in 119 ms of which 1 ms to minimize.
[2022-05-17 07:23:07] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 0 ms to minimize.
[2022-05-17 07:23:07] [INFO ] Deduced a trap composed of 38 places in 121 ms of which 0 ms to minimize.
[2022-05-17 07:23:08] [INFO ] Deduced a trap composed of 34 places in 119 ms of which 1 ms to minimize.
[2022-05-17 07:23:08] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 0 ms to minimize.
[2022-05-17 07:23:08] [INFO ] Deduced a trap composed of 76 places in 115 ms of which 0 ms to minimize.
[2022-05-17 07:23:08] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 1 ms to minimize.
[2022-05-17 07:23:08] [INFO ] Deduced a trap composed of 47 places in 113 ms of which 0 ms to minimize.
[2022-05-17 07:23:09] [INFO ] Deduced a trap composed of 41 places in 114 ms of which 0 ms to minimize.
[2022-05-17 07:23:09] [INFO ] Deduced a trap composed of 44 places in 119 ms of which 0 ms to minimize.
[2022-05-17 07:23:09] [INFO ] Deduced a trap composed of 47 places in 118 ms of which 0 ms to minimize.
[2022-05-17 07:23:09] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 1 ms to minimize.
[2022-05-17 07:23:11] [INFO ] Deduced a trap composed of 106 places in 117 ms of which 0 ms to minimize.
[2022-05-17 07:23:11] [INFO ] Deduced a trap composed of 59 places in 118 ms of which 1 ms to minimize.
[2022-05-17 07:23:11] [INFO ] Deduced a trap composed of 69 places in 118 ms of which 0 ms to minimize.
[2022-05-17 07:23:11] [INFO ] Deduced a trap composed of 46 places in 124 ms of which 1 ms to minimize.
[2022-05-17 07:23:12] [INFO ] Deduced a trap composed of 121 places in 125 ms of which 0 ms to minimize.
[2022-05-17 07:23:12] [INFO ] Deduced a trap composed of 56 places in 125 ms of which 0 ms to minimize.
[2022-05-17 07:23:12] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 1 ms to minimize.
[2022-05-17 07:23:12] [INFO ] Deduced a trap composed of 46 places in 127 ms of which 1 ms to minimize.
[2022-05-17 07:23:12] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 0 ms to minimize.
[2022-05-17 07:23:13] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 0 ms to minimize.
[2022-05-17 07:23:13] [INFO ] Deduced a trap composed of 46 places in 121 ms of which 0 ms to minimize.
[2022-05-17 07:23:13] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 0 ms to minimize.
[2022-05-17 07:23:13] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 0 ms to minimize.
[2022-05-17 07:23:13] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 1 ms to minimize.
[2022-05-17 07:23:13] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 1 ms to minimize.
[2022-05-17 07:23:14] [INFO ] Deduced a trap composed of 78 places in 121 ms of which 0 ms to minimize.
[2022-05-17 07:23:14] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 0 ms to minimize.
[2022-05-17 07:23:14] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 0 ms to minimize.
[2022-05-17 07:23:15] [INFO ] Deduced a trap composed of 36 places in 118 ms of which 0 ms to minimize.
[2022-05-17 07:23:15] [INFO ] Deduced a trap composed of 46 places in 116 ms of which 1 ms to minimize.
[2022-05-17 07:23:15] [INFO ] Deduced a trap composed of 65 places in 112 ms of which 1 ms to minimize.
[2022-05-17 07:23:15] [INFO ] Deduced a trap composed of 63 places in 113 ms of which 0 ms to minimize.
[2022-05-17 07:23:16] [INFO ] Deduced a trap composed of 70 places in 117 ms of which 0 ms to minimize.
[2022-05-17 07:23:16] [INFO ] Deduced a trap composed of 65 places in 113 ms of which 0 ms to minimize.
[2022-05-17 07:23:16] [INFO ] Deduced a trap composed of 60 places in 118 ms of which 0 ms to minimize.
[2022-05-17 07:23:16] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 1 ms to minimize.
[2022-05-17 07:23:17] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 0 ms to minimize.
[2022-05-17 07:23:17] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 1 ms to minimize.
[2022-05-17 07:23:17] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 0 ms to minimize.
[2022-05-17 07:23:17] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 1 ms to minimize.
[2022-05-17 07:23:17] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 1 ms to minimize.
[2022-05-17 07:23:17] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 1 ms to minimize.
[2022-05-17 07:23:18] [INFO ] Deduced a trap composed of 72 places in 113 ms of which 0 ms to minimize.
[2022-05-17 07:23:18] [INFO ] Deduced a trap composed of 53 places in 113 ms of which 1 ms to minimize.
[2022-05-17 07:23:19] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 1 ms to minimize.
[2022-05-17 07:23:19] [INFO ] Deduced a trap composed of 49 places in 129 ms of which 1 ms to minimize.
[2022-05-17 07:23:19] [INFO ] Deduced a trap composed of 61 places in 118 ms of which 0 ms to minimize.
[2022-05-17 07:23:19] [INFO ] Deduced a trap composed of 77 places in 115 ms of which 1 ms to minimize.
[2022-05-17 07:23:19] [INFO ] Deduced a trap composed of 61 places in 119 ms of which 0 ms to minimize.
[2022-05-17 07:23:19] [INFO ] Deduced a trap composed of 130 places in 115 ms of which 0 ms to minimize.
[2022-05-17 07:23:19] [INFO ] Deduced a trap composed of 61 places in 115 ms of which 0 ms to minimize.
[2022-05-17 07:23:20] [INFO ] Deduced a trap composed of 66 places in 117 ms of which 1 ms to minimize.
[2022-05-17 07:23:20] [INFO ] Deduced a trap composed of 77 places in 118 ms of which 0 ms to minimize.
[2022-05-17 07:23:20] [INFO ] Deduced a trap composed of 45 places in 120 ms of which 0 ms to minimize.
[2022-05-17 07:23:20] [INFO ] Deduced a trap composed of 59 places in 107 ms of which 0 ms to minimize.
[2022-05-17 07:23:20] [INFO ] Deduced a trap composed of 79 places in 107 ms of which 0 ms to minimize.
[2022-05-17 07:23:21] [INFO ] Deduced a trap composed of 43 places in 112 ms of which 0 ms to minimize.
[2022-05-17 07:23:21] [INFO ] Deduced a trap composed of 47 places in 105 ms of which 1 ms to minimize.
[2022-05-17 07:23:21] [INFO ] Deduced a trap composed of 48 places in 104 ms of which 0 ms to minimize.
[2022-05-17 07:23:21] [INFO ] Deduced a trap composed of 81 places in 108 ms of which 1 ms to minimize.
[2022-05-17 07:23:21] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 0 ms to minimize.
[2022-05-17 07:23:22] [INFO ] Deduced a trap composed of 51 places in 105 ms of which 0 ms to minimize.
[2022-05-17 07:23:22] [INFO ] Deduced a trap composed of 57 places in 106 ms of which 0 ms to minimize.
[2022-05-17 07:23:22] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 1 ms to minimize.
[2022-05-17 07:23:22] [INFO ] Deduced a trap composed of 65 places in 112 ms of which 0 ms to minimize.
[2022-05-17 07:23:23] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 1 ms to minimize.
[2022-05-17 07:23:24] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 0 ms to minimize.
[2022-05-17 07:23:24] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 1 ms to minimize.
[2022-05-17 07:23:24] [INFO ] Deduced a trap composed of 47 places in 115 ms of which 0 ms to minimize.
[2022-05-17 07:23:25] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 0 ms to minimize.
[2022-05-17 07:23:26] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 0 ms to minimize.
[2022-05-17 07:23:26] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 1 ms to minimize.
[2022-05-17 07:23:27] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 0 ms to minimize.
[2022-05-17 07:23:27] [INFO ] Deduced a trap composed of 53 places in 103 ms of which 0 ms to minimize.
[2022-05-17 07:23:27] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 0 ms to minimize.
[2022-05-17 07:23:27] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 0 ms to minimize.
[2022-05-17 07:23:28] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 0 ms to minimize.
[2022-05-17 07:23:29] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 1 ms to minimize.
[2022-05-17 07:23:32] [INFO ] Trap strengthening (SAT) tested/added 160/160 trap constraints in 40619 ms
Current structural bounds on expressions (after SMT) : [6, 6, 6, 6] Max seen :[5, 5, 5, 1]
FORMULA Peterson-COL-5-UpperBounds-09 6 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-COL-5-UpperBounds-07 6 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-COL-5-UpperBounds-05 6 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 6 out of 480 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 480/480 places, 888/888 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 480 transition count 833
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 110 place count 425 transition count 833
Performed 125 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 125 Pre rules applied. Total rules applied 110 place count 425 transition count 708
Deduced a syphon composed of 125 places in 1 ms
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 2 with 250 rules applied. Total rules applied 360 place count 300 transition count 708
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 420 place count 270 transition count 678
Applied a total of 420 rules in 52 ms. Remains 270 /480 variables (removed 210) and now considering 678/888 (removed 210) transitions.
Finished structural reductions, in 1 iterations. Remains : 270/480 places, 678/888 transitions.
Normalized transition count is 558 out of 678 initially.
// Phase 1: matrix 558 rows 270 cols
[2022-05-17 07:23:33] [INFO ] Computed 23 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1460 ms. (steps per millisecond=684 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 490 ms. (steps per millisecond=2040 ) properties (out of 1) seen :1
[2022-05-17 07:23:34] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
// Phase 1: matrix 558 rows 270 cols
[2022-05-17 07:23:34] [INFO ] Computed 23 place invariants in 9 ms
[2022-05-17 07:23:35] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2022-05-17 07:23:35] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-17 07:23:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:23:35] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2022-05-17 07:23:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:23:35] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2022-05-17 07:23:35] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-17 07:23:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:23:35] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2022-05-17 07:23:35] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 07:23:35] [INFO ] [Nat]Added 205 Read/Feed constraints in 22 ms returned sat
[2022-05-17 07:23:35] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 0 ms to minimize.
[2022-05-17 07:23:35] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 0 ms to minimize.
[2022-05-17 07:23:35] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 0 ms to minimize.
[2022-05-17 07:23:35] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 0 ms to minimize.
[2022-05-17 07:23:35] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 0 ms to minimize.
[2022-05-17 07:23:35] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 0 ms to minimize.
[2022-05-17 07:23:36] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 0 ms to minimize.
[2022-05-17 07:23:36] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 0 ms to minimize.
[2022-05-17 07:23:36] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2022-05-17 07:23:36] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 0 ms to minimize.
[2022-05-17 07:23:36] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 1 ms to minimize.
[2022-05-17 07:23:36] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 0 ms to minimize.
[2022-05-17 07:23:36] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 1 ms to minimize.
[2022-05-17 07:23:36] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 0 ms to minimize.
[2022-05-17 07:23:36] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 0 ms to minimize.
[2022-05-17 07:23:36] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 1 ms to minimize.
[2022-05-17 07:23:36] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2022-05-17 07:23:37] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2022-05-17 07:23:37] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 0 ms to minimize.
[2022-05-17 07:23:37] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2022-05-17 07:23:37] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 0 ms to minimize.
[2022-05-17 07:23:37] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 0 ms to minimize.
[2022-05-17 07:23:37] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 0 ms to minimize.
[2022-05-17 07:23:37] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2022-05-17 07:23:38] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 0 ms to minimize.
[2022-05-17 07:23:38] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 4 ms to minimize.
[2022-05-17 07:23:38] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 0 ms to minimize.
[2022-05-17 07:23:38] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 0 ms to minimize.
[2022-05-17 07:23:38] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 0 ms to minimize.
[2022-05-17 07:23:38] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 0 ms to minimize.
[2022-05-17 07:23:38] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 0 ms to minimize.
[2022-05-17 07:23:38] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2022-05-17 07:23:38] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 0 ms to minimize.
[2022-05-17 07:23:38] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 0 ms to minimize.
[2022-05-17 07:23:39] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 0 ms to minimize.
[2022-05-17 07:23:39] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 1 ms to minimize.
[2022-05-17 07:23:39] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2022-05-17 07:23:39] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 0 ms to minimize.
[2022-05-17 07:23:39] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 0 ms to minimize.
[2022-05-17 07:23:39] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 0 ms to minimize.
[2022-05-17 07:23:39] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 1 ms to minimize.
[2022-05-17 07:23:39] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 0 ms to minimize.
[2022-05-17 07:23:40] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2022-05-17 07:23:40] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 0 ms to minimize.
[2022-05-17 07:23:40] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 1 ms to minimize.
[2022-05-17 07:23:40] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 0 ms to minimize.
[2022-05-17 07:23:41] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 1 ms to minimize.
[2022-05-17 07:23:41] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 0 ms to minimize.
[2022-05-17 07:23:41] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2022-05-17 07:23:41] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2022-05-17 07:23:41] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 0 ms to minimize.
[2022-05-17 07:23:41] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 0 ms to minimize.
[2022-05-17 07:23:42] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2022-05-17 07:23:45] [INFO ] Trap strengthening (SAT) tested/added 53/53 trap constraints in 9735 ms
Current structural bounds on expressions (after SMT) : [6] Max seen :[1]
Support contains 6 out of 270 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 270/270 places, 678/678 transitions.
Applied a total of 0 rules in 17 ms. Remains 270 /270 variables (removed 0) and now considering 678/678 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 270/270 places, 678/678 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 270/270 places, 678/678 transitions.
Applied a total of 0 rules in 12 ms. Remains 270 /270 variables (removed 0) and now considering 678/678 (removed 0) transitions.
[2022-05-17 07:23:45] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
// Phase 1: matrix 558 rows 270 cols
[2022-05-17 07:23:45] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-17 07:23:45] [INFO ] Implicit Places using invariants in 147 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 157 ms to find 6 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 264/270 places, 678/678 transitions.
Applied a total of 0 rules in 13 ms. Remains 264 /264 variables (removed 0) and now considering 678/678 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 264/270 places, 678/678 transitions.
Normalized transition count is 558 out of 678 initially.
// Phase 1: matrix 558 rows 264 cols
[2022-05-17 07:23:45] [INFO ] Computed 17 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1445 ms. (steps per millisecond=692 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 484 ms. (steps per millisecond=2066 ) properties (out of 1) seen :1
[2022-05-17 07:23:47] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
// Phase 1: matrix 558 rows 264 cols
[2022-05-17 07:23:47] [INFO ] Computed 17 place invariants in 5 ms
[2022-05-17 07:23:47] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 07:23:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:23:47] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2022-05-17 07:23:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:23:47] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2022-05-17 07:23:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:23:47] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2022-05-17 07:23:47] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 07:23:47] [INFO ] [Nat]Added 205 Read/Feed constraints in 20 ms returned sat
[2022-05-17 07:23:47] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2022-05-17 07:23:47] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 0 ms to minimize.
[2022-05-17 07:23:47] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 0 ms to minimize.
[2022-05-17 07:23:47] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2022-05-17 07:23:48] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 0 ms to minimize.
[2022-05-17 07:23:48] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 0 ms to minimize.
[2022-05-17 07:23:48] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 1 ms to minimize.
[2022-05-17 07:23:48] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
[2022-05-17 07:23:48] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 0 ms to minimize.
[2022-05-17 07:23:48] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 0 ms to minimize.
[2022-05-17 07:23:48] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 0 ms to minimize.
[2022-05-17 07:23:48] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 0 ms to minimize.
[2022-05-17 07:23:48] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 0 ms to minimize.
[2022-05-17 07:23:48] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 0 ms to minimize.
[2022-05-17 07:23:48] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 0 ms to minimize.
[2022-05-17 07:23:49] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 0 ms to minimize.
[2022-05-17 07:23:49] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2022-05-17 07:23:49] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2022-05-17 07:23:49] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 0 ms to minimize.
[2022-05-17 07:23:49] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 0 ms to minimize.
[2022-05-17 07:23:49] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 0 ms to minimize.
[2022-05-17 07:23:49] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 0 ms to minimize.
[2022-05-17 07:23:49] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2022-05-17 07:23:49] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 0 ms to minimize.
[2022-05-17 07:23:49] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 0 ms to minimize.
[2022-05-17 07:23:49] [INFO ] Deduced a trap composed of 47 places in 73 ms of which 0 ms to minimize.
[2022-05-17 07:23:50] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 0 ms to minimize.
[2022-05-17 07:23:50] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2022-05-17 07:23:50] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 0 ms to minimize.
[2022-05-17 07:23:50] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 0 ms to minimize.
[2022-05-17 07:23:50] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 0 ms to minimize.
[2022-05-17 07:23:50] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 0 ms to minimize.
[2022-05-17 07:23:50] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 1 ms to minimize.
[2022-05-17 07:23:50] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
[2022-05-17 07:23:50] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 0 ms to minimize.
[2022-05-17 07:23:50] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 0 ms to minimize.
[2022-05-17 07:23:50] [INFO ] Deduced a trap composed of 58 places in 73 ms of which 0 ms to minimize.
[2022-05-17 07:23:51] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 0 ms to minimize.
[2022-05-17 07:23:51] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2022-05-17 07:23:51] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 0 ms to minimize.
[2022-05-17 07:23:51] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 0 ms to minimize.
[2022-05-17 07:23:51] [INFO ] Deduced a trap composed of 71 places in 89 ms of which 0 ms to minimize.
[2022-05-17 07:23:51] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 1 ms to minimize.
[2022-05-17 07:23:51] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 1 ms to minimize.
[2022-05-17 07:23:51] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2022-05-17 07:23:52] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 0 ms to minimize.
[2022-05-17 07:23:52] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 0 ms to minimize.
[2022-05-17 07:23:52] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 0 ms to minimize.
[2022-05-17 07:23:52] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 0 ms to minimize.
[2022-05-17 07:23:52] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 0 ms to minimize.
[2022-05-17 07:23:52] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
[2022-05-17 07:23:52] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 2 ms to minimize.
[2022-05-17 07:23:52] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 0 ms to minimize.
[2022-05-17 07:23:52] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 0 ms to minimize.
[2022-05-17 07:23:52] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 0 ms to minimize.
[2022-05-17 07:23:52] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 0 ms to minimize.
[2022-05-17 07:23:53] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 0 ms to minimize.
[2022-05-17 07:23:53] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 0 ms to minimize.
[2022-05-17 07:23:53] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 0 ms to minimize.
[2022-05-17 07:23:53] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 0 ms to minimize.
[2022-05-17 07:23:53] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 1 ms to minimize.
[2022-05-17 07:23:53] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2022-05-17 07:23:53] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 0 ms to minimize.
[2022-05-17 07:23:53] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 0 ms to minimize.
[2022-05-17 07:23:53] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2022-05-17 07:23:54] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 0 ms to minimize.
[2022-05-17 07:23:54] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2022-05-17 07:23:54] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 0 ms to minimize.
[2022-05-17 07:23:54] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 0 ms to minimize.
[2022-05-17 07:23:54] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 1 ms to minimize.
[2022-05-17 07:23:54] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 1 ms to minimize.
[2022-05-17 07:23:54] [INFO ] Deduced a trap composed of 57 places in 76 ms of which 0 ms to minimize.
[2022-05-17 07:23:54] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 0 ms to minimize.
[2022-05-17 07:23:55] [INFO ] Deduced a trap composed of 54 places in 69 ms of which 1 ms to minimize.
[2022-05-17 07:23:55] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 0 ms to minimize.
[2022-05-17 07:23:55] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 0 ms to minimize.
[2022-05-17 07:23:55] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 0 ms to minimize.
[2022-05-17 07:23:55] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 0 ms to minimize.
[2022-05-17 07:23:55] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 0 ms to minimize.
[2022-05-17 07:23:55] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 0 ms to minimize.
[2022-05-17 07:23:55] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 0 ms to minimize.
[2022-05-17 07:23:56] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2022-05-17 07:23:56] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 0 ms to minimize.
[2022-05-17 07:23:56] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 0 ms to minimize.
[2022-05-17 07:23:56] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 0 ms to minimize.
[2022-05-17 07:23:58] [INFO ] Deduced a trap composed of 53 places in 78 ms of which 0 ms to minimize.
[2022-05-17 07:23:58] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 0 ms to minimize.
[2022-05-17 07:23:58] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 1 ms to minimize.
[2022-05-17 07:23:58] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 0 ms to minimize.
[2022-05-17 07:23:58] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 0 ms to minimize.
[2022-05-17 07:23:58] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 1 ms to minimize.
[2022-05-17 07:23:58] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2022-05-17 07:23:58] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2022-05-17 07:23:59] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 1 ms to minimize.
[2022-05-17 07:23:59] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 0 ms to minimize.
[2022-05-17 07:23:59] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 1 ms to minimize.
[2022-05-17 07:23:59] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 0 ms to minimize.
[2022-05-17 07:23:59] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 0 ms to minimize.
[2022-05-17 07:23:59] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 0 ms to minimize.
[2022-05-17 07:23:59] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 1 ms to minimize.
[2022-05-17 07:23:59] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 0 ms to minimize.
[2022-05-17 07:23:59] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2022-05-17 07:24:00] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 0 ms to minimize.
[2022-05-17 07:24:00] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 1 ms to minimize.
[2022-05-17 07:24:00] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 0 ms to minimize.
[2022-05-17 07:24:00] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 0 ms to minimize.
[2022-05-17 07:24:00] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 0 ms to minimize.
[2022-05-17 07:24:00] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2022-05-17 07:24:00] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 0 ms to minimize.
[2022-05-17 07:24:01] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 0 ms to minimize.
[2022-05-17 07:24:01] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2022-05-17 07:24:02] [INFO ] Deduced a trap composed of 57 places in 60 ms of which 0 ms to minimize.
[2022-05-17 07:24:02] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 0 ms to minimize.
[2022-05-17 07:24:02] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 0 ms to minimize.
[2022-05-17 07:24:02] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 0 ms to minimize.
[2022-05-17 07:24:03] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 0 ms to minimize.
[2022-05-17 07:24:03] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 0 ms to minimize.
[2022-05-17 07:24:03] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 0 ms to minimize.
[2022-05-17 07:24:03] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 0 ms to minimize.
[2022-05-17 07:24:03] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2022-05-17 07:24:03] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 0 ms to minimize.
[2022-05-17 07:24:04] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 0 ms to minimize.
[2022-05-17 07:24:04] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 0 ms to minimize.
[2022-05-17 07:24:04] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 0 ms to minimize.
[2022-05-17 07:24:05] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 0 ms to minimize.
[2022-05-17 07:24:05] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 0 ms to minimize.
[2022-05-17 07:24:05] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2022-05-17 07:24:05] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 0 ms to minimize.
[2022-05-17 07:24:05] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2022-05-17 07:24:06] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 0 ms to minimize.
[2022-05-17 07:24:07] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 0 ms to minimize.
[2022-05-17 07:24:07] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2022-05-17 07:24:07] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2022-05-17 07:24:07] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 0 ms to minimize.
[2022-05-17 07:24:07] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 0 ms to minimize.
[2022-05-17 07:24:07] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2022-05-17 07:24:07] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 0 ms to minimize.
[2022-05-17 07:24:08] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2022-05-17 07:24:08] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 0 ms to minimize.
[2022-05-17 07:24:08] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 1 ms to minimize.
[2022-05-17 07:24:08] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 0 ms to minimize.
[2022-05-17 07:24:08] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 0 ms to minimize.
[2022-05-17 07:24:08] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 0 ms to minimize.
[2022-05-17 07:24:08] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 0 ms to minimize.
[2022-05-17 07:24:08] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 1 ms to minimize.
[2022-05-17 07:24:08] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 0 ms to minimize.
[2022-05-17 07:24:09] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2022-05-17 07:24:09] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 0 ms to minimize.
[2022-05-17 07:24:09] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 0 ms to minimize.
[2022-05-17 07:24:09] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 0 ms to minimize.
[2022-05-17 07:24:09] [INFO ] Deduced a trap composed of 46 places in 70 ms of which 1 ms to minimize.
[2022-05-17 07:24:09] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 0 ms to minimize.
[2022-05-17 07:24:09] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 0 ms to minimize.
[2022-05-17 07:24:09] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 0 ms to minimize.
[2022-05-17 07:24:09] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 0 ms to minimize.
[2022-05-17 07:24:09] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 0 ms to minimize.
[2022-05-17 07:24:10] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 0 ms to minimize.
[2022-05-17 07:24:10] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2022-05-17 07:24:10] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2022-05-17 07:24:10] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 0 ms to minimize.
[2022-05-17 07:24:10] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 0 ms to minimize.
[2022-05-17 07:24:10] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2022-05-17 07:24:11] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 0 ms to minimize.
[2022-05-17 07:24:11] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2022-05-17 07:24:11] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2022-05-17 07:24:11] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 0 ms to minimize.
[2022-05-17 07:24:11] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2022-05-17 07:24:11] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 1 ms to minimize.
[2022-05-17 07:24:12] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2022-05-17 07:24:12] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2022-05-17 07:24:12] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
[2022-05-17 07:24:12] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 0 ms to minimize.
[2022-05-17 07:24:13] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 0 ms to minimize.
[2022-05-17 07:24:13] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2022-05-17 07:24:13] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 0 ms to minimize.
[2022-05-17 07:24:13] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 1 ms to minimize.
[2022-05-17 07:24:13] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 0 ms to minimize.
[2022-05-17 07:24:15] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 0 ms to minimize.
[2022-05-17 07:24:16] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 0 ms to minimize.
[2022-05-17 07:24:17] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 0 ms to minimize.
[2022-05-17 07:24:17] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 0 ms to minimize.
[2022-05-17 07:24:17] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:24:17] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 0 ms to minimize.
[2022-05-17 07:24:17] [INFO ] Deduced a trap composed of 49 places in 51 ms of which 0 ms to minimize.
[2022-05-17 07:24:18] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 0 ms to minimize.
[2022-05-17 07:24:18] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2022-05-17 07:24:18] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:24:18] [INFO ] Deduced a trap composed of 55 places in 46 ms of which 0 ms to minimize.
[2022-05-17 07:24:18] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 0 ms to minimize.
[2022-05-17 07:24:19] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 1 ms to minimize.
[2022-05-17 07:24:19] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 0 ms to minimize.
[2022-05-17 07:24:22] [INFO ] Trap strengthening (SAT) tested/added 191/191 trap constraints in 34625 ms
Current structural bounds on expressions (after SMT) : [6] Max seen :[1]
Support contains 6 out of 264 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 264/264 places, 678/678 transitions.
Applied a total of 0 rules in 11 ms. Remains 264 /264 variables (removed 0) and now considering 678/678 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 264/264 places, 678/678 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 264/264 places, 678/678 transitions.
Applied a total of 0 rules in 10 ms. Remains 264 /264 variables (removed 0) and now considering 678/678 (removed 0) transitions.
[2022-05-17 07:24:22] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
// Phase 1: matrix 558 rows 264 cols
[2022-05-17 07:24:22] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-17 07:24:22] [INFO ] Implicit Places using invariants in 139 ms returned []
[2022-05-17 07:24:22] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
// Phase 1: matrix 558 rows 264 cols
[2022-05-17 07:24:22] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 07:24:22] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 07:24:22] [INFO ] Implicit Places using invariants and state equation in 592 ms returned []
Implicit Place search using SMT with State Equation took 734 ms to find 0 implicit places.
[2022-05-17 07:24:22] [INFO ] Redundant transitions in 38 ms returned []
[2022-05-17 07:24:22] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
// Phase 1: matrix 558 rows 264 cols
[2022-05-17 07:24:22] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 07:24:23] [INFO ] Dead Transitions using invariants and state equation in 208 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 264/264 places, 678/678 transitions.
Starting property specific reduction for Peterson-COL-5-UpperBounds-10
Normalized transition count is 558 out of 678 initially.
// Phase 1: matrix 558 rows 264 cols
[2022-05-17 07:24:23] [INFO ] Computed 17 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :1
[2022-05-17 07:24:23] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
// Phase 1: matrix 558 rows 264 cols
[2022-05-17 07:24:23] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 07:24:23] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2022-05-17 07:24:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:24:23] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2022-05-17 07:24:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:24:23] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2022-05-17 07:24:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:24:23] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2022-05-17 07:24:23] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 07:24:23] [INFO ] [Nat]Added 205 Read/Feed constraints in 18 ms returned sat
[2022-05-17 07:24:23] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2022-05-17 07:24:23] [INFO ] Deduced a trap composed of 45 places in 80 ms of which 1 ms to minimize.
[2022-05-17 07:24:23] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 0 ms to minimize.
[2022-05-17 07:24:23] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2022-05-17 07:24:24] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 0 ms to minimize.
[2022-05-17 07:24:24] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 0 ms to minimize.
[2022-05-17 07:24:24] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 0 ms to minimize.
[2022-05-17 07:24:24] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
[2022-05-17 07:24:24] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 0 ms to minimize.
[2022-05-17 07:24:24] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2022-05-17 07:24:24] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 0 ms to minimize.
[2022-05-17 07:24:24] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 0 ms to minimize.
[2022-05-17 07:24:24] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 0 ms to minimize.
[2022-05-17 07:24:24] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 0 ms to minimize.
[2022-05-17 07:24:24] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 0 ms to minimize.
[2022-05-17 07:24:25] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 0 ms to minimize.
[2022-05-17 07:24:25] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 0 ms to minimize.
[2022-05-17 07:24:25] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 0 ms to minimize.
[2022-05-17 07:24:25] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 0 ms to minimize.
[2022-05-17 07:24:25] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 0 ms to minimize.
[2022-05-17 07:24:25] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 0 ms to minimize.
[2022-05-17 07:24:25] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 0 ms to minimize.
[2022-05-17 07:24:25] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2022-05-17 07:24:25] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 0 ms to minimize.
[2022-05-17 07:24:25] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 0 ms to minimize.
[2022-05-17 07:24:25] [INFO ] Deduced a trap composed of 47 places in 80 ms of which 0 ms to minimize.
[2022-05-17 07:24:26] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 0 ms to minimize.
[2022-05-17 07:24:26] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2022-05-17 07:24:26] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 0 ms to minimize.
[2022-05-17 07:24:26] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 0 ms to minimize.
[2022-05-17 07:24:26] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 0 ms to minimize.
[2022-05-17 07:24:26] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 0 ms to minimize.
[2022-05-17 07:24:26] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 0 ms to minimize.
[2022-05-17 07:24:26] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 0 ms to minimize.
[2022-05-17 07:24:26] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 0 ms to minimize.
[2022-05-17 07:24:26] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2022-05-17 07:24:26] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 0 ms to minimize.
[2022-05-17 07:24:27] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 0 ms to minimize.
[2022-05-17 07:24:27] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 0 ms to minimize.
[2022-05-17 07:24:27] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 0 ms to minimize.
[2022-05-17 07:24:27] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2022-05-17 07:24:27] [INFO ] Deduced a trap composed of 71 places in 77 ms of which 0 ms to minimize.
[2022-05-17 07:24:27] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 0 ms to minimize.
[2022-05-17 07:24:27] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 0 ms to minimize.
[2022-05-17 07:24:27] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 0 ms to minimize.
[2022-05-17 07:24:28] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 0 ms to minimize.
[2022-05-17 07:24:28] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 1 ms to minimize.
[2022-05-17 07:24:28] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 0 ms to minimize.
[2022-05-17 07:24:28] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2022-05-17 07:24:28] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 1 ms to minimize.
[2022-05-17 07:24:28] [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) : [6] Max seen :[1]
Support contains 6 out of 264 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 264/264 places, 678/678 transitions.
Applied a total of 0 rules in 10 ms. Remains 264 /264 variables (removed 0) and now considering 678/678 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 264/264 places, 678/678 transitions.
Normalized transition count is 558 out of 678 initially.
// Phase 1: matrix 558 rows 264 cols
[2022-05-17 07:24:28] [INFO ] Computed 17 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1489 ms. (steps per millisecond=671 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 482 ms. (steps per millisecond=2074 ) properties (out of 1) seen :1
[2022-05-17 07:24:30] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
// Phase 1: matrix 558 rows 264 cols
[2022-05-17 07:24:30] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-17 07:24:30] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 07:24:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:24:30] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2022-05-17 07:24:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:24:30] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2022-05-17 07:24:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:24:30] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2022-05-17 07:24:30] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 07:24:30] [INFO ] [Nat]Added 205 Read/Feed constraints in 24 ms returned sat
[2022-05-17 07:24:30] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2022-05-17 07:24:30] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 0 ms to minimize.
[2022-05-17 07:24:31] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 0 ms to minimize.
[2022-05-17 07:24:31] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2022-05-17 07:24:31] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 0 ms to minimize.
[2022-05-17 07:24:31] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
[2022-05-17 07:24:31] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 1 ms to minimize.
[2022-05-17 07:24:31] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 0 ms to minimize.
[2022-05-17 07:24:31] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2022-05-17 07:24:31] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 0 ms to minimize.
[2022-05-17 07:24:31] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2022-05-17 07:24:31] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2022-05-17 07:24:31] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 0 ms to minimize.
[2022-05-17 07:24:32] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 0 ms to minimize.
[2022-05-17 07:24:32] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 0 ms to minimize.
[2022-05-17 07:24:32] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 0 ms to minimize.
[2022-05-17 07:24:32] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 0 ms to minimize.
[2022-05-17 07:24:32] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2022-05-17 07:24:32] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 0 ms to minimize.
[2022-05-17 07:24:32] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 0 ms to minimize.
[2022-05-17 07:24:32] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 0 ms to minimize.
[2022-05-17 07:24:32] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 1 ms to minimize.
[2022-05-17 07:24:32] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2022-05-17 07:24:33] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 0 ms to minimize.
[2022-05-17 07:24:33] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 0 ms to minimize.
[2022-05-17 07:24:33] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 1 ms to minimize.
[2022-05-17 07:24:33] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2022-05-17 07:24:33] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 0 ms to minimize.
[2022-05-17 07:24:33] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 0 ms to minimize.
[2022-05-17 07:24:33] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
[2022-05-17 07:24:33] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 0 ms to minimize.
[2022-05-17 07:24:33] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 0 ms to minimize.
[2022-05-17 07:24:33] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 0 ms to minimize.
[2022-05-17 07:24:33] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 0 ms to minimize.
[2022-05-17 07:24:33] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 0 ms to minimize.
[2022-05-17 07:24:34] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 0 ms to minimize.
[2022-05-17 07:24:34] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 1 ms to minimize.
[2022-05-17 07:24:34] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 0 ms to minimize.
[2022-05-17 07:24:34] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2022-05-17 07:24:34] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 0 ms to minimize.
[2022-05-17 07:24:34] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 0 ms to minimize.
[2022-05-17 07:24:34] [INFO ] Deduced a trap composed of 71 places in 84 ms of which 1 ms to minimize.
[2022-05-17 07:24:34] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 1 ms to minimize.
[2022-05-17 07:24:35] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 0 ms to minimize.
[2022-05-17 07:24:35] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 0 ms to minimize.
[2022-05-17 07:24:35] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 0 ms to minimize.
[2022-05-17 07:24:35] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 0 ms to minimize.
[2022-05-17 07:24:35] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 0 ms to minimize.
[2022-05-17 07:24:35] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 0 ms to minimize.
[2022-05-17 07:24:35] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2022-05-17 07:24:35] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2022-05-17 07:24:35] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2022-05-17 07:24:35] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 0 ms to minimize.
[2022-05-17 07:24:36] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 0 ms to minimize.
[2022-05-17 07:24:36] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
[2022-05-17 07:24:36] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 0 ms to minimize.
[2022-05-17 07:24:36] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 0 ms to minimize.
[2022-05-17 07:24:36] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2022-05-17 07:24:36] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2022-05-17 07:24:36] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 0 ms to minimize.
[2022-05-17 07:24:36] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 1 ms to minimize.
[2022-05-17 07:24:36] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2022-05-17 07:24:36] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 0 ms to minimize.
[2022-05-17 07:24:37] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 0 ms to minimize.
[2022-05-17 07:24:37] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 0 ms to minimize.
[2022-05-17 07:24:37] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 0 ms to minimize.
[2022-05-17 07:24:37] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 0 ms to minimize.
[2022-05-17 07:24:37] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 0 ms to minimize.
[2022-05-17 07:24:37] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2022-05-17 07:24:37] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 1 ms to minimize.
[2022-05-17 07:24:37] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 1 ms to minimize.
[2022-05-17 07:24:37] [INFO ] Deduced a trap composed of 57 places in 72 ms of which 1 ms to minimize.
[2022-05-17 07:24:38] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 0 ms to minimize.
[2022-05-17 07:24:38] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 0 ms to minimize.
[2022-05-17 07:24:38] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 0 ms to minimize.
[2022-05-17 07:24:38] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 0 ms to minimize.
[2022-05-17 07:24:38] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2022-05-17 07:24:38] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 0 ms to minimize.
[2022-05-17 07:24:38] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 0 ms to minimize.
[2022-05-17 07:24:38] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 0 ms to minimize.
[2022-05-17 07:24:38] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 0 ms to minimize.
[2022-05-17 07:24:39] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 0 ms to minimize.
[2022-05-17 07:24:39] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2022-05-17 07:24:39] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2022-05-17 07:24:40] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2022-05-17 07:24:41] [INFO ] Deduced a trap composed of 53 places in 77 ms of which 0 ms to minimize.
[2022-05-17 07:24:41] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 0 ms to minimize.
[2022-05-17 07:24:41] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 0 ms to minimize.
[2022-05-17 07:24:41] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 0 ms to minimize.
[2022-05-17 07:24:41] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 0 ms to minimize.
[2022-05-17 07:24:42] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 0 ms to minimize.
[2022-05-17 07:24:42] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 0 ms to minimize.
[2022-05-17 07:24:42] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2022-05-17 07:24:42] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 0 ms to minimize.
[2022-05-17 07:24:42] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2022-05-17 07:24:42] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 1 ms to minimize.
[2022-05-17 07:24:42] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 0 ms to minimize.
[2022-05-17 07:24:42] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 0 ms to minimize.
[2022-05-17 07:24:42] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 0 ms to minimize.
[2022-05-17 07:24:43] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 0 ms to minimize.
[2022-05-17 07:24:43] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 1 ms to minimize.
[2022-05-17 07:24:43] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2022-05-17 07:24:43] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 0 ms to minimize.
[2022-05-17 07:24:43] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 1 ms to minimize.
[2022-05-17 07:24:43] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 0 ms to minimize.
[2022-05-17 07:24:43] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 0 ms to minimize.
[2022-05-17 07:24:43] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 0 ms to minimize.
[2022-05-17 07:24:44] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2022-05-17 07:24:44] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 0 ms to minimize.
[2022-05-17 07:24:45] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 0 ms to minimize.
[2022-05-17 07:24:45] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 0 ms to minimize.
[2022-05-17 07:24:45] [INFO ] Deduced a trap composed of 57 places in 58 ms of which 0 ms to minimize.
[2022-05-17 07:24:46] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 0 ms to minimize.
[2022-05-17 07:24:46] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 0 ms to minimize.
[2022-05-17 07:24:46] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2022-05-17 07:24:46] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 0 ms to minimize.
[2022-05-17 07:24:46] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 1 ms to minimize.
[2022-05-17 07:24:46] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2022-05-17 07:24:46] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 0 ms to minimize.
[2022-05-17 07:24:46] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 0 ms to minimize.
[2022-05-17 07:24:47] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 0 ms to minimize.
[2022-05-17 07:24:47] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 0 ms to minimize.
[2022-05-17 07:24:47] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 0 ms to minimize.
[2022-05-17 07:24:47] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2022-05-17 07:24:48] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2022-05-17 07:24:48] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 1 ms to minimize.
[2022-05-17 07:24:49] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 0 ms to minimize.
[2022-05-17 07:24:49] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2022-05-17 07:24:49] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 0 ms to minimize.
[2022-05-17 07:24:49] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 0 ms to minimize.
[2022-05-17 07:24:50] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 0 ms to minimize.
[2022-05-17 07:24:50] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 0 ms to minimize.
[2022-05-17 07:24:50] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 0 ms to minimize.
[2022-05-17 07:24:51] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 0 ms to minimize.
[2022-05-17 07:24:51] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 0 ms to minimize.
[2022-05-17 07:24:51] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 0 ms to minimize.
[2022-05-17 07:24:51] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2022-05-17 07:24:51] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 0 ms to minimize.
[2022-05-17 07:24:51] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 0 ms to minimize.
[2022-05-17 07:24:51] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 0 ms to minimize.
[2022-05-17 07:24:51] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 0 ms to minimize.
[2022-05-17 07:24:51] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 0 ms to minimize.
[2022-05-17 07:24:52] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 0 ms to minimize.
[2022-05-17 07:24:52] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 1 ms to minimize.
[2022-05-17 07:24:52] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 0 ms to minimize.
[2022-05-17 07:24:52] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 0 ms to minimize.
[2022-05-17 07:24:52] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 0 ms to minimize.
[2022-05-17 07:24:52] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 0 ms to minimize.
[2022-05-17 07:24:52] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 0 ms to minimize.
[2022-05-17 07:24:52] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2022-05-17 07:24:52] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 1 ms to minimize.
[2022-05-17 07:24:52] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 0 ms to minimize.
[2022-05-17 07:24:53] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 0 ms to minimize.
[2022-05-17 07:24:53] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2022-05-17 07:24:53] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 0 ms to minimize.
[2022-05-17 07:24:53] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 0 ms to minimize.
[2022-05-17 07:24:53] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 0 ms to minimize.
[2022-05-17 07:24:53] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2022-05-17 07:24:53] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 0 ms to minimize.
[2022-05-17 07:24:53] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 0 ms to minimize.
[2022-05-17 07:24:53] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 0 ms to minimize.
[2022-05-17 07:24:54] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 0 ms to minimize.
[2022-05-17 07:24:54] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2022-05-17 07:24:54] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 0 ms to minimize.
[2022-05-17 07:24:54] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 0 ms to minimize.
[2022-05-17 07:24:54] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2022-05-17 07:24:54] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2022-05-17 07:24:55] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 0 ms to minimize.
[2022-05-17 07:24:55] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2022-05-17 07:24:55] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 0 ms to minimize.
[2022-05-17 07:24:55] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 0 ms to minimize.
[2022-05-17 07:24:55] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 0 ms to minimize.
[2022-05-17 07:24:56] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 0 ms to minimize.
[2022-05-17 07:24:56] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 0 ms to minimize.
[2022-05-17 07:24:56] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 0 ms to minimize.
[2022-05-17 07:24:57] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 1 ms to minimize.
[2022-05-17 07:24:57] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 0 ms to minimize.
[2022-05-17 07:24:59] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 0 ms to minimize.
[2022-05-17 07:25:00] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 0 ms to minimize.
[2022-05-17 07:25:00] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 0 ms to minimize.
[2022-05-17 07:25:00] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 0 ms to minimize.
[2022-05-17 07:25:00] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 0 ms to minimize.
[2022-05-17 07:25:00] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2022-05-17 07:25:00] [INFO ] Deduced a trap composed of 49 places in 53 ms of which 1 ms to minimize.
[2022-05-17 07:25:01] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 0 ms to minimize.
[2022-05-17 07:25:01] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2022-05-17 07:25:01] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 0 ms to minimize.
[2022-05-17 07:25:01] [INFO ] Deduced a trap composed of 55 places in 54 ms of which 1 ms to minimize.
[2022-05-17 07:25:01] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 0 ms to minimize.
[2022-05-17 07:25:02] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 0 ms to minimize.
[2022-05-17 07:25:02] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:25:05] [INFO ] Trap strengthening (SAT) tested/added 191/191 trap constraints in 34739 ms
Current structural bounds on expressions (after SMT) : [6] Max seen :[1]
Support contains 6 out of 264 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 264/264 places, 678/678 transitions.
Applied a total of 0 rules in 17 ms. Remains 264 /264 variables (removed 0) and now considering 678/678 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 264/264 places, 678/678 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 264/264 places, 678/678 transitions.
Applied a total of 0 rules in 9 ms. Remains 264 /264 variables (removed 0) and now considering 678/678 (removed 0) transitions.
[2022-05-17 07:25:05] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
// Phase 1: matrix 558 rows 264 cols
[2022-05-17 07:25:05] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 07:25:05] [INFO ] Implicit Places using invariants in 168 ms returned []
[2022-05-17 07:25:05] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
// Phase 1: matrix 558 rows 264 cols
[2022-05-17 07:25:05] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 07:25:05] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 07:25:06] [INFO ] Implicit Places using invariants and state equation in 552 ms returned []
Implicit Place search using SMT with State Equation took 725 ms to find 0 implicit places.
[2022-05-17 07:25:06] [INFO ] Redundant transitions in 12 ms returned []
[2022-05-17 07:25:06] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
// Phase 1: matrix 558 rows 264 cols
[2022-05-17 07:25:06] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 07:25:06] [INFO ] Dead Transitions using invariants and state equation in 229 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 264/264 places, 678/678 transitions.
Ending property specific reduction for Peterson-COL-5-UpperBounds-10 in 43337 ms.
[2022-05-17 07:25:06] [INFO ] Flatten gal took : 103 ms
[2022-05-17 07:25:06] [INFO ] Applying decomposition
[2022-05-17 07:25:06] [INFO ] Flatten gal took : 48 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/graph8861239780095991473.txt' '-o' '/tmp/graph8861239780095991473.bin' '-w' '/tmp/graph8861239780095991473.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8861239780095991473.bin' '-l' '-1' '-v' '-w' '/tmp/graph8861239780095991473.weights' '-q' '0' '-e' '0.001'
[2022-05-17 07:25:07] [INFO ] Decomposing Gal with order
[2022-05-17 07:25:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 07:25:07] [INFO ] Removed a total of 912 redundant transitions.
[2022-05-17 07:25:07] [INFO ] Flatten gal took : 115 ms
[2022-05-17 07:25:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 250 labels/synchronizations in 33 ms.
[2022-05-17 07:25:07] [INFO ] Time to serialize gal into /tmp/UpperBounds12598798954511868604.gal : 18 ms
[2022-05-17 07:25:07] [INFO ] Time to serialize properties into /tmp/UpperBounds7915525805074954160.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/UpperBounds12598798954511868604.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7915525805074954160.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/UpperBounds7915525805074954160.prop.
Detected timeout of ITS tools.
[2022-05-17 07:46:34] [INFO ] Applying decomposition
[2022-05-17 07:46:34] [INFO ] Flatten gal took : 189 ms
[2022-05-17 07:46:34] [INFO ] Decomposing Gal with order
[2022-05-17 07:46:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 07:46:34] [INFO ] Removed a total of 1367 redundant transitions.
[2022-05-17 07:46:35] [INFO ] Flatten gal took : 396 ms
[2022-05-17 07:46:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 74 ms.
[2022-05-17 07:46:35] [INFO ] Time to serialize gal into /tmp/UpperBounds14861787825022779724.gal : 67 ms
[2022-05-17 07:46:35] [INFO ] Time to serialize properties into /tmp/UpperBounds6525756358625097061.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/UpperBounds14861787825022779724.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds6525756358625097061.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/UpperBounds6525756358625097061.prop.
Detected timeout of ITS tools.
[2022-05-17 08:07:53] [INFO ] Flatten gal took : 242 ms
[2022-05-17 08:07:54] [INFO ] Input system was already deterministic with 678 transitions.
[2022-05-17 08:07:54] [INFO ] Transformed 264 places.
[2022-05-17 08:07:54] [INFO ] Transformed 678 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
[2022-05-17 08:07:54] [INFO ] Time to serialize gal into /tmp/UpperBounds2101441562833153494.gal : 14 ms
[2022-05-17 08:07:54] [INFO ] Time to serialize properties into /tmp/UpperBounds12449597125451297218.prop : 2 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/UpperBounds2101441562833153494.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12449597125451297218.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...341
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds12449597125451297218.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-5"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is Peterson-COL-5, 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 r168-tall-165277016100029"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-5.tgz
mv Peterson-COL-5 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 ;