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.r312-tall-165472282200437.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 FunctionPointer-PT-b008, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472282200437
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 840K
-rw-r--r-- 1 mcc users 6.0K Jun 7 17:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Jun 7 17:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 7 17:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K Jun 7 17:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 6 15:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 6 15:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 6 15:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 8.4K Jun 7 17:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Jun 7 17:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 7 17:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Jun 7 17:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 15:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 5 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 391K Jun 6 12:11 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 FunctionPointer-PT-b008-UpperBounds-00
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-01
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-02
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-03
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-04
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-05
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-06
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-07
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-08
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-09
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-10
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-11
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-12
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-13
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-14
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654835169736

Running Version 202205111006
[2022-06-10 04:26:10] [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-06-10 04:26:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 04:26:11] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2022-06-10 04:26:11] [INFO ] Transformed 306 places.
[2022-06-10 04:26:11] [INFO ] Transformed 840 transitions.
[2022-06-10 04:26:11] [INFO ] Parsed PT model containing 306 places and 840 transitions in 233 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 84 places in 6 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b008-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 414 out of 648 initially.
// Phase 1: matrix 414 rows 222 cols
[2022-06-10 04:26:11] [INFO ] Computed 4 place invariants in 27 ms
Incomplete random walk after 10000 steps, including 7 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 14) seen :48
FORMULA FunctionPointer-PT-b008-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b008-UpperBounds-00 8 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 12) seen :9
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 12) seen :13
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 12) seen :18
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 12) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 12) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 12) seen :15
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 12) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 12) seen :16
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 12) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 12) seen :16
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 12) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 12) seen :17
[2022-06-10 04:26:11] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
// Phase 1: matrix 414 rows 222 cols
[2022-06-10 04:26:11] [INFO ] Computed 4 place invariants in 4 ms
[2022-06-10 04:26:11] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-10 04:26:11] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-10 04:26:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:11] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2022-06-10 04:26:11] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:26:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 04:26:11] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 04:26:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:11] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2022-06-10 04:26:11] [INFO ] State equation strengthened by 65 read => feed constraints.
[2022-06-10 04:26:11] [INFO ] [Nat]Added 65 Read/Feed constraints in 10 ms returned sat
[2022-06-10 04:26:11] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 60 ms.
[2022-06-10 04:26:12] [INFO ] Added : 0 causal constraints over 0 iterations in 102 ms. Result :sat
Minimization took 29 ms.
[2022-06-10 04:26:12] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 04:26:12] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 04:26:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:12] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2022-06-10 04:26:12] [INFO ] [Real]Added 65 Read/Feed constraints in 12 ms returned sat
[2022-06-10 04:26:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:26:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 04:26:12] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 04:26:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:12] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2022-06-10 04:26:12] [INFO ] [Nat]Added 65 Read/Feed constraints in 11 ms returned sat
[2022-06-10 04:26:12] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 7 ms to minimize.
[2022-06-10 04:26:12] [INFO ] Deduced a trap composed of 59 places in 107 ms of which 1 ms to minimize.
[2022-06-10 04:26:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 269 ms
[2022-06-10 04:26:12] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 53 ms.
[2022-06-10 04:26:12] [INFO ] Added : 2 causal constraints over 1 iterations in 103 ms. Result :sat
Minimization took 27 ms.
[2022-06-10 04:26:12] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 04:26:12] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 04:26:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:12] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2022-06-10 04:26:12] [INFO ] [Real]Added 65 Read/Feed constraints in 11 ms returned sat
[2022-06-10 04:26:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:26:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-10 04:26:13] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 04:26:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:13] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2022-06-10 04:26:13] [INFO ] [Nat]Added 65 Read/Feed constraints in 9 ms returned sat
[2022-06-10 04:26:13] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 1 ms to minimize.
[2022-06-10 04:26:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2022-06-10 04:26:13] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 40 ms.
[2022-06-10 04:26:13] [INFO ] Added : 1 causal constraints over 1 iterations in 88 ms. Result :sat
Minimization took 30 ms.
[2022-06-10 04:26:13] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 04:26:13] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 04:26:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:13] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2022-06-10 04:26:13] [INFO ] [Real]Added 65 Read/Feed constraints in 12 ms returned sat
[2022-06-10 04:26:13] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:26:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 04:26:13] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 04:26:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:13] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2022-06-10 04:26:13] [INFO ] [Nat]Added 65 Read/Feed constraints in 10 ms returned sat
[2022-06-10 04:26:13] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 1 ms to minimize.
[2022-06-10 04:26:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2022-06-10 04:26:13] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 34 ms.
[2022-06-10 04:26:13] [INFO ] Added : 2 causal constraints over 1 iterations in 91 ms. Result :sat
Minimization took 28 ms.
[2022-06-10 04:26:13] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 04:26:13] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 04:26:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:14] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2022-06-10 04:26:14] [INFO ] [Real]Added 65 Read/Feed constraints in 7 ms returned sat
[2022-06-10 04:26:14] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:26:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 04:26:14] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 04:26:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:14] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2022-06-10 04:26:14] [INFO ] [Nat]Added 65 Read/Feed constraints in 11 ms returned sat
[2022-06-10 04:26:14] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 1 ms to minimize.
[2022-06-10 04:26:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2022-06-10 04:26:14] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 30 ms.
[2022-06-10 04:26:14] [INFO ] Added : 2 causal constraints over 1 iterations in 85 ms. Result :sat
Minimization took 27 ms.
[2022-06-10 04:26:14] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 04:26:14] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 04:26:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:14] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2022-06-10 04:26:14] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:26:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 04:26:14] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 04:26:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:14] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2022-06-10 04:26:14] [INFO ] [Nat]Added 65 Read/Feed constraints in 10 ms returned sat
[2022-06-10 04:26:14] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 34 ms.
[2022-06-10 04:26:14] [INFO ] Added : 3 causal constraints over 1 iterations in 90 ms. Result :sat
Minimization took 51 ms.
[2022-06-10 04:26:14] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 04:26:14] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 04:26:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:14] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2022-06-10 04:26:14] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:26:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 04:26:14] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 04:26:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:15] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2022-06-10 04:26:15] [INFO ] [Nat]Added 65 Read/Feed constraints in 11 ms returned sat
[2022-06-10 04:26:15] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 0 ms to minimize.
[2022-06-10 04:26:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2022-06-10 04:26:15] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 25 ms.
[2022-06-10 04:26:15] [INFO ] Added : 2 causal constraints over 1 iterations in 78 ms. Result :sat
Minimization took 32 ms.
[2022-06-10 04:26:15] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 04:26:15] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 04:26:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:15] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2022-06-10 04:26:15] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:26:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 04:26:15] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 04:26:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:15] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2022-06-10 04:26:15] [INFO ] [Nat]Added 65 Read/Feed constraints in 8 ms returned sat
[2022-06-10 04:26:15] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 27 ms.
[2022-06-10 04:26:15] [INFO ] Added : 2 causal constraints over 1 iterations in 78 ms. Result :sat
Minimization took 29 ms.
[2022-06-10 04:26:15] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-10 04:26:15] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 04:26:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:15] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2022-06-10 04:26:15] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:26:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 04:26:15] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 04:26:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:15] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2022-06-10 04:26:15] [INFO ] [Nat]Added 65 Read/Feed constraints in 10 ms returned sat
[2022-06-10 04:26:16] [INFO ] Deduced a trap composed of 51 places in 100 ms of which 1 ms to minimize.
[2022-06-10 04:26:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2022-06-10 04:26:16] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 28 ms.
[2022-06-10 04:26:16] [INFO ] Added : 2 causal constraints over 1 iterations in 77 ms. Result :sat
Minimization took 32 ms.
[2022-06-10 04:26:16] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-10 04:26:16] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 04:26:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:16] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2022-06-10 04:26:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:26:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-10 04:26:16] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 4 ms returned sat
[2022-06-10 04:26:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:16] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2022-06-10 04:26:16] [INFO ] [Nat]Added 65 Read/Feed constraints in 9 ms returned sat
[2022-06-10 04:26:16] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 0 ms to minimize.
[2022-06-10 04:26:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2022-06-10 04:26:16] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 25 ms.
[2022-06-10 04:26:16] [INFO ] Added : 2 causal constraints over 1 iterations in 71 ms. Result :sat
Minimization took 24 ms.
[2022-06-10 04:26:16] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 04:26:16] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-10 04:26:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:16] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2022-06-10 04:26:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:26:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-10 04:26:16] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 04:26:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:16] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2022-06-10 04:26:16] [INFO ] [Nat]Added 65 Read/Feed constraints in 9 ms returned sat
[2022-06-10 04:26:16] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 26 ms.
[2022-06-10 04:26:16] [INFO ] Added : 2 causal constraints over 1 iterations in 71 ms. Result :sat
Minimization took 27 ms.
[2022-06-10 04:26:17] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 04:26:17] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 04:26:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:17] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2022-06-10 04:26:17] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:26:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 04:26:17] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 04:26:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:17] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2022-06-10 04:26:17] [INFO ] [Nat]Added 65 Read/Feed constraints in 11 ms returned sat
[2022-06-10 04:26:17] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 30 ms.
[2022-06-10 04:26:17] [INFO ] Added : 1 causal constraints over 1 iterations in 75 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : [8, -1, -1, -1, -1, 8, -1, 8, 8, 8, 8, -1] Max seen :[3, 10, 1, 9, 5, 2, 7, 3, 7, 6, 3, 1]
FORMULA FunctionPointer-PT-b008-UpperBounds-01 8 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 11 out of 222 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 222/222 places, 648/648 transitions.
Graph (complete) has 932 edges and 222 vertex of which 194 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.6 ms
Discarding 28 places :
Also discarding 0 output transitions
Drop transitions removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 194 transition count 610
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 67 place count 166 transition count 450
Iterating global reduction 1 with 28 rules applied. Total rules applied 95 place count 166 transition count 450
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 125 place count 166 transition count 420
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 139 place count 152 transition count 392
Iterating global reduction 2 with 14 rules applied. Total rules applied 153 place count 152 transition count 392
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 159 place count 146 transition count 380
Iterating global reduction 2 with 6 rules applied. Total rules applied 165 place count 146 transition count 380
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 171 place count 140 transition count 356
Iterating global reduction 2 with 6 rules applied. Total rules applied 177 place count 140 transition count 356
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 183 place count 134 transition count 344
Iterating global reduction 2 with 6 rules applied. Total rules applied 189 place count 134 transition count 344
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 194 place count 129 transition count 324
Iterating global reduction 2 with 5 rules applied. Total rules applied 199 place count 129 transition count 324
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 204 place count 124 transition count 304
Iterating global reduction 2 with 5 rules applied. Total rules applied 209 place count 124 transition count 304
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 214 place count 119 transition count 294
Iterating global reduction 2 with 5 rules applied. Total rules applied 219 place count 119 transition count 294
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 224 place count 114 transition count 284
Iterating global reduction 2 with 5 rules applied. Total rules applied 229 place count 114 transition count 284
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 234 place count 109 transition count 274
Iterating global reduction 2 with 5 rules applied. Total rules applied 239 place count 109 transition count 274
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 244 place count 104 transition count 264
Iterating global reduction 2 with 5 rules applied. Total rules applied 249 place count 104 transition count 264
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 254 place count 99 transition count 254
Iterating global reduction 2 with 5 rules applied. Total rules applied 259 place count 99 transition count 254
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 265 place count 99 transition count 248
Applied a total of 265 rules in 129 ms. Remains 99 /222 variables (removed 123) and now considering 248/648 (removed 400) transitions.
Finished structural reductions, in 1 iterations. Remains : 99/222 places, 248/648 transitions.
Normalized transition count is 158 out of 248 initially.
// Phase 1: matrix 158 rows 99 cols
[2022-06-10 04:26:17] [INFO ] Computed 3 place invariants in 1 ms
Incomplete random walk after 1000004 steps, including 2 resets, run finished after 1178 ms. (steps per millisecond=848 ) properties (out of 11) seen :93
FORMULA FunctionPointer-PT-b008-UpperBounds-10 8 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 534 ms. (steps per millisecond=1872 ) properties (out of 10) seen :38
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 548 ms. (steps per millisecond=1824 ) properties (out of 10) seen :269
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 539 ms. (steps per millisecond=1855 ) properties (out of 10) seen :40
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 524 ms. (steps per millisecond=1908 ) properties (out of 10) seen :545
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 493 ms. (steps per millisecond=2028 ) properties (out of 10) seen :34
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 557 ms. (steps per millisecond=1795 ) properties (out of 10) seen :407
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 510 ms. (steps per millisecond=1960 ) properties (out of 10) seen :33
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 488 ms. (steps per millisecond=2049 ) properties (out of 10) seen :22
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 580 ms. (steps per millisecond=1724 ) properties (out of 10) seen :35
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 532 ms. (steps per millisecond=1879 ) properties (out of 10) seen :267
[2022-06-10 04:26:24] [INFO ] Flow matrix only has 158 transitions (discarded 90 similar events)
// Phase 1: matrix 158 rows 99 cols
[2022-06-10 04:26:24] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 04:26:24] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:26:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:24] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2022-06-10 04:26:24] [INFO ] State equation strengthened by 27 read => feed constraints.
[2022-06-10 04:26:24] [INFO ] [Real]Added 27 Read/Feed constraints in 5 ms returned sat
[2022-06-10 04:26:24] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:26:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 04:26:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:24] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2022-06-10 04:26:24] [INFO ] [Nat]Added 27 Read/Feed constraints in 6 ms returned sat
[2022-06-10 04:26:24] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 0 ms to minimize.
[2022-06-10 04:26:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2022-06-10 04:26:24] [INFO ] Computed and/alt/rep : 66/321/61 causal constraints (skipped 95 transitions) in 9 ms.
[2022-06-10 04:26:24] [INFO ] Added : 14 causal constraints over 4 iterations in 66 ms. Result :sat
Minimization took 16 ms.
[2022-06-10 04:26:24] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 04:26:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:24] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2022-06-10 04:26:24] [INFO ] [Real]Added 27 Read/Feed constraints in 6 ms returned sat
[2022-06-10 04:26:24] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:26:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:26:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:24] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2022-06-10 04:26:24] [INFO ] [Nat]Added 27 Read/Feed constraints in 6 ms returned sat
[2022-06-10 04:26:24] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 0 ms to minimize.
[2022-06-10 04:26:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2022-06-10 04:26:24] [INFO ] Computed and/alt/rep : 66/321/61 causal constraints (skipped 95 transitions) in 10 ms.
[2022-06-10 04:26:24] [INFO ] Added : 21 causal constraints over 5 iterations in 69 ms. Result :sat
Minimization took 19 ms.
[2022-06-10 04:26:24] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 04:26:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:24] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2022-06-10 04:26:24] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2022-06-10 04:26:24] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:26:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:26:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:24] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2022-06-10 04:26:24] [INFO ] [Nat]Added 27 Read/Feed constraints in 5 ms returned sat
[2022-06-10 04:26:24] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 0 ms to minimize.
[2022-06-10 04:26:25] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 0 ms to minimize.
[2022-06-10 04:26:25] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2022-06-10 04:26:25] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 0 ms to minimize.
[2022-06-10 04:26:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 218 ms
[2022-06-10 04:26:25] [INFO ] Computed and/alt/rep : 66/321/61 causal constraints (skipped 95 transitions) in 9 ms.
[2022-06-10 04:26:25] [INFO ] Added : 9 causal constraints over 2 iterations in 38 ms. Result :sat
Minimization took 15 ms.
[2022-06-10 04:26:25] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:26:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:25] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2022-06-10 04:26:25] [INFO ] [Real]Added 27 Read/Feed constraints in 3 ms returned sat
[2022-06-10 04:26:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:26:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:26:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:25] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2022-06-10 04:26:25] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2022-06-10 04:26:25] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 0 ms to minimize.
[2022-06-10 04:26:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2022-06-10 04:26:25] [INFO ] Computed and/alt/rep : 66/321/61 causal constraints (skipped 95 transitions) in 10 ms.
[2022-06-10 04:26:25] [INFO ] Added : 15 causal constraints over 4 iterations in 68 ms. Result :sat
Minimization took 15 ms.
[2022-06-10 04:26:25] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 04:26:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:25] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2022-06-10 04:26:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:26:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:26:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:25] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2022-06-10 04:26:25] [INFO ] [Nat]Added 27 Read/Feed constraints in 5 ms returned sat
[2022-06-10 04:26:25] [INFO ] Computed and/alt/rep : 66/321/61 causal constraints (skipped 95 transitions) in 9 ms.
[2022-06-10 04:26:25] [INFO ] Added : 3 causal constraints over 1 iterations in 36 ms. Result :sat
Minimization took 13 ms.
[2022-06-10 04:26:25] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-10 04:26:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:25] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2022-06-10 04:26:25] [INFO ] [Real]Added 27 Read/Feed constraints in 5 ms returned sat
[2022-06-10 04:26:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:26:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:26:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:25] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2022-06-10 04:26:25] [INFO ] [Nat]Added 27 Read/Feed constraints in 5 ms returned sat
[2022-06-10 04:26:25] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2022-06-10 04:26:25] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2022-06-10 04:26:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 123 ms
[2022-06-10 04:26:25] [INFO ] Computed and/alt/rep : 66/321/61 causal constraints (skipped 95 transitions) in 11 ms.
[2022-06-10 04:26:25] [INFO ] Added : 13 causal constraints over 4 iterations in 55 ms. Result :sat
Minimization took 15 ms.
[2022-06-10 04:26:26] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:26:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:26] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2022-06-10 04:26:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:26:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:26:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:26] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2022-06-10 04:26:26] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2022-06-10 04:26:26] [INFO ] Computed and/alt/rep : 66/321/61 causal constraints (skipped 95 transitions) in 9 ms.
[2022-06-10 04:26:26] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 0 ms to minimize.
[2022-06-10 04:26:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2022-06-10 04:26:26] [INFO ] Added : 20 causal constraints over 6 iterations in 139 ms. Result :sat
Minimization took 20 ms.
[2022-06-10 04:26:26] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:26:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:26] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2022-06-10 04:26:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:26:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 04:26:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:26] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2022-06-10 04:26:26] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2022-06-10 04:26:26] [INFO ] Computed and/alt/rep : 66/321/61 causal constraints (skipped 95 transitions) in 8 ms.
[2022-06-10 04:26:26] [INFO ] Added : 22 causal constraints over 7 iterations in 76 ms. Result :sat
Minimization took 29 ms.
[2022-06-10 04:26:26] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:26:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:26] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2022-06-10 04:26:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:26:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:26:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:26] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2022-06-10 04:26:26] [INFO ] [Nat]Added 27 Read/Feed constraints in 5 ms returned sat
[2022-06-10 04:26:26] [INFO ] Computed and/alt/rep : 66/321/61 causal constraints (skipped 95 transitions) in 9 ms.
[2022-06-10 04:26:26] [INFO ] Added : 2 causal constraints over 1 iterations in 27 ms. Result :sat
Minimization took 14 ms.
[2022-06-10 04:26:26] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:26:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:26] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2022-06-10 04:26:26] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2022-06-10 04:26:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:26:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:26:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:26] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2022-06-10 04:26:26] [INFO ] [Nat]Added 27 Read/Feed constraints in 5 ms returned sat
[2022-06-10 04:26:26] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 0 ms to minimize.
[2022-06-10 04:26:26] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2022-06-10 04:26:27] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2022-06-10 04:26:27] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2022-06-10 04:26:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 203 ms
[2022-06-10 04:26:27] [INFO ] Computed and/alt/rep : 66/321/61 causal constraints (skipped 95 transitions) in 8 ms.
[2022-06-10 04:26:27] [INFO ] Added : 34 causal constraints over 8 iterations in 106 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, 8, -1, 8, 8, 8, -1] Max seen :[10, 251, 9, 521, 6, 375, 7, 6, 7, 248]
FORMULA FunctionPointer-PT-b008-UpperBounds-14 8 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FunctionPointer-PT-b008-UpperBounds-08 8 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 8 out of 99 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 99/99 places, 248/248 transitions.
Applied a total of 0 rules in 17 ms. Remains 99 /99 variables (removed 0) and now considering 248/248 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 99/99 places, 248/248 transitions.
Normalized transition count is 158 out of 248 initially.
// Phase 1: matrix 158 rows 99 cols
[2022-06-10 04:26:30] [INFO ] Computed 3 place invariants in 2 ms
Incomplete random walk after 1000005 steps, including 2 resets, run finished after 1145 ms. (steps per millisecond=873 ) properties (out of 8) seen :37
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 569 ms. (steps per millisecond=1757 ) properties (out of 8) seen :27
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 539 ms. (steps per millisecond=1855 ) properties (out of 8) seen :209
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 529 ms. (steps per millisecond=1890 ) properties (out of 8) seen :33
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 534 ms. (steps per millisecond=1872 ) properties (out of 8) seen :550
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 474 ms. (steps per millisecond=2109 ) properties (out of 8) seen :556
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 542 ms. (steps per millisecond=1845 ) properties (out of 8) seen :28
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 520 ms. (steps per millisecond=1923 ) properties (out of 8) seen :31
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 526 ms. (steps per millisecond=1901 ) properties (out of 8) seen :185
[2022-06-10 04:26:36] [INFO ] Flow matrix only has 158 transitions (discarded 90 similar events)
// Phase 1: matrix 158 rows 99 cols
[2022-06-10 04:26:36] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-10 04:26:36] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 04:26:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:36] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-06-10 04:26:36] [INFO ] State equation strengthened by 27 read => feed constraints.
[2022-06-10 04:26:36] [INFO ] [Real]Added 27 Read/Feed constraints in 12 ms returned sat
[2022-06-10 04:26:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:26:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:26:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:36] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2022-06-10 04:26:36] [INFO ] [Nat]Added 27 Read/Feed constraints in 5 ms returned sat
[2022-06-10 04:26:36] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 0 ms to minimize.
[2022-06-10 04:26:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2022-06-10 04:26:36] [INFO ] Computed and/alt/rep : 66/321/61 causal constraints (skipped 95 transitions) in 8 ms.
[2022-06-10 04:26:36] [INFO ] Added : 14 causal constraints over 4 iterations in 65 ms. Result :sat
Minimization took 17 ms.
[2022-06-10 04:26:36] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 04:26:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:36] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-06-10 04:26:36] [INFO ] [Real]Added 27 Read/Feed constraints in 7 ms returned sat
[2022-06-10 04:26:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:26:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 04:26:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:36] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2022-06-10 04:26:36] [INFO ] [Nat]Added 27 Read/Feed constraints in 5 ms returned sat
[2022-06-10 04:26:36] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2022-06-10 04:26:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2022-06-10 04:26:36] [INFO ] Computed and/alt/rep : 66/321/61 causal constraints (skipped 95 transitions) in 8 ms.
[2022-06-10 04:26:36] [INFO ] Added : 21 causal constraints over 5 iterations in 73 ms. Result :sat
Minimization took 16 ms.
[2022-06-10 04:26:36] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 04:26:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:36] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2022-06-10 04:26:36] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2022-06-10 04:26:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:26:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:26:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:36] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2022-06-10 04:26:36] [INFO ] [Nat]Added 27 Read/Feed constraints in 8 ms returned sat
[2022-06-10 04:26:36] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2022-06-10 04:26:36] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 0 ms to minimize.
[2022-06-10 04:26:36] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2022-06-10 04:26:37] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2022-06-10 04:26:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 194 ms
[2022-06-10 04:26:37] [INFO ] Computed and/alt/rep : 66/321/61 causal constraints (skipped 95 transitions) in 8 ms.
[2022-06-10 04:26:37] [INFO ] Added : 9 causal constraints over 2 iterations in 45 ms. Result :sat
Minimization took 22 ms.
[2022-06-10 04:26:37] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 04:26:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:37] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-06-10 04:26:37] [INFO ] [Real]Added 27 Read/Feed constraints in 3 ms returned sat
[2022-06-10 04:26:37] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:26:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 04:26:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:37] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2022-06-10 04:26:37] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2022-06-10 04:26:37] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 0 ms to minimize.
[2022-06-10 04:26:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2022-06-10 04:26:37] [INFO ] Computed and/alt/rep : 66/321/61 causal constraints (skipped 95 transitions) in 10 ms.
[2022-06-10 04:26:37] [INFO ] Added : 15 causal constraints over 4 iterations in 57 ms. Result :sat
Minimization took 15 ms.
[2022-06-10 04:26:37] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 04:26:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:37] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-06-10 04:26:37] [INFO ] [Real]Added 27 Read/Feed constraints in 6 ms returned sat
[2022-06-10 04:26:37] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:26:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:26:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:37] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2022-06-10 04:26:37] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2022-06-10 04:26:37] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 0 ms to minimize.
[2022-06-10 04:26:37] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2022-06-10 04:26:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 105 ms
[2022-06-10 04:26:37] [INFO ] Computed and/alt/rep : 66/321/61 causal constraints (skipped 95 transitions) in 7 ms.
[2022-06-10 04:26:37] [INFO ] Added : 13 causal constraints over 4 iterations in 51 ms. Result :sat
Minimization took 16 ms.
[2022-06-10 04:26:37] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 04:26:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:37] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2022-06-10 04:26:37] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:26:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:26:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:37] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2022-06-10 04:26:37] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2022-06-10 04:26:37] [INFO ] Computed and/alt/rep : 66/321/61 causal constraints (skipped 95 transitions) in 8 ms.
[2022-06-10 04:26:37] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2022-06-10 04:26:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2022-06-10 04:26:37] [INFO ] Added : 20 causal constraints over 6 iterations in 127 ms. Result :sat
Minimization took 20 ms.
[2022-06-10 04:26:37] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:26:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:38] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-06-10 04:26:38] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:26:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:26:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:38] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2022-06-10 04:26:38] [INFO ] [Nat]Added 27 Read/Feed constraints in 5 ms returned sat
[2022-06-10 04:26:38] [INFO ] Computed and/alt/rep : 66/321/61 causal constraints (skipped 95 transitions) in 8 ms.
[2022-06-10 04:26:38] [INFO ] Added : 22 causal constraints over 7 iterations in 76 ms. Result :sat
Minimization took 30 ms.
[2022-06-10 04:26:38] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:26:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:38] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-06-10 04:26:38] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2022-06-10 04:26:38] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:26:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:26:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:38] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2022-06-10 04:26:38] [INFO ] [Nat]Added 27 Read/Feed constraints in 6 ms returned sat
[2022-06-10 04:26:38] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2022-06-10 04:26:38] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2022-06-10 04:26:38] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 2 ms to minimize.
[2022-06-10 04:26:38] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2022-06-10 04:26:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 214 ms
[2022-06-10 04:26:38] [INFO ] Computed and/alt/rep : 66/321/61 causal constraints (skipped 95 transitions) in 8 ms.
[2022-06-10 04:26:38] [INFO ] Added : 34 causal constraints over 8 iterations in 91 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, 8, 8, -1] Max seen :[10, 251, 9, 521, 541, 7, 6, 248]
Support contains 8 out of 99 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 99/99 places, 248/248 transitions.
Applied a total of 0 rules in 7 ms. Remains 99 /99 variables (removed 0) and now considering 248/248 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 99/99 places, 248/248 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 99/99 places, 248/248 transitions.
Applied a total of 0 rules in 7 ms. Remains 99 /99 variables (removed 0) and now considering 248/248 (removed 0) transitions.
[2022-06-10 04:26:42] [INFO ] Flow matrix only has 158 transitions (discarded 90 similar events)
// Phase 1: matrix 158 rows 99 cols
[2022-06-10 04:26:42] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 04:26:42] [INFO ] Implicit Places using invariants in 128 ms returned []
[2022-06-10 04:26:42] [INFO ] Flow matrix only has 158 transitions (discarded 90 similar events)
// Phase 1: matrix 158 rows 99 cols
[2022-06-10 04:26:42] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-10 04:26:42] [INFO ] State equation strengthened by 27 read => feed constraints.
[2022-06-10 04:26:42] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
[2022-06-10 04:26:42] [INFO ] Redundant transitions in 11 ms returned []
[2022-06-10 04:26:42] [INFO ] Flow matrix only has 158 transitions (discarded 90 similar events)
// Phase 1: matrix 158 rows 99 cols
[2022-06-10 04:26:42] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-10 04:26:42] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 99/99 places, 248/248 transitions.
Normalized transition count is 158 out of 248 initially.
// Phase 1: matrix 158 rows 99 cols
[2022-06-10 04:26:42] [INFO ] Computed 3 place invariants in 1 ms
Incomplete random walk after 1000003 steps, including 2 resets, run finished after 1041 ms. (steps per millisecond=960 ) properties (out of 8) seen :52
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 589 ms. (steps per millisecond=1697 ) properties (out of 8) seen :28
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 501 ms. (steps per millisecond=1996 ) properties (out of 8) seen :112
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 563 ms. (steps per millisecond=1776 ) properties (out of 8) seen :26
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 526 ms. (steps per millisecond=1901 ) properties (out of 8) seen :413
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 571 ms. (steps per millisecond=1751 ) properties (out of 8) seen :371
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 558 ms. (steps per millisecond=1792 ) properties (out of 8) seen :31
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 496 ms. (steps per millisecond=2016 ) properties (out of 8) seen :32
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 560 ms. (steps per millisecond=1785 ) properties (out of 8) seen :211
[2022-06-10 04:26:48] [INFO ] Flow matrix only has 158 transitions (discarded 90 similar events)
// Phase 1: matrix 158 rows 99 cols
[2022-06-10 04:26:48] [INFO ] Computed 3 place invariants in 8 ms
[2022-06-10 04:26:48] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:26:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:48] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2022-06-10 04:26:48] [INFO ] State equation strengthened by 27 read => feed constraints.
[2022-06-10 04:26:48] [INFO ] [Real]Added 27 Read/Feed constraints in 5 ms returned sat
[2022-06-10 04:26:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:26:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:26:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:48] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2022-06-10 04:26:48] [INFO ] [Nat]Added 27 Read/Feed constraints in 6 ms returned sat
[2022-06-10 04:26:48] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 0 ms to minimize.
[2022-06-10 04:26:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2022-06-10 04:26:48] [INFO ] Computed and/alt/rep : 66/321/61 causal constraints (skipped 95 transitions) in 9 ms.
[2022-06-10 04:26:48] [INFO ] Added : 14 causal constraints over 4 iterations in 53 ms. Result :sat
Minimization took 15 ms.
[2022-06-10 04:26:48] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:26:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:48] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2022-06-10 04:26:48] [INFO ] [Real]Added 27 Read/Feed constraints in 6 ms returned sat
[2022-06-10 04:26:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:26:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 04:26:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:48] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2022-06-10 04:26:48] [INFO ] [Nat]Added 27 Read/Feed constraints in 6 ms returned sat
[2022-06-10 04:26:48] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 0 ms to minimize.
[2022-06-10 04:26:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2022-06-10 04:26:48] [INFO ] Computed and/alt/rep : 66/321/61 causal constraints (skipped 95 transitions) in 9 ms.
[2022-06-10 04:26:48] [INFO ] Added : 21 causal constraints over 5 iterations in 68 ms. Result :sat
Minimization took 22 ms.
[2022-06-10 04:26:48] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 04:26:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:48] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2022-06-10 04:26:48] [INFO ] [Real]Added 27 Read/Feed constraints in 5 ms returned sat
[2022-06-10 04:26:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:26:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:26:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:48] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2022-06-10 04:26:48] [INFO ] [Nat]Added 27 Read/Feed constraints in 6 ms returned sat
[2022-06-10 04:26:48] [INFO ] Computed and/alt/rep : 66/321/61 causal constraints (skipped 95 transitions) in 10 ms.
[2022-06-10 04:26:49] [INFO ] Added : 14 causal constraints over 4 iterations in 55 ms. Result :sat
Minimization took 15 ms.
[2022-06-10 04:26:49] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:26:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:49] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-06-10 04:26:49] [INFO ] [Real]Added 27 Read/Feed constraints in 3 ms returned sat
[2022-06-10 04:26:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:26:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:26:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:49] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2022-06-10 04:26:49] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2022-06-10 04:26:49] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2022-06-10 04:26:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2022-06-10 04:26:49] [INFO ] Computed and/alt/rep : 66/321/61 causal constraints (skipped 95 transitions) in 11 ms.
[2022-06-10 04:26:49] [INFO ] Added : 15 causal constraints over 4 iterations in 57 ms. Result :sat
Minimization took 14 ms.
[2022-06-10 04:26:49] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:26:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:49] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-06-10 04:26:49] [INFO ] [Real]Added 27 Read/Feed constraints in 6 ms returned sat
[2022-06-10 04:26:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:26:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:26:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:49] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2022-06-10 04:26:49] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2022-06-10 04:26:49] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 0 ms to minimize.
[2022-06-10 04:26:49] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 0 ms to minimize.
[2022-06-10 04:26:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 101 ms
[2022-06-10 04:26:49] [INFO ] Computed and/alt/rep : 66/321/61 causal constraints (skipped 95 transitions) in 9 ms.
[2022-06-10 04:26:49] [INFO ] Added : 13 causal constraints over 4 iterations in 54 ms. Result :sat
Minimization took 18 ms.
[2022-06-10 04:26:49] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:26:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:49] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2022-06-10 04:26:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:26:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:26:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:49] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2022-06-10 04:26:49] [INFO ] [Nat]Added 27 Read/Feed constraints in 6 ms returned sat
[2022-06-10 04:26:49] [INFO ] Computed and/alt/rep : 66/321/61 causal constraints (skipped 95 transitions) in 10 ms.
[2022-06-10 04:26:49] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2022-06-10 04:26:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2022-06-10 04:26:49] [INFO ] Added : 20 causal constraints over 6 iterations in 128 ms. Result :sat
Minimization took 21 ms.
[2022-06-10 04:26:49] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:26:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:49] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2022-06-10 04:26:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:26:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:26:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:49] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2022-06-10 04:26:50] [INFO ] [Nat]Added 27 Read/Feed constraints in 7 ms returned sat
[2022-06-10 04:26:50] [INFO ] Computed and/alt/rep : 66/321/61 causal constraints (skipped 95 transitions) in 10 ms.
[2022-06-10 04:26:50] [INFO ] Added : 22 causal constraints over 7 iterations in 78 ms. Result :sat
Minimization took 30 ms.
[2022-06-10 04:26:50] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:26:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:50] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-06-10 04:26:50] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2022-06-10 04:26:50] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:26:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:26:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:50] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2022-06-10 04:26:50] [INFO ] [Nat]Added 27 Read/Feed constraints in 5 ms returned sat
[2022-06-10 04:26:50] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 0 ms to minimize.
[2022-06-10 04:26:50] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2022-06-10 04:26:50] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2022-06-10 04:26:50] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2022-06-10 04:26:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 191 ms
[2022-06-10 04:26:50] [INFO ] Computed and/alt/rep : 66/321/61 causal constraints (skipped 95 transitions) in 8 ms.
[2022-06-10 04:26:50] [INFO ] Added : 34 causal constraints over 8 iterations in 91 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, 8, 8, -1] Max seen :[10, 251, 10, 521, 541, 7, 6, 248]
Support contains 8 out of 99 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 99/99 places, 248/248 transitions.
Applied a total of 0 rules in 6 ms. Remains 99 /99 variables (removed 0) and now considering 248/248 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 99/99 places, 248/248 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 99/99 places, 248/248 transitions.
Applied a total of 0 rules in 6 ms. Remains 99 /99 variables (removed 0) and now considering 248/248 (removed 0) transitions.
[2022-06-10 04:26:54] [INFO ] Flow matrix only has 158 transitions (discarded 90 similar events)
// Phase 1: matrix 158 rows 99 cols
[2022-06-10 04:26:54] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-10 04:26:54] [INFO ] Implicit Places using invariants in 72 ms returned []
[2022-06-10 04:26:54] [INFO ] Flow matrix only has 158 transitions (discarded 90 similar events)
// Phase 1: matrix 158 rows 99 cols
[2022-06-10 04:26:54] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-10 04:26:54] [INFO ] State equation strengthened by 27 read => feed constraints.
[2022-06-10 04:26:54] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2022-06-10 04:26:54] [INFO ] Redundant transitions in 6 ms returned []
[2022-06-10 04:26:54] [INFO ] Flow matrix only has 158 transitions (discarded 90 similar events)
// Phase 1: matrix 158 rows 99 cols
[2022-06-10 04:26:54] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 04:26:55] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 99/99 places, 248/248 transitions.
Starting property specific reduction for FunctionPointer-PT-b008-UpperBounds-03
Normalized transition count is 158 out of 248 initially.
// Phase 1: matrix 158 rows 99 cols
[2022-06-10 04:26:55] [INFO ] Computed 3 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :6
[2022-06-10 04:26:55] [INFO ] Flow matrix only has 158 transitions (discarded 90 similar events)
// Phase 1: matrix 158 rows 99 cols
[2022-06-10 04:26:55] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-10 04:26:55] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:26:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:55] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2022-06-10 04:26:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:26:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:26:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:55] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2022-06-10 04:26:55] [INFO ] State equation strengthened by 27 read => feed constraints.
[2022-06-10 04:26:55] [INFO ] [Nat]Added 27 Read/Feed constraints in 5 ms returned sat
[2022-06-10 04:26:55] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 0 ms to minimize.
[2022-06-10 04:26:55] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2022-06-10 04:26:55] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2022-06-10 04:26:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 161 ms
[2022-06-10 04:26:55] [INFO ] Computed and/alt/rep : 66/321/61 causal constraints (skipped 95 transitions) in 8 ms.
[2022-06-10 04:26:55] [INFO ] Added : 4 causal constraints over 2 iterations in 33 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[6]
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 99/99 places, 248/248 transitions.
Graph (complete) has 420 edges and 99 vertex of which 96 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 96 transition count 243
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 9 place count 93 transition count 235
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 93 transition count 235
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 93 transition count 233
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 18 place count 89 transition count 223
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 89 transition count 223
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 26 place count 89 transition count 219
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 28 place count 87 transition count 215
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 87 transition count 215
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 32 place count 85 transition count 209
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 85 transition count 209
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 36 place count 83 transition count 205
Iterating global reduction 3 with 2 rules applied. Total rules applied 38 place count 83 transition count 205
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 40 place count 81 transition count 201
Iterating global reduction 3 with 2 rules applied. Total rules applied 42 place count 81 transition count 201
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 44 place count 79 transition count 197
Iterating global reduction 3 with 2 rules applied. Total rules applied 46 place count 79 transition count 197
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 47 place count 78 transition count 195
Iterating global reduction 3 with 1 rules applied. Total rules applied 48 place count 78 transition count 195
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 49 place count 77 transition count 193
Iterating global reduction 3 with 1 rules applied. Total rules applied 50 place count 77 transition count 193
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 51 place count 76 transition count 191
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 76 transition count 191
Applied a total of 52 rules in 39 ms. Remains 76 /99 variables (removed 23) and now considering 191/248 (removed 57) transitions.
Finished structural reductions, in 1 iterations. Remains : 76/99 places, 191/248 transitions.
Normalized transition count is 117 out of 191 initially.
// Phase 1: matrix 117 rows 76 cols
[2022-06-10 04:26:55] [INFO ] Computed 3 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 907 ms. (steps per millisecond=1102 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 438 ms. (steps per millisecond=2283 ) properties (out of 1) seen :3
[2022-06-10 04:26:56] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
// Phase 1: matrix 117 rows 76 cols
[2022-06-10 04:26:56] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-10 04:26:56] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:26:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:56] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-06-10 04:26:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:26:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:26:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:56] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-06-10 04:26:56] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-06-10 04:26:56] [INFO ] [Nat]Added 18 Read/Feed constraints in 4 ms returned sat
[2022-06-10 04:26:56] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2022-06-10 04:26:57] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2022-06-10 04:26:57] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2022-06-10 04:26:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 125 ms
[2022-06-10 04:26:57] [INFO ] Computed and/alt/rep : 61/197/52 causal constraints (skipped 63 transitions) in 6 ms.
[2022-06-10 04:26:57] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2022-06-10 04:26:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2022-06-10 04:26:57] [INFO ] Added : 4 causal constraints over 2 iterations in 71 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[6]
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 76/76 places, 191/191 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 76/76 places, 191/191 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 76/76 places, 191/191 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 191/191 (removed 0) transitions.
[2022-06-10 04:26:57] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
// Phase 1: matrix 117 rows 76 cols
[2022-06-10 04:26:57] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-10 04:26:57] [INFO ] Implicit Places using invariants in 54 ms returned []
[2022-06-10 04:26:57] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
// Phase 1: matrix 117 rows 76 cols
[2022-06-10 04:26:57] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 04:26:57] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-06-10 04:26:57] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2022-06-10 04:26:57] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-10 04:26:57] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
// Phase 1: matrix 117 rows 76 cols
[2022-06-10 04:26:57] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-10 04:26:57] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 76/76 places, 191/191 transitions.
Ending property specific reduction for FunctionPointer-PT-b008-UpperBounds-03 in 2346 ms.
Starting property specific reduction for FunctionPointer-PT-b008-UpperBounds-05
Normalized transition count is 158 out of 248 initially.
// Phase 1: matrix 158 rows 99 cols
[2022-06-10 04:26:57] [INFO ] Computed 3 place invariants in 1 ms
Incomplete random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :3
[2022-06-10 04:26:57] [INFO ] Flow matrix only has 158 transitions (discarded 90 similar events)
// Phase 1: matrix 158 rows 99 cols
[2022-06-10 04:26:57] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 04:26:57] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:26:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:57] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-06-10 04:26:57] [INFO ] State equation strengthened by 27 read => feed constraints.
[2022-06-10 04:26:57] [INFO ] [Real]Added 27 Read/Feed constraints in 5 ms returned sat
[2022-06-10 04:26:57] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:26:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:26:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:57] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2022-06-10 04:26:57] [INFO ] [Nat]Added 27 Read/Feed constraints in 5 ms returned sat
[2022-06-10 04:26:57] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 0 ms to minimize.
[2022-06-10 04:26:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2022-06-10 04:26:57] [INFO ] Computed and/alt/rep : 66/321/61 causal constraints (skipped 95 transitions) in 11 ms.
[2022-06-10 04:26:57] [INFO ] Added : 29 causal constraints over 7 iterations in 86 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[10]
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 99/99 places, 248/248 transitions.
Graph (complete) has 420 edges and 99 vertex of which 93 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 93 transition count 238
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 91 transition count 232
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 91 transition count 232
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 91 transition count 230
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 20 place count 88 transition count 224
Iterating global reduction 2 with 3 rules applied. Total rules applied 23 place count 88 transition count 224
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 27 place count 88 transition count 220
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 28 place count 87 transition count 218
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 87 transition count 218
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 30 place count 86 transition count 216
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 86 transition count 216
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 32 place count 85 transition count 214
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 85 transition count 214
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 34 place count 84 transition count 212
Iterating global reduction 3 with 1 rules applied. Total rules applied 35 place count 84 transition count 212
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 36 place count 83 transition count 210
Iterating global reduction 3 with 1 rules applied. Total rules applied 37 place count 83 transition count 210
Applied a total of 37 rules in 21 ms. Remains 83 /99 variables (removed 16) and now considering 210/248 (removed 38) transitions.
Finished structural reductions, in 1 iterations. Remains : 83/99 places, 210/248 transitions.
Normalized transition count is 130 out of 210 initially.
// Phase 1: matrix 130 rows 83 cols
[2022-06-10 04:26:57] [INFO ] Computed 3 place invariants in 2 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 1044 ms. (steps per millisecond=957 ) properties (out of 1) seen :15
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 484 ms. (steps per millisecond=2066 ) properties (out of 1) seen :237
[2022-06-10 04:26:59] [INFO ] Flow matrix only has 130 transitions (discarded 80 similar events)
// Phase 1: matrix 130 rows 83 cols
[2022-06-10 04:26:59] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 04:26:59] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 04:26:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:59] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2022-06-10 04:26:59] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-06-10 04:26:59] [INFO ] [Real]Added 18 Read/Feed constraints in 5 ms returned sat
[2022-06-10 04:26:59] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:26:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 04:26:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:26:59] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2022-06-10 04:26:59] [INFO ] [Nat]Added 18 Read/Feed constraints in 3 ms returned sat
[2022-06-10 04:26:59] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 0 ms to minimize.
[2022-06-10 04:26:59] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2022-06-10 04:26:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 98 ms
[2022-06-10 04:26:59] [INFO ] Computed and/alt/rep : 61/202/55 causal constraints (skipped 73 transitions) in 7 ms.
[2022-06-10 04:26:59] [INFO ] Added : 16 causal constraints over 5 iterations in 52 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[237]
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 83/83 places, 210/210 transitions.
Applied a total of 0 rules in 4 ms. Remains 83 /83 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 83/83 places, 210/210 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 83/83 places, 210/210 transitions.
Applied a total of 0 rules in 14 ms. Remains 83 /83 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2022-06-10 04:27:00] [INFO ] Flow matrix only has 130 transitions (discarded 80 similar events)
// Phase 1: matrix 130 rows 83 cols
[2022-06-10 04:27:00] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-10 04:27:00] [INFO ] Implicit Places using invariants in 53 ms returned []
[2022-06-10 04:27:00] [INFO ] Flow matrix only has 130 transitions (discarded 80 similar events)
// Phase 1: matrix 130 rows 83 cols
[2022-06-10 04:27:00] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 04:27:00] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-06-10 04:27:00] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2022-06-10 04:27:00] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-10 04:27:00] [INFO ] Flow matrix only has 130 transitions (discarded 80 similar events)
// Phase 1: matrix 130 rows 83 cols
[2022-06-10 04:27:00] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-10 04:27:00] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 83/83 places, 210/210 transitions.
Normalized transition count is 130 out of 210 initially.
// Phase 1: matrix 130 rows 83 cols
[2022-06-10 04:27:00] [INFO ] Computed 3 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 960 ms. (steps per millisecond=1041 ) properties (out of 1) seen :17
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 501 ms. (steps per millisecond=1996 ) properties (out of 1) seen :242
[2022-06-10 04:27:01] [INFO ] Flow matrix only has 130 transitions (discarded 80 similar events)
// Phase 1: matrix 130 rows 83 cols
[2022-06-10 04:27:01] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 04:27:01] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:27:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:27:01] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2022-06-10 04:27:01] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-06-10 04:27:01] [INFO ] [Real]Added 18 Read/Feed constraints in 5 ms returned sat
[2022-06-10 04:27:01] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:27:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:27:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:27:01] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2022-06-10 04:27:01] [INFO ] [Nat]Added 18 Read/Feed constraints in 3 ms returned sat
[2022-06-10 04:27:01] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2022-06-10 04:27:01] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2022-06-10 04:27:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 94 ms
[2022-06-10 04:27:01] [INFO ] Computed and/alt/rep : 61/202/55 causal constraints (skipped 73 transitions) in 7 ms.
[2022-06-10 04:27:02] [INFO ] Added : 16 causal constraints over 5 iterations in 53 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[242]
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 83/83 places, 210/210 transitions.
Applied a total of 0 rules in 4 ms. Remains 83 /83 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 83/83 places, 210/210 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 83/83 places, 210/210 transitions.
Applied a total of 0 rules in 13 ms. Remains 83 /83 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2022-06-10 04:27:02] [INFO ] Flow matrix only has 130 transitions (discarded 80 similar events)
// Phase 1: matrix 130 rows 83 cols
[2022-06-10 04:27:02] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 04:27:02] [INFO ] Implicit Places using invariants in 52 ms returned []
[2022-06-10 04:27:02] [INFO ] Flow matrix only has 130 transitions (discarded 80 similar events)
// Phase 1: matrix 130 rows 83 cols
[2022-06-10 04:27:02] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-10 04:27:02] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-06-10 04:27:02] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2022-06-10 04:27:02] [INFO ] Redundant transitions in 0 ms returned []
[2022-06-10 04:27:02] [INFO ] Flow matrix only has 130 transitions (discarded 80 similar events)
// Phase 1: matrix 130 rows 83 cols
[2022-06-10 04:27:02] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 04:27:02] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 83/83 places, 210/210 transitions.
Normalized transition count is 130 out of 210 initially.
// Phase 1: matrix 130 rows 83 cols
[2022-06-10 04:27:02] [INFO ] Computed 3 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 932 ms. (steps per millisecond=1072 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 491 ms. (steps per millisecond=2036 ) properties (out of 1) seen :228
[2022-06-10 04:27:04] [INFO ] Flow matrix only has 130 transitions (discarded 80 similar events)
// Phase 1: matrix 130 rows 83 cols
[2022-06-10 04:27:04] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-10 04:27:04] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:27:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:27:04] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-06-10 04:27:04] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-06-10 04:27:04] [INFO ] [Real]Added 18 Read/Feed constraints in 5 ms returned sat
[2022-06-10 04:27:04] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:27:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:27:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:27:04] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2022-06-10 04:27:04] [INFO ] [Nat]Added 18 Read/Feed constraints in 3 ms returned sat
[2022-06-10 04:27:04] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2022-06-10 04:27:04] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2022-06-10 04:27:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 87 ms
[2022-06-10 04:27:04] [INFO ] Computed and/alt/rep : 61/202/55 causal constraints (skipped 73 transitions) in 6 ms.
[2022-06-10 04:27:04] [INFO ] Added : 16 causal constraints over 5 iterations in 49 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[242]
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 83/83 places, 210/210 transitions.
Applied a total of 0 rules in 4 ms. Remains 83 /83 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 83/83 places, 210/210 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 83/83 places, 210/210 transitions.
Applied a total of 0 rules in 4 ms. Remains 83 /83 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2022-06-10 04:27:04] [INFO ] Flow matrix only has 130 transitions (discarded 80 similar events)
// Phase 1: matrix 130 rows 83 cols
[2022-06-10 04:27:04] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-10 04:27:04] [INFO ] Implicit Places using invariants in 58 ms returned []
[2022-06-10 04:27:04] [INFO ] Flow matrix only has 130 transitions (discarded 80 similar events)
// Phase 1: matrix 130 rows 83 cols
[2022-06-10 04:27:04] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-10 04:27:04] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-06-10 04:27:05] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2022-06-10 04:27:05] [INFO ] Redundant transitions in 0 ms returned []
[2022-06-10 04:27:05] [INFO ] Flow matrix only has 130 transitions (discarded 80 similar events)
// Phase 1: matrix 130 rows 83 cols
[2022-06-10 04:27:05] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 04:27:05] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 83/83 places, 210/210 transitions.
Ending property specific reduction for FunctionPointer-PT-b008-UpperBounds-05 in 7704 ms.
Starting property specific reduction for FunctionPointer-PT-b008-UpperBounds-06
Normalized transition count is 158 out of 248 initially.
// Phase 1: matrix 158 rows 99 cols
[2022-06-10 04:27:05] [INFO ] Computed 3 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :9
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :6
[2022-06-10 04:27:05] [INFO ] Flow matrix only has 158 transitions (discarded 90 similar events)
// Phase 1: matrix 158 rows 99 cols
[2022-06-10 04:27:05] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 04:27:05] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 04:27:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:27:05] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2022-06-10 04:27:05] [INFO ] State equation strengthened by 27 read => feed constraints.
[2022-06-10 04:27:05] [INFO ] [Real]Added 27 Read/Feed constraints in 8 ms returned sat
[2022-06-10 04:27:05] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:27:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:27:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:27:05] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2022-06-10 04:27:05] [INFO ] [Nat]Added 27 Read/Feed constraints in 5 ms returned sat
[2022-06-10 04:27:05] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2022-06-10 04:27:05] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2022-06-10 04:27:05] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2022-06-10 04:27:05] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 0 ms to minimize.
[2022-06-10 04:27:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 190 ms
[2022-06-10 04:27:05] [INFO ] Computed and/alt/rep : 66/321/61 causal constraints (skipped 95 transitions) in 8 ms.
[2022-06-10 04:27:05] [INFO ] Added : 9 causal constraints over 2 iterations in 37 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[9]
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 99/99 places, 248/248 transitions.
Graph (complete) has 420 edges and 99 vertex of which 96 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 96 transition count 243
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 9 place count 93 transition count 235
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 93 transition count 235
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 93 transition count 233
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 18 place count 89 transition count 223
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 89 transition count 223
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 26 place count 89 transition count 219
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 28 place count 87 transition count 215
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 87 transition count 215
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 32 place count 85 transition count 209
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 85 transition count 209
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 36 place count 83 transition count 205
Iterating global reduction 3 with 2 rules applied. Total rules applied 38 place count 83 transition count 205
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 40 place count 81 transition count 201
Iterating global reduction 3 with 2 rules applied. Total rules applied 42 place count 81 transition count 201
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 44 place count 79 transition count 197
Iterating global reduction 3 with 2 rules applied. Total rules applied 46 place count 79 transition count 197
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 47 place count 78 transition count 195
Iterating global reduction 3 with 1 rules applied. Total rules applied 48 place count 78 transition count 195
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 49 place count 77 transition count 193
Iterating global reduction 3 with 1 rules applied. Total rules applied 50 place count 77 transition count 193
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 51 place count 76 transition count 191
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 76 transition count 191
Applied a total of 52 rules in 36 ms. Remains 76 /99 variables (removed 23) and now considering 191/248 (removed 57) transitions.
Finished structural reductions, in 1 iterations. Remains : 76/99 places, 191/248 transitions.
Normalized transition count is 117 out of 191 initially.
// Phase 1: matrix 117 rows 76 cols
[2022-06-10 04:27:05] [INFO ] Computed 3 place invariants in 1 ms
Incomplete random walk after 1000002 steps, including 2 resets, run finished after 919 ms. (steps per millisecond=1088 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 443 ms. (steps per millisecond=2257 ) properties (out of 1) seen :9
[2022-06-10 04:27:06] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
// Phase 1: matrix 117 rows 76 cols
[2022-06-10 04:27:06] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 04:27:06] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 04:27:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:27:06] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-06-10 04:27:07] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-06-10 04:27:07] [INFO ] [Real]Added 18 Read/Feed constraints in 3 ms returned sat
[2022-06-10 04:27:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:27:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 04:27:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:27:07] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-06-10 04:27:07] [INFO ] [Nat]Added 18 Read/Feed constraints in 5 ms returned sat
[2022-06-10 04:27:07] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2022-06-10 04:27:07] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2022-06-10 04:27:07] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 3 ms to minimize.
[2022-06-10 04:27:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 118 ms
[2022-06-10 04:27:07] [INFO ] Computed and/alt/rep : 61/197/52 causal constraints (skipped 63 transitions) in 5 ms.
[2022-06-10 04:27:07] [INFO ] Added : 5 causal constraints over 2 iterations in 27 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[9]
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 76/76 places, 191/191 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 76/76 places, 191/191 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 76/76 places, 191/191 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 191/191 (removed 0) transitions.
[2022-06-10 04:27:07] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
// Phase 1: matrix 117 rows 76 cols
[2022-06-10 04:27:07] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 04:27:07] [INFO ] Implicit Places using invariants in 53 ms returned []
[2022-06-10 04:27:07] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
// Phase 1: matrix 117 rows 76 cols
[2022-06-10 04:27:07] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-10 04:27:07] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-06-10 04:27:07] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2022-06-10 04:27:07] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-10 04:27:07] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
// Phase 1: matrix 117 rows 76 cols
[2022-06-10 04:27:07] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-10 04:27:07] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 76/76 places, 191/191 transitions.
Ending property specific reduction for FunctionPointer-PT-b008-UpperBounds-06 in 2350 ms.
Starting property specific reduction for FunctionPointer-PT-b008-UpperBounds-07
Normalized transition count is 158 out of 248 initially.
// Phase 1: matrix 158 rows 99 cols
[2022-06-10 04:27:07] [INFO ] Computed 3 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :1
[2022-06-10 04:27:07] [INFO ] Flow matrix only has 158 transitions (discarded 90 similar events)
// Phase 1: matrix 158 rows 99 cols
[2022-06-10 04:27:07] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 04:27:07] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:27:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:27:07] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-06-10 04:27:07] [INFO ] State equation strengthened by 27 read => feed constraints.
[2022-06-10 04:27:07] [INFO ] [Real]Added 27 Read/Feed constraints in 3 ms returned sat
[2022-06-10 04:27:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:27:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 04:27:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:27:07] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2022-06-10 04:27:07] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2022-06-10 04:27:07] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
[2022-06-10 04:27:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2022-06-10 04:27:07] [INFO ] Computed and/alt/rep : 66/321/61 causal constraints (skipped 95 transitions) in 14 ms.
[2022-06-10 04:27:07] [INFO ] Added : 19 causal constraints over 5 iterations in 93 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[5]
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 99/99 places, 248/248 transitions.
Graph (complete) has 420 edges and 99 vertex of which 93 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 93 transition count 238
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 91 transition count 234
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 91 transition count 234
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 91 transition count 232
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 20 place count 88 transition count 224
Iterating global reduction 2 with 3 rules applied. Total rules applied 23 place count 88 transition count 224
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 27 place count 88 transition count 220
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 28 place count 87 transition count 218
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 87 transition count 218
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 30 place count 86 transition count 214
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 86 transition count 214
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 32 place count 85 transition count 212
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 85 transition count 212
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 34 place count 84 transition count 210
Iterating global reduction 3 with 1 rules applied. Total rules applied 35 place count 84 transition count 210
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 36 place count 83 transition count 208
Iterating global reduction 3 with 1 rules applied. Total rules applied 37 place count 83 transition count 208
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 38 place count 82 transition count 206
Iterating global reduction 3 with 1 rules applied. Total rules applied 39 place count 82 transition count 206
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 40 place count 81 transition count 204
Iterating global reduction 3 with 1 rules applied. Total rules applied 41 place count 81 transition count 204
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 42 place count 80 transition count 202
Iterating global reduction 3 with 1 rules applied. Total rules applied 43 place count 80 transition count 202
Applied a total of 43 rules in 29 ms. Remains 80 /99 variables (removed 19) and now considering 202/248 (removed 46) transitions.
Finished structural reductions, in 1 iterations. Remains : 80/99 places, 202/248 transitions.
Normalized transition count is 124 out of 202 initially.
// Phase 1: matrix 124 rows 80 cols
[2022-06-10 04:27:07] [INFO ] Computed 3 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 989 ms. (steps per millisecond=1011 ) properties (out of 1) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 459 ms. (steps per millisecond=2178 ) properties (out of 1) seen :628
[2022-06-10 04:27:09] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
// Phase 1: matrix 124 rows 80 cols
[2022-06-10 04:27:09] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 04:27:09] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 04:27:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:27:09] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-06-10 04:27:09] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-06-10 04:27:09] [INFO ] [Real]Added 18 Read/Feed constraints in 2 ms returned sat
[2022-06-10 04:27:09] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:27:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:27:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:27:09] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-06-10 04:27:09] [INFO ] [Nat]Added 18 Read/Feed constraints in 2 ms returned sat
[2022-06-10 04:27:09] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 3 ms to minimize.
[2022-06-10 04:27:09] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2022-06-10 04:27:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 108 ms
[2022-06-10 04:27:09] [INFO ] Computed and/alt/rep : 59/192/53 causal constraints (skipped 69 transitions) in 7 ms.
[2022-06-10 04:27:09] [INFO ] Added : 11 causal constraints over 3 iterations in 37 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[628]
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 80/80 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 80 /80 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 80/80 places, 202/202 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 80/80 places, 202/202 transitions.
Applied a total of 0 rules in 4 ms. Remains 80 /80 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2022-06-10 04:27:10] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
// Phase 1: matrix 124 rows 80 cols
[2022-06-10 04:27:10] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 04:27:10] [INFO ] Implicit Places using invariants in 55 ms returned []
[2022-06-10 04:27:10] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
// Phase 1: matrix 124 rows 80 cols
[2022-06-10 04:27:10] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 04:27:10] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-06-10 04:27:10] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2022-06-10 04:27:10] [INFO ] Redundant transitions in 0 ms returned []
[2022-06-10 04:27:10] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
// Phase 1: matrix 124 rows 80 cols
[2022-06-10 04:27:10] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-10 04:27:10] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 80/80 places, 202/202 transitions.
Normalized transition count is 124 out of 202 initially.
// Phase 1: matrix 124 rows 80 cols
[2022-06-10 04:27:10] [INFO ] Computed 3 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1004 ms. (steps per millisecond=996 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 460 ms. (steps per millisecond=2173 ) properties (out of 1) seen :742
[2022-06-10 04:27:12] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
// Phase 1: matrix 124 rows 80 cols
[2022-06-10 04:27:12] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 04:27:12] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:27:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:27:12] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-06-10 04:27:12] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-06-10 04:27:12] [INFO ] [Real]Added 18 Read/Feed constraints in 2 ms returned sat
[2022-06-10 04:27:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:27:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 04:27:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:27:12] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2022-06-10 04:27:12] [INFO ] [Nat]Added 18 Read/Feed constraints in 2 ms returned sat
[2022-06-10 04:27:12] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2022-06-10 04:27:12] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2022-06-10 04:27:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 87 ms
[2022-06-10 04:27:12] [INFO ] Computed and/alt/rep : 59/192/53 causal constraints (skipped 69 transitions) in 11 ms.
[2022-06-10 04:27:12] [INFO ] Added : 11 causal constraints over 3 iterations in 47 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[742]
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 80/80 places, 202/202 transitions.
Applied a total of 0 rules in 14 ms. Remains 80 /80 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 80/80 places, 202/202 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 80/80 places, 202/202 transitions.
Applied a total of 0 rules in 8 ms. Remains 80 /80 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2022-06-10 04:27:13] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
// Phase 1: matrix 124 rows 80 cols
[2022-06-10 04:27:13] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 04:27:14] [INFO ] Implicit Places using invariants in 58 ms returned []
[2022-06-10 04:27:14] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
// Phase 1: matrix 124 rows 80 cols
[2022-06-10 04:27:14] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 04:27:14] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-06-10 04:27:14] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2022-06-10 04:27:14] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-10 04:27:14] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
// Phase 1: matrix 124 rows 80 cols
[2022-06-10 04:27:14] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 04:27:14] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 80/80 places, 202/202 transitions.
Normalized transition count is 124 out of 202 initially.
// Phase 1: matrix 124 rows 80 cols
[2022-06-10 04:27:14] [INFO ] Computed 3 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1013 ms. (steps per millisecond=987 ) properties (out of 1) seen :13
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 489 ms. (steps per millisecond=2044 ) properties (out of 1) seen :655
[2022-06-10 04:27:15] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
// Phase 1: matrix 124 rows 80 cols
[2022-06-10 04:27:15] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 04:27:15] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:27:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:27:15] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-06-10 04:27:15] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-06-10 04:27:15] [INFO ] [Real]Added 18 Read/Feed constraints in 3 ms returned sat
[2022-06-10 04:27:15] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:27:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:27:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:27:15] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-06-10 04:27:15] [INFO ] [Nat]Added 18 Read/Feed constraints in 2 ms returned sat
[2022-06-10 04:27:15] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2022-06-10 04:27:15] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2022-06-10 04:27:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 91 ms
[2022-06-10 04:27:15] [INFO ] Computed and/alt/rep : 59/192/53 causal constraints (skipped 69 transitions) in 6 ms.
[2022-06-10 04:27:15] [INFO ] Added : 11 causal constraints over 3 iterations in 37 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[742]
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 80/80 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 80 /80 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 80/80 places, 202/202 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 80/80 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 80 /80 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2022-06-10 04:27:17] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
// Phase 1: matrix 124 rows 80 cols
[2022-06-10 04:27:17] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-10 04:27:17] [INFO ] Implicit Places using invariants in 57 ms returned []
[2022-06-10 04:27:17] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
// Phase 1: matrix 124 rows 80 cols
[2022-06-10 04:27:17] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-10 04:27:17] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-06-10 04:27:17] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2022-06-10 04:27:17] [INFO ] Redundant transitions in 0 ms returned []
[2022-06-10 04:27:17] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
// Phase 1: matrix 124 rows 80 cols
[2022-06-10 04:27:17] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-10 04:27:17] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 80/80 places, 202/202 transitions.
Ending property specific reduction for FunctionPointer-PT-b008-UpperBounds-07 in 10117 ms.
Starting property specific reduction for FunctionPointer-PT-b008-UpperBounds-09
Normalized transition count is 158 out of 248 initially.
// Phase 1: matrix 158 rows 99 cols
[2022-06-10 04:27:17] [INFO ] Computed 3 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :5
[2022-06-10 04:27:17] [INFO ] Flow matrix only has 158 transitions (discarded 90 similar events)
// Phase 1: matrix 158 rows 99 cols
[2022-06-10 04:27:17] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 04:27:17] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:27:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:27:17] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2022-06-10 04:27:17] [INFO ] State equation strengthened by 27 read => feed constraints.
[2022-06-10 04:27:17] [INFO ] [Real]Added 27 Read/Feed constraints in 6 ms returned sat
[2022-06-10 04:27:17] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:27:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 04:27:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:27:17] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2022-06-10 04:27:17] [INFO ] [Nat]Added 27 Read/Feed constraints in 5 ms returned sat
[2022-06-10 04:27:17] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2022-06-10 04:27:17] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 0 ms to minimize.
[2022-06-10 04:27:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 106 ms
[2022-06-10 04:27:17] [INFO ] Computed and/alt/rep : 66/321/61 causal constraints (skipped 95 transitions) in 10 ms.
[2022-06-10 04:27:17] [INFO ] Added : 13 causal constraints over 4 iterations in 61 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[10]
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 99/99 places, 248/248 transitions.
Graph (complete) has 420 edges and 99 vertex of which 93 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 93 transition count 238
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 91 transition count 232
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 91 transition count 232
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 89 transition count 226
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 89 transition count 226
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 87 transition count 222
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 87 transition count 222
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 85 transition count 216
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 85 transition count 216
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 83 transition count 212
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 83 transition count 212
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 81 transition count 208
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 81 transition count 208
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 79 transition count 204
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 79 transition count 204
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 78 transition count 202
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 78 transition count 202
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 77 transition count 200
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 77 transition count 200
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 76 transition count 198
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 76 transition count 198
Applied a total of 45 rules in 19 ms. Remains 76 /99 variables (removed 23) and now considering 198/248 (removed 50) transitions.
Finished structural reductions, in 1 iterations. Remains : 76/99 places, 198/248 transitions.
Normalized transition count is 118 out of 198 initially.
// Phase 1: matrix 118 rows 76 cols
[2022-06-10 04:27:17] [INFO ] Computed 3 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 985 ms. (steps per millisecond=1015 ) properties (out of 1) seen :16
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 416 ms. (steps per millisecond=2403 ) properties (out of 1) seen :661
[2022-06-10 04:27:19] [INFO ] Flow matrix only has 118 transitions (discarded 80 similar events)
// Phase 1: matrix 118 rows 76 cols
[2022-06-10 04:27:19] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 04:27:19] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:27:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:27:19] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-06-10 04:27:19] [INFO ] State equation strengthened by 15 read => feed constraints.
[2022-06-10 04:27:19] [INFO ] [Real]Added 15 Read/Feed constraints in 2 ms returned sat
[2022-06-10 04:27:19] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:27:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:27:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:27:19] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-06-10 04:27:19] [INFO ] [Nat]Added 15 Read/Feed constraints in 2 ms returned sat
[2022-06-10 04:27:19] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2022-06-10 04:27:19] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
[2022-06-10 04:27:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 79 ms
[2022-06-10 04:27:19] [INFO ] Computed and/alt/rep : 60/163/51 causal constraints (skipped 65 transitions) in 6 ms.
[2022-06-10 04:27:19] [INFO ] Added : 31 causal constraints over 7 iterations in 59 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[661]
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 76/76 places, 198/198 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 76/76 places, 198/198 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 76/76 places, 198/198 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2022-06-10 04:27:20] [INFO ] Flow matrix only has 118 transitions (discarded 80 similar events)
// Phase 1: matrix 118 rows 76 cols
[2022-06-10 04:27:20] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 04:27:20] [INFO ] Implicit Places using invariants in 54 ms returned []
[2022-06-10 04:27:20] [INFO ] Flow matrix only has 118 transitions (discarded 80 similar events)
// Phase 1: matrix 118 rows 76 cols
[2022-06-10 04:27:20] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 04:27:20] [INFO ] State equation strengthened by 15 read => feed constraints.
[2022-06-10 04:27:20] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2022-06-10 04:27:20] [INFO ] Redundant transitions in 0 ms returned []
[2022-06-10 04:27:20] [INFO ] Flow matrix only has 118 transitions (discarded 80 similar events)
// Phase 1: matrix 118 rows 76 cols
[2022-06-10 04:27:20] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 04:27:21] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 76/76 places, 198/198 transitions.
Normalized transition count is 118 out of 198 initially.
// Phase 1: matrix 118 rows 76 cols
[2022-06-10 04:27:21] [INFO ] Computed 3 place invariants in 0 ms
Incomplete random walk after 1000002 steps, including 2 resets, run finished after 918 ms. (steps per millisecond=1089 ) properties (out of 1) seen :16
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 420 ms. (steps per millisecond=2380 ) properties (out of 1) seen :634
[2022-06-10 04:27:22] [INFO ] Flow matrix only has 118 transitions (discarded 80 similar events)
// Phase 1: matrix 118 rows 76 cols
[2022-06-10 04:27:22] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 04:27:22] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:27:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:27:22] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-06-10 04:27:22] [INFO ] State equation strengthened by 15 read => feed constraints.
[2022-06-10 04:27:22] [INFO ] [Real]Added 15 Read/Feed constraints in 2 ms returned sat
[2022-06-10 04:27:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:27:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:27:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:27:22] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-06-10 04:27:22] [INFO ] [Nat]Added 15 Read/Feed constraints in 2 ms returned sat
[2022-06-10 04:27:22] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2022-06-10 04:27:22] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
[2022-06-10 04:27:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 87 ms
[2022-06-10 04:27:22] [INFO ] Computed and/alt/rep : 60/163/51 causal constraints (skipped 65 transitions) in 6 ms.
[2022-06-10 04:27:22] [INFO ] Added : 31 causal constraints over 7 iterations in 61 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[661]
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 76/76 places, 198/198 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 76/76 places, 198/198 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 76/76 places, 198/198 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2022-06-10 04:27:23] [INFO ] Flow matrix only has 118 transitions (discarded 80 similar events)
// Phase 1: matrix 118 rows 76 cols
[2022-06-10 04:27:23] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-10 04:27:23] [INFO ] Implicit Places using invariants in 57 ms returned []
[2022-06-10 04:27:23] [INFO ] Flow matrix only has 118 transitions (discarded 80 similar events)
// Phase 1: matrix 118 rows 76 cols
[2022-06-10 04:27:23] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 04:27:23] [INFO ] State equation strengthened by 15 read => feed constraints.
[2022-06-10 04:27:23] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2022-06-10 04:27:23] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-10 04:27:23] [INFO ] Flow matrix only has 118 transitions (discarded 80 similar events)
// Phase 1: matrix 118 rows 76 cols
[2022-06-10 04:27:23] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-10 04:27:23] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 76/76 places, 198/198 transitions.
Ending property specific reduction for FunctionPointer-PT-b008-UpperBounds-09 in 6315 ms.
Starting property specific reduction for FunctionPointer-PT-b008-UpperBounds-11
Normalized transition count is 158 out of 248 initially.
// Phase 1: matrix 158 rows 99 cols
[2022-06-10 04:27:23] [INFO ] Computed 3 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
[2022-06-10 04:27:23] [INFO ] Flow matrix only has 158 transitions (discarded 90 similar events)
// Phase 1: matrix 158 rows 99 cols
[2022-06-10 04:27:23] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 04:27:23] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 04:27:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:27:23] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2022-06-10 04:27:24] [INFO ] State equation strengthened by 27 read => feed constraints.
[2022-06-10 04:27:24] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2022-06-10 04:27:24] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:27:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 04:27:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:27:24] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2022-06-10 04:27:24] [INFO ] [Nat]Added 27 Read/Feed constraints in 11 ms returned sat
[2022-06-10 04:27:24] [INFO ] Computed and/alt/rep : 66/321/61 causal constraints (skipped 95 transitions) in 10 ms.
[2022-06-10 04:27:24] [INFO ] Added : 18 causal constraints over 5 iterations in 65 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[5]
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 99/99 places, 248/248 transitions.
Graph (complete) has 420 edges and 99 vertex of which 93 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 93 transition count 238
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 90 transition count 230
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 90 transition count 230
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 90 transition count 228
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 23 place count 86 transition count 218
Iterating global reduction 2 with 4 rules applied. Total rules applied 27 place count 86 transition count 218
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 31 place count 86 transition count 214
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 33 place count 84 transition count 210
Iterating global reduction 3 with 2 rules applied. Total rules applied 35 place count 84 transition count 210
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 37 place count 82 transition count 204
Iterating global reduction 3 with 2 rules applied. Total rules applied 39 place count 82 transition count 204
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 41 place count 80 transition count 200
Iterating global reduction 3 with 2 rules applied. Total rules applied 43 place count 80 transition count 200
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 45 place count 78 transition count 196
Iterating global reduction 3 with 2 rules applied. Total rules applied 47 place count 78 transition count 196
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 49 place count 76 transition count 192
Iterating global reduction 3 with 2 rules applied. Total rules applied 51 place count 76 transition count 192
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 52 place count 75 transition count 190
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 75 transition count 190
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 74 transition count 188
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 74 transition count 188
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 56 place count 73 transition count 186
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 73 transition count 186
Applied a total of 57 rules in 15 ms. Remains 73 /99 variables (removed 26) and now considering 186/248 (removed 62) transitions.
Finished structural reductions, in 1 iterations. Remains : 73/99 places, 186/248 transitions.
Normalized transition count is 112 out of 186 initially.
// Phase 1: matrix 112 rows 73 cols
[2022-06-10 04:27:24] [INFO ] Computed 3 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 892 ms. (steps per millisecond=1121 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 420 ms. (steps per millisecond=2380 ) properties (out of 1) seen :4
[2022-06-10 04:27:25] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
// Phase 1: matrix 112 rows 73 cols
[2022-06-10 04:27:25] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 04:27:25] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:27:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:27:25] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-06-10 04:27:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:27:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 04:27:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:27:25] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-06-10 04:27:25] [INFO ] State equation strengthened by 15 read => feed constraints.
[2022-06-10 04:27:25] [INFO ] [Nat]Added 15 Read/Feed constraints in 3 ms returned sat
[2022-06-10 04:27:25] [INFO ] Computed and/alt/rep : 60/163/51 causal constraints (skipped 59 transitions) in 5 ms.
[2022-06-10 04:27:25] [INFO ] Added : 3 causal constraints over 1 iterations in 22 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[7]
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 73/73 places, 186/186 transitions.
Applied a total of 0 rules in 5 ms. Remains 73 /73 variables (removed 0) and now considering 186/186 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 73/73 places, 186/186 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 73/73 places, 186/186 transitions.
Applied a total of 0 rules in 2 ms. Remains 73 /73 variables (removed 0) and now considering 186/186 (removed 0) transitions.
[2022-06-10 04:27:25] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
// Phase 1: matrix 112 rows 73 cols
[2022-06-10 04:27:25] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-10 04:27:25] [INFO ] Implicit Places using invariants in 51 ms returned []
[2022-06-10 04:27:25] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
// Phase 1: matrix 112 rows 73 cols
[2022-06-10 04:27:25] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 04:27:25] [INFO ] State equation strengthened by 15 read => feed constraints.
[2022-06-10 04:27:25] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2022-06-10 04:27:25] [INFO ] Redundant transitions in 0 ms returned []
[2022-06-10 04:27:25] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
// Phase 1: matrix 112 rows 73 cols
[2022-06-10 04:27:25] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 04:27:25] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 73/73 places, 186/186 transitions.
Ending property specific reduction for FunctionPointer-PT-b008-UpperBounds-11 in 1990 ms.
Starting property specific reduction for FunctionPointer-PT-b008-UpperBounds-12
Normalized transition count is 158 out of 248 initially.
// Phase 1: matrix 158 rows 99 cols
[2022-06-10 04:27:25] [INFO ] Computed 3 place invariants in 1 ms
Incomplete random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :1
[2022-06-10 04:27:25] [INFO ] Flow matrix only has 158 transitions (discarded 90 similar events)
// Phase 1: matrix 158 rows 99 cols
[2022-06-10 04:27:25] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-10 04:27:25] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:27:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:27:25] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2022-06-10 04:27:25] [INFO ] State equation strengthened by 27 read => feed constraints.
[2022-06-10 04:27:25] [INFO ] [Real]Added 27 Read/Feed constraints in 3 ms returned sat
[2022-06-10 04:27:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:27:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:27:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:27:26] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2022-06-10 04:27:26] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2022-06-10 04:27:26] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 0 ms to minimize.
[2022-06-10 04:27:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2022-06-10 04:27:26] [INFO ] Computed and/alt/rep : 66/321/61 causal constraints (skipped 95 transitions) in 9 ms.
[2022-06-10 04:27:26] [INFO ] Added : 5 causal constraints over 2 iterations in 31 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[1]
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 99/99 places, 248/248 transitions.
Graph (complete) has 420 edges and 99 vertex of which 93 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 93 transition count 238
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 90 transition count 230
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 90 transition count 230
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 90 transition count 228
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 23 place count 86 transition count 218
Iterating global reduction 2 with 4 rules applied. Total rules applied 27 place count 86 transition count 218
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 31 place count 86 transition count 214
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 33 place count 84 transition count 210
Iterating global reduction 3 with 2 rules applied. Total rules applied 35 place count 84 transition count 210
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 37 place count 82 transition count 204
Iterating global reduction 3 with 2 rules applied. Total rules applied 39 place count 82 transition count 204
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 41 place count 80 transition count 200
Iterating global reduction 3 with 2 rules applied. Total rules applied 43 place count 80 transition count 200
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 45 place count 78 transition count 196
Iterating global reduction 3 with 2 rules applied. Total rules applied 47 place count 78 transition count 196
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 49 place count 76 transition count 192
Iterating global reduction 3 with 2 rules applied. Total rules applied 51 place count 76 transition count 192
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 52 place count 75 transition count 190
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 75 transition count 190
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 74 transition count 188
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 74 transition count 188
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 56 place count 73 transition count 186
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 73 transition count 186
Applied a total of 57 rules in 17 ms. Remains 73 /99 variables (removed 26) and now considering 186/248 (removed 62) transitions.
Finished structural reductions, in 1 iterations. Remains : 73/99 places, 186/248 transitions.
Normalized transition count is 112 out of 186 initially.
// Phase 1: matrix 112 rows 73 cols
[2022-06-10 04:27:26] [INFO ] Computed 3 place invariants in 0 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 887 ms. (steps per millisecond=1127 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 420 ms. (steps per millisecond=2380 ) properties (out of 1) seen :0
[2022-06-10 04:27:27] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
// Phase 1: matrix 112 rows 73 cols
[2022-06-10 04:27:27] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 04:27:27] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:27:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:27:27] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-06-10 04:27:27] [INFO ] State equation strengthened by 15 read => feed constraints.
[2022-06-10 04:27:27] [INFO ] [Real]Added 15 Read/Feed constraints in 5 ms returned sat
[2022-06-10 04:27:27] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:27:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:27:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:27:27] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-06-10 04:27:27] [INFO ] [Nat]Added 15 Read/Feed constraints in 2 ms returned sat
[2022-06-10 04:27:27] [INFO ] Computed and/alt/rep : 60/163/51 causal constraints (skipped 59 transitions) in 8 ms.
[2022-06-10 04:27:27] [INFO ] Added : 5 causal constraints over 2 iterations in 28 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[1]
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 73/73 places, 186/186 transitions.
Applied a total of 0 rules in 2 ms. Remains 73 /73 variables (removed 0) and now considering 186/186 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 73/73 places, 186/186 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 73/73 places, 186/186 transitions.
Applied a total of 0 rules in 3 ms. Remains 73 /73 variables (removed 0) and now considering 186/186 (removed 0) transitions.
[2022-06-10 04:27:27] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
// Phase 1: matrix 112 rows 73 cols
[2022-06-10 04:27:27] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 04:27:27] [INFO ] Implicit Places using invariants in 58 ms returned []
[2022-06-10 04:27:27] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
// Phase 1: matrix 112 rows 73 cols
[2022-06-10 04:27:27] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 04:27:27] [INFO ] State equation strengthened by 15 read => feed constraints.
[2022-06-10 04:27:27] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2022-06-10 04:27:27] [INFO ] Redundant transitions in 0 ms returned []
[2022-06-10 04:27:27] [INFO ] Flow matrix only has 112 transitions (discarded 74 similar events)
// Phase 1: matrix 112 rows 73 cols
[2022-06-10 04:27:27] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 04:27:27] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 73/73 places, 186/186 transitions.
Ending property specific reduction for FunctionPointer-PT-b008-UpperBounds-12 in 2003 ms.
Starting property specific reduction for FunctionPointer-PT-b008-UpperBounds-15
Normalized transition count is 158 out of 248 initially.
// Phase 1: matrix 158 rows 99 cols
[2022-06-10 04:27:27] [INFO ] Computed 3 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :3
[2022-06-10 04:27:27] [INFO ] Flow matrix only has 158 transitions (discarded 90 similar events)
// Phase 1: matrix 158 rows 99 cols
[2022-06-10 04:27:27] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 04:27:27] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:27:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:27:27] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-06-10 04:27:27] [INFO ] State equation strengthened by 27 read => feed constraints.
[2022-06-10 04:27:27] [INFO ] [Real]Added 27 Read/Feed constraints in 6 ms returned sat
[2022-06-10 04:27:27] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:27:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:27:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:27:28] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2022-06-10 04:27:28] [INFO ] [Nat]Added 27 Read/Feed constraints in 5 ms returned sat
[2022-06-10 04:27:28] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 0 ms to minimize.
[2022-06-10 04:27:28] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 0 ms to minimize.
[2022-06-10 04:27:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 104 ms
[2022-06-10 04:27:28] [INFO ] Computed and/alt/rep : 66/321/61 causal constraints (skipped 95 transitions) in 8 ms.
[2022-06-10 04:27:28] [INFO ] Added : 18 causal constraints over 5 iterations in 60 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[5]
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 99/99 places, 248/248 transitions.
Graph (complete) has 420 edges and 99 vertex of which 93 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 93 transition count 238
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 90 transition count 230
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 90 transition count 230
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 90 transition count 228
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 22 place count 87 transition count 222
Iterating global reduction 2 with 3 rules applied. Total rules applied 25 place count 87 transition count 222
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 29 place count 87 transition count 218
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 30 place count 86 transition count 216
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 86 transition count 216
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 32 place count 85 transition count 214
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 85 transition count 214
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 34 place count 84 transition count 212
Iterating global reduction 3 with 1 rules applied. Total rules applied 35 place count 84 transition count 212
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 36 place count 83 transition count 210
Iterating global reduction 3 with 1 rules applied. Total rules applied 37 place count 83 transition count 210
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 38 place count 82 transition count 208
Iterating global reduction 3 with 1 rules applied. Total rules applied 39 place count 82 transition count 208
Applied a total of 39 rules in 11 ms. Remains 82 /99 variables (removed 17) and now considering 208/248 (removed 40) transitions.
Finished structural reductions, in 1 iterations. Remains : 82/99 places, 208/248 transitions.
Normalized transition count is 128 out of 208 initially.
// Phase 1: matrix 128 rows 82 cols
[2022-06-10 04:27:28] [INFO ] Computed 3 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 924 ms. (steps per millisecond=1082 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 440 ms. (steps per millisecond=2272 ) properties (out of 1) seen :227
[2022-06-10 04:27:29] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
// Phase 1: matrix 128 rows 82 cols
[2022-06-10 04:27:29] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-10 04:27:29] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 04:27:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:27:29] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2022-06-10 04:27:29] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-06-10 04:27:29] [INFO ] [Real]Added 18 Read/Feed constraints in 4 ms returned sat
[2022-06-10 04:27:29] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:27:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:27:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:27:29] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-06-10 04:27:29] [INFO ] [Nat]Added 18 Read/Feed constraints in 9 ms returned sat
[2022-06-10 04:27:29] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2022-06-10 04:27:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2022-06-10 04:27:29] [INFO ] Computed and/alt/rep : 60/196/54 causal constraints (skipped 72 transitions) in 7 ms.
[2022-06-10 04:27:29] [INFO ] Added : 12 causal constraints over 4 iterations in 41 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[227]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 82/82 places, 208/208 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 82/82 places, 208/208 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 82/82 places, 208/208 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2022-06-10 04:27:30] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
// Phase 1: matrix 128 rows 82 cols
[2022-06-10 04:27:30] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 04:27:30] [INFO ] Implicit Places using invariants in 57 ms returned []
[2022-06-10 04:27:30] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
// Phase 1: matrix 128 rows 82 cols
[2022-06-10 04:27:30] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 04:27:30] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-06-10 04:27:30] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2022-06-10 04:27:30] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-10 04:27:30] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
// Phase 1: matrix 128 rows 82 cols
[2022-06-10 04:27:30] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 04:27:30] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 82/82 places, 208/208 transitions.
Normalized transition count is 128 out of 208 initially.
// Phase 1: matrix 128 rows 82 cols
[2022-06-10 04:27:30] [INFO ] Computed 3 place invariants in 1 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 938 ms. (steps per millisecond=1066 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 510 ms. (steps per millisecond=1960 ) properties (out of 1) seen :241
[2022-06-10 04:27:31] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
// Phase 1: matrix 128 rows 82 cols
[2022-06-10 04:27:31] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 04:27:32] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:27:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:27:32] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-06-10 04:27:32] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-06-10 04:27:32] [INFO ] [Real]Added 18 Read/Feed constraints in 4 ms returned sat
[2022-06-10 04:27:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:27:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 04:27:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:27:32] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2022-06-10 04:27:32] [INFO ] [Nat]Added 18 Read/Feed constraints in 4 ms returned sat
[2022-06-10 04:27:32] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2022-06-10 04:27:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2022-06-10 04:27:32] [INFO ] Computed and/alt/rep : 60/196/54 causal constraints (skipped 72 transitions) in 6 ms.
[2022-06-10 04:27:32] [INFO ] Added : 12 causal constraints over 4 iterations in 44 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[241]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 82/82 places, 208/208 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 82/82 places, 208/208 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 82/82 places, 208/208 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2022-06-10 04:27:32] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
// Phase 1: matrix 128 rows 82 cols
[2022-06-10 04:27:32] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 04:27:32] [INFO ] Implicit Places using invariants in 54 ms returned []
[2022-06-10 04:27:32] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
// Phase 1: matrix 128 rows 82 cols
[2022-06-10 04:27:32] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-10 04:27:32] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-06-10 04:27:32] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2022-06-10 04:27:32] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-10 04:27:32] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
// Phase 1: matrix 128 rows 82 cols
[2022-06-10 04:27:32] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-10 04:27:32] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 82/82 places, 208/208 transitions.
Normalized transition count is 128 out of 208 initially.
// Phase 1: matrix 128 rows 82 cols
[2022-06-10 04:27:32] [INFO ] Computed 3 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 949 ms. (steps per millisecond=1053 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 442 ms. (steps per millisecond=2262 ) properties (out of 1) seen :196
[2022-06-10 04:27:34] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
// Phase 1: matrix 128 rows 82 cols
[2022-06-10 04:27:34] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 04:27:34] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:27:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 04:27:34] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-06-10 04:27:34] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-06-10 04:27:34] [INFO ] [Real]Added 18 Read/Feed constraints in 3 ms returned sat
[2022-06-10 04:27:34] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 04:27:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 04:27:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 04:27:34] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-06-10 04:27:34] [INFO ] [Nat]Added 18 Read/Feed constraints in 4 ms returned sat
[2022-06-10 04:27:34] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2022-06-10 04:27:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2022-06-10 04:27:34] [INFO ] Computed and/alt/rep : 60/196/54 causal constraints (skipped 72 transitions) in 6 ms.
[2022-06-10 04:27:34] [INFO ] Added : 12 causal constraints over 4 iterations in 38 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[241]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 82/82 places, 208/208 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 82/82 places, 208/208 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 82/82 places, 208/208 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2022-06-10 04:27:34] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
// Phase 1: matrix 128 rows 82 cols
[2022-06-10 04:27:34] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-10 04:27:34] [INFO ] Implicit Places using invariants in 60 ms returned []
[2022-06-10 04:27:34] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
// Phase 1: matrix 128 rows 82 cols
[2022-06-10 04:27:34] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 04:27:35] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-06-10 04:27:35] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2022-06-10 04:27:35] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-10 04:27:35] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
// Phase 1: matrix 128 rows 82 cols
[2022-06-10 04:27:35] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 04:27:35] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 82/82 places, 208/208 transitions.
Ending property specific reduction for FunctionPointer-PT-b008-UpperBounds-15 in 7230 ms.
[2022-06-10 04:27:35] [INFO ] Flatten gal took : 64 ms
[2022-06-10 04:27:35] [INFO ] Applying decomposition
[2022-06-10 04:27:35] [INFO ] Flatten gal took : 18 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/graph4284954156885010077.txt' '-o' '/tmp/graph4284954156885010077.bin' '-w' '/tmp/graph4284954156885010077.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4284954156885010077.bin' '-l' '-1' '-v' '-w' '/tmp/graph4284954156885010077.weights' '-q' '0' '-e' '0.001'
[2022-06-10 04:27:35] [INFO ] Decomposing Gal with order
[2022-06-10 04:27:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 04:27:35] [INFO ] Removed a total of 427 redundant transitions.
[2022-06-10 04:27:35] [INFO ] Flatten gal took : 82 ms
[2022-06-10 04:27:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 134 labels/synchronizations in 19 ms.
[2022-06-10 04:27:35] [INFO ] Time to serialize gal into /tmp/UpperBounds5087734297637369860.gal : 15 ms
[2022-06-10 04:27:35] [INFO ] Time to serialize properties into /tmp/UpperBounds18196060928271070402.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/UpperBounds5087734297637369860.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds18196060928271070402.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/UpperBounds18196060928271070402.prop.
Detected timeout of ITS tools.
[2022-06-10 04:48:04] [INFO ] Flatten gal took : 14 ms
[2022-06-10 04:48:04] [INFO ] Time to serialize gal into /tmp/UpperBounds17168897680029726618.gal : 3 ms
[2022-06-10 04:48:04] [INFO ] Time to serialize properties into /tmp/UpperBounds4213750441477650356.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/UpperBounds17168897680029726618.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4213750441477650356.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...296
Loading property file /tmp/UpperBounds4213750441477650356.prop.
Detected timeout of ITS tools.
[2022-06-10 05:08:32] [INFO ] Flatten gal took : 19 ms
[2022-06-10 05:08:32] [INFO ] Input system was already deterministic with 248 transitions.
[2022-06-10 05:08:32] [INFO ] Transformed 99 places.
[2022-06-10 05:08:32] [INFO ] Transformed 248 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-10 05:08:32] [INFO ] Time to serialize gal into /tmp/UpperBounds6670462658871528726.gal : 3 ms
[2022-06-10 05:08:32] [INFO ] Time to serialize properties into /tmp/UpperBounds1639849149568006351.prop : 8 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/UpperBounds6670462658871528726.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds1639849149568006351.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...340
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds1639849149568006351.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="FunctionPointer-PT-b008"
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 FunctionPointer-PT-b008, 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 r312-tall-165472282200437"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-b008.tgz
mv FunctionPointer-PT-b008 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 ;