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.r078-tall-165260110000213.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 DoubleExponent-PT-100, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110000213
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.0K Apr 29 13:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 29 13:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 29 13:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 29 13:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 1.8M May 10 09:33 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 DoubleExponent-PT-100-UpperBounds-00
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-01
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-02
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-03
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-04
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-05
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-06
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-07
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-08
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-09
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-10
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-11
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-12
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-13
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-14
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652648944811

Running Version 202205111006
[2022-05-15 21:09:05] [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-15 21:09:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 21:09:06] [INFO ] Load time of PNML (sax parser for PT used): 227 ms
[2022-05-15 21:09:06] [INFO ] Transformed 5304 places.
[2022-05-15 21:09:06] [INFO ] Transformed 4998 transitions.
[2022-05-15 21:09:06] [INFO ] Parsed PT model containing 5304 places and 4998 transitions in 376 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 4998 rows 5304 cols
[2022-05-15 21:09:07] [INFO ] Invariants computation overflowed in 286 ms
Incomplete random walk after 10000 steps, including 318 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 297 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 289 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 275 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 272 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 293 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 286 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 289 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 281 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 288 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 279 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 296 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 294 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 287 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 275 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 16) seen :0
// Phase 1: matrix 4998 rows 5304 cols
[2022-05-15 21:09:08] [INFO ] Invariants computation overflowed in 166 ms
[2022-05-15 21:09:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:09:13] [INFO ] [Real]Absence check using state equation in 4405 ms returned unknown
[2022-05-15 21:09:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:09:18] [INFO ] [Real]Absence check using state equation in 4564 ms returned unknown
[2022-05-15 21:09:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:09:23] [INFO ] [Real]Absence check using state equation in 4514 ms returned unknown
[2022-05-15 21:09:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:09:28] [INFO ] [Real]Absence check using state equation in 4559 ms returned unknown
[2022-05-15 21:09:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:09:33] [INFO ] [Real]Absence check using state equation in 4579 ms returned unknown
[2022-05-15 21:09:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:09:38] [INFO ] [Real]Absence check using state equation in 4539 ms returned unknown
[2022-05-15 21:09:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:09:43] [INFO ] [Real]Absence check using state equation in 4571 ms returned unknown
[2022-05-15 21:09:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:09:48] [INFO ] [Real]Absence check using state equation in 4514 ms returned unknown
[2022-05-15 21:09:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:09:53] [INFO ] [Real]Absence check using state equation in 4552 ms returned unknown
[2022-05-15 21:09:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:09:58] [INFO ] [Real]Absence check using state equation in 4575 ms returned unknown
[2022-05-15 21:09:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:10:03] [INFO ] [Real]Absence check using state equation in 4552 ms returned unknown
[2022-05-15 21:10:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:10:08] [INFO ] [Real]Absence check using state equation in 4580 ms returned unknown
[2022-05-15 21:10:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:10:13] [INFO ] [Real]Absence check using state equation in 4569 ms returned unknown
[2022-05-15 21:10:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:10:18] [INFO ] [Real]Absence check using state equation in 4575 ms returned unknown
[2022-05-15 21:10:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:10:23] [INFO ] [Real]Absence check using state equation in 4594 ms returned unknown
[2022-05-15 21:10:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:10:28] [INFO ] [Real]Absence check using state equation in 4532 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 16 out of 5304 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5304/5304 places, 4998/4998 transitions.
Graph (complete) has 9096 edges and 5304 vertex of which 5298 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.22 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1184 transitions
Trivial Post-agglo rules discarded 1184 transitions
Performed 1184 trivial Post agglomeration. Transition count delta: 1184
Iterating post reduction 0 with 1187 rules applied. Total rules applied 1188 place count 5297 transition count 3812
Reduce places removed 1184 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 1190 rules applied. Total rules applied 2378 place count 4113 transition count 3806
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 2384 place count 4107 transition count 3806
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 202 Pre rules applied. Total rules applied 2384 place count 4107 transition count 3604
Deduced a syphon composed of 202 places in 187 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 3 with 404 rules applied. Total rules applied 2788 place count 3905 transition count 3604
Performed 893 Post agglomeration using F-continuation condition.Transition count delta: 893
Deduced a syphon composed of 893 places in 66 ms
Reduce places removed 893 places and 0 transitions.
Iterating global reduction 3 with 1786 rules applied. Total rules applied 4574 place count 3012 transition count 2711
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 66 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4776 place count 2911 transition count 2711
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 95 places in 52 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 4966 place count 2816 transition count 2711
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4967 place count 2816 transition count 2710
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4968 place count 2815 transition count 2710
Free-agglomeration rule (complex) applied 402 times.
Iterating global reduction 4 with 402 rules applied. Total rules applied 5370 place count 2815 transition count 2308
Reduce places removed 402 places and 0 transitions.
Iterating post reduction 4 with 402 rules applied. Total rules applied 5772 place count 2413 transition count 2308
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 403 times.
Drop transitions removed 403 transitions
Iterating global reduction 5 with 403 rules applied. Total rules applied 6175 place count 2413 transition count 2308
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 6176 place count 2412 transition count 2307
Applied a total of 6176 rules in 2733 ms. Remains 2412 /5304 variables (removed 2892) and now considering 2307/4998 (removed 2691) transitions.
Finished structural reductions, in 1 iterations. Remains : 2412/5304 places, 2307/4998 transitions.
// Phase 1: matrix 2307 rows 2412 cols
[2022-05-15 21:10:31] [INFO ] Invariants computation overflowed in 53 ms
Incomplete random walk after 1000000 steps, including 128173 resets, run finished after 2254 ms. (steps per millisecond=443 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84511 resets, run finished after 1246 ms. (steps per millisecond=802 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84753 resets, run finished after 1241 ms. (steps per millisecond=805 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84777 resets, run finished after 1282 ms. (steps per millisecond=780 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84628 resets, run finished after 1328 ms. (steps per millisecond=753 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84784 resets, run finished after 1315 ms. (steps per millisecond=760 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84539 resets, run finished after 1159 ms. (steps per millisecond=862 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84699 resets, run finished after 1103 ms. (steps per millisecond=906 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84757 resets, run finished after 1133 ms. (steps per millisecond=882 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84332 resets, run finished after 1089 ms. (steps per millisecond=918 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84885 resets, run finished after 1090 ms. (steps per millisecond=917 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84628 resets, run finished after 1097 ms. (steps per millisecond=911 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84875 resets, run finished after 1074 ms. (steps per millisecond=931 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84819 resets, run finished after 1071 ms. (steps per millisecond=933 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84619 resets, run finished after 1078 ms. (steps per millisecond=927 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84697 resets, run finished after 1075 ms. (steps per millisecond=930 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84743 resets, run finished after 1086 ms. (steps per millisecond=920 ) properties (out of 16) seen :0
// Phase 1: matrix 2307 rows 2412 cols
[2022-05-15 21:10:52] [INFO ] Invariants computation overflowed in 58 ms
[2022-05-15 21:10:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:11:10] [INFO ] [Real]Absence check using state equation in 18247 ms returned unknown
[2022-05-15 21:11:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:11:42] [INFO ] [Real]Absence check using state equation in 30989 ms returned unknown
[2022-05-15 21:11:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:11:43] [INFO ] [Real]Absence check using state equation in 1375 ms returned sat
[2022-05-15 21:11:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:11:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:11:46] [INFO ] [Nat]Absence check using state equation in 2313 ms returned sat
[2022-05-15 21:11:46] [INFO ] State equation strengthened by 392 read => feed constraints.
[2022-05-15 21:11:50] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-15 21:11:53] [INFO ] [Nat]Added 392 Read/Feed constraints in 6587 ms returned unknown
[2022-05-15 21:11:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:11:54] [INFO ] [Real]Absence check using state equation in 1060 ms returned sat
[2022-05-15 21:11:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:11:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:11:55] [INFO ] [Nat]Absence check using state equation in 1053 ms returned sat
[2022-05-15 21:11:56] [INFO ] [Nat]Added 392 Read/Feed constraints in 131 ms returned sat
[2022-05-15 21:12:00] [INFO ] Deduced a trap composed of 13 places in 4463 ms of which 16 ms to minimize.
[2022-05-15 21:12:05] [INFO ] Deduced a trap composed of 584 places in 4390 ms of which 8 ms to minimize.
[2022-05-15 21:12:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 10691 ms
[2022-05-15 21:12:07] [INFO ] Computed and/alt/rep : 1817/11251/1817 causal constraints (skipped 489 transitions) in 494 ms.
[2022-05-15 21:12:13] [INFO ] Added : 10 causal constraints over 2 iterations in 6825 ms. Result :unknown
[2022-05-15 21:12:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:12:15] [INFO ] [Real]Absence check using state equation in 2096 ms returned sat
[2022-05-15 21:12:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:12:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:12:20] [INFO ] [Nat]Absence check using state equation in 3985 ms returned sat
[2022-05-15 21:12:23] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-15 21:12:27] [INFO ] [Nat]Added 392 Read/Feed constraints in 7521 ms returned unknown
[2022-05-15 21:12:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:12:29] [INFO ] [Real]Absence check using state equation in 1233 ms returned sat
[2022-05-15 21:12:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:12:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:12:43] [INFO ] [Nat]Absence check using state equation in 13585 ms returned sat
[2022-05-15 21:12:46] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-15 21:12:49] [INFO ] [Nat]Added 392 Read/Feed constraints in 6283 ms returned unknown
[2022-05-15 21:12:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:12:58] [INFO ] [Real]Absence check using state equation in 8722 ms returned sat
[2022-05-15 21:12:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:12:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:13:06] [INFO ] [Nat]Absence check using state equation in 7894 ms returned sat
[2022-05-15 21:13:09] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-15 21:13:12] [INFO ] [Nat]Added 392 Read/Feed constraints in 6089 ms returned unknown
[2022-05-15 21:13:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:13:44] [INFO ] [Real]Absence check using state equation in 31318 ms returned sat
[2022-05-15 21:13:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:13:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:13:51] [INFO ] [Nat]Absence check using state equation in 6731 ms returned sat
[2022-05-15 21:13:54] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-15 21:13:57] [INFO ] [Nat]Added 392 Read/Feed constraints in 6174 ms returned unknown
[2022-05-15 21:13:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:14:03] [INFO ] [Real]Absence check using state equation in 5730 ms returned sat
[2022-05-15 21:14:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:14:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:14:38] [INFO ] [Nat]Absence check using state equation in 34329 ms returned sat
[2022-05-15 21:14:41] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-15 21:14:44] [INFO ] [Nat]Added 392 Read/Feed constraints in 6057 ms returned unknown
[2022-05-15 21:14:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:14:59] [INFO ] [Real]Absence check using state equation in 15326 ms returned sat
[2022-05-15 21:15:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:15:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:15:10] [INFO ] [Nat]Absence check using state equation in 10360 ms returned sat
[2022-05-15 21:15:13] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-15 21:15:16] [INFO ] [Nat]Added 392 Read/Feed constraints in 6043 ms returned unknown
[2022-05-15 21:15:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:15:34] [INFO ] [Real]Absence check using state equation in 17722 ms returned sat
[2022-05-15 21:15:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:15:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:15:52] [INFO ] [Nat]Absence check using state equation in 17586 ms returned sat
[2022-05-15 21:15:55] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-15 21:15:58] [INFO ] [Nat]Added 392 Read/Feed constraints in 6257 ms returned unknown
[2022-05-15 21:15:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:16:01] [INFO ] [Real]Absence check using state equation in 2710 ms returned sat
[2022-05-15 21:16:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:16:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:16:04] [INFO ] [Nat]Absence check using state equation in 2517 ms returned sat
[2022-05-15 21:16:14] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-15 21:16:17] [INFO ] [Nat]Added 392 Read/Feed constraints in 12914 ms returned unknown
[2022-05-15 21:16:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:17:02] [INFO ] [Real]Absence check using state equation in 44773 ms returned unknown
[2022-05-15 21:17:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:17:47] [INFO ] [Real]Absence check using state equation in 44792 ms returned unknown
[2022-05-15 21:17:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:17:51] [INFO ] [Real]Absence check using state equation in 3373 ms returned sat
[2022-05-15 21:17:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:17:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:17:53] [INFO ] [Nat]Absence check using state equation in 1785 ms returned sat
[2022-05-15 21:17:59] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-15 21:18:02] [INFO ] [Nat]Added 392 Read/Feed constraints in 8524 ms returned unknown
[2022-05-15 21:18:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:18:23] [INFO ] [Real]Absence check using state equation in 20902 ms returned sat
[2022-05-15 21:18:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:18:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:19:08] [INFO ] [Nat]Absence check using state equation in 44805 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 16 out of 2412 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2412/2412 places, 2307/2307 transitions.
Applied a total of 0 rules in 218 ms. Remains 2412 /2412 variables (removed 0) and now considering 2307/2307 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2412/2412 places, 2307/2307 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2412/2412 places, 2307/2307 transitions.
Applied a total of 0 rules in 227 ms. Remains 2412 /2412 variables (removed 0) and now considering 2307/2307 (removed 0) transitions.
// Phase 1: matrix 2307 rows 2412 cols
[2022-05-15 21:19:09] [INFO ] Invariants computation overflowed in 44 ms
[2022-05-15 21:19:31] [INFO ] Implicit Places using invariants in 22288 ms returned []
// Phase 1: matrix 2307 rows 2412 cols
[2022-05-15 21:19:31] [INFO ] Invariants computation overflowed in 42 ms
[2022-05-15 21:19:54] [INFO ] Implicit Places using invariants and state equation in 22770 ms returned []
Implicit Place search using SMT with State Equation took 45066 ms to find 0 implicit places.
[2022-05-15 21:19:54] [INFO ] Redundant transitions in 209 ms returned []
// Phase 1: matrix 2307 rows 2412 cols
[2022-05-15 21:19:54] [INFO ] Invariants computation overflowed in 41 ms
[2022-05-15 21:19:55] [INFO ] Dead Transitions using invariants and state equation in 1625 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2412/2412 places, 2307/2307 transitions.
Starting property specific reduction for DoubleExponent-PT-100-UpperBounds-00
// Phase 1: matrix 2307 rows 2412 cols
[2022-05-15 21:19:56] [INFO ] Invariants computation overflowed in 43 ms
Incomplete random walk after 10000 steps, including 1303 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 811 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
// Phase 1: matrix 2307 rows 2412 cols
[2022-05-15 21:19:56] [INFO ] Invariants computation overflowed in 48 ms
[2022-05-15 21:19:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:20:01] [INFO ] [Real]Absence check using state equation in 4804 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2412 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2412/2412 places, 2307/2307 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2412 transition count 2306
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2411 transition count 2306
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 95 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 16 place count 2404 transition count 2299
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 6 places in 90 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 28 place count 2398 transition count 2300
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 31 place count 2398 transition count 2297
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 34 place count 2395 transition count 2297
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 39 place count 2395 transition count 2297
Applied a total of 39 rules in 1017 ms. Remains 2395 /2412 variables (removed 17) and now considering 2297/2307 (removed 10) transitions.
Finished structural reductions, in 1 iterations. Remains : 2395/2412 places, 2297/2307 transitions.
// Phase 1: matrix 2297 rows 2395 cols
[2022-05-15 21:20:02] [INFO ] Invariants computation overflowed in 49 ms
Incomplete random walk after 1000000 steps, including 128308 resets, run finished after 1889 ms. (steps per millisecond=529 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84639 resets, run finished after 1295 ms. (steps per millisecond=772 ) properties (out of 1) seen :0
// Phase 1: matrix 2297 rows 2395 cols
[2022-05-15 21:20:05] [INFO ] Invariants computation overflowed in 46 ms
[2022-05-15 21:20:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:20:23] [INFO ] [Real]Absence check using state equation in 17340 ms returned sat
[2022-05-15 21:20:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:20:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:20:24] [INFO ] [Nat]Absence check using state equation in 1329 ms returned sat
[2022-05-15 21:20:24] [INFO ] State equation strengthened by 410 read => feed constraints.
[2022-05-15 21:20:25] [INFO ] [Nat]Added 410 Read/Feed constraints in 551 ms returned sat
[2022-05-15 21:20:26] [INFO ] Computed and/alt/rep : 1789/11381/1789 causal constraints (skipped 507 transitions) in 495 ms.
[2022-05-15 21:20:49] [INFO ] Added : 55 causal constraints over 11 iterations in 23536 ms.(timeout) Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2395 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2395/2395 places, 2297/2297 transitions.
Applied a total of 0 rules in 198 ms. Remains 2395 /2395 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2395/2395 places, 2297/2297 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2395/2395 places, 2297/2297 transitions.
Applied a total of 0 rules in 206 ms. Remains 2395 /2395 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
// Phase 1: matrix 2297 rows 2395 cols
[2022-05-15 21:20:49] [INFO ] Invariants computation overflowed in 46 ms
[2022-05-15 21:21:11] [INFO ] Implicit Places using invariants in 21801 ms returned []
// Phase 1: matrix 2297 rows 2395 cols
[2022-05-15 21:21:11] [INFO ] Invariants computation overflowed in 43 ms
[2022-05-15 21:21:34] [INFO ] Implicit Places using invariants and state equation in 22811 ms returned []
Implicit Place search using SMT with State Equation took 44624 ms to find 0 implicit places.
[2022-05-15 21:21:34] [INFO ] Redundant transitions in 150 ms returned []
// Phase 1: matrix 2297 rows 2395 cols
[2022-05-15 21:21:34] [INFO ] Invariants computation overflowed in 43 ms
[2022-05-15 21:21:36] [INFO ] Dead Transitions using invariants and state equation in 1578 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2395/2395 places, 2297/2297 transitions.
Ending property specific reduction for DoubleExponent-PT-100-UpperBounds-00 in 100153 ms.
Starting property specific reduction for DoubleExponent-PT-100-UpperBounds-01
// Phase 1: matrix 2307 rows 2412 cols
[2022-05-15 21:21:36] [INFO ] Invariants computation overflowed in 40 ms
Incomplete random walk after 10000 steps, including 1283 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 813 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
// Phase 1: matrix 2307 rows 2412 cols
[2022-05-15 21:21:36] [INFO ] Invariants computation overflowed in 42 ms
[2022-05-15 21:21:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:21:41] [INFO ] [Real]Absence check using state equation in 4792 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2412 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2412/2412 places, 2307/2307 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2412 transition count 2306
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2411 transition count 2306
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 91 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 18 place count 2403 transition count 2298
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 6 places in 85 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 30 place count 2397 transition count 2299
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 2397 transition count 2297
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 34 place count 2395 transition count 2297
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 39 place count 2395 transition count 2297
Applied a total of 39 rules in 980 ms. Remains 2395 /2412 variables (removed 17) and now considering 2297/2307 (removed 10) transitions.
Finished structural reductions, in 1 iterations. Remains : 2395/2412 places, 2297/2307 transitions.
// Phase 1: matrix 2297 rows 2395 cols
[2022-05-15 21:21:42] [INFO ] Invariants computation overflowed in 48 ms
Incomplete random walk after 1000000 steps, including 128289 resets, run finished after 1923 ms. (steps per millisecond=520 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84594 resets, run finished after 1318 ms. (steps per millisecond=758 ) properties (out of 1) seen :0
// Phase 1: matrix 2297 rows 2395 cols
[2022-05-15 21:21:45] [INFO ] Invariants computation overflowed in 41 ms
[2022-05-15 21:21:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:22:00] [INFO ] [Real]Absence check using state equation in 14057 ms returned sat
[2022-05-15 21:22:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:22:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:22:10] [INFO ] [Nat]Absence check using state equation in 10172 ms returned sat
[2022-05-15 21:22:10] [INFO ] State equation strengthened by 410 read => feed constraints.
[2022-05-15 21:22:13] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-15 21:22:16] [INFO ] [Nat]Added 410 Read/Feed constraints in 6227 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2395 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2395/2395 places, 2297/2297 transitions.
Applied a total of 0 rules in 224 ms. Remains 2395 /2395 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2395/2395 places, 2297/2297 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2395/2395 places, 2297/2297 transitions.
Applied a total of 0 rules in 205 ms. Remains 2395 /2395 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
// Phase 1: matrix 2297 rows 2395 cols
[2022-05-15 21:22:17] [INFO ] Invariants computation overflowed in 46 ms
[2022-05-15 21:22:39] [INFO ] Implicit Places using invariants in 22347 ms returned []
// Phase 1: matrix 2297 rows 2395 cols
[2022-05-15 21:22:39] [INFO ] Invariants computation overflowed in 45 ms
[2022-05-15 21:23:02] [INFO ] Implicit Places using invariants and state equation in 23133 ms returned []
Implicit Place search using SMT with State Equation took 45495 ms to find 0 implicit places.
[2022-05-15 21:23:02] [INFO ] Redundant transitions in 91 ms returned []
// Phase 1: matrix 2297 rows 2395 cols
[2022-05-15 21:23:02] [INFO ] Invariants computation overflowed in 41 ms
[2022-05-15 21:23:04] [INFO ] Dead Transitions using invariants and state equation in 1581 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2395/2395 places, 2297/2297 transitions.
Ending property specific reduction for DoubleExponent-PT-100-UpperBounds-01 in 88307 ms.
Starting property specific reduction for DoubleExponent-PT-100-UpperBounds-02
// Phase 1: matrix 2307 rows 2412 cols
[2022-05-15 21:23:04] [INFO ] Invariants computation overflowed in 41 ms
Incomplete random walk after 10000 steps, including 1260 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 839 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
// Phase 1: matrix 2307 rows 2412 cols
[2022-05-15 21:23:04] [INFO ] Invariants computation overflowed in 40 ms
[2022-05-15 21:23:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:23:06] [INFO ] [Real]Absence check using state equation in 1428 ms returned sat
[2022-05-15 21:23:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:23:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:23:09] [INFO ] [Nat]Absence check using state equation in 2396 ms returned sat
[2022-05-15 21:23:09] [INFO ] State equation strengthened by 392 read => feed constraints.
[2022-05-15 21:23:11] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-15 21:23:11] [INFO ] [Nat]Added 392 Read/Feed constraints in 2392 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2412 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2412/2412 places, 2307/2307 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2412 transition count 2306
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2411 transition count 2306
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 86 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 16 place count 2404 transition count 2299
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 5 places in 85 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 26 place count 2399 transition count 2300
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 29 place count 2399 transition count 2297
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 32 place count 2396 transition count 2297
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 37 place count 2396 transition count 2297
Applied a total of 37 rules in 966 ms. Remains 2396 /2412 variables (removed 16) and now considering 2297/2307 (removed 10) transitions.
Finished structural reductions, in 1 iterations. Remains : 2396/2412 places, 2297/2307 transitions.
// Phase 1: matrix 2297 rows 2396 cols
[2022-05-15 21:23:12] [INFO ] Invariants computation overflowed in 41 ms
Incomplete random walk after 1000000 steps, including 128266 resets, run finished after 1896 ms. (steps per millisecond=527 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84610 resets, run finished after 1326 ms. (steps per millisecond=754 ) properties (out of 1) seen :0
// Phase 1: matrix 2297 rows 2396 cols
[2022-05-15 21:23:15] [INFO ] Invariants computation overflowed in 44 ms
[2022-05-15 21:23:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:23:24] [INFO ] [Real]Absence check using state equation in 8821 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2396 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2396/2396 places, 2297/2297 transitions.
Applied a total of 0 rules in 227 ms. Remains 2396 /2396 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2396/2396 places, 2297/2297 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2396/2396 places, 2297/2297 transitions.
Applied a total of 0 rules in 233 ms. Remains 2396 /2396 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
// Phase 1: matrix 2297 rows 2396 cols
[2022-05-15 21:23:25] [INFO ] Invariants computation overflowed in 37 ms
[2022-05-15 21:23:47] [INFO ] Implicit Places using invariants in 22235 ms returned []
// Phase 1: matrix 2297 rows 2396 cols
[2022-05-15 21:23:47] [INFO ] Invariants computation overflowed in 40 ms
[2022-05-15 21:24:10] [INFO ] Implicit Places using invariants and state equation in 22717 ms returned []
Implicit Place search using SMT with State Equation took 44957 ms to find 0 implicit places.
[2022-05-15 21:24:10] [INFO ] Redundant transitions in 92 ms returned []
// Phase 1: matrix 2297 rows 2396 cols
[2022-05-15 21:24:10] [INFO ] Invariants computation overflowed in 40 ms
[2022-05-15 21:24:11] [INFO ] Dead Transitions using invariants and state equation in 1525 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2396/2396 places, 2297/2297 transitions.
Ending property specific reduction for DoubleExponent-PT-100-UpperBounds-02 in 67545 ms.
Starting property specific reduction for DoubleExponent-PT-100-UpperBounds-03
// Phase 1: matrix 2307 rows 2412 cols
[2022-05-15 21:24:12] [INFO ] Invariants computation overflowed in 39 ms
Incomplete random walk after 10000 steps, including 1296 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 872 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
// Phase 1: matrix 2307 rows 2412 cols
[2022-05-15 21:24:12] [INFO ] Invariants computation overflowed in 39 ms
[2022-05-15 21:24:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:24:13] [INFO ] [Real]Absence check using state equation in 1115 ms returned sat
[2022-05-15 21:24:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:24:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:24:14] [INFO ] [Nat]Absence check using state equation in 1093 ms returned sat
[2022-05-15 21:24:14] [INFO ] State equation strengthened by 392 read => feed constraints.
[2022-05-15 21:24:15] [INFO ] [Nat]Added 392 Read/Feed constraints in 144 ms returned sat
[2022-05-15 21:24:19] [INFO ] Deduced a trap composed of 13 places in 4441 ms of which 3 ms to minimize.
[2022-05-15 21:24:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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) : [-1] Max seen :[0]
Support contains 1 out of 2412 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2412/2412 places, 2307/2307 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2412 transition count 2306
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2411 transition count 2306
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 89 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 16 place count 2404 transition count 2299
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 5 places in 98 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 26 place count 2399 transition count 2300
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 29 place count 2399 transition count 2297
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 32 place count 2396 transition count 2297
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 37 place count 2396 transition count 2297
Applied a total of 37 rules in 958 ms. Remains 2396 /2412 variables (removed 16) and now considering 2297/2307 (removed 10) transitions.
Finished structural reductions, in 1 iterations. Remains : 2396/2412 places, 2297/2307 transitions.
// Phase 1: matrix 2297 rows 2396 cols
[2022-05-15 21:24:20] [INFO ] Invariants computation overflowed in 43 ms
Incomplete random walk after 1000000 steps, including 128248 resets, run finished after 1720 ms. (steps per millisecond=581 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84627 resets, run finished after 1180 ms. (steps per millisecond=847 ) properties (out of 1) seen :0
// Phase 1: matrix 2297 rows 2396 cols
[2022-05-15 21:24:23] [INFO ] Invariants computation overflowed in 43 ms
[2022-05-15 21:24:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:24:34] [INFO ] [Real]Absence check using state equation in 10674 ms returned sat
[2022-05-15 21:24:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:24:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:24:35] [INFO ] [Nat]Absence check using state equation in 1115 ms returned sat
[2022-05-15 21:24:35] [INFO ] State equation strengthened by 409 read => feed constraints.
[2022-05-15 21:24:36] [INFO ] [Nat]Added 409 Read/Feed constraints in 83 ms returned sat
[2022-05-15 21:24:36] [INFO ] Computed and/alt/rep : 1792/11368/1792 causal constraints (skipped 504 transitions) in 341 ms.
[2022-05-15 21:24:46] [INFO ] Added : 55 causal constraints over 11 iterations in 10270 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2396 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2396/2396 places, 2297/2297 transitions.
Applied a total of 0 rules in 205 ms. Remains 2396 /2396 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2396/2396 places, 2297/2297 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2396/2396 places, 2297/2297 transitions.
Applied a total of 0 rules in 211 ms. Remains 2396 /2396 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
// Phase 1: matrix 2297 rows 2396 cols
[2022-05-15 21:24:47] [INFO ] Invariants computation overflowed in 38 ms
[2022-05-15 21:25:09] [INFO ] Implicit Places using invariants in 22385 ms returned []
// Phase 1: matrix 2297 rows 2396 cols
[2022-05-15 21:25:09] [INFO ] Invariants computation overflowed in 38 ms
[2022-05-15 21:25:32] [INFO ] Implicit Places using invariants and state equation in 22998 ms returned []
Implicit Place search using SMT with State Equation took 45404 ms to find 0 implicit places.
[2022-05-15 21:25:32] [INFO ] Redundant transitions in 94 ms returned []
// Phase 1: matrix 2297 rows 2396 cols
[2022-05-15 21:25:32] [INFO ] Invariants computation overflowed in 38 ms
[2022-05-15 21:25:34] [INFO ] Dead Transitions using invariants and state equation in 1526 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2396/2396 places, 2297/2297 transitions.
Ending property specific reduction for DoubleExponent-PT-100-UpperBounds-03 in 82105 ms.
Starting property specific reduction for DoubleExponent-PT-100-UpperBounds-04
// Phase 1: matrix 2307 rows 2412 cols
[2022-05-15 21:25:34] [INFO ] Invariants computation overflowed in 38 ms
Incomplete random walk after 10000 steps, including 1312 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 841 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
// Phase 1: matrix 2307 rows 2412 cols
[2022-05-15 21:25:34] [INFO ] Invariants computation overflowed in 41 ms
[2022-05-15 21:25:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:25:36] [INFO ] [Real]Absence check using state equation in 2127 ms returned sat
[2022-05-15 21:25:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:25:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:25:41] [INFO ] [Nat]Absence check using state equation in 4134 ms returned sat
[2022-05-15 21:25:41] [INFO ] State equation strengthened by 392 read => feed constraints.
[2022-05-15 21:25:41] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-15 21:25:41] [INFO ] [Nat]Added 392 Read/Feed constraints in 703 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2412 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2412/2412 places, 2307/2307 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2412 transition count 2306
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2411 transition count 2306
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 80 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 16 place count 2404 transition count 2299
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 6 places in 78 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 28 place count 2398 transition count 2300
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 31 place count 2398 transition count 2297
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 34 place count 2395 transition count 2297
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 39 place count 2395 transition count 2297
Applied a total of 39 rules in 933 ms. Remains 2395 /2412 variables (removed 17) and now considering 2297/2307 (removed 10) transitions.
Finished structural reductions, in 1 iterations. Remains : 2395/2412 places, 2297/2307 transitions.
// Phase 1: matrix 2297 rows 2395 cols
[2022-05-15 21:25:42] [INFO ] Invariants computation overflowed in 41 ms
Incomplete random walk after 1000000 steps, including 128407 resets, run finished after 1547 ms. (steps per millisecond=646 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84721 resets, run finished after 1079 ms. (steps per millisecond=926 ) properties (out of 1) seen :0
// Phase 1: matrix 2297 rows 2395 cols
[2022-05-15 21:25:45] [INFO ] Invariants computation overflowed in 33 ms
[2022-05-15 21:25:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:25:47] [INFO ] [Real]Absence check using state equation in 2187 ms returned sat
[2022-05-15 21:25:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:25:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:25:50] [INFO ] [Nat]Absence check using state equation in 2312 ms returned sat
[2022-05-15 21:25:50] [INFO ] State equation strengthened by 411 read => feed constraints.
[2022-05-15 21:25:53] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-15 21:25:56] [INFO ] [Nat]Added 411 Read/Feed constraints in 6046 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2395 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2395/2395 places, 2297/2297 transitions.
Applied a total of 0 rules in 216 ms. Remains 2395 /2395 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2395/2395 places, 2297/2297 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2395/2395 places, 2297/2297 transitions.
Applied a total of 0 rules in 203 ms. Remains 2395 /2395 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
// Phase 1: matrix 2297 rows 2395 cols
[2022-05-15 21:25:57] [INFO ] Invariants computation overflowed in 42 ms
[2022-05-15 21:26:19] [INFO ] Implicit Places using invariants in 22282 ms returned []
// Phase 1: matrix 2297 rows 2395 cols
[2022-05-15 21:26:19] [INFO ] Invariants computation overflowed in 36 ms
[2022-05-15 21:26:41] [INFO ] Implicit Places using invariants and state equation in 22077 ms returned []
Implicit Place search using SMT with State Equation took 44365 ms to find 0 implicit places.
[2022-05-15 21:26:41] [INFO ] Redundant transitions in 90 ms returned []
// Phase 1: matrix 2297 rows 2395 cols
[2022-05-15 21:26:41] [INFO ] Invariants computation overflowed in 40 ms
[2022-05-15 21:26:43] [INFO ] Dead Transitions using invariants and state equation in 1534 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2395/2395 places, 2297/2297 transitions.
Ending property specific reduction for DoubleExponent-PT-100-UpperBounds-04 in 69079 ms.
Starting property specific reduction for DoubleExponent-PT-100-UpperBounds-05
// Phase 1: matrix 2307 rows 2412 cols
[2022-05-15 21:26:43] [INFO ] Invariants computation overflowed in 43 ms
Incomplete random walk after 10000 steps, including 1252 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 845 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
// Phase 1: matrix 2307 rows 2412 cols
[2022-05-15 21:26:43] [INFO ] Invariants computation overflowed in 40 ms
[2022-05-15 21:26:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:26:44] [INFO ] [Real]Absence check using state equation in 1276 ms returned sat
[2022-05-15 21:26:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:26:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:26:50] [INFO ] [Nat]Absence check using state equation in 4808 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2412 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2412/2412 places, 2307/2307 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2412 transition count 2306
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2411 transition count 2306
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 110 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 18 place count 2403 transition count 2298
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 5 places in 88 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 28 place count 2398 transition count 2299
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 31 place count 2398 transition count 2296
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 34 place count 2395 transition count 2296
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 39 place count 2395 transition count 2296
Applied a total of 39 rules in 1005 ms. Remains 2395 /2412 variables (removed 17) and now considering 2296/2307 (removed 11) transitions.
Finished structural reductions, in 1 iterations. Remains : 2395/2412 places, 2296/2307 transitions.
// Phase 1: matrix 2296 rows 2395 cols
[2022-05-15 21:26:51] [INFO ] Invariants computation overflowed in 60 ms
Incomplete random walk after 1000000 steps, including 128527 resets, run finished after 1951 ms. (steps per millisecond=512 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84655 resets, run finished after 1314 ms. (steps per millisecond=761 ) properties (out of 1) seen :0
// Phase 1: matrix 2296 rows 2395 cols
[2022-05-15 21:26:54] [INFO ] Invariants computation overflowed in 55 ms
[2022-05-15 21:26:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:27:04] [INFO ] [Real]Absence check using state equation in 9960 ms returned sat
[2022-05-15 21:27:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:27:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:27:15] [INFO ] [Nat]Absence check using state equation in 10735 ms returned sat
[2022-05-15 21:27:15] [INFO ] State equation strengthened by 409 read => feed constraints.
[2022-05-15 21:27:18] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-15 21:27:21] [INFO ] [Nat]Added 409 Read/Feed constraints in 6082 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2395 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2395/2395 places, 2296/2296 transitions.
Applied a total of 0 rules in 237 ms. Remains 2395 /2395 variables (removed 0) and now considering 2296/2296 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2395/2395 places, 2296/2296 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2395/2395 places, 2296/2296 transitions.
Applied a total of 0 rules in 218 ms. Remains 2395 /2395 variables (removed 0) and now considering 2296/2296 (removed 0) transitions.
// Phase 1: matrix 2296 rows 2395 cols
[2022-05-15 21:27:22] [INFO ] Invariants computation overflowed in 56 ms
[2022-05-15 21:27:44] [INFO ] Implicit Places using invariants in 22410 ms returned []
// Phase 1: matrix 2296 rows 2395 cols
[2022-05-15 21:27:44] [INFO ] Invariants computation overflowed in 53 ms
[2022-05-15 21:28:07] [INFO ] Implicit Places using invariants and state equation in 22701 ms returned []
Implicit Place search using SMT with State Equation took 45121 ms to find 0 implicit places.
[2022-05-15 21:28:07] [INFO ] Redundant transitions in 89 ms returned []
// Phase 1: matrix 2296 rows 2395 cols
[2022-05-15 21:28:07] [INFO ] Invariants computation overflowed in 53 ms
[2022-05-15 21:28:09] [INFO ] Dead Transitions using invariants and state equation in 1597 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2395/2395 places, 2296/2296 transitions.
Ending property specific reduction for DoubleExponent-PT-100-UpperBounds-05 in 86063 ms.
Starting property specific reduction for DoubleExponent-PT-100-UpperBounds-06
// Phase 1: matrix 2307 rows 2412 cols
[2022-05-15 21:28:09] [INFO ] Invariants computation overflowed in 39 ms
Incomplete random walk after 10000 steps, including 1294 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 828 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
// Phase 1: matrix 2307 rows 2412 cols
[2022-05-15 21:28:09] [INFO ] Invariants computation overflowed in 40 ms
[2022-05-15 21:28:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:28:14] [INFO ] [Real]Absence check using state equation in 4804 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2412 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2412/2412 places, 2307/2307 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2412 transition count 2306
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2411 transition count 2306
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 79 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 18 place count 2403 transition count 2298
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 6 places in 81 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 30 place count 2397 transition count 2299
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 33 place count 2397 transition count 2296
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 36 place count 2394 transition count 2296
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 41 place count 2394 transition count 2296
Applied a total of 41 rules in 971 ms. Remains 2394 /2412 variables (removed 18) and now considering 2296/2307 (removed 11) transitions.
Finished structural reductions, in 1 iterations. Remains : 2394/2412 places, 2296/2307 transitions.
// Phase 1: matrix 2296 rows 2394 cols
[2022-05-15 21:28:15] [INFO ] Invariants computation overflowed in 57 ms
Incomplete random walk after 1000000 steps, including 128360 resets, run finished after 1803 ms. (steps per millisecond=554 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84668 resets, run finished after 1276 ms. (steps per millisecond=783 ) properties (out of 1) seen :0
// Phase 1: matrix 2296 rows 2394 cols
[2022-05-15 21:28:18] [INFO ] Invariants computation overflowed in 56 ms
[2022-05-15 21:28:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:29:03] [INFO ] [Real]Absence check using state equation in 44789 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2394 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2394/2394 places, 2296/2296 transitions.
Applied a total of 0 rules in 209 ms. Remains 2394 /2394 variables (removed 0) and now considering 2296/2296 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2394/2394 places, 2296/2296 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2394/2394 places, 2296/2296 transitions.
Applied a total of 0 rules in 198 ms. Remains 2394 /2394 variables (removed 0) and now considering 2296/2296 (removed 0) transitions.
// Phase 1: matrix 2296 rows 2394 cols
[2022-05-15 21:29:04] [INFO ] Invariants computation overflowed in 53 ms
[2022-05-15 21:29:26] [INFO ] Implicit Places using invariants in 22225 ms returned []
// Phase 1: matrix 2296 rows 2394 cols
[2022-05-15 21:29:26] [INFO ] Invariants computation overflowed in 54 ms
[2022-05-15 21:29:49] [INFO ] Implicit Places using invariants and state equation in 23096 ms returned []
Implicit Place search using SMT with State Equation took 45326 ms to find 0 implicit places.
[2022-05-15 21:29:49] [INFO ] Redundant transitions in 93 ms returned []
// Phase 1: matrix 2296 rows 2394 cols
[2022-05-15 21:29:49] [INFO ] Invariants computation overflowed in 56 ms
[2022-05-15 21:29:51] [INFO ] Dead Transitions using invariants and state equation in 1575 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2394/2394 places, 2296/2296 transitions.
Ending property specific reduction for DoubleExponent-PT-100-UpperBounds-06 in 101946 ms.
Starting property specific reduction for DoubleExponent-PT-100-UpperBounds-07
// Phase 1: matrix 2307 rows 2412 cols
[2022-05-15 21:29:51] [INFO ] Invariants computation overflowed in 43 ms
Incomplete random walk after 10000 steps, including 1277 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 845 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
// Phase 1: matrix 2307 rows 2412 cols
[2022-05-15 21:29:51] [INFO ] Invariants computation overflowed in 42 ms
[2022-05-15 21:29:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:29:56] [INFO ] [Real]Absence check using state equation in 4777 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2412 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2412/2412 places, 2307/2307 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2412 transition count 2306
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2411 transition count 2306
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 98 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 16 place count 2404 transition count 2299
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 6 places in 90 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 28 place count 2398 transition count 2300
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 31 place count 2398 transition count 2297
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 34 place count 2395 transition count 2297
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 38 place count 2395 transition count 2297
Applied a total of 38 rules in 987 ms. Remains 2395 /2412 variables (removed 17) and now considering 2297/2307 (removed 10) transitions.
Finished structural reductions, in 1 iterations. Remains : 2395/2412 places, 2297/2307 transitions.
// Phase 1: matrix 2297 rows 2395 cols
[2022-05-15 21:29:57] [INFO ] Invariants computation overflowed in 61 ms
Incomplete random walk after 1000000 steps, including 128575 resets, run finished after 1729 ms. (steps per millisecond=578 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84616 resets, run finished after 1207 ms. (steps per millisecond=828 ) properties (out of 1) seen :0
// Phase 1: matrix 2297 rows 2395 cols
[2022-05-15 21:30:00] [INFO ] Invariants computation overflowed in 58 ms
[2022-05-15 21:30:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:30:08] [INFO ] [Real]Absence check using state equation in 7809 ms returned sat
[2022-05-15 21:30:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:30:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:30:43] [INFO ] [Nat]Absence check using state equation in 34730 ms returned sat
[2022-05-15 21:30:43] [INFO ] State equation strengthened by 410 read => feed constraints.
[2022-05-15 21:30:48] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-15 21:30:53] [INFO ] [Nat]Added 410 Read/Feed constraints in 10037 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2395 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2395/2395 places, 2297/2297 transitions.
Applied a total of 0 rules in 223 ms. Remains 2395 /2395 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2395/2395 places, 2297/2297 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2395/2395 places, 2297/2297 transitions.
Applied a total of 0 rules in 208 ms. Remains 2395 /2395 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
// Phase 1: matrix 2297 rows 2395 cols
[2022-05-15 21:30:54] [INFO ] Invariants computation overflowed in 59 ms
[2022-05-15 21:31:15] [INFO ] Implicit Places using invariants in 21461 ms returned []
// Phase 1: matrix 2297 rows 2395 cols
[2022-05-15 21:31:15] [INFO ] Invariants computation overflowed in 63 ms
[2022-05-15 21:31:37] [INFO ] Implicit Places using invariants and state equation in 22266 ms returned []
Implicit Place search using SMT with State Equation took 43747 ms to find 0 implicit places.
[2022-05-15 21:31:37] [INFO ] Redundant transitions in 90 ms returned []
// Phase 1: matrix 2297 rows 2395 cols
[2022-05-15 21:31:38] [INFO ] Invariants computation overflowed in 53 ms
[2022-05-15 21:31:39] [INFO ] Dead Transitions using invariants and state equation in 1595 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2395/2395 places, 2297/2297 transitions.
Ending property specific reduction for DoubleExponent-PT-100-UpperBounds-07 in 108450 ms.
Starting property specific reduction for DoubleExponent-PT-100-UpperBounds-08
// Phase 1: matrix 2307 rows 2412 cols
[2022-05-15 21:31:39] [INFO ] Invariants computation overflowed in 39 ms
Incomplete random walk after 10000 steps, including 1275 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 834 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
// Phase 1: matrix 2307 rows 2412 cols
[2022-05-15 21:31:39] [INFO ] Invariants computation overflowed in 41 ms
[2022-05-15 21:31:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:31:44] [INFO ] [Real]Absence check using state equation in 4789 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2412 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2412/2412 places, 2307/2307 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2412 transition count 2306
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2411 transition count 2306
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 81 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 16 place count 2404 transition count 2299
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 6 places in 79 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 28 place count 2398 transition count 2300
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 31 place count 2398 transition count 2297
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 34 place count 2395 transition count 2297
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 39 place count 2395 transition count 2297
Applied a total of 39 rules in 918 ms. Remains 2395 /2412 variables (removed 17) and now considering 2297/2307 (removed 10) transitions.
Finished structural reductions, in 1 iterations. Remains : 2395/2412 places, 2297/2307 transitions.
// Phase 1: matrix 2297 rows 2395 cols
[2022-05-15 21:31:45] [INFO ] Invariants computation overflowed in 57 ms
Incomplete random walk after 1000000 steps, including 127776 resets, run finished after 1561 ms. (steps per millisecond=640 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84538 resets, run finished after 1037 ms. (steps per millisecond=964 ) properties (out of 1) seen :0
// Phase 1: matrix 2297 rows 2395 cols
[2022-05-15 21:31:48] [INFO ] Invariants computation overflowed in 46 ms
[2022-05-15 21:31:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:32:33] [INFO ] [Real]Absence check using state equation in 44805 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2395 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2395/2395 places, 2297/2297 transitions.
Applied a total of 0 rules in 191 ms. Remains 2395 /2395 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2395/2395 places, 2297/2297 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2395/2395 places, 2297/2297 transitions.
Applied a total of 0 rules in 188 ms. Remains 2395 /2395 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
// Phase 1: matrix 2297 rows 2395 cols
[2022-05-15 21:32:33] [INFO ] Invariants computation overflowed in 48 ms
[2022-05-15 21:32:55] [INFO ] Implicit Places using invariants in 21465 ms returned []
// Phase 1: matrix 2297 rows 2395 cols
[2022-05-15 21:32:55] [INFO ] Invariants computation overflowed in 46 ms
[2022-05-15 21:33:18] [INFO ] Implicit Places using invariants and state equation in 22629 ms returned []
Implicit Place search using SMT with State Equation took 44104 ms to find 0 implicit places.
[2022-05-15 21:33:18] [INFO ] Redundant transitions in 92 ms returned []
// Phase 1: matrix 2297 rows 2395 cols
[2022-05-15 21:33:18] [INFO ] Invariants computation overflowed in 42 ms
[2022-05-15 21:33:19] [INFO ] Dead Transitions using invariants and state equation in 1559 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2395/2395 places, 2297/2297 transitions.
Ending property specific reduction for DoubleExponent-PT-100-UpperBounds-08 in 100112 ms.
Starting property specific reduction for DoubleExponent-PT-100-UpperBounds-09
// Phase 1: matrix 2307 rows 2412 cols
[2022-05-15 21:33:19] [INFO ] Invariants computation overflowed in 49 ms
Incomplete random walk after 10000 steps, including 1316 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 853 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
// Phase 1: matrix 2307 rows 2412 cols
[2022-05-15 21:33:19] [INFO ] Invariants computation overflowed in 34 ms
[2022-05-15 21:33:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:33:24] [INFO ] [Real]Absence check using state equation in 4822 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2412 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2412/2412 places, 2307/2307 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2412 transition count 2306
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2411 transition count 2306
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 80 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 18 place count 2403 transition count 2298
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 6 places in 80 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 30 place count 2397 transition count 2299
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 33 place count 2397 transition count 2296
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 36 place count 2394 transition count 2296
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 40 place count 2394 transition count 2296
Applied a total of 40 rules in 936 ms. Remains 2394 /2412 variables (removed 18) and now considering 2296/2307 (removed 11) transitions.
Finished structural reductions, in 1 iterations. Remains : 2394/2412 places, 2296/2307 transitions.
// Phase 1: matrix 2296 rows 2394 cols
[2022-05-15 21:33:26] [INFO ] Invariants computation overflowed in 47 ms
Incomplete random walk after 1000000 steps, including 128365 resets, run finished after 1493 ms. (steps per millisecond=669 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84486 resets, run finished after 1044 ms. (steps per millisecond=957 ) properties (out of 1) seen :0
// Phase 1: matrix 2296 rows 2394 cols
[2022-05-15 21:33:28] [INFO ] Invariants computation overflowed in 53 ms
[2022-05-15 21:33:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:33:50] [INFO ] [Real]Absence check using state equation in 21509 ms returned sat
[2022-05-15 21:33:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:33:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:34:09] [INFO ] [Nat]Absence check using state equation in 19047 ms returned sat
[2022-05-15 21:34:09] [INFO ] State equation strengthened by 411 read => feed constraints.
[2022-05-15 21:34:12] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-15 21:34:15] [INFO ] [Nat]Added 411 Read/Feed constraints in 6257 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2394 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2394/2394 places, 2296/2296 transitions.
Applied a total of 0 rules in 227 ms. Remains 2394 /2394 variables (removed 0) and now considering 2296/2296 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2394/2394 places, 2296/2296 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2394/2394 places, 2296/2296 transitions.
Applied a total of 0 rules in 192 ms. Remains 2394 /2394 variables (removed 0) and now considering 2296/2296 (removed 0) transitions.
// Phase 1: matrix 2296 rows 2394 cols
[2022-05-15 21:34:16] [INFO ] Invariants computation overflowed in 55 ms
[2022-05-15 21:34:38] [INFO ] Implicit Places using invariants in 21859 ms returned []
// Phase 1: matrix 2296 rows 2394 cols
[2022-05-15 21:34:38] [INFO ] Invariants computation overflowed in 47 ms
[2022-05-15 21:35:00] [INFO ] Implicit Places using invariants and state equation in 22527 ms returned []
Implicit Place search using SMT with State Equation took 44397 ms to find 0 implicit places.
[2022-05-15 21:35:00] [INFO ] Redundant transitions in 94 ms returned []
// Phase 1: matrix 2296 rows 2394 cols
[2022-05-15 21:35:00] [INFO ] Invariants computation overflowed in 55 ms
[2022-05-15 21:35:02] [INFO ] Dead Transitions using invariants and state equation in 1480 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2394/2394 places, 2296/2296 transitions.
Ending property specific reduction for DoubleExponent-PT-100-UpperBounds-09 in 102713 ms.
Starting property specific reduction for DoubleExponent-PT-100-UpperBounds-10
// Phase 1: matrix 2307 rows 2412 cols
[2022-05-15 21:35:02] [INFO ] Invariants computation overflowed in 43 ms
Incomplete random walk after 10000 steps, including 1267 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 851 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
// Phase 1: matrix 2307 rows 2412 cols
[2022-05-15 21:35:02] [INFO ] Invariants computation overflowed in 38 ms
[2022-05-15 21:35:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:35:07] [INFO ] [Real]Absence check using state equation in 4804 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2412 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2412/2412 places, 2307/2307 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2412 transition count 2306
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2411 transition count 2306
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 82 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 2405 transition count 2300
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 79 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 24 place count 2400 transition count 2300
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 27 place count 2400 transition count 2297
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 30 place count 2397 transition count 2297
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 35 place count 2397 transition count 2297
Applied a total of 35 rules in 919 ms. Remains 2397 /2412 variables (removed 15) and now considering 2297/2307 (removed 10) transitions.
Finished structural reductions, in 1 iterations. Remains : 2397/2412 places, 2297/2307 transitions.
// Phase 1: matrix 2297 rows 2397 cols
[2022-05-15 21:35:08] [INFO ] Invariants computation overflowed in 57 ms
Incomplete random walk after 1000000 steps, including 128360 resets, run finished after 1465 ms. (steps per millisecond=682 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84483 resets, run finished after 1025 ms. (steps per millisecond=975 ) properties (out of 1) seen :0
// Phase 1: matrix 2297 rows 2397 cols
[2022-05-15 21:35:11] [INFO ] Invariants computation overflowed in 84 ms
[2022-05-15 21:35:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:35:21] [INFO ] [Real]Absence check using state equation in 9878 ms returned sat
[2022-05-15 21:35:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:35:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:35:32] [INFO ] [Nat]Absence check using state equation in 10630 ms returned sat
[2022-05-15 21:35:32] [INFO ] State equation strengthened by 409 read => feed constraints.
[2022-05-15 21:35:35] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-15 21:35:38] [INFO ] [Nat]Added 409 Read/Feed constraints in 6077 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2397 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2397/2397 places, 2297/2297 transitions.
Applied a total of 0 rules in 226 ms. Remains 2397 /2397 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2397/2397 places, 2297/2297 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2397/2397 places, 2297/2297 transitions.
Applied a total of 0 rules in 214 ms. Remains 2397 /2397 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
// Phase 1: matrix 2297 rows 2397 cols
[2022-05-15 21:35:38] [INFO ] Invariants computation overflowed in 55 ms
[2022-05-15 21:36:00] [INFO ] Implicit Places using invariants in 21829 ms returned []
// Phase 1: matrix 2297 rows 2397 cols
[2022-05-15 21:36:00] [INFO ] Invariants computation overflowed in 50 ms
[2022-05-15 21:36:23] [INFO ] Implicit Places using invariants and state equation in 22354 ms returned []
Implicit Place search using SMT with State Equation took 44193 ms to find 0 implicit places.
[2022-05-15 21:36:23] [INFO ] Redundant transitions in 98 ms returned []
// Phase 1: matrix 2297 rows 2397 cols
[2022-05-15 21:36:23] [INFO ] Invariants computation overflowed in 53 ms
[2022-05-15 21:36:24] [INFO ] Dead Transitions using invariants and state equation in 1562 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2397/2397 places, 2297/2297 transitions.
Ending property specific reduction for DoubleExponent-PT-100-UpperBounds-10 in 82334 ms.
Starting property specific reduction for DoubleExponent-PT-100-UpperBounds-11
// Phase 1: matrix 2307 rows 2412 cols
[2022-05-15 21:36:24] [INFO ] Invariants computation overflowed in 41 ms
Incomplete random walk after 10000 steps, including 1285 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 842 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
// Phase 1: matrix 2307 rows 2412 cols
[2022-05-15 21:36:24] [INFO ] Invariants computation overflowed in 46 ms
[2022-05-15 21:36:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:36:28] [INFO ] [Real]Absence check using state equation in 3080 ms returned sat
[2022-05-15 21:36:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:36:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:36:31] [INFO ] [Nat]Absence check using state equation in 2643 ms returned sat
[2022-05-15 21:36:31] [INFO ] State equation strengthened by 392 read => feed constraints.
[2022-05-15 21:36:33] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-15 21:36:33] [INFO ] [Nat]Added 392 Read/Feed constraints in 2163 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2412 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2412/2412 places, 2307/2307 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2412 transition count 2306
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2411 transition count 2306
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 78 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 18 place count 2403 transition count 2298
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 6 places in 77 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 30 place count 2397 transition count 2299
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 2397 transition count 2298
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 2396 transition count 2298
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 37 place count 2396 transition count 2298
Applied a total of 37 rules in 895 ms. Remains 2396 /2412 variables (removed 16) and now considering 2298/2307 (removed 9) transitions.
Finished structural reductions, in 1 iterations. Remains : 2396/2412 places, 2298/2307 transitions.
// Phase 1: matrix 2298 rows 2396 cols
[2022-05-15 21:36:34] [INFO ] Invariants computation overflowed in 49 ms
Incomplete random walk after 1000000 steps, including 128348 resets, run finished after 1457 ms. (steps per millisecond=686 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84811 resets, run finished after 1009 ms. (steps per millisecond=991 ) properties (out of 1) seen :0
// Phase 1: matrix 2298 rows 2396 cols
[2022-05-15 21:36:37] [INFO ] Invariants computation overflowed in 49 ms
[2022-05-15 21:36:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:36:39] [INFO ] [Real]Absence check using state equation in 2331 ms returned sat
[2022-05-15 21:36:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:36:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:36:43] [INFO ] [Nat]Absence check using state equation in 3795 ms returned sat
[2022-05-15 21:36:43] [INFO ] State equation strengthened by 411 read => feed constraints.
[2022-05-15 21:36:47] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-15 21:36:54] [INFO ] [Nat]Added 411 Read/Feed constraints in 10207 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2396 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2396/2396 places, 2298/2298 transitions.
Applied a total of 0 rules in 198 ms. Remains 2396 /2396 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2396/2396 places, 2298/2298 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2396/2396 places, 2298/2298 transitions.
Applied a total of 0 rules in 189 ms. Remains 2396 /2396 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
// Phase 1: matrix 2298 rows 2396 cols
[2022-05-15 21:36:54] [INFO ] Invariants computation overflowed in 62 ms
[2022-05-15 21:37:16] [INFO ] Implicit Places using invariants in 21978 ms returned []
// Phase 1: matrix 2298 rows 2396 cols
[2022-05-15 21:37:16] [INFO ] Invariants computation overflowed in 45 ms
[2022-05-15 21:37:39] [INFO ] Implicit Places using invariants and state equation in 22700 ms returned []
Implicit Place search using SMT with State Equation took 44699 ms to find 0 implicit places.
[2022-05-15 21:37:39] [INFO ] Redundant transitions in 89 ms returned []
// Phase 1: matrix 2298 rows 2396 cols
[2022-05-15 21:37:39] [INFO ] Invariants computation overflowed in 46 ms
[2022-05-15 21:37:40] [INFO ] Dead Transitions using invariants and state equation in 1566 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2396/2396 places, 2298/2298 transitions.
Ending property specific reduction for DoubleExponent-PT-100-UpperBounds-11 in 76052 ms.
Starting property specific reduction for DoubleExponent-PT-100-UpperBounds-12
// Phase 1: matrix 2307 rows 2412 cols
[2022-05-15 21:37:40] [INFO ] Invariants computation overflowed in 38 ms
Incomplete random walk after 10000 steps, including 1274 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 867 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
// Phase 1: matrix 2307 rows 2412 cols
[2022-05-15 21:37:40] [INFO ] Invariants computation overflowed in 41 ms
[2022-05-15 21:37:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:37:46] [INFO ] [Real]Absence check using state equation in 4785 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2412 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2412/2412 places, 2307/2307 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2412 transition count 2306
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2411 transition count 2306
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 77 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 18 place count 2403 transition count 2298
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 6 places in 78 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 30 place count 2397 transition count 2299
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 33 place count 2397 transition count 2296
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 36 place count 2394 transition count 2296
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 40 place count 2394 transition count 2296
Applied a total of 40 rules in 902 ms. Remains 2394 /2412 variables (removed 18) and now considering 2296/2307 (removed 11) transitions.
Finished structural reductions, in 1 iterations. Remains : 2394/2412 places, 2296/2307 transitions.
// Phase 1: matrix 2296 rows 2394 cols
[2022-05-15 21:37:47] [INFO ] Invariants computation overflowed in 56 ms
Incomplete random walk after 1000000 steps, including 128407 resets, run finished after 1471 ms. (steps per millisecond=679 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84770 resets, run finished after 1016 ms. (steps per millisecond=984 ) properties (out of 1) seen :0
// Phase 1: matrix 2296 rows 2394 cols
[2022-05-15 21:37:49] [INFO ] Invariants computation overflowed in 56 ms
[2022-05-15 21:37:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:38:34] [INFO ] [Real]Absence check using state equation in 44811 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2394 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2394/2394 places, 2296/2296 transitions.
Applied a total of 0 rules in 226 ms. Remains 2394 /2394 variables (removed 0) and now considering 2296/2296 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2394/2394 places, 2296/2296 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2394/2394 places, 2296/2296 transitions.
Applied a total of 0 rules in 212 ms. Remains 2394 /2394 variables (removed 0) and now considering 2296/2296 (removed 0) transitions.
// Phase 1: matrix 2296 rows 2394 cols
[2022-05-15 21:38:35] [INFO ] Invariants computation overflowed in 55 ms
[2022-05-15 21:38:57] [INFO ] Implicit Places using invariants in 22120 ms returned []
// Phase 1: matrix 2296 rows 2394 cols
[2022-05-15 21:38:57] [INFO ] Invariants computation overflowed in 51 ms
[2022-05-15 21:39:19] [INFO ] Implicit Places using invariants and state equation in 22778 ms returned []
Implicit Place search using SMT with State Equation took 44905 ms to find 0 implicit places.
[2022-05-15 21:39:20] [INFO ] Redundant transitions in 96 ms returned []
// Phase 1: matrix 2296 rows 2394 cols
[2022-05-15 21:39:20] [INFO ] Invariants computation overflowed in 58 ms
[2022-05-15 21:39:21] [INFO ] Dead Transitions using invariants and state equation in 1584 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2394/2394 places, 2296/2296 transitions.
Ending property specific reduction for DoubleExponent-PT-100-UpperBounds-12 in 100895 ms.
Starting property specific reduction for DoubleExponent-PT-100-UpperBounds-13
// Phase 1: matrix 2307 rows 2412 cols
[2022-05-15 21:39:21] [INFO ] Invariants computation overflowed in 42 ms
Incomplete random walk after 10000 steps, including 1275 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 840 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
// Phase 1: matrix 2307 rows 2412 cols
[2022-05-15 21:39:21] [INFO ] Invariants computation overflowed in 39 ms
[2022-05-15 21:39:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:39:26] [INFO ] [Real]Absence check using state equation in 4786 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2412 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2412/2412 places, 2307/2307 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2412 transition count 2306
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2411 transition count 2306
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 90 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 18 place count 2403 transition count 2298
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 5 places in 87 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 28 place count 2398 transition count 2299
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 31 place count 2398 transition count 2296
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 34 place count 2395 transition count 2296
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 37 place count 2395 transition count 2296
Applied a total of 37 rules in 995 ms. Remains 2395 /2412 variables (removed 17) and now considering 2296/2307 (removed 11) transitions.
Finished structural reductions, in 1 iterations. Remains : 2395/2412 places, 2296/2307 transitions.
// Phase 1: matrix 2296 rows 2395 cols
[2022-05-15 21:39:28] [INFO ] Invariants computation overflowed in 36 ms
Incomplete random walk after 1000000 steps, including 128124 resets, run finished after 1893 ms. (steps per millisecond=528 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84958 resets, run finished after 1289 ms. (steps per millisecond=775 ) properties (out of 1) seen :0
// Phase 1: matrix 2296 rows 2395 cols
[2022-05-15 21:39:31] [INFO ] Invariants computation overflowed in 41 ms
[2022-05-15 21:39:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:40:16] [INFO ] [Real]Absence check using state equation in 44808 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2395 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2395/2395 places, 2296/2296 transitions.
Applied a total of 0 rules in 202 ms. Remains 2395 /2395 variables (removed 0) and now considering 2296/2296 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2395/2395 places, 2296/2296 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2395/2395 places, 2296/2296 transitions.
Applied a total of 0 rules in 188 ms. Remains 2395 /2395 variables (removed 0) and now considering 2296/2296 (removed 0) transitions.
// Phase 1: matrix 2296 rows 2395 cols
[2022-05-15 21:40:16] [INFO ] Invariants computation overflowed in 43 ms
[2022-05-15 21:40:38] [INFO ] Implicit Places using invariants in 22166 ms returned []
// Phase 1: matrix 2296 rows 2395 cols
[2022-05-15 21:40:38] [INFO ] Invariants computation overflowed in 34 ms
[2022-05-15 21:40:40] [INFO ] State equation strengthened by 407 read => feed constraints.
[2022-05-15 21:41:46] [INFO ] Performed 70/2395 implicitness test of which 0 returned IMPLICIT in 66 seconds.
[2022-05-15 21:43:18] [INFO ] Performed 72/2395 implicitness test of which 0 returned IMPLICIT in 158 seconds.
[2022-05-15 21:43:18] [INFO ] Timeout of Implicit test with SMT after 158 seconds.
[2022-05-15 21:43:18] [INFO ] Implicit Places using invariants and state equation in 160103 ms returned []
Implicit Place search using SMT with State Equation took 182279 ms to find 0 implicit places.
[2022-05-15 21:43:19] [INFO ] Redundant transitions in 91 ms returned []
// Phase 1: matrix 2296 rows 2395 cols
[2022-05-15 21:43:19] [INFO ] Invariants computation overflowed in 42 ms
[2022-05-15 21:43:20] [INFO ] Dead Transitions using invariants and state equation in 1635 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2395/2395 places, 2296/2296 transitions.
Ending property specific reduction for DoubleExponent-PT-100-UpperBounds-13 in 239056 ms.
Starting property specific reduction for DoubleExponent-PT-100-UpperBounds-14
// Phase 1: matrix 2307 rows 2412 cols
[2022-05-15 21:43:20] [INFO ] Invariants computation overflowed in 40 ms
Incomplete random walk after 10000 steps, including 1292 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 872 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
// Phase 1: matrix 2307 rows 2412 cols
[2022-05-15 21:43:20] [INFO ] Invariants computation overflowed in 33 ms
[2022-05-15 21:43:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:43:24] [INFO ] [Real]Absence check using state equation in 3290 ms returned sat
[2022-05-15 21:43:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:43:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:43:26] [INFO ] [Nat]Absence check using state equation in 1711 ms returned sat
[2022-05-15 21:43:26] [INFO ] State equation strengthened by 392 read => feed constraints.
[2022-05-15 21:43:29] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-15 21:43:29] [INFO ] [Nat]Added 392 Read/Feed constraints in 3095 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2412 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2412/2412 places, 2307/2307 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2412 transition count 2306
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2411 transition count 2306
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 80 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 18 place count 2403 transition count 2298
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 5 places in 90 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 28 place count 2398 transition count 2299
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 31 place count 2398 transition count 2296
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 34 place count 2395 transition count 2296
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 39 place count 2395 transition count 2296
Applied a total of 39 rules in 946 ms. Remains 2395 /2412 variables (removed 17) and now considering 2296/2307 (removed 11) transitions.
Finished structural reductions, in 1 iterations. Remains : 2395/2412 places, 2296/2307 transitions.
// Phase 1: matrix 2296 rows 2395 cols
[2022-05-15 21:43:30] [INFO ] Invariants computation overflowed in 51 ms
Incomplete random walk after 1000000 steps, including 128368 resets, run finished after 1670 ms. (steps per millisecond=598 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84766 resets, run finished after 1144 ms. (steps per millisecond=874 ) properties (out of 1) seen :0
// Phase 1: matrix 2296 rows 2395 cols
[2022-05-15 21:43:33] [INFO ] Invariants computation overflowed in 49 ms
[2022-05-15 21:43:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:43:35] [INFO ] [Real]Absence check using state equation in 1654 ms returned sat
[2022-05-15 21:43:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:43:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:43:37] [INFO ] [Nat]Absence check using state equation in 1659 ms returned sat
[2022-05-15 21:43:37] [INFO ] State equation strengthened by 409 read => feed constraints.
[2022-05-15 21:43:42] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-15 21:43:45] [INFO ] [Nat]Added 409 Read/Feed constraints in 7563 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2395 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2395/2395 places, 2296/2296 transitions.
Applied a total of 0 rules in 223 ms. Remains 2395 /2395 variables (removed 0) and now considering 2296/2296 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2395/2395 places, 2296/2296 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2395/2395 places, 2296/2296 transitions.
Applied a total of 0 rules in 212 ms. Remains 2395 /2395 variables (removed 0) and now considering 2296/2296 (removed 0) transitions.
// Phase 1: matrix 2296 rows 2395 cols
[2022-05-15 21:43:45] [INFO ] Invariants computation overflowed in 46 ms
[2022-05-15 21:44:07] [INFO ] Implicit Places using invariants in 22076 ms returned []
// Phase 1: matrix 2296 rows 2395 cols
[2022-05-15 21:44:07] [INFO ] Invariants computation overflowed in 44 ms
[2022-05-15 21:44:30] [INFO ] Implicit Places using invariants and state equation in 22927 ms returned []
Implicit Place search using SMT with State Equation took 45031 ms to find 0 implicit places.
[2022-05-15 21:44:30] [INFO ] Redundant transitions in 91 ms returned []
// Phase 1: matrix 2296 rows 2395 cols
[2022-05-15 21:44:30] [INFO ] Invariants computation overflowed in 47 ms
[2022-05-15 21:44:32] [INFO ] Dead Transitions using invariants and state equation in 1560 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2395/2395 places, 2296/2296 transitions.
Ending property specific reduction for DoubleExponent-PT-100-UpperBounds-14 in 71520 ms.
Starting property specific reduction for DoubleExponent-PT-100-UpperBounds-15
// Phase 1: matrix 2307 rows 2412 cols
[2022-05-15 21:44:32] [INFO ] Invariants computation overflowed in 40 ms
Incomplete random walk after 10000 steps, including 1265 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 851 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
// Phase 1: matrix 2307 rows 2412 cols
[2022-05-15 21:44:32] [INFO ] Invariants computation overflowed in 43 ms
[2022-05-15 21:44:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:44:37] [INFO ] [Real]Absence check using state equation in 4810 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2412 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2412/2412 places, 2307/2307 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 77 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 2404 transition count 2299
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 6 places in 81 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 28 place count 2398 transition count 2300
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 31 place count 2398 transition count 2297
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 34 place count 2395 transition count 2297
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 2395 transition count 2297
Applied a total of 39 rules in 907 ms. Remains 2395 /2412 variables (removed 17) and now considering 2297/2307 (removed 10) transitions.
Finished structural reductions, in 1 iterations. Remains : 2395/2412 places, 2297/2307 transitions.
// Phase 1: matrix 2297 rows 2395 cols
[2022-05-15 21:44:38] [INFO ] Invariants computation overflowed in 55 ms
Incomplete random walk after 1000000 steps, including 128535 resets, run finished after 1632 ms. (steps per millisecond=612 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84798 resets, run finished after 1145 ms. (steps per millisecond=873 ) properties (out of 1) seen :0
// Phase 1: matrix 2297 rows 2395 cols
[2022-05-15 21:44:41] [INFO ] Invariants computation overflowed in 50 ms
[2022-05-15 21:44:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:44:45] [INFO ] [Real]Absence check using state equation in 3623 ms returned sat
[2022-05-15 21:44:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:44:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:44:52] [INFO ] [Nat]Absence check using state equation in 6649 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2395 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2395/2395 places, 2297/2297 transitions.
Applied a total of 0 rules in 202 ms. Remains 2395 /2395 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2395/2395 places, 2297/2297 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2395/2395 places, 2297/2297 transitions.
Applied a total of 0 rules in 192 ms. Remains 2395 /2395 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
// Phase 1: matrix 2297 rows 2395 cols
[2022-05-15 21:44:52] [INFO ] Invariants computation overflowed in 56 ms
[2022-05-15 21:45:14] [INFO ] Implicit Places using invariants in 22341 ms returned []
// Phase 1: matrix 2297 rows 2395 cols
[2022-05-15 21:45:14] [INFO ] Invariants computation overflowed in 47 ms
[2022-05-15 21:45:37] [INFO ] Implicit Places using invariants and state equation in 22194 ms returned []
Implicit Place search using SMT with State Equation took 44571 ms to find 0 implicit places.
[2022-05-15 21:45:37] [INFO ] Redundant transitions in 89 ms returned []
// Phase 1: matrix 2297 rows 2395 cols
[2022-05-15 21:45:37] [INFO ] Invariants computation overflowed in 48 ms
[2022-05-15 21:45:38] [INFO ] Dead Transitions using invariants and state equation in 1571 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2395/2395 places, 2297/2297 transitions.
Ending property specific reduction for DoubleExponent-PT-100-UpperBounds-15 in 66572 ms.
[2022-05-15 21:45:40] [INFO ] Flatten gal took : 1766 ms
[2022-05-15 21:45:41] [INFO ] Applying decomposition
[2022-05-15 21:45:42] [INFO ] Flatten gal took : 1181 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/graph514935310390855188.txt' '-o' '/tmp/graph514935310390855188.bin' '-w' '/tmp/graph514935310390855188.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph514935310390855188.bin' '-l' '-1' '-v' '-w' '/tmp/graph514935310390855188.weights' '-q' '0' '-e' '0.001'
[2022-05-15 21:45:44] [INFO ] Decomposing Gal with order
[2022-05-15 21:45:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 21:45:46] [INFO ] Removed a total of 4712 redundant transitions.
[2022-05-15 21:45:47] [INFO ] Flatten gal took : 2077 ms
[2022-05-15 21:45:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 810 labels/synchronizations in 319 ms.
[2022-05-15 21:45:48] [INFO ] Time to serialize gal into /tmp/UpperBounds2408961012747877710.gal : 171 ms
[2022-05-15 21:45:48] [INFO ] Time to serialize properties into /tmp/UpperBounds12082889007288431608.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/UpperBounds2408961012747877710.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12082889007288431608.prop' '--nowitness'

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...275
Loading property file /tmp/UpperBounds12082889007288431608.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="DoubleExponent-PT-100"
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 DoubleExponent-PT-100, 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 r078-tall-165260110000213"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-100.tgz
mv DoubleExponent-PT-100 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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;