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.r071-tall-165254780500232.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 gold2021
Input is Dekker-PT-050, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r071-tall-165254780500232
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 8.2K Apr 30 05:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 30 05:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 30 05:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 30 05:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K May 9 07:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 9 07:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 07:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 1.5M May 10 09:33 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652591554958

Running Version 0
[2022-05-15 05:12:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 05:12:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 05:12:36] [INFO ] Load time of PNML (sax parser for PT used): 310 ms
[2022-05-15 05:12:36] [INFO ] Transformed 250 places.
[2022-05-15 05:12:36] [INFO ] Transformed 2600 transitions.
[2022-05-15 05:12:36] [INFO ] Found NUPN structural information;
[2022-05-15 05:12:36] [INFO ] Parsed PT model containing 250 places and 2600 transitions in 368 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
FORMULA Dekker-PT-050-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 200 out of 2600 initially.
// Phase 1: matrix 200 rows 250 cols
[2022-05-15 05:12:36] [INFO ] Computed 150 place invariants in 29 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 251 ms. (steps per millisecond=39 ) properties (out of 10) seen :8
FORMULA Dekker-PT-050-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-050-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-050-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-050-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-050-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-050-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-050-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-050-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
[2022-05-15 05:12:37] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 250 cols
[2022-05-15 05:12:37] [INFO ] Computed 150 place invariants in 6 ms
[2022-05-15 05:12:37] [INFO ] [Real]Absence check using 100 positive place invariants in 36 ms returned sat
[2022-05-15 05:12:37] [INFO ] [Real]Absence check using 100 positive and 50 generalized place invariants in 8 ms returned sat
[2022-05-15 05:12:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:12:37] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2022-05-15 05:12:37] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-15 05:12:37] [INFO ] [Real]Added 50 Read/Feed constraints in 11 ms returned sat
[2022-05-15 05:12:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:12:37] [INFO ] [Nat]Absence check using 100 positive place invariants in 22 ms returned sat
[2022-05-15 05:12:37] [INFO ] [Nat]Absence check using 100 positive and 50 generalized place invariants in 7 ms returned sat
[2022-05-15 05:12:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:12:37] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2022-05-15 05:12:37] [INFO ] [Nat]Added 50 Read/Feed constraints in 9 ms returned sat
[2022-05-15 05:12:37] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 2 ms to minimize.
[2022-05-15 05:12:38] [INFO ] Deduced a trap composed of 4 places in 212 ms of which 1 ms to minimize.
[2022-05-15 05:12:38] [INFO ] Deduced a trap composed of 6 places in 176 ms of which 1 ms to minimize.
[2022-05-15 05:12:38] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 0 ms to minimize.
[2022-05-15 05:12:38] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2022-05-15 05:12:38] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2022-05-15 05:12:38] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2022-05-15 05:12:38] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2022-05-15 05:12:38] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 0 ms to minimize.
[2022-05-15 05:12:39] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2022-05-15 05:12:39] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2022-05-15 05:12:39] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
[2022-05-15 05:12:39] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2022-05-15 05:12:39] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2022-05-15 05:12:39] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2022-05-15 05:12:39] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2022-05-15 05:12:39] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 0 ms to minimize.
[2022-05-15 05:12:39] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2022-05-15 05:12:39] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 0 ms to minimize.
[2022-05-15 05:12:39] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2022-05-15 05:12:39] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2022-05-15 05:12:39] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
[2022-05-15 05:12:39] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2022-05-15 05:12:39] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2022-05-15 05:12:39] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2022-05-15 05:12:39] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2022-05-15 05:12:39] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2022-05-15 05:12:39] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2022-05-15 05:12:39] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2022-05-15 05:12:40] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2022-05-15 05:12:40] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2022-05-15 05:12:40] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2022-05-15 05:12:40] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 2 ms to minimize.
[2022-05-15 05:12:40] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2022-05-15 05:12:40] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 4 ms to minimize.
[2022-05-15 05:12:40] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2022-05-15 05:12:40] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 0 ms to minimize.
[2022-05-15 05:12:40] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
[2022-05-15 05:12:40] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2022-05-15 05:12:40] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2022-05-15 05:12:40] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2022-05-15 05:12:40] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2022-05-15 05:12:40] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2022-05-15 05:12:40] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2022-05-15 05:12:40] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2022-05-15 05:12:40] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2022-05-15 05:12:40] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2022-05-15 05:12:40] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2022-05-15 05:12:40] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2022-05-15 05:12:40] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2022-05-15 05:12:40] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2022-05-15 05:12:41] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 0 ms to minimize.
[2022-05-15 05:12:41] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2022-05-15 05:12:41] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2022-05-15 05:12:41] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2022-05-15 05:12:41] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2022-05-15 05:12:41] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2022-05-15 05:12:41] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2022-05-15 05:12:41] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2022-05-15 05:12:41] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2022-05-15 05:12:41] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2022-05-15 05:12:41] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2022-05-15 05:12:41] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2022-05-15 05:12:41] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2022-05-15 05:12:41] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2022-05-15 05:12:41] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2022-05-15 05:12:41] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 4 ms to minimize.
[2022-05-15 05:12:41] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 3 ms to minimize.
[2022-05-15 05:12:41] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2022-05-15 05:12:41] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2022-05-15 05:12:41] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2022-05-15 05:12:41] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2022-05-15 05:12:42] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2022-05-15 05:12:42] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2022-05-15 05:12:42] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2022-05-15 05:12:42] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2022-05-15 05:12:42] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2022-05-15 05:12:42] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2022-05-15 05:12:42] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2022-05-15 05:12:42] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2022-05-15 05:12:42] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2022-05-15 05:12:42] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2022-05-15 05:12:42] [INFO ] Trap strengthening (SAT) tested/added 83/82 trap constraints in 4511 ms
[2022-05-15 05:12:42] [INFO ] Computed and/alt/rep : 100/150/100 causal constraints (skipped 50 transitions) in 54 ms.
[2022-05-15 05:12:42] [INFO ] Added : 1 causal constraints over 1 iterations in 95 ms. Result :sat
Minimization took 46 ms.
[2022-05-15 05:12:42] [INFO ] [Real]Absence check using 100 positive place invariants in 13 ms returned sat
[2022-05-15 05:12:42] [INFO ] [Real]Absence check using 100 positive and 50 generalized place invariants in 12 ms returned sat
[2022-05-15 05:12:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:12:42] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2022-05-15 05:12:42] [INFO ] [Real]Added 50 Read/Feed constraints in 9 ms returned sat
[2022-05-15 05:12:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:12:42] [INFO ] [Nat]Absence check using 100 positive place invariants in 14 ms returned sat
[2022-05-15 05:12:42] [INFO ] [Nat]Absence check using 100 positive and 50 generalized place invariants in 7 ms returned sat
[2022-05-15 05:12:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:12:42] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2022-05-15 05:12:42] [INFO ] [Nat]Added 50 Read/Feed constraints in 8 ms returned sat
[2022-05-15 05:12:42] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 0 ms to minimize.
[2022-05-15 05:12:43] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2022-05-15 05:12:43] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2022-05-15 05:12:43] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2022-05-15 05:12:43] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 0 ms to minimize.
[2022-05-15 05:12:43] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2022-05-15 05:12:43] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 1 ms to minimize.
[2022-05-15 05:12:43] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2022-05-15 05:12:43] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2022-05-15 05:12:43] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2022-05-15 05:12:43] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
[2022-05-15 05:12:43] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2022-05-15 05:12:43] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2022-05-15 05:12:44] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2022-05-15 05:12:44] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2022-05-15 05:12:44] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2022-05-15 05:12:44] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2022-05-15 05:12:44] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2022-05-15 05:12:44] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2022-05-15 05:12:44] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2022-05-15 05:12:44] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2022-05-15 05:12:44] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
[2022-05-15 05:12:44] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2022-05-15 05:12:44] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2022-05-15 05:12:44] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2022-05-15 05:12:44] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2022-05-15 05:12:44] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2022-05-15 05:12:44] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2022-05-15 05:12:45] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2022-05-15 05:12:45] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2022-05-15 05:12:45] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2022-05-15 05:12:45] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2022-05-15 05:12:45] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 0 ms to minimize.
[2022-05-15 05:12:45] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2022-05-15 05:12:45] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
[2022-05-15 05:12:45] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2022-05-15 05:12:45] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2022-05-15 05:12:45] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2022-05-15 05:12:45] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2022-05-15 05:12:45] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2022-05-15 05:12:45] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
[2022-05-15 05:12:45] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2022-05-15 05:12:45] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 0 ms to minimize.
[2022-05-15 05:12:45] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2022-05-15 05:12:45] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2022-05-15 05:12:45] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2022-05-15 05:12:45] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2022-05-15 05:12:45] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2022-05-15 05:12:46] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2022-05-15 05:12:46] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2022-05-15 05:12:46] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2022-05-15 05:12:46] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2022-05-15 05:12:46] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2022-05-15 05:12:46] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2022-05-15 05:12:46] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2022-05-15 05:12:46] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2022-05-15 05:12:46] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2022-05-15 05:12:46] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 0 ms to minimize.
[2022-05-15 05:12:46] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2022-05-15 05:12:46] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2022-05-15 05:12:46] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2022-05-15 05:12:46] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2022-05-15 05:12:46] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
[2022-05-15 05:12:46] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2022-05-15 05:12:46] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2022-05-15 05:12:46] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2022-05-15 05:12:46] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2022-05-15 05:12:46] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2022-05-15 05:12:46] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2022-05-15 05:12:46] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2022-05-15 05:12:47] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2022-05-15 05:12:47] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2022-05-15 05:12:47] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2022-05-15 05:12:47] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2022-05-15 05:12:47] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2022-05-15 05:12:47] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2022-05-15 05:12:47] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2022-05-15 05:12:47] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2022-05-15 05:12:47] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2022-05-15 05:12:47] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2022-05-15 05:12:47] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2022-05-15 05:12:47] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2022-05-15 05:12:47] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2022-05-15 05:12:47] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2022-05-15 05:12:47] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
[2022-05-15 05:12:47] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2022-05-15 05:12:47] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2022-05-15 05:12:47] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 0 ms to minimize.
[2022-05-15 05:12:47] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Incomplete Parikh walk after 16900 steps, including 110 resets, run finished after 295 ms. (steps per millisecond=57 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 250/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 198 ms. Remains 250 /250 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 2600/2600 transitions.
Normalized transition count is 200 out of 2600 initially.
// Phase 1: matrix 200 rows 250 cols
[2022-05-15 05:12:48] [INFO ] Computed 150 place invariants in 15 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 9638 ms. (steps per millisecond=103 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1866 ms. (steps per millisecond=535 ) properties (out of 2) seen :1
FORMULA Dekker-PT-050-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2022-05-15 05:12:59] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 250 cols
[2022-05-15 05:12:59] [INFO ] Computed 150 place invariants in 3 ms
[2022-05-15 05:12:59] [INFO ] [Real]Absence check using 100 positive place invariants in 17 ms returned sat
[2022-05-15 05:12:59] [INFO ] [Real]Absence check using 100 positive and 50 generalized place invariants in 5 ms returned sat
[2022-05-15 05:12:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:12:59] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2022-05-15 05:12:59] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-15 05:12:59] [INFO ] [Real]Added 50 Read/Feed constraints in 10 ms returned sat
[2022-05-15 05:12:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:13:00] [INFO ] [Nat]Absence check using 100 positive place invariants in 17 ms returned sat
[2022-05-15 05:13:00] [INFO ] [Nat]Absence check using 100 positive and 50 generalized place invariants in 5 ms returned sat
[2022-05-15 05:13:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:13:00] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2022-05-15 05:13:00] [INFO ] [Nat]Added 50 Read/Feed constraints in 9 ms returned sat
[2022-05-15 05:13:00] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 0 ms to minimize.
[2022-05-15 05:13:00] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 0 ms to minimize.
[2022-05-15 05:13:00] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 0 ms to minimize.
[2022-05-15 05:13:00] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2022-05-15 05:13:00] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 0 ms to minimize.
[2022-05-15 05:13:00] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2022-05-15 05:13:00] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 0 ms to minimize.
[2022-05-15 05:13:00] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2022-05-15 05:13:00] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2022-05-15 05:13:00] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2022-05-15 05:13:00] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2022-05-15 05:13:01] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2022-05-15 05:13:01] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2022-05-15 05:13:01] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2022-05-15 05:13:01] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2022-05-15 05:13:01] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2022-05-15 05:13:01] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2022-05-15 05:13:01] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2022-05-15 05:13:01] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2022-05-15 05:13:01] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2022-05-15 05:13:01] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2022-05-15 05:13:01] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2022-05-15 05:13:01] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2022-05-15 05:13:01] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2022-05-15 05:13:01] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2022-05-15 05:13:01] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2022-05-15 05:13:01] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2022-05-15 05:13:02] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2022-05-15 05:13:02] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2022-05-15 05:13:02] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2022-05-15 05:13:02] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
[2022-05-15 05:13:02] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2022-05-15 05:13:02] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2022-05-15 05:13:02] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2022-05-15 05:13:02] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2022-05-15 05:13:02] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2022-05-15 05:13:02] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2022-05-15 05:13:02] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2022-05-15 05:13:02] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2022-05-15 05:13:02] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2022-05-15 05:13:02] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 0 ms to minimize.
[2022-05-15 05:13:02] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2022-05-15 05:13:02] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 0 ms to minimize.
[2022-05-15 05:13:02] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2022-05-15 05:13:02] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2022-05-15 05:13:02] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2022-05-15 05:13:02] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2022-05-15 05:13:03] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2022-05-15 05:13:03] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2022-05-15 05:13:03] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2022-05-15 05:13:03] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2022-05-15 05:13:03] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2022-05-15 05:13:03] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2022-05-15 05:13:03] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 0 ms to minimize.
[2022-05-15 05:13:03] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2022-05-15 05:13:03] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2022-05-15 05:13:03] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
[2022-05-15 05:13:03] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2022-05-15 05:13:03] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2022-05-15 05:13:03] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2022-05-15 05:13:03] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2022-05-15 05:13:03] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2022-05-15 05:13:03] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2022-05-15 05:13:03] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2022-05-15 05:13:03] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2022-05-15 05:13:03] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
[2022-05-15 05:13:03] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2022-05-15 05:13:04] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
[2022-05-15 05:13:04] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2022-05-15 05:13:04] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2022-05-15 05:13:04] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2022-05-15 05:13:04] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2022-05-15 05:13:04] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2022-05-15 05:13:04] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2022-05-15 05:13:04] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2022-05-15 05:13:04] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2022-05-15 05:13:04] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2022-05-15 05:13:04] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2022-05-15 05:13:04] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2022-05-15 05:13:04] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2022-05-15 05:13:04] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2022-05-15 05:13:04] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2022-05-15 05:13:04] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2022-05-15 05:13:04] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2022-05-15 05:13:04] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2022-05-15 05:13:04] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2022-05-15 05:13:04] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2022-05-15 05:13:04] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
[2022-05-15 05:13:04] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2022-05-15 05:13:04] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
[2022-05-15 05:13:05] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2022-05-15 05:13:05] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2022-05-15 05:13:05] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
[2022-05-15 05:13:05] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2022-05-15 05:13:05] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2022-05-15 05:13:05] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2022-05-15 05:13:05] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2022-05-15 05:13:05] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2022-05-15 05:13:05] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2022-05-15 05:13:05] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2022-05-15 05:13:05] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2022-05-15 05:13:05] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2022-05-15 05:13:05] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2022-05-15 05:13:05] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2022-05-15 05:13:05] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2022-05-15 05:13:05] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2022-05-15 05:13:05] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 0 ms to minimize.
[2022-05-15 05:13:05] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2022-05-15 05:13:05] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2022-05-15 05:13:05] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2022-05-15 05:13:06] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
[2022-05-15 05:13:06] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2022-05-15 05:13:06] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2022-05-15 05:13:06] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2022-05-15 05:13:06] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2022-05-15 05:13:06] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2022-05-15 05:13:06] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2022-05-15 05:13:06] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2022-05-15 05:13:06] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2022-05-15 05:13:06] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2022-05-15 05:13:06] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 0 ms to minimize.
[2022-05-15 05:13:06] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2022-05-15 05:13:06] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2022-05-15 05:13:06] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2022-05-15 05:13:06] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2022-05-15 05:13:06] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2022-05-15 05:13:06] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2022-05-15 05:13:06] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2022-05-15 05:13:06] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2022-05-15 05:13:06] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
[2022-05-15 05:13:06] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2022-05-15 05:13:06] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2022-05-15 05:13:06] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2022-05-15 05:13:06] [INFO ] Trap strengthening (SAT) tested/added 134/133 trap constraints in 6830 ms
[2022-05-15 05:13:06] [INFO ] Computed and/alt/rep : 100/150/100 causal constraints (skipped 50 transitions) in 49 ms.
[2022-05-15 05:13:06] [INFO ] Added : 1 causal constraints over 1 iterations in 90 ms. Result :sat
Minimization took 49 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 15700 steps, including 103 resets, run finished after 269 ms. (steps per millisecond=58 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 250 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions, iteration 0 : 250/250 places, 2599/2599 transitions.
Applied a total of 0 rules in 122 ms. Remains 250 /250 variables (removed 0) and now considering 2599/2599 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 2599/2599 transitions.
Normalized transition count is 199 out of 2599 initially.
// Phase 1: matrix 199 rows 250 cols
[2022-05-15 05:13:07] [INFO ] Computed 150 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 9474 ms. (steps per millisecond=105 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1801 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
[2022-05-15 05:13:18] [INFO ] Flow matrix only has 199 transitions (discarded 2400 similar events)
// Phase 1: matrix 199 rows 250 cols
[2022-05-15 05:13:18] [INFO ] Computed 150 place invariants in 6 ms
[2022-05-15 05:13:18] [INFO ] [Real]Absence check using 100 positive place invariants in 13 ms returned sat
[2022-05-15 05:13:18] [INFO ] [Real]Absence check using 100 positive and 50 generalized place invariants in 6 ms returned sat
[2022-05-15 05:13:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:13:18] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2022-05-15 05:13:18] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-15 05:13:18] [INFO ] [Real]Added 50 Read/Feed constraints in 12 ms returned sat
[2022-05-15 05:13:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:13:18] [INFO ] [Nat]Absence check using 100 positive place invariants in 13 ms returned sat
[2022-05-15 05:13:18] [INFO ] [Nat]Absence check using 100 positive and 50 generalized place invariants in 6 ms returned sat
[2022-05-15 05:13:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:13:19] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2022-05-15 05:13:19] [INFO ] [Nat]Added 50 Read/Feed constraints in 9 ms returned sat
[2022-05-15 05:13:19] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2022-05-15 05:13:19] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2022-05-15 05:13:19] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2022-05-15 05:13:19] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2022-05-15 05:13:19] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 0 ms to minimize.
[2022-05-15 05:13:19] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2022-05-15 05:13:19] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 0 ms to minimize.
[2022-05-15 05:13:19] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2022-05-15 05:13:19] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2022-05-15 05:13:19] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 0 ms to minimize.
[2022-05-15 05:13:19] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2022-05-15 05:13:20] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2022-05-15 05:13:20] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2022-05-15 05:13:20] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2022-05-15 05:13:20] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2022-05-15 05:13:20] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2022-05-15 05:13:20] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2022-05-15 05:13:20] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2022-05-15 05:13:20] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2022-05-15 05:13:20] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2022-05-15 05:13:20] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2022-05-15 05:13:20] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2022-05-15 05:13:20] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2022-05-15 05:13:20] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2022-05-15 05:13:20] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2022-05-15 05:13:20] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2022-05-15 05:13:20] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2022-05-15 05:13:21] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2022-05-15 05:13:21] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2022-05-15 05:13:21] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2022-05-15 05:13:21] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2022-05-15 05:13:21] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2022-05-15 05:13:21] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2022-05-15 05:13:21] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2022-05-15 05:13:21] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
[2022-05-15 05:13:21] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2022-05-15 05:13:21] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2022-05-15 05:13:21] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2022-05-15 05:13:21] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2022-05-15 05:13:21] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2022-05-15 05:13:21] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 0 ms to minimize.
[2022-05-15 05:13:21] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2022-05-15 05:13:21] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 0 ms to minimize.
[2022-05-15 05:13:21] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2022-05-15 05:13:21] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2022-05-15 05:13:21] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2022-05-15 05:13:21] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2022-05-15 05:13:22] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2022-05-15 05:13:22] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
[2022-05-15 05:13:22] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2022-05-15 05:13:22] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2022-05-15 05:13:22] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2022-05-15 05:13:22] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2022-05-15 05:13:22] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 0 ms to minimize.
[2022-05-15 05:13:22] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2022-05-15 05:13:22] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2022-05-15 05:13:22] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2022-05-15 05:13:22] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2022-05-15 05:13:22] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2022-05-15 05:13:22] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2022-05-15 05:13:22] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2022-05-15 05:13:22] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2022-05-15 05:13:22] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2022-05-15 05:13:22] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2022-05-15 05:13:22] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2022-05-15 05:13:22] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2022-05-15 05:13:22] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2022-05-15 05:13:22] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2022-05-15 05:13:22] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2022-05-15 05:13:23] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2022-05-15 05:13:23] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2022-05-15 05:13:23] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2022-05-15 05:13:23] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2022-05-15 05:13:23] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2022-05-15 05:13:23] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2022-05-15 05:13:23] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2022-05-15 05:13:23] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2022-05-15 05:13:23] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2022-05-15 05:13:23] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2022-05-15 05:13:23] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2022-05-15 05:13:23] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2022-05-15 05:13:23] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2022-05-15 05:13:23] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2022-05-15 05:13:23] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2022-05-15 05:13:23] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2022-05-15 05:13:23] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2022-05-15 05:13:23] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2022-05-15 05:13:23] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 0 ms to minimize.
[2022-05-15 05:13:23] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2022-05-15 05:13:23] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2022-05-15 05:13:23] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 0 ms to minimize.
[2022-05-15 05:13:23] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2022-05-15 05:13:23] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
[2022-05-15 05:13:24] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2022-05-15 05:13:24] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2022-05-15 05:13:24] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2022-05-15 05:13:24] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2022-05-15 05:13:24] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2022-05-15 05:13:24] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2022-05-15 05:13:24] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2022-05-15 05:13:24] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2022-05-15 05:13:24] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2022-05-15 05:13:24] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2022-05-15 05:13:24] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2022-05-15 05:13:24] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2022-05-15 05:13:24] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2022-05-15 05:13:24] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 0 ms to minimize.
[2022-05-15 05:13:24] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
[2022-05-15 05:13:24] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2022-05-15 05:13:24] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2022-05-15 05:13:24] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
[2022-05-15 05:13:24] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2022-05-15 05:13:24] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2022-05-15 05:13:25] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2022-05-15 05:13:25] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2022-05-15 05:13:25] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2022-05-15 05:13:25] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2022-05-15 05:13:25] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2022-05-15 05:13:25] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2022-05-15 05:13:25] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2022-05-15 05:13:25] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2022-05-15 05:13:25] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2022-05-15 05:13:25] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2022-05-15 05:13:25] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2022-05-15 05:13:25] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2022-05-15 05:13:25] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2022-05-15 05:13:25] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2022-05-15 05:13:25] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2022-05-15 05:13:25] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2022-05-15 05:13:25] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
[2022-05-15 05:13:25] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2022-05-15 05:13:25] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2022-05-15 05:13:25] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2022-05-15 05:13:25] [INFO ] Trap strengthening (SAT) tested/added 134/133 trap constraints in 6636 ms
[2022-05-15 05:13:25] [INFO ] Computed and/alt/rep : 99/148/99 causal constraints (skipped 50 transitions) in 43 ms.
[2022-05-15 05:13:25] [INFO ] Added : 1 causal constraints over 1 iterations in 71 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 15700 steps, including 103 resets, run finished after 262 ms. (steps per millisecond=59 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 250/250 places, 2599/2599 transitions.
Applied a total of 0 rules in 104 ms. Remains 250 /250 variables (removed 0) and now considering 2599/2599 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 2599/2599 transitions.
Starting structural reductions, iteration 0 : 250/250 places, 2599/2599 transitions.
Applied a total of 0 rules in 76 ms. Remains 250 /250 variables (removed 0) and now considering 2599/2599 (removed 0) transitions.
[2022-05-15 05:13:26] [INFO ] Flow matrix only has 199 transitions (discarded 2400 similar events)
// Phase 1: matrix 199 rows 250 cols
[2022-05-15 05:13:26] [INFO ] Computed 150 place invariants in 3 ms
[2022-05-15 05:13:27] [INFO ] Implicit Places using invariants in 1178 ms returned [100, 103, 106, 109, 112, 115, 118, 121, 124, 127, 130, 133, 136, 139, 142, 145, 148, 151, 154, 157, 160, 163, 166, 169, 172, 175, 178, 181, 184, 187, 190, 193, 196, 199, 202, 205, 208, 211, 214, 217, 220, 223, 226, 229, 232, 235, 238, 241, 244, 247]
Discarding 50 places :
Implicit Place search using SMT only with invariants took 1184 ms to find 50 implicit places.
[2022-05-15 05:13:27] [INFO ] Redundant transitions in 177 ms returned []
[2022-05-15 05:13:27] [INFO ] Flow matrix only has 199 transitions (discarded 2400 similar events)
// Phase 1: matrix 199 rows 200 cols
[2022-05-15 05:13:27] [INFO ] Computed 100 place invariants in 3 ms
[2022-05-15 05:13:28] [INFO ] Dead Transitions using invariants and state equation in 805 ms returned []
Starting structural reductions, iteration 1 : 200/250 places, 2599/2599 transitions.
Applied a total of 0 rules in 61 ms. Remains 200 /200 variables (removed 0) and now considering 2599/2599 (removed 0) transitions.
[2022-05-15 05:13:28] [INFO ] Redundant transitions in 238 ms returned []
[2022-05-15 05:13:28] [INFO ] Flow matrix only has 199 transitions (discarded 2400 similar events)
// Phase 1: matrix 199 rows 200 cols
[2022-05-15 05:13:28] [INFO ] Computed 100 place invariants in 3 ms
[2022-05-15 05:13:29] [INFO ] Dead Transitions using invariants and state equation in 774 ms returned []
Finished structural reductions, in 2 iterations. Remains : 200/250 places, 2599/2599 transitions.
Normalized transition count is 199 out of 2599 initially.
// Phase 1: matrix 199 rows 200 cols
[2022-05-15 05:13:29] [INFO ] Computed 100 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 9871 ms. (steps per millisecond=101 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1639 ms. (steps per millisecond=610 ) properties (out of 1) seen :0
[2022-05-15 05:13:41] [INFO ] Flow matrix only has 199 transitions (discarded 2400 similar events)
// Phase 1: matrix 199 rows 200 cols
[2022-05-15 05:13:41] [INFO ] Computed 100 place invariants in 6 ms
[2022-05-15 05:13:41] [INFO ] [Real]Absence check using 100 positive place invariants in 11 ms returned sat
[2022-05-15 05:13:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:13:41] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2022-05-15 05:13:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:13:41] [INFO ] [Nat]Absence check using 100 positive place invariants in 12 ms returned sat
[2022-05-15 05:13:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:13:41] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2022-05-15 05:13:41] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-15 05:13:41] [INFO ] [Nat]Added 50 Read/Feed constraints in 11 ms returned sat
[2022-05-15 05:13:41] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2022-05-15 05:13:41] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2022-05-15 05:13:41] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2022-05-15 05:13:41] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2022-05-15 05:13:41] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2022-05-15 05:13:41] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2022-05-15 05:13:41] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2022-05-15 05:13:41] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2022-05-15 05:13:41] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2022-05-15 05:13:41] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2022-05-15 05:13:41] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2022-05-15 05:13:41] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2022-05-15 05:13:41] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2022-05-15 05:13:41] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2022-05-15 05:13:41] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2022-05-15 05:13:41] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2022-05-15 05:13:41] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2022-05-15 05:13:41] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2022-05-15 05:13:42] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2022-05-15 05:13:42] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2022-05-15 05:13:42] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2022-05-15 05:13:42] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2022-05-15 05:13:42] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2022-05-15 05:13:42] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2022-05-15 05:13:42] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2022-05-15 05:13:42] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2022-05-15 05:13:42] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2022-05-15 05:13:42] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2022-05-15 05:13:42] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2022-05-15 05:13:42] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2022-05-15 05:13:42] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2022-05-15 05:13:42] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 1183 ms
[2022-05-15 05:13:42] [INFO ] Computed and/alt/rep : 99/148/99 causal constraints (skipped 50 transitions) in 34 ms.
[2022-05-15 05:13:42] [INFO ] Added : 1 causal constraints over 1 iterations in 69 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 15100 steps, including 98 resets, run finished after 245 ms. (steps per millisecond=61 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 200 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 200/200 places, 2599/2599 transitions.
Applied a total of 0 rules in 55 ms. Remains 200 /200 variables (removed 0) and now considering 2599/2599 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 200/200 places, 2599/2599 transitions.
Starting structural reductions, iteration 0 : 200/200 places, 2599/2599 transitions.
Applied a total of 0 rules in 55 ms. Remains 200 /200 variables (removed 0) and now considering 2599/2599 (removed 0) transitions.
[2022-05-15 05:13:42] [INFO ] Flow matrix only has 199 transitions (discarded 2400 similar events)
// Phase 1: matrix 199 rows 200 cols
[2022-05-15 05:13:42] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-15 05:13:43] [INFO ] Implicit Places using invariants in 427 ms returned []
[2022-05-15 05:13:43] [INFO ] Flow matrix only has 199 transitions (discarded 2400 similar events)
// Phase 1: matrix 199 rows 200 cols
[2022-05-15 05:13:43] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-15 05:13:43] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-15 05:13:43] [INFO ] Implicit Places using invariants and state equation in 460 ms returned []
Implicit Place search using SMT with State Equation took 887 ms to find 0 implicit places.
[2022-05-15 05:13:43] [INFO ] Redundant transitions in 87 ms returned []
[2022-05-15 05:13:43] [INFO ] Flow matrix only has 199 transitions (discarded 2400 similar events)
// Phase 1: matrix 199 rows 200 cols
[2022-05-15 05:13:43] [INFO ] Computed 100 place invariants in 4 ms
[2022-05-15 05:13:44] [INFO ] Dead Transitions using invariants and state equation in 715 ms returned []
Finished structural reductions, in 1 iterations. Remains : 200/200 places, 2599/2599 transitions.
Starting property specific reduction for Dekker-PT-050-UpperBounds-15
Normalized transition count is 199 out of 2599 initially.
// Phase 1: matrix 199 rows 200 cols
[2022-05-15 05:13:44] [INFO ] Computed 100 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
[2022-05-15 05:13:44] [INFO ] Flow matrix only has 199 transitions (discarded 2400 similar events)
// Phase 1: matrix 199 rows 200 cols
[2022-05-15 05:13:44] [INFO ] Computed 100 place invariants in 2 ms
[2022-05-15 05:13:44] [INFO ] [Real]Absence check using 100 positive place invariants in 12 ms returned sat
[2022-05-15 05:13:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:13:44] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2022-05-15 05:13:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:13:44] [INFO ] [Nat]Absence check using 100 positive place invariants in 12 ms returned sat
[2022-05-15 05:13:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:13:44] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2022-05-15 05:13:44] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-15 05:13:44] [INFO ] [Nat]Added 50 Read/Feed constraints in 12 ms returned sat
[2022-05-15 05:13:44] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2022-05-15 05:13:45] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2022-05-15 05:13:45] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2022-05-15 05:13:45] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2022-05-15 05:13:45] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2022-05-15 05:13:45] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2022-05-15 05:13:45] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2022-05-15 05:13:45] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2022-05-15 05:13:45] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2022-05-15 05:13:45] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2022-05-15 05:13:45] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2022-05-15 05:13:45] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2022-05-15 05:13:45] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2022-05-15 05:13:45] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2022-05-15 05:13:45] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2022-05-15 05:13:45] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2022-05-15 05:13:45] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2022-05-15 05:13:45] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2022-05-15 05:13:45] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2022-05-15 05:13:45] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2022-05-15 05:13:45] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2022-05-15 05:13:45] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2022-05-15 05:13:45] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2022-05-15 05:13:45] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2022-05-15 05:13:45] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2022-05-15 05:13:45] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2022-05-15 05:13:45] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2022-05-15 05:13:45] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2022-05-15 05:13:45] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2022-05-15 05:13:46] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2022-05-15 05:13:46] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2022-05-15 05:13:46] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 1150 ms
[2022-05-15 05:13:46] [INFO ] Computed and/alt/rep : 99/148/99 causal constraints (skipped 50 transitions) in 41 ms.
[2022-05-15 05:13:46] [INFO ] Added : 1 causal constraints over 1 iterations in 72 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 15100 steps, including 98 resets, run finished after 241 ms. (steps per millisecond=62 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 200 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 200/200 places, 2599/2599 transitions.
Applied a total of 0 rules in 60 ms. Remains 200 /200 variables (removed 0) and now considering 2599/2599 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 200/200 places, 2599/2599 transitions.
Normalized transition count is 199 out of 2599 initially.
// Phase 1: matrix 199 rows 200 cols
[2022-05-15 05:13:46] [INFO ] Computed 100 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 9866 ms. (steps per millisecond=101 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1634 ms. (steps per millisecond=611 ) properties (out of 1) seen :0
[2022-05-15 05:13:57] [INFO ] Flow matrix only has 199 transitions (discarded 2400 similar events)
// Phase 1: matrix 199 rows 200 cols
[2022-05-15 05:13:58] [INFO ] Computed 100 place invariants in 10 ms
[2022-05-15 05:13:58] [INFO ] [Real]Absence check using 100 positive place invariants in 11 ms returned sat
[2022-05-15 05:13:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:13:58] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2022-05-15 05:13:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:13:58] [INFO ] [Nat]Absence check using 100 positive place invariants in 16 ms returned sat
[2022-05-15 05:13:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:13:58] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2022-05-15 05:13:58] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-15 05:13:58] [INFO ] [Nat]Added 50 Read/Feed constraints in 12 ms returned sat
[2022-05-15 05:13:58] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2022-05-15 05:13:58] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2022-05-15 05:13:58] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2022-05-15 05:13:58] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2022-05-15 05:13:58] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2022-05-15 05:13:58] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2022-05-15 05:13:58] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2022-05-15 05:13:58] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2022-05-15 05:13:58] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2022-05-15 05:13:58] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2022-05-15 05:13:58] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2022-05-15 05:13:58] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2022-05-15 05:13:58] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2022-05-15 05:13:58] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 4 ms to minimize.
[2022-05-15 05:13:58] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2022-05-15 05:13:58] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2022-05-15 05:13:58] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2022-05-15 05:13:58] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2022-05-15 05:13:58] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2022-05-15 05:13:59] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2022-05-15 05:13:59] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2022-05-15 05:13:59] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2022-05-15 05:13:59] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2022-05-15 05:13:59] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2022-05-15 05:13:59] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2022-05-15 05:13:59] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2022-05-15 05:13:59] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2022-05-15 05:13:59] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2022-05-15 05:13:59] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2022-05-15 05:13:59] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2022-05-15 05:13:59] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2022-05-15 05:13:59] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 1197 ms
[2022-05-15 05:13:59] [INFO ] Computed and/alt/rep : 99/148/99 causal constraints (skipped 50 transitions) in 36 ms.
[2022-05-15 05:13:59] [INFO ] Added : 1 causal constraints over 1 iterations in 69 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 15100 steps, including 98 resets, run finished after 254 ms. (steps per millisecond=59 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 200 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 200/200 places, 2599/2599 transitions.
Applied a total of 0 rules in 50 ms. Remains 200 /200 variables (removed 0) and now considering 2599/2599 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 200/200 places, 2599/2599 transitions.
Starting structural reductions, iteration 0 : 200/200 places, 2599/2599 transitions.
Applied a total of 0 rules in 49 ms. Remains 200 /200 variables (removed 0) and now considering 2599/2599 (removed 0) transitions.
[2022-05-15 05:13:59] [INFO ] Flow matrix only has 199 transitions (discarded 2400 similar events)
// Phase 1: matrix 199 rows 200 cols
[2022-05-15 05:13:59] [INFO ] Computed 100 place invariants in 2 ms
[2022-05-15 05:14:00] [INFO ] Implicit Places using invariants in 383 ms returned []
[2022-05-15 05:14:00] [INFO ] Flow matrix only has 199 transitions (discarded 2400 similar events)
// Phase 1: matrix 199 rows 200 cols
[2022-05-15 05:14:00] [INFO ] Computed 100 place invariants in 2 ms
[2022-05-15 05:14:00] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-15 05:14:00] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 849 ms to find 0 implicit places.
[2022-05-15 05:14:00] [INFO ] Redundant transitions in 66 ms returned []
[2022-05-15 05:14:00] [INFO ] Flow matrix only has 199 transitions (discarded 2400 similar events)
// Phase 1: matrix 199 rows 200 cols
[2022-05-15 05:14:00] [INFO ] Computed 100 place invariants in 2 ms
[2022-05-15 05:14:01] [INFO ] Dead Transitions using invariants and state equation in 709 ms returned []
Finished structural reductions, in 1 iterations. Remains : 200/200 places, 2599/2599 transitions.
Ending property specific reduction for Dekker-PT-050-UpperBounds-15 in 16926 ms.
[2022-05-15 05:14:01] [INFO ] Flatten gal took : 265 ms
[2022-05-15 05:14:02] [INFO ] Applying decomposition
[2022-05-15 05:14:02] [INFO ] Flatten gal took : 154 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph10373089887389034603.txt, -o, /tmp/graph10373089887389034603.bin, -w, /tmp/graph10373089887389034603.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph10373089887389034603.bin, -l, -1, -v, -w, /tmp/graph10373089887389034603.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-15 05:14:02] [INFO ] Decomposing Gal with order
[2022-05-15 05:14:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 05:14:02] [INFO ] Removed a total of 7200 redundant transitions.
[2022-05-15 05:14:03] [INFO ] Flatten gal took : 339 ms
[2022-05-15 05:14:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 54 ms.
[2022-05-15 05:14:03] [INFO ] Time to serialize gal into /tmp/UpperBounds10172998567222978942.gal : 37 ms
[2022-05-15 05:14:03] [INFO ] Time to serialize properties into /tmp/UpperBounds3207347535795400751.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds10172998567222978942.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds3207347535795400751.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds10172998567222978942.gal -t CGAL -reachable-file /tmp/UpperBounds3207347535795400751.prop --nowitness
Loading property file /tmp/UpperBounds3207347535795400751.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\_flat,2.92734e+16,0.384376,11572,103,10,1615,1350,2818,1341,27,1325,0
Total reachable state count : 29273397577908224

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property Dekker-PT-050-UpperBounds-15 :0 <= u31.p3_31 <= 1
FORMULA Dekker-PT-050-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
Dekker-PT-050-UpperBounds-15,0,0.388479,11572,1,0,1615,1350,3118,1341,38,1325,1619
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1652591644630

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="Dekker-PT-050"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is Dekker-PT-050, 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 r071-tall-165254780500232"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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