Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r168-tall-165277016200069.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Peterson-PT-4, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016200069
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 47K Apr 30 09:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 209K Apr 30 09:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 83K Apr 30 09:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 388K Apr 30 09:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 26K May 9 08:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 9 08:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 17K May 9 08:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 9 08:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.5K May 9 08:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 298K May 10 09:34 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Peterson-PT-4-UpperBounds-00
FORMULA_NAME Peterson-PT-4-UpperBounds-01
FORMULA_NAME Peterson-PT-4-UpperBounds-02
FORMULA_NAME Peterson-PT-4-UpperBounds-03
FORMULA_NAME Peterson-PT-4-UpperBounds-04
FORMULA_NAME Peterson-PT-4-UpperBounds-05
FORMULA_NAME Peterson-PT-4-UpperBounds-06
FORMULA_NAME Peterson-PT-4-UpperBounds-07
FORMULA_NAME Peterson-PT-4-UpperBounds-08
FORMULA_NAME Peterson-PT-4-UpperBounds-09
FORMULA_NAME Peterson-PT-4-UpperBounds-10
FORMULA_NAME Peterson-PT-4-UpperBounds-11
FORMULA_NAME Peterson-PT-4-UpperBounds-12
FORMULA_NAME Peterson-PT-4-UpperBounds-13
FORMULA_NAME Peterson-PT-4-UpperBounds-14
FORMULA_NAME Peterson-PT-4-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652782232718

Running Version 202205111006
[2022-05-17 10:10:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 10:10:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 10:10:34] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2022-05-17 10:10:34] [INFO ] Transformed 480 places.
[2022-05-17 10:10:34] [INFO ] Transformed 690 transitions.
[2022-05-17 10:10:34] [INFO ] Found NUPN structural information;
[2022-05-17 10:10:34] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_0_3_4, IsEndLoop_1_3_4, TestAlone_3_1_4, TestAlone_2_2_4, TestIdentity_2_3_4, TestIdentity_4_0_4, AskForSection_0_3, AskForSection_0_2]
[2022-05-17 10:10:34] [INFO ] Parsed PT model containing 480 places and 690 transitions in 225 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
FORMULA Peterson-PT-4-UpperBounds-05 4 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-4-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 630 out of 690 initially.
// Phase 1: matrix 630 rows 480 cols
[2022-05-17 10:10:34] [INFO ] Computed 19 place invariants in 28 ms
FORMULA Peterson-PT-4-UpperBounds-02 5 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-4-UpperBounds-01 5 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 12) seen :17
FORMULA Peterson-PT-4-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 6) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 6) seen :10
[2022-05-17 10:10:34] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2022-05-17 10:10:34] [INFO ] Computed 19 place invariants in 7 ms
[2022-05-17 10:10:34] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned unsat
[2022-05-17 10:10:34] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2022-05-17 10:10:34] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-17 10:10:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 10:10:34] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2022-05-17 10:10:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 10:10:35] [INFO ] [Nat]Absence check using 14 positive place invariants in 12 ms returned sat
[2022-05-17 10:10:35] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2022-05-17 10:10:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 10:10:35] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2022-05-17 10:10:35] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 10:10:35] [INFO ] [Nat]Added 116 Read/Feed constraints in 33 ms returned sat
[2022-05-17 10:10:35] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 7 ms to minimize.
[2022-05-17 10:10:35] [INFO ] Deduced a trap composed of 32 places in 153 ms of which 2 ms to minimize.
[2022-05-17 10:10:35] [INFO ] Deduced a trap composed of 39 places in 134 ms of which 1 ms to minimize.
[2022-05-17 10:10:35] [INFO ] Deduced a trap composed of 61 places in 129 ms of which 2 ms to minimize.
[2022-05-17 10:10:36] [INFO ] Deduced a trap composed of 21 places in 141 ms of which 1 ms to minimize.
[2022-05-17 10:10:36] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 1 ms to minimize.
[2022-05-17 10:10:36] [INFO ] Deduced a trap composed of 18 places in 144 ms of which 4 ms to minimize.
[2022-05-17 10:10:36] [INFO ] Deduced a trap composed of 54 places in 110 ms of which 0 ms to minimize.
[2022-05-17 10:10:36] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 1 ms to minimize.
[2022-05-17 10:10:36] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 1 ms to minimize.
[2022-05-17 10:10:37] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 0 ms to minimize.
[2022-05-17 10:10:37] [INFO ] Deduced a trap composed of 54 places in 113 ms of which 1 ms to minimize.
[2022-05-17 10:10:37] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 0 ms to minimize.
[2022-05-17 10:10:37] [INFO ] Deduced a trap composed of 54 places in 130 ms of which 0 ms to minimize.
[2022-05-17 10:10:37] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 1 ms to minimize.
[2022-05-17 10:10:37] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 1 ms to minimize.
[2022-05-17 10:10:37] [INFO ] Deduced a trap composed of 43 places in 112 ms of which 0 ms to minimize.
[2022-05-17 10:10:39] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 0 ms to minimize.
[2022-05-17 10:10:39] [INFO ] Deduced a trap composed of 69 places in 101 ms of which 0 ms to minimize.
[2022-05-17 10:10:39] [INFO ] Deduced a trap composed of 83 places in 101 ms of which 1 ms to minimize.
[2022-05-17 10:10:39] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 2 ms to minimize.
[2022-05-17 10:10:39] [INFO ] Trap strengthening (SAT) tested/added 21/21 trap constraints in 4690 ms
[2022-05-17 10:10:39] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2022-05-17 10:10:39] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-17 10:10:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 10:10:40] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2022-05-17 10:10:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 10:10:40] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2022-05-17 10:10:40] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-17 10:10:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 10:10:40] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2022-05-17 10:10:40] [INFO ] [Nat]Added 116 Read/Feed constraints in 34 ms returned sat
[2022-05-17 10:10:40] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 0 ms to minimize.
[2022-05-17 10:10:40] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 1 ms to minimize.
[2022-05-17 10:10:40] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 0 ms to minimize.
[2022-05-17 10:10:41] [INFO ] Deduced a trap composed of 61 places in 116 ms of which 0 ms to minimize.
[2022-05-17 10:10:41] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 1 ms to minimize.
[2022-05-17 10:10:41] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 1 ms to minimize.
[2022-05-17 10:10:41] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 1 ms to minimize.
[2022-05-17 10:10:41] [INFO ] Deduced a trap composed of 54 places in 121 ms of which 1 ms to minimize.
[2022-05-17 10:10:41] [INFO ] Deduced a trap composed of 40 places in 121 ms of which 1 ms to minimize.
[2022-05-17 10:10:41] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 1 ms to minimize.
[2022-05-17 10:10:42] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 1 ms to minimize.
[2022-05-17 10:10:42] [INFO ] Deduced a trap composed of 54 places in 115 ms of which 0 ms to minimize.
[2022-05-17 10:10:42] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 2 ms to minimize.
[2022-05-17 10:10:42] [INFO ] Deduced a trap composed of 54 places in 124 ms of which 5 ms to minimize.
[2022-05-17 10:10:42] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 0 ms to minimize.
[2022-05-17 10:10:42] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 0 ms to minimize.
[2022-05-17 10:10:42] [INFO ] Deduced a trap composed of 43 places in 103 ms of which 1 ms to minimize.
[2022-05-17 10:10:44] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 0 ms to minimize.
[2022-05-17 10:10:44] [INFO ] Deduced a trap composed of 69 places in 101 ms of which 2 ms to minimize.
[2022-05-17 10:10:44] [INFO ] Deduced a trap composed of 83 places in 96 ms of which 1 ms to minimize.
[2022-05-17 10:10:45] [INFO ] Deduced a trap composed of 84 places in 93 ms of which 0 ms to minimize.
[2022-05-17 10:10:45] [INFO ] Trap strengthening (SAT) tested/added 21/21 trap constraints in 4729 ms
[2022-05-17 10:10:45] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2022-05-17 10:10:45] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-17 10:10:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 10:10:45] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2022-05-17 10:10:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 10:10:45] [INFO ] [Nat]Absence check using 14 positive place invariants in 14 ms returned sat
[2022-05-17 10:10:45] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-17 10:10:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 10:10:45] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2022-05-17 10:10:45] [INFO ] [Nat]Added 116 Read/Feed constraints in 39 ms returned sat
[2022-05-17 10:10:45] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 1 ms to minimize.
[2022-05-17 10:10:45] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 0 ms to minimize.
[2022-05-17 10:10:46] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 0 ms to minimize.
[2022-05-17 10:10:46] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 2 ms to minimize.
[2022-05-17 10:10:46] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 1 ms to minimize.
[2022-05-17 10:10:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 749 ms
[2022-05-17 10:10:46] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2022-05-17 10:10:46] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 0 ms returned sat
[2022-05-17 10:10:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 10:10:46] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2022-05-17 10:10:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 10:10:46] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2022-05-17 10:10:46] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 0 ms returned sat
[2022-05-17 10:10:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 10:10:46] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2022-05-17 10:10:46] [INFO ] [Nat]Added 116 Read/Feed constraints in 33 ms returned sat
[2022-05-17 10:10:47] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 0 ms to minimize.
[2022-05-17 10:10:47] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 1 ms to minimize.
[2022-05-17 10:10:47] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 0 ms to minimize.
[2022-05-17 10:10:47] [INFO ] Deduced a trap composed of 61 places in 123 ms of which 0 ms to minimize.
[2022-05-17 10:10:47] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 1 ms to minimize.
[2022-05-17 10:10:47] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 0 ms to minimize.
[2022-05-17 10:10:48] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 0 ms to minimize.
[2022-05-17 10:10:48] [INFO ] Deduced a trap composed of 54 places in 123 ms of which 0 ms to minimize.
[2022-05-17 10:10:48] [INFO ] Deduced a trap composed of 40 places in 129 ms of which 4 ms to minimize.
[2022-05-17 10:10:48] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 1 ms to minimize.
[2022-05-17 10:10:48] [INFO ] Deduced a trap composed of 87 places in 116 ms of which 1 ms to minimize.
[2022-05-17 10:10:48] [INFO ] Deduced a trap composed of 54 places in 109 ms of which 0 ms to minimize.
[2022-05-17 10:10:48] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 1 ms to minimize.
[2022-05-17 10:10:49] [INFO ] Deduced a trap composed of 54 places in 117 ms of which 1 ms to minimize.
[2022-05-17 10:10:49] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 0 ms to minimize.
[2022-05-17 10:10:49] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 0 ms to minimize.
[2022-05-17 10:10:49] [INFO ] Deduced a trap composed of 43 places in 110 ms of which 1 ms to minimize.
[2022-05-17 10:10:51] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 1 ms to minimize.
[2022-05-17 10:10:51] [INFO ] Deduced a trap composed of 69 places in 104 ms of which 2 ms to minimize.
[2022-05-17 10:10:51] [INFO ] Deduced a trap composed of 83 places in 100 ms of which 2 ms to minimize.
[2022-05-17 10:10:51] [INFO ] Deduced a trap composed of 84 places in 93 ms of which 1 ms to minimize.
[2022-05-17 10:10:51] [INFO ] Trap strengthening (SAT) tested/added 21/21 trap constraints in 4731 ms
[2022-05-17 10:10:51] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2022-05-17 10:10:51] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-17 10:10:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 10:10:51] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2022-05-17 10:10:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 10:10:52] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2022-05-17 10:10:52] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-17 10:10:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 10:10:52] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2022-05-17 10:10:52] [INFO ] [Nat]Added 116 Read/Feed constraints in 22 ms returned sat
[2022-05-17 10:10:52] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 42 ms.
[2022-05-17 10:10:53] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 1 ms to minimize.
[2022-05-17 10:10:53] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 0 ms to minimize.
[2022-05-17 10:10:54] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 1 ms to minimize.
[2022-05-17 10:10:54] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 1 ms to minimize.
[2022-05-17 10:10:54] [INFO ] Deduced a trap composed of 58 places in 120 ms of which 0 ms to minimize.
[2022-05-17 10:10:54] [INFO ] Deduced a trap composed of 43 places in 109 ms of which 0 ms to minimize.
[2022-05-17 10:10:54] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 0 ms to minimize.
[2022-05-17 10:10:54] [INFO ] Deduced a trap composed of 88 places in 112 ms of which 0 ms to minimize.
[2022-05-17 10:10:55] [INFO ] Deduced a trap composed of 107 places in 99 ms of which 1 ms to minimize.
[2022-05-17 10:10:55] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
[2022-05-17 10:10:55] [INFO ] Deduced a trap composed of 87 places in 121 ms of which 0 ms to minimize.
[2022-05-17 10:10:55] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 0 ms to minimize.
[2022-05-17 10:10:55] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 0 ms to minimize.
[2022-05-17 10:10:55] [INFO ] Deduced a trap composed of 91 places in 108 ms of which 0 ms to minimize.
[2022-05-17 10:10:55] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 1 ms to minimize.
[2022-05-17 10:10:55] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2311 ms
[2022-05-17 10:10:56] [INFO ] Added : 210 causal constraints over 43 iterations in 4104 ms. Result :sat
Minimization took 113 ms.
Current structural bounds on expressions (after SMT) : [5, 5, 5, 4, 5, 1] Max seen :[5, 1, 1, 4, 1, 0]
FORMULA Peterson-PT-4-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-4-UpperBounds-00 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 6 out of 480 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 480 transition count 490
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 280 transition count 490
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 400 place count 280 transition count 395
Deduced a syphon composed of 95 places in 1 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 590 place count 185 transition count 395
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 628 place count 166 transition count 376
Applied a total of 628 rules in 58 ms. Remains 166 /480 variables (removed 314) and now considering 376/690 (removed 314) transitions.
Finished structural reductions, in 1 iterations. Remains : 166/480 places, 376/690 transitions.
Normalized transition count is 316 out of 376 initially.
// Phase 1: matrix 316 rows 166 cols
[2022-05-17 10:10:56] [INFO ] Computed 19 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1430 ms. (steps per millisecond=699 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 468 ms. (steps per millisecond=2136 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 444 ms. (steps per millisecond=2252 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 426 ms. (steps per millisecond=2347 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 493 ms. (steps per millisecond=2028 ) properties (out of 4) seen :3
[2022-05-17 10:11:00] [INFO ] Flow matrix only has 316 transitions (discarded 60 similar events)
// Phase 1: matrix 316 rows 166 cols
[2022-05-17 10:11:00] [INFO ] Computed 19 place invariants in 4 ms
[2022-05-17 10:11:00] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2022-05-17 10:11:00] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-17 10:11:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 10:11:00] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2022-05-17 10:11:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 10:11:00] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2022-05-17 10:11:00] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-17 10:11:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 10:11:00] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2022-05-17 10:11:00] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 10:11:00] [INFO ] [Nat]Added 116 Read/Feed constraints in 14 ms returned sat
[2022-05-17 10:11:00] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2022-05-17 10:11:00] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 0 ms to minimize.
[2022-05-17 10:11:00] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 0 ms to minimize.
[2022-05-17 10:11:00] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 0 ms to minimize.
[2022-05-17 10:11:00] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 0 ms to minimize.
[2022-05-17 10:11:00] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 0 ms to minimize.
[2022-05-17 10:11:00] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 0 ms to minimize.
[2022-05-17 10:11:00] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2022-05-17 10:11:00] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 0 ms to minimize.
[2022-05-17 10:11:00] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 0 ms to minimize.
[2022-05-17 10:11:01] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2022-05-17 10:11:01] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 0 ms to minimize.
[2022-05-17 10:11:01] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2022-05-17 10:11:01] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2022-05-17 10:11:01] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 0 ms to minimize.
[2022-05-17 10:11:01] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 0 ms to minimize.
[2022-05-17 10:11:01] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2022-05-17 10:11:01] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2022-05-17 10:11:02] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 0 ms to minimize.
[2022-05-17 10:11:02] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2022-05-17 10:11:02] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2022-05-17 10:11:02] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
[2022-05-17 10:11:02] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 0 ms to minimize.
[2022-05-17 10:11:02] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 0 ms to minimize.
[2022-05-17 10:11:02] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2022-05-17 10:11:02] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 0 ms to minimize.
[2022-05-17 10:11:02] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 0 ms to minimize.
[2022-05-17 10:11:02] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
[2022-05-17 10:11:02] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2022-05-17 10:11:02] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2022-05-17 10:11:03] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 0 ms to minimize.
[2022-05-17 10:11:03] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
[2022-05-17 10:11:03] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2022-05-17 10:11:03] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 0 ms to minimize.
[2022-05-17 10:11:03] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2022-05-17 10:11:03] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 0 ms to minimize.
[2022-05-17 10:11:03] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 0 ms to minimize.
[2022-05-17 10:11:04] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2022-05-17 10:11:04] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2022-05-17 10:11:04] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 0 ms to minimize.
[2022-05-17 10:11:04] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2022-05-17 10:11:04] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 0 ms to minimize.
[2022-05-17 10:11:04] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 0 ms to minimize.
[2022-05-17 10:11:04] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 0 ms to minimize.
[2022-05-17 10:11:04] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2022-05-17 10:11:04] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2022-05-17 10:11:04] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2022-05-17 10:11:05] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2022-05-17 10:11:05] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 0 ms to minimize.
[2022-05-17 10:11:07] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 0 ms to minimize.
[2022-05-17 10:11:09] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 0 ms to minimize.
[2022-05-17 10:11:09] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 0 ms to minimize.
[2022-05-17 10:11:09] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 0 ms to minimize.
[2022-05-17 10:11:09] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2022-05-17 10:11:10] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2022-05-17 10:11:10] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 0 ms to minimize.
[2022-05-17 10:11:10] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 0 ms to minimize.
[2022-05-17 10:11:10] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2022-05-17 10:11:10] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2022-05-17 10:11:10] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 0 ms to minimize.
[2022-05-17 10:11:10] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2022-05-17 10:11:10] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 0 ms to minimize.
[2022-05-17 10:11:11] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2022-05-17 10:11:11] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 0 ms to minimize.
[2022-05-17 10:11:11] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 0 ms to minimize.
[2022-05-17 10:11:11] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 0 ms to minimize.
[2022-05-17 10:11:11] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2022-05-17 10:11:11] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 0 ms to minimize.
[2022-05-17 10:11:12] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2022-05-17 10:11:12] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 0 ms to minimize.
[2022-05-17 10:11:15] [INFO ] Trap strengthening (SAT) tested/added 70/70 trap constraints in 15500 ms
[2022-05-17 10:11:15] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-17 10:11:15] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-17 10:11:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 10:11:15] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2022-05-17 10:11:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 10:11:15] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-17 10:11:15] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-17 10:11:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 10:11:16] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2022-05-17 10:11:16] [INFO ] [Nat]Added 116 Read/Feed constraints in 13 ms returned sat
[2022-05-17 10:11:16] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2022-05-17 10:11:16] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2022-05-17 10:11:16] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 0 ms to minimize.
[2022-05-17 10:11:16] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 0 ms to minimize.
[2022-05-17 10:11:16] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2022-05-17 10:11:16] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 0 ms to minimize.
[2022-05-17 10:11:16] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 0 ms to minimize.
[2022-05-17 10:11:16] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2022-05-17 10:11:16] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2022-05-17 10:11:16] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2022-05-17 10:11:16] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 0 ms to minimize.
[2022-05-17 10:11:16] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2022-05-17 10:11:16] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2022-05-17 10:11:16] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2022-05-17 10:11:16] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2022-05-17 10:11:17] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 0 ms to minimize.
[2022-05-17 10:11:17] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 0 ms to minimize.
[2022-05-17 10:11:17] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2022-05-17 10:11:17] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 0 ms to minimize.
[2022-05-17 10:11:17] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2022-05-17 10:11:17] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2022-05-17 10:11:17] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2022-05-17 10:11:18] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2022-05-17 10:11:18] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2022-05-17 10:11:18] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 0 ms to minimize.
[2022-05-17 10:11:18] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2022-05-17 10:11:18] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2022-05-17 10:11:18] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 0 ms to minimize.
[2022-05-17 10:11:18] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 0 ms to minimize.
[2022-05-17 10:11:18] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 0 ms to minimize.
[2022-05-17 10:11:18] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 0 ms to minimize.
[2022-05-17 10:11:18] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2022-05-17 10:11:18] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2022-05-17 10:11:19] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2022-05-17 10:11:19] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 0 ms to minimize.
[2022-05-17 10:11:19] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2022-05-17 10:11:19] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 0 ms to minimize.
[2022-05-17 10:11:19] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2022-05-17 10:11:19] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 0 ms to minimize.
[2022-05-17 10:11:19] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2022-05-17 10:11:20] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 0 ms to minimize.
[2022-05-17 10:11:20] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 0 ms to minimize.
[2022-05-17 10:11:20] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2022-05-17 10:11:20] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 0 ms to minimize.
[2022-05-17 10:11:20] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2022-05-17 10:11:20] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2022-05-17 10:11:20] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2022-05-17 10:11:20] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
[2022-05-17 10:11:20] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2022-05-17 10:11:23] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 0 ms to minimize.
[2022-05-17 10:11:24] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 0 ms to minimize.
[2022-05-17 10:11:24] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 0 ms to minimize.
[2022-05-17 10:11:24] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2022-05-17 10:11:25] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 0 ms to minimize.
[2022-05-17 10:11:25] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2022-05-17 10:11:25] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 0 ms to minimize.
[2022-05-17 10:11:25] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 0 ms to minimize.
[2022-05-17 10:11:25] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2022-05-17 10:11:26] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 0 ms to minimize.
[2022-05-17 10:11:26] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2022-05-17 10:11:26] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2022-05-17 10:11:26] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 0 ms to minimize.
[2022-05-17 10:11:26] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 0 ms to minimize.
[2022-05-17 10:11:26] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 0 ms to minimize.
[2022-05-17 10:11:27] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 0 ms to minimize.
[2022-05-17 10:11:27] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 0 ms to minimize.
[2022-05-17 10:11:27] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2022-05-17 10:11:27] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2022-05-17 10:11:28] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 0 ms to minimize.
[2022-05-17 10:11:28] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 0 ms to minimize.
[2022-05-17 10:11:31] [INFO ] Trap strengthening (SAT) tested/added 70/70 trap constraints in 15216 ms
[2022-05-17 10:11:31] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-17 10:11:31] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-17 10:11:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 10:11:31] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2022-05-17 10:11:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 10:11:31] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2022-05-17 10:11:31] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-17 10:11:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 10:11:31] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2022-05-17 10:11:31] [INFO ] [Nat]Added 116 Read/Feed constraints in 12 ms returned sat
[2022-05-17 10:11:31] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2022-05-17 10:11:31] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 0 ms to minimize.
[2022-05-17 10:11:31] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 0 ms to minimize.
[2022-05-17 10:11:31] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2022-05-17 10:11:31] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 0 ms to minimize.
[2022-05-17 10:11:31] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 0 ms to minimize.
[2022-05-17 10:11:31] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2022-05-17 10:11:31] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 0 ms to minimize.
[2022-05-17 10:11:31] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2022-05-17 10:11:32] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2022-05-17 10:11:32] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2022-05-17 10:11:32] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 0 ms to minimize.
[2022-05-17 10:11:32] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 0 ms to minimize.
[2022-05-17 10:11:32] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
[2022-05-17 10:11:32] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 0 ms to minimize.
[2022-05-17 10:11:32] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 0 ms to minimize.
[2022-05-17 10:11:32] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2022-05-17 10:11:33] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2022-05-17 10:11:33] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 0 ms to minimize.
[2022-05-17 10:11:33] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2022-05-17 10:11:33] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2022-05-17 10:11:33] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2022-05-17 10:11:33] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 0 ms to minimize.
[2022-05-17 10:11:33] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 0 ms to minimize.
[2022-05-17 10:11:33] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2022-05-17 10:11:33] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2022-05-17 10:11:33] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 0 ms to minimize.
[2022-05-17 10:11:33] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2022-05-17 10:11:33] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2022-05-17 10:11:33] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2022-05-17 10:11:34] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2022-05-17 10:11:34] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2022-05-17 10:11:34] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 3 ms to minimize.
[2022-05-17 10:11:34] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2022-05-17 10:11:34] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 0 ms to minimize.
[2022-05-17 10:11:34] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2022-05-17 10:11:34] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 0 ms to minimize.
[2022-05-17 10:11:34] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 0 ms to minimize.
[2022-05-17 10:11:35] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 0 ms to minimize.
[2022-05-17 10:11:35] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 0 ms to minimize.
[2022-05-17 10:11:35] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 0 ms to minimize.
[2022-05-17 10:11:35] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 0 ms to minimize.
[2022-05-17 10:11:35] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2022-05-17 10:11:35] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
[2022-05-17 10:11:35] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2022-05-17 10:11:35] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2022-05-17 10:11:35] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2022-05-17 10:11:35] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2022-05-17 10:11:36] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2022-05-17 10:11:38] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2022-05-17 10:11:39] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2022-05-17 10:11:40] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 0 ms to minimize.
[2022-05-17 10:11:40] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2022-05-17 10:11:40] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 0 ms to minimize.
[2022-05-17 10:11:40] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2022-05-17 10:11:40] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 0 ms to minimize.
[2022-05-17 10:11:40] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2022-05-17 10:11:41] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 0 ms to minimize.
[2022-05-17 10:11:41] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 0 ms to minimize.
[2022-05-17 10:11:41] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 0 ms to minimize.
[2022-05-17 10:11:41] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 0 ms to minimize.
[2022-05-17 10:11:41] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 0 ms to minimize.
[2022-05-17 10:11:41] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2022-05-17 10:11:42] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
[2022-05-17 10:11:42] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2022-05-17 10:11:42] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 0 ms to minimize.
[2022-05-17 10:11:42] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 0 ms to minimize.
[2022-05-17 10:11:42] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 0 ms to minimize.
[2022-05-17 10:11:43] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 0 ms to minimize.
[2022-05-17 10:11:43] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 0 ms to minimize.
[2022-05-17 10:11:46] [INFO ] Trap strengthening (SAT) tested/added 70/70 trap constraints in 14958 ms
[2022-05-17 10:11:46] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2022-05-17 10:11:46] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-17 10:11:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 10:11:46] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2022-05-17 10:11:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 10:11:46] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2022-05-17 10:11:46] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-17 10:11:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 10:11:46] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2022-05-17 10:11:46] [INFO ] [Nat]Added 116 Read/Feed constraints in 9 ms returned sat
[2022-05-17 10:11:46] [INFO ] Computed and/alt/rep : 275/792/275 causal constraints (skipped 36 transitions) in 18 ms.
[2022-05-17 10:11:46] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 0 ms to minimize.
[2022-05-17 10:11:46] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2022-05-17 10:11:47] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2022-05-17 10:11:47] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 0 ms to minimize.
[2022-05-17 10:11:47] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2022-05-17 10:11:47] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 354 ms
[2022-05-17 10:11:47] [INFO ] Added : 56 causal constraints over 12 iterations in 607 ms. Result :sat
Minimization took 56 ms.
Current structural bounds on expressions (after SMT) : [5, 5, 5, 1] Max seen :[1, 1, 1, 0]
Support contains 6 out of 166 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 166/166 places, 376/376 transitions.
Applied a total of 0 rules in 15 ms. Remains 166 /166 variables (removed 0) and now considering 376/376 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 166/166 places, 376/376 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 166/166 places, 376/376 transitions.
Applied a total of 0 rules in 12 ms. Remains 166 /166 variables (removed 0) and now considering 376/376 (removed 0) transitions.
[2022-05-17 10:11:47] [INFO ] Flow matrix only has 316 transitions (discarded 60 similar events)
// Phase 1: matrix 316 rows 166 cols
[2022-05-17 10:11:47] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-17 10:11:47] [INFO ] Implicit Places using invariants in 117 ms returned [153, 154, 155, 156, 157]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 119 ms to find 5 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 161/166 places, 376/376 transitions.
Applied a total of 0 rules in 10 ms. Remains 161 /161 variables (removed 0) and now considering 376/376 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 161/166 places, 376/376 transitions.
Normalized transition count is 316 out of 376 initially.
// Phase 1: matrix 316 rows 161 cols
[2022-05-17 10:11:47] [INFO ] Computed 14 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1312 ms. (steps per millisecond=762 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 412 ms. (steps per millisecond=2427 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 426 ms. (steps per millisecond=2347 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 412 ms. (steps per millisecond=2427 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 434 ms. (steps per millisecond=2304 ) properties (out of 4) seen :3
[2022-05-17 10:11:50] [INFO ] Flow matrix only has 316 transitions (discarded 60 similar events)
// Phase 1: matrix 316 rows 161 cols
[2022-05-17 10:11:50] [INFO ] Computed 14 place invariants in 5 ms
[2022-05-17 10:11:50] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-17 10:11:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 10:11:50] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2022-05-17 10:11:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 10:11:50] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2022-05-17 10:11:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 10:11:50] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2022-05-17 10:11:50] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 10:11:50] [INFO ] [Nat]Added 116 Read/Feed constraints in 12 ms returned sat
[2022-05-17 10:11:50] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 0 ms to minimize.
[2022-05-17 10:11:50] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2022-05-17 10:11:50] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
[2022-05-17 10:11:51] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 0 ms to minimize.
[2022-05-17 10:11:51] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
[2022-05-17 10:11:51] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2022-05-17 10:11:51] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 0 ms to minimize.
[2022-05-17 10:11:51] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 0 ms to minimize.
[2022-05-17 10:11:51] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 0 ms to minimize.
[2022-05-17 10:11:51] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2022-05-17 10:11:51] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2022-05-17 10:11:51] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2022-05-17 10:11:51] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2022-05-17 10:11:51] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 0 ms to minimize.
[2022-05-17 10:11:51] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2022-05-17 10:11:51] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 0 ms to minimize.
[2022-05-17 10:11:51] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
[2022-05-17 10:11:52] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2022-05-17 10:11:52] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2022-05-17 10:11:52] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2022-05-17 10:11:52] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 0 ms to minimize.
[2022-05-17 10:11:52] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 0 ms to minimize.
[2022-05-17 10:11:52] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 0 ms to minimize.
[2022-05-17 10:11:52] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 0 ms to minimize.
[2022-05-17 10:11:52] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 0 ms to minimize.
[2022-05-17 10:11:52] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 0 ms to minimize.
[2022-05-17 10:11:52] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2022-05-17 10:11:52] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 0 ms to minimize.
[2022-05-17 10:11:52] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2022-05-17 10:11:52] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2022-05-17 10:11:53] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 0 ms to minimize.
[2022-05-17 10:11:53] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 0 ms to minimize.
[2022-05-17 10:11:53] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 0 ms to minimize.
[2022-05-17 10:11:53] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 0 ms to minimize.
[2022-05-17 10:11:53] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2022-05-17 10:11:55] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2022-05-17 10:11:55] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
[2022-05-17 10:11:55] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2022-05-17 10:11:55] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2022-05-17 10:11:56] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 0 ms to minimize.
[2022-05-17 10:11:56] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2022-05-17 10:11:56] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 0 ms to minimize.
[2022-05-17 10:11:56] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 0 ms to minimize.
[2022-05-17 10:11:56] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 0 ms to minimize.
[2022-05-17 10:11:56] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2022-05-17 10:11:56] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 0 ms to minimize.
[2022-05-17 10:11:56] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 0 ms to minimize.
[2022-05-17 10:11:56] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 0 ms to minimize.
[2022-05-17 10:11:56] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2022-05-17 10:11:56] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2022-05-17 10:11:56] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2022-05-17 10:11:57] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2022-05-17 10:11:57] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 0 ms to minimize.
[2022-05-17 10:11:57] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 0 ms to minimize.
[2022-05-17 10:11:57] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 0 ms to minimize.
[2022-05-17 10:11:57] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2022-05-17 10:11:57] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 0 ms to minimize.
[2022-05-17 10:11:57] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 11 ms to minimize.
[2022-05-17 10:11:58] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2022-05-17 10:11:58] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 0 ms to minimize.
[2022-05-17 10:11:58] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
[2022-05-17 10:11:58] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 0 ms to minimize.
[2022-05-17 10:11:58] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2022-05-17 10:11:58] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2022-05-17 10:11:58] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2022-05-17 10:11:58] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2022-05-17 10:11:58] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 0 ms to minimize.
[2022-05-17 10:11:59] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2022-05-17 10:12:00] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 0 ms to minimize.
[2022-05-17 10:12:01] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 0 ms to minimize.
[2022-05-17 10:12:04] [INFO ] Trap strengthening (SAT) tested/added 70/70 trap constraints in 13755 ms
[2022-05-17 10:12:04] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-17 10:12:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 10:12:04] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2022-05-17 10:12:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 10:12:04] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-17 10:12:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 10:12:04] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2022-05-17 10:12:04] [INFO ] [Nat]Added 116 Read/Feed constraints in 12 ms returned sat
[2022-05-17 10:12:04] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 0 ms to minimize.
[2022-05-17 10:12:04] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2022-05-17 10:12:04] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 0 ms to minimize.
[2022-05-17 10:12:04] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2022-05-17 10:12:05] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 0 ms to minimize.
[2022-05-17 10:12:05] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2022-05-17 10:12:05] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 0 ms to minimize.
[2022-05-17 10:12:05] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 0 ms to minimize.
[2022-05-17 10:12:05] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 0 ms to minimize.
[2022-05-17 10:12:05] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 0 ms to minimize.
[2022-05-17 10:12:05] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2022-05-17 10:12:05] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2022-05-17 10:12:05] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 0 ms to minimize.
[2022-05-17 10:12:05] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 0 ms to minimize.
[2022-05-17 10:12:05] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2022-05-17 10:12:05] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
[2022-05-17 10:12:05] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
[2022-05-17 10:12:05] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2022-05-17 10:12:06] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2022-05-17 10:12:06] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2022-05-17 10:12:06] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2022-05-17 10:12:06] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 0 ms to minimize.
[2022-05-17 10:12:06] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 0 ms to minimize.
[2022-05-17 10:12:06] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 0 ms to minimize.
[2022-05-17 10:12:06] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2022-05-17 10:12:06] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 0 ms to minimize.
[2022-05-17 10:12:06] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 0 ms to minimize.
[2022-05-17 10:12:06] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 0 ms to minimize.
[2022-05-17 10:12:06] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 0 ms to minimize.
[2022-05-17 10:12:06] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 0 ms to minimize.
[2022-05-17 10:12:06] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2022-05-17 10:12:07] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 0 ms to minimize.
[2022-05-17 10:12:07] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 0 ms to minimize.
[2022-05-17 10:12:07] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2022-05-17 10:12:07] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2022-05-17 10:12:09] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 0 ms to minimize.
[2022-05-17 10:12:09] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2022-05-17 10:12:09] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2022-05-17 10:12:09] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2022-05-17 10:12:09] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 0 ms to minimize.
[2022-05-17 10:12:10] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2022-05-17 10:12:10] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2022-05-17 10:12:10] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 0 ms to minimize.
[2022-05-17 10:12:10] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 0 ms to minimize.
[2022-05-17 10:12:10] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2022-05-17 10:12:10] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 0 ms to minimize.
[2022-05-17 10:12:10] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 0 ms to minimize.
[2022-05-17 10:12:10] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 0 ms to minimize.
[2022-05-17 10:12:10] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
[2022-05-17 10:12:10] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2022-05-17 10:12:10] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2022-05-17 10:12:10] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2022-05-17 10:12:10] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2022-05-17 10:12:11] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 0 ms to minimize.
[2022-05-17 10:12:11] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 0 ms to minimize.
[2022-05-17 10:12:11] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2022-05-17 10:12:11] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
[2022-05-17 10:12:11] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2022-05-17 10:12:12] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2022-05-17 10:12:12] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
[2022-05-17 10:12:12] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2022-05-17 10:12:12] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2022-05-17 10:12:12] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
[2022-05-17 10:12:12] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
[2022-05-17 10:12:12] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 0 ms to minimize.
[2022-05-17 10:12:12] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2022-05-17 10:12:12] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2022-05-17 10:12:13] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 0 ms to minimize.
[2022-05-17 10:12:14] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2022-05-17 10:12:15] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 0 ms to minimize.
[2022-05-17 10:12:18] [INFO ] Trap strengthening (SAT) tested/added 70/70 trap constraints in 13677 ms
[2022-05-17 10:12:18] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-17 10:12:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 10:12:18] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2022-05-17 10:12:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 10:12:18] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-17 10:12:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 10:12:18] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2022-05-17 10:12:18] [INFO ] [Nat]Added 116 Read/Feed constraints in 9 ms returned sat
[2022-05-17 10:12:18] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 0 ms to minimize.
[2022-05-17 10:12:18] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2022-05-17 10:12:18] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2022-05-17 10:12:18] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2022-05-17 10:12:18] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2022-05-17 10:12:18] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2022-05-17 10:12:18] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2022-05-17 10:12:19] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2022-05-17 10:12:19] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 0 ms to minimize.
[2022-05-17 10:12:19] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2022-05-17 10:12:19] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2022-05-17 10:12:19] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2022-05-17 10:12:19] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2022-05-17 10:12:19] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 0 ms to minimize.
[2022-05-17 10:12:19] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2022-05-17 10:12:19] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2022-05-17 10:12:19] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 0 ms to minimize.
[2022-05-17 10:12:19] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2022-05-17 10:12:19] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2022-05-17 10:12:19] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2022-05-17 10:12:20] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 0 ms to minimize.
[2022-05-17 10:12:20] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 0 ms to minimize.
[2022-05-17 10:12:20] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 0 ms to minimize.
[2022-05-17 10:12:20] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 0 ms to minimize.
[2022-05-17 10:12:20] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 0 ms to minimize.
[2022-05-17 10:12:20] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2022-05-17 10:12:20] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2022-05-17 10:12:20] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 0 ms to minimize.
[2022-05-17 10:12:20] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 0 ms to minimize.
[2022-05-17 10:12:20] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 0 ms to minimize.
[2022-05-17 10:12:20] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 0 ms to minimize.
[2022-05-17 10:12:21] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 0 ms to minimize.
[2022-05-17 10:12:21] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2022-05-17 10:12:21] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2022-05-17 10:12:21] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 0 ms to minimize.
[2022-05-17 10:12:23] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2022-05-17 10:12:23] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 0 ms to minimize.
[2022-05-17 10:12:23] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2022-05-17 10:12:23] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2022-05-17 10:12:23] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 0 ms to minimize.
[2022-05-17 10:12:23] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 0 ms to minimize.
[2022-05-17 10:12:24] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 0 ms to minimize.
[2022-05-17 10:12:24] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 0 ms to minimize.
[2022-05-17 10:12:24] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2022-05-17 10:12:24] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2022-05-17 10:12:24] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2022-05-17 10:12:24] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 0 ms to minimize.
[2022-05-17 10:12:24] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2022-05-17 10:12:24] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2022-05-17 10:12:24] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
[2022-05-17 10:12:24] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2022-05-17 10:12:24] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2022-05-17 10:12:24] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 0 ms to minimize.
[2022-05-17 10:12:24] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 0 ms to minimize.
[2022-05-17 10:12:25] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 0 ms to minimize.
[2022-05-17 10:12:25] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2022-05-17 10:12:25] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 0 ms to minimize.
[2022-05-17 10:12:25] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 0 ms to minimize.
[2022-05-17 10:12:26] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 0 ms to minimize.
[2022-05-17 10:12:26] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 0 ms to minimize.
[2022-05-17 10:12:26] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 0 ms to minimize.
[2022-05-17 10:12:26] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 0 ms to minimize.
[2022-05-17 10:12:26] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2022-05-17 10:12:26] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
[2022-05-17 10:12:26] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2022-05-17 10:12:26] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2022-05-17 10:12:26] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 0 ms to minimize.
[2022-05-17 10:12:27] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 0 ms to minimize.
[2022-05-17 10:12:28] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 0 ms to minimize.
[2022-05-17 10:12:29] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2022-05-17 10:12:32] [INFO ] Trap strengthening (SAT) tested/added 70/70 trap constraints in 13768 ms
[2022-05-17 10:12:32] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-17 10:12:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 10:12:32] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2022-05-17 10:12:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 10:12:32] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-17 10:12:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 10:12:32] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2022-05-17 10:12:32] [INFO ] [Nat]Added 116 Read/Feed constraints in 7 ms returned sat
[2022-05-17 10:12:32] [INFO ] Computed and/alt/rep : 275/792/275 causal constraints (skipped 36 transitions) in 18 ms.
[2022-05-17 10:12:33] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2022-05-17 10:12:33] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2022-05-17 10:12:33] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 0 ms to minimize.
[2022-05-17 10:12:33] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 5 ms to minimize.
[2022-05-17 10:12:33] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2022-05-17 10:12:33] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 0 ms to minimize.
[2022-05-17 10:12:33] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 0 ms to minimize.
[2022-05-17 10:12:33] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2022-05-17 10:12:33] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 0 ms to minimize.
[2022-05-17 10:12:33] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2022-05-17 10:12:33] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2022-05-17 10:12:33] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2022-05-17 10:12:34] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2022-05-17 10:12:34] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2022-05-17 10:12:34] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2022-05-17 10:12:34] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2022-05-17 10:12:34] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2022-05-17 10:12:34] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2022-05-17 10:12:34] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2022-05-17 10:12:34] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2022-05-17 10:12:34] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 0 ms to minimize.
[2022-05-17 10:12:34] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 0 ms to minimize.
[2022-05-17 10:12:34] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2022-05-17 10:12:34] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2022-05-17 10:12:34] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
[2022-05-17 10:12:34] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2022-05-17 10:12:34] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
[2022-05-17 10:12:34] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2022-05-17 10:12:35] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2022-05-17 10:12:35] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2022-05-17 10:12:35] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 2040 ms
[2022-05-17 10:12:35] [INFO ] Added : 151 causal constraints over 31 iterations in 2672 ms. Result :sat
Minimization took 75 ms.
Current structural bounds on expressions (after SMT) : [5, 5, 5, 1] Max seen :[1, 1, 1, 0]
Support contains 6 out of 161 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 161/161 places, 376/376 transitions.
Applied a total of 0 rules in 18 ms. Remains 161 /161 variables (removed 0) and now considering 376/376 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 161/161 places, 376/376 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 161/161 places, 376/376 transitions.
Applied a total of 0 rules in 8 ms. Remains 161 /161 variables (removed 0) and now considering 376/376 (removed 0) transitions.
[2022-05-17 10:12:35] [INFO ] Flow matrix only has 316 transitions (discarded 60 similar events)
// Phase 1: matrix 316 rows 161 cols
[2022-05-17 10:12:35] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-17 10:12:35] [INFO ] Implicit Places using invariants in 108 ms returned []
[2022-05-17 10:12:35] [INFO ] Flow matrix only has 316 transitions (discarded 60 similar events)
// Phase 1: matrix 316 rows 161 cols
[2022-05-17 10:12:35] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-17 10:12:35] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 10:12:35] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
[2022-05-17 10:12:35] [INFO ] Redundant transitions in 20 ms returned []
[2022-05-17 10:12:35] [INFO ] Flow matrix only has 316 transitions (discarded 60 similar events)
// Phase 1: matrix 316 rows 161 cols
[2022-05-17 10:12:35] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-17 10:12:35] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 161/161 places, 376/376 transitions.
Starting property specific reduction for Peterson-PT-4-UpperBounds-03
Normalized transition count is 316 out of 376 initially.
// Phase 1: matrix 316 rows 161 cols
[2022-05-17 10:12:35] [INFO ] Computed 14 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :1
[2022-05-17 10:12:35] [INFO ] Flow matrix only has 316 transitions (discarded 60 similar events)
// Phase 1: matrix 316 rows 161 cols
[2022-05-17 10:12:35] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-17 10:12:36] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-17 10:12:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 10:12:36] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2022-05-17 10:12:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 10:12:36] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2022-05-17 10:12:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 10:12:36] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2022-05-17 10:12:36] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 10:12:36] [INFO ] [Nat]Added 116 Read/Feed constraints in 9 ms returned sat
[2022-05-17 10:12:36] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 0 ms to minimize.
[2022-05-17 10:12:36] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 0 ms to minimize.
[2022-05-17 10:12:36] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2022-05-17 10:12:36] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 0 ms to minimize.
[2022-05-17 10:12:36] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 0 ms to minimize.
[2022-05-17 10:12:36] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2022-05-17 10:12:36] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 0 ms to minimize.
[2022-05-17 10:12:36] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 0 ms to minimize.
[2022-05-17 10:12:36] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 0 ms to minimize.
[2022-05-17 10:12:36] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 0 ms to minimize.
[2022-05-17 10:12:36] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2022-05-17 10:12:37] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2022-05-17 10:12:37] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 0 ms to minimize.
[2022-05-17 10:12:37] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2022-05-17 10:12:37] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
[2022-05-17 10:12:37] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
[2022-05-17 10:12:37] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
[2022-05-17 10:12:37] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2022-05-17 10:12:37] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2022-05-17 10:12:37] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2022-05-17 10:12:37] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 0 ms to minimize.
[2022-05-17 10:12:37] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 0 ms to minimize.
[2022-05-17 10:12:37] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2022-05-17 10:12:38] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 0 ms to minimize.
[2022-05-17 10:12:38] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 0 ms to minimize.
[2022-05-17 10:12:38] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2022-05-17 10:12:38] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2022-05-17 10:12:38] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 0 ms to minimize.
[2022-05-17 10:12:38] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 0 ms to minimize.
[2022-05-17 10:12:38] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 0 ms to minimize.
[2022-05-17 10:12:38] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 0 ms to minimize.
[2022-05-17 10:12:39] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 0 ms to minimize.
[2022-05-17 10:12:39] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 0 ms to minimize.
[2022-05-17 10:12:39] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 0 ms to minimize.
[2022-05-17 10:12:39] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 0 ms to minimize.
[2022-05-17 10:12:41] [INFO ] Trap strengthening (SAT) tested/added 35/35 trap constraints in 4896 ms
Current structural bounds on expressions (after SMT) : [5] Max seen :[1]
Support contains 5 out of 161 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 161/161 places, 376/376 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 160 transition count 375
Applied a total of 2 rules in 13 ms. Remains 160 /161 variables (removed 1) and now considering 375/376 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/161 places, 375/376 transitions.
Normalized transition count is 315 out of 375 initially.
// Phase 1: matrix 315 rows 160 cols
[2022-05-17 10:12:41] [INFO ] Computed 14 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1284 ms. (steps per millisecond=778 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 430 ms. (steps per millisecond=2325 ) properties (out of 1) seen :1
[2022-05-17 10:12:42] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2022-05-17 10:12:42] [INFO ] Computed 14 place invariants in 4 ms
[2022-05-17 10:12:42] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2022-05-17 10:12:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 10:12:42] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2022-05-17 10:12:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 10:12:43] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-17 10:12:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 10:12:43] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2022-05-17 10:12:43] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 10:12:43] [INFO ] [Nat]Added 116 Read/Feed constraints in 15 ms returned sat
[2022-05-17 10:12:43] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 0 ms to minimize.
[2022-05-17 10:12:43] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 0 ms to minimize.
[2022-05-17 10:12:43] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2022-05-17 10:12:43] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 0 ms to minimize.
[2022-05-17 10:12:43] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2022-05-17 10:12:43] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2022-05-17 10:12:43] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
[2022-05-17 10:12:43] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2022-05-17 10:12:43] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2022-05-17 10:12:43] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 0 ms to minimize.
[2022-05-17 10:12:43] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2022-05-17 10:12:43] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2022-05-17 10:12:43] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2022-05-17 10:12:44] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 0 ms to minimize.
[2022-05-17 10:12:44] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 0 ms to minimize.
[2022-05-17 10:12:44] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 0 ms to minimize.
[2022-05-17 10:12:44] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 0 ms to minimize.
[2022-05-17 10:12:45] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 0 ms to minimize.
[2022-05-17 10:12:45] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2022-05-17 10:12:45] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2022-05-17 10:12:45] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 0 ms to minimize.
[2022-05-17 10:12:45] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 0 ms to minimize.
[2022-05-17 10:12:45] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 0 ms to minimize.
[2022-05-17 10:12:45] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 0 ms to minimize.
[2022-05-17 10:12:45] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2022-05-17 10:12:45] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
[2022-05-17 10:12:45] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 0 ms to minimize.
[2022-05-17 10:12:46] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
[2022-05-17 10:12:46] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2022-05-17 10:12:46] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2022-05-17 10:12:46] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2022-05-17 10:12:46] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 0 ms to minimize.
[2022-05-17 10:12:46] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 0 ms to minimize.
[2022-05-17 10:12:47] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 0 ms to minimize.
[2022-05-17 10:12:47] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 0 ms to minimize.
[2022-05-17 10:12:47] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 0 ms to minimize.
[2022-05-17 10:12:47] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2022-05-17 10:12:47] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2022-05-17 10:12:47] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2022-05-17 10:12:47] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2022-05-17 10:12:47] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2022-05-17 10:12:47] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 0 ms to minimize.
[2022-05-17 10:12:47] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 0 ms to minimize.
[2022-05-17 10:12:47] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2022-05-17 10:12:48] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 0 ms to minimize.
[2022-05-17 10:12:48] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2022-05-17 10:12:48] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 0 ms to minimize.
[2022-05-17 10:12:48] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 0 ms to minimize.
[2022-05-17 10:12:49] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 0 ms to minimize.
[2022-05-17 10:12:49] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2022-05-17 10:12:49] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 0 ms to minimize.
[2022-05-17 10:12:49] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 0 ms to minimize.
[2022-05-17 10:12:50] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2022-05-17 10:12:50] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2022-05-17 10:12:50] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
[2022-05-17 10:12:51] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2022-05-17 10:12:51] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 0 ms to minimize.
[2022-05-17 10:12:51] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 0 ms to minimize.
[2022-05-17 10:12:54] [INFO ] Trap strengthening (SAT) tested/added 58/58 trap constraints in 11427 ms
Current structural bounds on expressions (after SMT) : [5] Max seen :[1]
Support contains 5 out of 160 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 160/160 places, 375/375 transitions.
Applied a total of 0 rules in 8 ms. Remains 160 /160 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 375/375 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 160/160 places, 375/375 transitions.
Applied a total of 0 rules in 7 ms. Remains 160 /160 variables (removed 0) and now considering 375/375 (removed 0) transitions.
[2022-05-17 10:12:54] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2022-05-17 10:12:54] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-17 10:12:54] [INFO ] Implicit Places using invariants in 98 ms returned []
[2022-05-17 10:12:54] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2022-05-17 10:12:54] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-17 10:12:54] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 10:12:54] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
[2022-05-17 10:12:54] [INFO ] Redundant transitions in 12 ms returned []
[2022-05-17 10:12:54] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2022-05-17 10:12:54] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-17 10:12:55] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 375/375 transitions.
Ending property specific reduction for Peterson-PT-4-UpperBounds-03 in 19212 ms.
Starting property specific reduction for Peterson-PT-4-UpperBounds-04
Normalized transition count is 316 out of 376 initially.
// Phase 1: matrix 316 rows 161 cols
[2022-05-17 10:12:55] [INFO ] Computed 14 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :1
[2022-05-17 10:12:55] [INFO ] Flow matrix only has 316 transitions (discarded 60 similar events)
// Phase 1: matrix 316 rows 161 cols
[2022-05-17 10:12:55] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-17 10:12:55] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 10:12:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 10:12:55] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2022-05-17 10:12:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 10:12:55] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-17 10:12:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 10:12:55] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2022-05-17 10:12:55] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 10:12:55] [INFO ] [Nat]Added 116 Read/Feed constraints in 10 ms returned sat
[2022-05-17 10:12:55] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 0 ms to minimize.
[2022-05-17 10:12:55] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2022-05-17 10:12:55] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2022-05-17 10:12:55] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
[2022-05-17 10:12:55] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 0 ms to minimize.
[2022-05-17 10:12:55] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2022-05-17 10:12:55] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 0 ms to minimize.
[2022-05-17 10:12:55] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 0 ms to minimize.
[2022-05-17 10:12:55] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 0 ms to minimize.
[2022-05-17 10:12:55] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 0 ms to minimize.
[2022-05-17 10:12:56] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2022-05-17 10:12:56] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 0 ms to minimize.
[2022-05-17 10:12:56] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 0 ms to minimize.
[2022-05-17 10:12:56] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 0 ms to minimize.
[2022-05-17 10:12:56] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2022-05-17 10:12:56] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2022-05-17 10:12:56] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
[2022-05-17 10:12:56] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2022-05-17 10:12:56] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2022-05-17 10:12:56] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2022-05-17 10:12:56] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 0 ms to minimize.
[2022-05-17 10:12:56] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 0 ms to minimize.
[2022-05-17 10:12:56] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 0 ms to minimize.
[2022-05-17 10:12:57] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2022-05-17 10:12:57] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 0 ms to minimize.
[2022-05-17 10:12:57] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 0 ms to minimize.
[2022-05-17 10:12:57] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 0 ms to minimize.
[2022-05-17 10:12:57] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 0 ms to minimize.
[2022-05-17 10:12:57] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 0 ms to minimize.
[2022-05-17 10:12:57] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 0 ms to minimize.
[2022-05-17 10:12:57] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2022-05-17 10:12:57] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 0 ms to minimize.
[2022-05-17 10:12:58] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 0 ms to minimize.
[2022-05-17 10:12:58] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 0 ms to minimize.
[2022-05-17 10:12:58] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 0 ms to minimize.
[2022-05-17 10:13:00] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 0 ms to minimize.
[2022-05-17 10:13:00] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
[2022-05-17 10:13:00] [INFO ] Trap strengthening (SAT) tested/added 37/37 trap constraints in 4889 ms
Current structural bounds on expressions (after SMT) : [5] Max seen :[1]
Support contains 5 out of 161 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 161/161 places, 376/376 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 160 transition count 375
Applied a total of 2 rules in 13 ms. Remains 160 /161 variables (removed 1) and now considering 375/376 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/161 places, 375/376 transitions.
Normalized transition count is 315 out of 375 initially.
// Phase 1: matrix 315 rows 160 cols
[2022-05-17 10:13:00] [INFO ] Computed 14 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1210 ms. (steps per millisecond=826 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 417 ms. (steps per millisecond=2398 ) properties (out of 1) seen :1
[2022-05-17 10:13:01] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2022-05-17 10:13:01] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-17 10:13:01] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-17 10:13:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 10:13:02] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2022-05-17 10:13:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 10:13:02] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-17 10:13:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 10:13:02] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2022-05-17 10:13:02] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 10:13:02] [INFO ] [Nat]Added 116 Read/Feed constraints in 14 ms returned sat
[2022-05-17 10:13:02] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 0 ms to minimize.
[2022-05-17 10:13:02] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2022-05-17 10:13:02] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 0 ms to minimize.
[2022-05-17 10:13:02] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 0 ms to minimize.
[2022-05-17 10:13:02] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2022-05-17 10:13:02] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2022-05-17 10:13:02] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 0 ms to minimize.
[2022-05-17 10:13:02] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2022-05-17 10:13:02] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 0 ms to minimize.
[2022-05-17 10:13:02] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 0 ms to minimize.
[2022-05-17 10:13:02] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2022-05-17 10:13:02] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2022-05-17 10:13:02] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 0 ms to minimize.
[2022-05-17 10:13:03] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 0 ms to minimize.
[2022-05-17 10:13:03] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2022-05-17 10:13:03] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2022-05-17 10:13:03] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 0 ms to minimize.
[2022-05-17 10:13:04] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 0 ms to minimize.
[2022-05-17 10:13:04] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2022-05-17 10:13:04] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2022-05-17 10:13:04] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2022-05-17 10:13:04] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 0 ms to minimize.
[2022-05-17 10:13:04] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2022-05-17 10:13:04] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2022-05-17 10:13:04] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2022-05-17 10:13:04] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 0 ms to minimize.
[2022-05-17 10:13:04] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2022-05-17 10:13:04] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2022-05-17 10:13:04] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2022-05-17 10:13:05] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2022-05-17 10:13:05] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 0 ms to minimize.
[2022-05-17 10:13:05] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 0 ms to minimize.
[2022-05-17 10:13:05] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
[2022-05-17 10:13:06] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 0 ms to minimize.
[2022-05-17 10:13:06] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2022-05-17 10:13:06] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2022-05-17 10:13:06] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2022-05-17 10:13:06] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 0 ms to minimize.
[2022-05-17 10:13:06] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2022-05-17 10:13:06] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2022-05-17 10:13:06] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 0 ms to minimize.
[2022-05-17 10:13:06] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
[2022-05-17 10:13:06] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 0 ms to minimize.
[2022-05-17 10:13:06] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
[2022-05-17 10:13:07] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2022-05-17 10:13:07] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2022-05-17 10:13:07] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 0 ms to minimize.
[2022-05-17 10:13:07] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
[2022-05-17 10:13:07] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 0 ms to minimize.
[2022-05-17 10:13:08] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2022-05-17 10:13:08] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 0 ms to minimize.
[2022-05-17 10:13:08] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2022-05-17 10:13:09] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 0 ms to minimize.
[2022-05-17 10:13:09] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2022-05-17 10:13:09] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2022-05-17 10:13:09] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2022-05-17 10:13:10] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2022-05-17 10:13:10] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2022-05-17 10:13:13] [INFO ] Trap strengthening (SAT) tested/added 58/58 trap constraints in 11219 ms
Current structural bounds on expressions (after SMT) : [5] Max seen :[1]
Support contains 5 out of 160 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 160/160 places, 375/375 transitions.
Applied a total of 0 rules in 6 ms. Remains 160 /160 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 375/375 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 160/160 places, 375/375 transitions.
Applied a total of 0 rules in 5 ms. Remains 160 /160 variables (removed 0) and now considering 375/375 (removed 0) transitions.
[2022-05-17 10:13:13] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2022-05-17 10:13:13] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-17 10:13:13] [INFO ] Implicit Places using invariants in 98 ms returned []
[2022-05-17 10:13:13] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2022-05-17 10:13:13] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-17 10:13:13] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 10:13:13] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
[2022-05-17 10:13:13] [INFO ] Redundant transitions in 7 ms returned []
[2022-05-17 10:13:13] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2022-05-17 10:13:13] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-17 10:13:13] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 375/375 transitions.
Ending property specific reduction for Peterson-PT-4-UpperBounds-04 in 18835 ms.
Starting property specific reduction for Peterson-PT-4-UpperBounds-07
Normalized transition count is 316 out of 376 initially.
// Phase 1: matrix 316 rows 161 cols
[2022-05-17 10:13:13] [INFO ] Computed 14 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 :1
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-05-17 10:13:13] [INFO ] Flow matrix only has 316 transitions (discarded 60 similar events)
// Phase 1: matrix 316 rows 161 cols
[2022-05-17 10:13:14] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-17 10:13:14] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-17 10:13:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 10:13:14] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2022-05-17 10:13:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 10:13:14] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-17 10:13:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 10:13:14] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2022-05-17 10:13:14] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 10:13:14] [INFO ] [Nat]Added 116 Read/Feed constraints in 10 ms returned sat
[2022-05-17 10:13:14] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2022-05-17 10:13:14] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 0 ms to minimize.
[2022-05-17 10:13:14] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2022-05-17 10:13:14] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2022-05-17 10:13:14] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2022-05-17 10:13:14] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2022-05-17 10:13:14] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 0 ms to minimize.
[2022-05-17 10:13:14] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2022-05-17 10:13:14] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2022-05-17 10:13:14] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 0 ms to minimize.
[2022-05-17 10:13:14] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2022-05-17 10:13:14] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 0 ms to minimize.
[2022-05-17 10:13:15] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2022-05-17 10:13:15] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2022-05-17 10:13:15] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2022-05-17 10:13:15] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 0 ms to minimize.
[2022-05-17 10:13:15] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2022-05-17 10:13:15] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2022-05-17 10:13:15] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
[2022-05-17 10:13:15] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2022-05-17 10:13:15] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2022-05-17 10:13:15] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 0 ms to minimize.
[2022-05-17 10:13:15] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 0 ms to minimize.
[2022-05-17 10:13:15] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2022-05-17 10:13:15] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 0 ms to minimize.
[2022-05-17 10:13:16] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 0 ms to minimize.
[2022-05-17 10:13:16] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 0 ms to minimize.
[2022-05-17 10:13:16] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 0 ms to minimize.
[2022-05-17 10:13:16] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 0 ms to minimize.
[2022-05-17 10:13:16] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 0 ms to minimize.
[2022-05-17 10:13:16] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 0 ms to minimize.
[2022-05-17 10:13:16] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 0 ms to minimize.
[2022-05-17 10:13:16] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2022-05-17 10:13:17] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2022-05-17 10:13:17] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 0 ms to minimize.
[2022-05-17 10:13:19] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2022-05-17 10:13:19] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2022-05-17 10:13:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [5] Max seen :[1]
Support contains 5 out of 161 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 161/161 places, 376/376 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 160 transition count 375
Applied a total of 2 rules in 9 ms. Remains 160 /161 variables (removed 1) and now considering 375/376 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/161 places, 375/376 transitions.
Normalized transition count is 315 out of 375 initially.
// Phase 1: matrix 315 rows 160 cols
[2022-05-17 10:13:19] [INFO ] Computed 14 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1198 ms. (steps per millisecond=834 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 416 ms. (steps per millisecond=2403 ) properties (out of 1) seen :1
[2022-05-17 10:13:20] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2022-05-17 10:13:20] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-17 10:13:20] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-17 10:13:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 10:13:20] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2022-05-17 10:13:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 10:13:20] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2022-05-17 10:13:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 10:13:20] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2022-05-17 10:13:20] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 10:13:20] [INFO ] [Nat]Added 116 Read/Feed constraints in 13 ms returned sat
[2022-05-17 10:13:21] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 0 ms to minimize.
[2022-05-17 10:13:21] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 0 ms to minimize.
[2022-05-17 10:13:21] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 0 ms to minimize.
[2022-05-17 10:13:21] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 0 ms to minimize.
[2022-05-17 10:13:21] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2022-05-17 10:13:21] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2022-05-17 10:13:21] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 0 ms to minimize.
[2022-05-17 10:13:21] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 0 ms to minimize.
[2022-05-17 10:13:21] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 0 ms to minimize.
[2022-05-17 10:13:21] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 0 ms to minimize.
[2022-05-17 10:13:21] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2022-05-17 10:13:21] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 0 ms to minimize.
[2022-05-17 10:13:21] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2022-05-17 10:13:21] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2022-05-17 10:13:21] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 0 ms to minimize.
[2022-05-17 10:13:22] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2022-05-17 10:13:22] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2022-05-17 10:13:22] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 0 ms to minimize.
[2022-05-17 10:13:22] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2022-05-17 10:13:22] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2022-05-17 10:13:22] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2022-05-17 10:13:23] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2022-05-17 10:13:23] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2022-05-17 10:13:23] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 0 ms to minimize.
[2022-05-17 10:13:23] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2022-05-17 10:13:23] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 0 ms to minimize.
[2022-05-17 10:13:23] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 0 ms to minimize.
[2022-05-17 10:13:23] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2022-05-17 10:13:23] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2022-05-17 10:13:23] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2022-05-17 10:13:24] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 0 ms to minimize.
[2022-05-17 10:13:24] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2022-05-17 10:13:24] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2022-05-17 10:13:24] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2022-05-17 10:13:24] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2022-05-17 10:13:24] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 0 ms to minimize.
[2022-05-17 10:13:24] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2022-05-17 10:13:25] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 0 ms to minimize.
[2022-05-17 10:13:25] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2022-05-17 10:13:25] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 0 ms to minimize.
[2022-05-17 10:13:25] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 0 ms to minimize.
[2022-05-17 10:13:25] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
[2022-05-17 10:13:25] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 0 ms to minimize.
[2022-05-17 10:13:25] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 0 ms to minimize.
[2022-05-17 10:13:26] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 0 ms to minimize.
[2022-05-17 10:13:26] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2022-05-17 10:13:26] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 0 ms to minimize.
[2022-05-17 10:13:26] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 0 ms to minimize.
[2022-05-17 10:13:26] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2022-05-17 10:13:26] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2022-05-17 10:13:26] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 0 ms to minimize.
[2022-05-17 10:13:26] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2022-05-17 10:13:28] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
[2022-05-17 10:13:28] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2022-05-17 10:13:28] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 0 ms to minimize.
[2022-05-17 10:13:28] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2022-05-17 10:13:28] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2022-05-17 10:13:29] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 0 ms to minimize.
[2022-05-17 10:13:32] [INFO ] Trap strengthening (SAT) tested/added 58/58 trap constraints in 11062 ms
Current structural bounds on expressions (after SMT) : [5] Max seen :[1]
Support contains 5 out of 160 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 160/160 places, 375/375 transitions.
Applied a total of 0 rules in 5 ms. Remains 160 /160 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 375/375 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 160/160 places, 375/375 transitions.
Applied a total of 0 rules in 5 ms. Remains 160 /160 variables (removed 0) and now considering 375/375 (removed 0) transitions.
[2022-05-17 10:13:32] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2022-05-17 10:13:32] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-17 10:13:32] [INFO ] Implicit Places using invariants in 101 ms returned []
[2022-05-17 10:13:32] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2022-05-17 10:13:32] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-17 10:13:32] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 10:13:32] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
[2022-05-17 10:13:32] [INFO ] Redundant transitions in 4 ms returned []
[2022-05-17 10:13:32] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2022-05-17 10:13:32] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-17 10:13:32] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 375/375 transitions.
Ending property specific reduction for Peterson-PT-4-UpperBounds-07 in 18643 ms.
Starting property specific reduction for Peterson-PT-4-UpperBounds-15
Normalized transition count is 316 out of 376 initially.
// Phase 1: matrix 316 rows 161 cols
[2022-05-17 10:13:32] [INFO ] Computed 14 place invariants in 1 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 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
[2022-05-17 10:13:32] [INFO ] Flow matrix only has 316 transitions (discarded 60 similar events)
// Phase 1: matrix 316 rows 161 cols
[2022-05-17 10:13:32] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-17 10:13:32] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-17 10:13:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 10:13:32] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2022-05-17 10:13:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 10:13:32] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2022-05-17 10:13:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 10:13:32] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2022-05-17 10:13:32] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 10:13:32] [INFO ] [Nat]Added 116 Read/Feed constraints in 7 ms returned sat
[2022-05-17 10:13:32] [INFO ] Computed and/alt/rep : 275/792/275 causal constraints (skipped 36 transitions) in 19 ms.
[2022-05-17 10:13:33] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 16 ms to minimize.
[2022-05-17 10:13:33] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 0 ms to minimize.
[2022-05-17 10:13:33] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 0 ms to minimize.
[2022-05-17 10:13:33] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2022-05-17 10:13:33] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2022-05-17 10:13:33] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 0 ms to minimize.
[2022-05-17 10:13:33] [INFO ] Deduced a trap composed of 50 places in 42 ms of which 0 ms to minimize.
[2022-05-17 10:13:34] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2022-05-17 10:13:34] [INFO ] Deduced a trap composed of 48 places in 39 ms of which 1 ms to minimize.
[2022-05-17 10:13:34] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 0 ms to minimize.
[2022-05-17 10:13:34] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2022-05-17 10:13:34] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 0 ms to minimize.
[2022-05-17 10:13:34] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2022-05-17 10:13:34] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2022-05-17 10:13:34] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 0 ms to minimize.
[2022-05-17 10:13:34] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2022-05-17 10:13:34] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2022-05-17 10:13:34] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2022-05-17 10:13:34] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
[2022-05-17 10:13:34] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2022-05-17 10:13:34] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2022-05-17 10:13:34] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 0 ms to minimize.
[2022-05-17 10:13:34] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2022-05-17 10:13:35] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2022-05-17 10:13:35] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 0 ms to minimize.
[2022-05-17 10:13:35] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2022-05-17 10:13:35] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2022-05-17 10:13:35] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2022-05-17 10:13:35] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2022-05-17 10:13:35] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2022-05-17 10:13:35] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 2058 ms
[2022-05-17 10:13:35] [INFO ] Added : 151 causal constraints over 31 iterations in 2686 ms. Result :sat
Minimization took 75 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 161 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in SAFETY mode, iteration 0 : 161/161 places, 375/375 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 161 transition count 370
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 156 transition count 370
Applied a total of 10 rules in 23 ms. Remains 156 /161 variables (removed 5) and now considering 370/375 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 156/161 places, 370/375 transitions.
Normalized transition count is 310 out of 370 initially.
// Phase 1: matrix 310 rows 156 cols
[2022-05-17 10:13:35] [INFO ] Computed 14 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1128 ms. (steps per millisecond=886 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 391 ms. (steps per millisecond=2557 ) properties (out of 1) seen :0
[2022-05-17 10:13:37] [INFO ] Flow matrix only has 310 transitions (discarded 60 similar events)
// Phase 1: matrix 310 rows 156 cols
[2022-05-17 10:13:37] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-17 10:13:37] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-17 10:13:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 10:13:37] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2022-05-17 10:13:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 10:13:37] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2022-05-17 10:13:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 10:13:37] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2022-05-17 10:13:37] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 10:13:37] [INFO ] [Nat]Added 116 Read/Feed constraints in 8 ms returned sat
[2022-05-17 10:13:37] [INFO ] Computed and/alt/rep : 269/785/269 causal constraints (skipped 36 transitions) in 19 ms.
[2022-05-17 10:13:38] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 0 ms to minimize.
[2022-05-17 10:13:38] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2022-05-17 10:13:38] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 0 ms to minimize.
[2022-05-17 10:13:38] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2022-05-17 10:13:38] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 0 ms to minimize.
[2022-05-17 10:13:38] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 0 ms to minimize.
[2022-05-17 10:13:38] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2022-05-17 10:13:38] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
[2022-05-17 10:13:38] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2022-05-17 10:13:38] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2022-05-17 10:13:38] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 0 ms to minimize.
[2022-05-17 10:13:38] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 0 ms to minimize.
[2022-05-17 10:13:39] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 0 ms to minimize.
[2022-05-17 10:13:39] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 0 ms to minimize.
[2022-05-17 10:13:39] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 0 ms to minimize.
[2022-05-17 10:13:39] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 0 ms to minimize.
[2022-05-17 10:13:39] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2022-05-17 10:13:39] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 0 ms to minimize.
[2022-05-17 10:13:39] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2022-05-17 10:13:39] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2022-05-17 10:13:39] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
[2022-05-17 10:13:39] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 0 ms to minimize.
[2022-05-17 10:13:39] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 0 ms to minimize.
[2022-05-17 10:13:39] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2022-05-17 10:13:39] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2022-05-17 10:13:39] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2022-05-17 10:13:40] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2022-05-17 10:13:40] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2022-05-17 10:13:40] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 2023 ms
[2022-05-17 10:13:40] [INFO ] Added : 167 causal constraints over 34 iterations in 2744 ms. Result :sat
Minimization took 118 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 156/156 places, 370/370 transitions.
Applied a total of 0 rules in 15 ms. Remains 156 /156 variables (removed 0) and now considering 370/370 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 156/156 places, 370/370 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 156/156 places, 370/370 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 370/370 (removed 0) transitions.
[2022-05-17 10:13:40] [INFO ] Flow matrix only has 310 transitions (discarded 60 similar events)
// Phase 1: matrix 310 rows 156 cols
[2022-05-17 10:13:40] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-17 10:13:40] [INFO ] Implicit Places using invariants in 93 ms returned []
[2022-05-17 10:13:40] [INFO ] Flow matrix only has 310 transitions (discarded 60 similar events)
// Phase 1: matrix 310 rows 156 cols
[2022-05-17 10:13:40] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-17 10:13:40] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 10:13:40] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2022-05-17 10:13:40] [INFO ] Redundant transitions in 6 ms returned []
[2022-05-17 10:13:40] [INFO ] Flow matrix only has 310 transitions (discarded 60 similar events)
// Phase 1: matrix 310 rows 156 cols
[2022-05-17 10:13:40] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-17 10:13:40] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 156/156 places, 370/370 transitions.
Ending property specific reduction for Peterson-PT-4-UpperBounds-15 in 8227 ms.
[2022-05-17 10:13:41] [INFO ] Flatten gal took : 70 ms
[2022-05-17 10:13:41] [INFO ] Applying decomposition
[2022-05-17 10:13:41] [INFO ] Flatten gal took : 24 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/graph2236263899500296243.txt' '-o' '/tmp/graph2236263899500296243.bin' '-w' '/tmp/graph2236263899500296243.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2236263899500296243.bin' '-l' '-1' '-v' '-w' '/tmp/graph2236263899500296243.weights' '-q' '0' '-e' '0.001'
[2022-05-17 10:13:41] [INFO ] Decomposing Gal with order
[2022-05-17 10:13:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 10:13:41] [INFO ] Removed a total of 411 redundant transitions.
[2022-05-17 10:13:41] [INFO ] Flatten gal took : 103 ms
[2022-05-17 10:13:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 340 labels/synchronizations in 28 ms.
[2022-05-17 10:13:41] [INFO ] Time to serialize gal into /tmp/UpperBounds7410564422213541271.gal : 21 ms
[2022-05-17 10:13:41] [INFO ] Time to serialize properties into /tmp/UpperBounds7882123358754749709.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/UpperBounds7410564422213541271.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7882123358754749709.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...295
Loading property file /tmp/UpperBounds7882123358754749709.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flatf,4.22921e+06,22.6451,619812,2,50013,5,2.57758e+06,6,0,1145,2.1698e+06,0
Total reachable state count : 4229212

Verifying 4 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property Peterson-PT-4-UpperBounds-03 :0 <= gi6.gu24.CS_0+gi1.gu4.CS_1+gi1.gu6.CS_3+gi1.gu7.CS_2+gi5.gu23.CS_4 <= 1
FORMULA Peterson-PT-4-UpperBounds-03 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-PT-4-UpperBounds-03,0,22.6755,620072,1,0,7,2.57758e+06,9,1,1465,2.1698e+06,4
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property Peterson-PT-4-UpperBounds-04 :0 <= gi6.gu24.CS_0+gi1.gu4.CS_1+gi1.gu6.CS_3+gi1.gu7.CS_2+gi5.gu23.CS_4 <= 1
FORMULA Peterson-PT-4-UpperBounds-04 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-PT-4-UpperBounds-04,0,22.6776,620072,1,0,7,2.57758e+06,9,1,1465,2.1698e+06,4
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property Peterson-PT-4-UpperBounds-07 :0 <= gi6.gu24.CS_0+gi1.gu4.CS_1+gi1.gu6.CS_3+gi1.gu7.CS_2+gi5.gu23.CS_4 <= 1
FORMULA Peterson-PT-4-UpperBounds-07 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-PT-4-UpperBounds-07,0,22.6778,620072,1,0,7,2.57758e+06,9,1,1465,2.1698e+06,4
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property Peterson-PT-4-UpperBounds-15 :0 <= gi1.gu6.IsEndLoop_3_3_4 <= 1
FORMULA Peterson-PT-4-UpperBounds-15 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-PT-4-UpperBounds-15,0,22.6792,620072,1,0,8,2.57758e+06,10,1,1516,2.1698e+06,5
Total runtime 210725 ms.

BK_STOP 1652782444612

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Peterson-PT-4"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Peterson-PT-4, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r168-tall-165277016200069"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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