Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 6.6K Mar 23 15:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Mar 23 15:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Mar 23 15:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Mar 23 15:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 7 12:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 7 12:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 7 12:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 7 12:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 12K Mar 23 15:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Mar 23 15:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Mar 23 15:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Mar 23 15:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 7 12:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 7 12:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 9.3K Mar 31 16:48 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 PGCD-PT-D04N025-UpperBounds-00
FORMULA_NAME PGCD-PT-D04N025-UpperBounds-01
FORMULA_NAME PGCD-PT-D04N025-UpperBounds-02
FORMULA_NAME PGCD-PT-D04N025-UpperBounds-03
FORMULA_NAME PGCD-PT-D04N025-UpperBounds-04
FORMULA_NAME PGCD-PT-D04N025-UpperBounds-05
FORMULA_NAME PGCD-PT-D04N025-UpperBounds-06
FORMULA_NAME PGCD-PT-D04N025-UpperBounds-07
FORMULA_NAME PGCD-PT-D04N025-UpperBounds-08
FORMULA_NAME PGCD-PT-D04N025-UpperBounds-09
FORMULA_NAME PGCD-PT-D04N025-UpperBounds-10
FORMULA_NAME PGCD-PT-D04N025-UpperBounds-11
FORMULA_NAME PGCD-PT-D04N025-UpperBounds-12
FORMULA_NAME PGCD-PT-D04N025-UpperBounds-13
FORMULA_NAME PGCD-PT-D04N025-UpperBounds-14
FORMULA_NAME PGCD-PT-D04N025-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1680939210204

Running Version 202205111006
[2023-04-08 07:33:31] [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]
[2023-04-08 07:33:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-08 07:33:31] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2023-04-08 07:33:31] [INFO ] Transformed 15 places.
[2023-04-08 07:33:31] [INFO ] Transformed 15 transitions.
[2023-04-08 07:33:31] [INFO ] Parsed PT model containing 15 places and 15 transitions in 143 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 15 rows 15 cols
[2023-04-08 07:33:31] [INFO ] Computed 6 place invariants in 11 ms
Incomplete random walk after 10027 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=668 ) properties (out of 16) seen :502
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :432
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :500
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :496
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :590
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) seen :494
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 16) seen :504
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) seen :397
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :285
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :357
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 16) seen :478
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 16) seen :320
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 16) seen :664
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :316
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 16) seen :318
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 16) seen :543
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 16) seen :276
// Phase 1: matrix 15 rows 15 cols
[2023-04-08 07:33:31] [INFO ] Computed 6 place invariants in 1 ms
[2023-04-08 07:33:31] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2023-04-08 07:33:31] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2023-04-08 07:33:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:31] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-04-08 07:33:31] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:33:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-04-08 07:33:31] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-08 07:33:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:31] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-04-08 07:33:31] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-08 07:33:31] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2023-04-08 07:33:31] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 7 ms to minimize.
[2023-04-08 07:33:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-04-08 07:33:31] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 4 ms.
[2023-04-08 07:33:32] [INFO ] Added : 1 causal constraints over 1 iterations in 21 ms. Result :sat
Minimization took 10 ms.
[2023-04-08 07:33:32] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-04-08 07:33:32] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2023-04-08 07:33:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:32] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-04-08 07:33:32] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:33:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-04-08 07:33:32] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2023-04-08 07:33:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:32] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-04-08 07:33:32] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:33:32] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:33:32] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 8 ms.
[2023-04-08 07:33:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:33:32] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-08 07:33:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:32] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-04-08 07:33:32] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:33:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:33:32] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-08 07:33:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:32] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-04-08 07:33:32] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2023-04-08 07:33:32] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-08 07:33:32] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 7 ms.
[2023-04-08 07:33:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:33:32] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-08 07:33:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:32] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-04-08 07:33:32] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:33:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:33:32] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2023-04-08 07:33:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:32] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-04-08 07:33:32] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:33:32] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-08 07:33:32] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 8 ms.
[2023-04-08 07:33:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:33:32] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-08 07:33:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:32] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-04-08 07:33:32] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:33:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:33:32] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2023-04-08 07:33:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:32] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-04-08 07:33:32] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:33:32] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-08 07:33:32] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 6 ms.
[2023-04-08 07:33:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:33:32] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2023-04-08 07:33:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:32] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:33:32] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:33:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:33:32] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2023-04-08 07:33:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:32] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:33:32] [INFO ] [Nat]Added 5 Read/Feed constraints in 4 ms returned sat
[2023-04-08 07:33:32] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:33:32] [INFO ] Added : 0 causal constraints over 0 iterations in 15 ms. Result :sat
Minimization took 7 ms.
[2023-04-08 07:33:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:33:32] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2023-04-08 07:33:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:32] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-04-08 07:33:32] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:33:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:33:32] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2023-04-08 07:33:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:32] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-04-08 07:33:32] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:33:32] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 2 ms to minimize.
[2023-04-08 07:33:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2023-04-08 07:33:32] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:33:32] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 7 ms.
[2023-04-08 07:33:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:33:32] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-08 07:33:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:32] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-04-08 07:33:32] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:33:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:33:32] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-08 07:33:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:32] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-04-08 07:33:32] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:33:32] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2023-04-08 07:33:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2023-04-08 07:33:32] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-08 07:33:32] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 5 ms.
[2023-04-08 07:33:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:33:32] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-08 07:33:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:32] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-04-08 07:33:32] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:33:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:33:32] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-08 07:33:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:32] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-04-08 07:33:32] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:33:32] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:33:32] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 10 ms.
[2023-04-08 07:33:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:33:32] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-08 07:33:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:32] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:33:32] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:33:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-04-08 07:33:32] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2023-04-08 07:33:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:32] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-04-08 07:33:32] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:33:32] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-08 07:33:32] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 10 ms.
[2023-04-08 07:33:32] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:33:32] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-08 07:33:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:32] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-04-08 07:33:32] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:33:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:33:32] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-08 07:33:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:32] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-04-08 07:33:32] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:33:32] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:33:32] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 10 ms.
[2023-04-08 07:33:32] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-04-08 07:33:32] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-08 07:33:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:33] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-04-08 07:33:33] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:33:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:33:33] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-08 07:33:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:33] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-04-08 07:33:33] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:33:33] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:33:33] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Minimization took 7 ms.
[2023-04-08 07:33:33] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:33:33] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-08 07:33:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:33] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-04-08 07:33:33] [INFO ] [Real]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:33:33] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:33:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:33:33] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-08 07:33:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:33] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-04-08 07:33:33] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:33:33] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 3 ms.
[2023-04-08 07:33:33] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 5 ms.
[2023-04-08 07:33:33] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:33:33] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 13 ms returned sat
[2023-04-08 07:33:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:33] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-04-08 07:33:33] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:33:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:33:33] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-08 07:33:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:33] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-04-08 07:33:33] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:33:33] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-08 07:33:33] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 10 ms.
[2023-04-08 07:33:33] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:33:33] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-08 07:33:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:33] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-04-08 07:33:33] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:33:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:33:33] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-08 07:33:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:33] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-04-08 07:33:33] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:33:33] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:33:33] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 8 ms.
[2023-04-08 07:33:33] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:33:33] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-08 07:33:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:33] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-04-08 07:33:33] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:33:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:33:33] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-08 07:33:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:33] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-04-08 07:33:33] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:33:33] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:33:33] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [130, 130, 130, 130, 130, 130, 130, 130, 130, 130, 130, 130, 130, 130, 130, 130] Max seen :[104, 90, 102, 90, 102, 90, 104, 104, 70, 102, 102, 90, 88, 70, 90, 60]
FORMULA PGCD-PT-D04N025-UpperBounds-15 130 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PGCD-PT-D04N025-UpperBounds-14 130 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PGCD-PT-D04N025-UpperBounds-11 130 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PGCD-PT-D04N025-UpperBounds-05 130 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PGCD-PT-D04N025-UpperBounds-03 130 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PGCD-PT-D04N025-UpperBounds-01 130 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PGCD-PT-D04N025-UpperBounds-12 130 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PGCD-PT-D04N025-UpperBounds-13 130 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PGCD-PT-D04N025-UpperBounds-08 130 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 15/15 places, 15/15 transitions.
Applied a total of 0 rules in 8 ms. Remains 15 /15 variables (removed 0) and now considering 15/15 (removed 0) transitions.
// Phase 1: matrix 15 rows 15 cols
[2023-04-08 07:33:33] [INFO ] Computed 6 place invariants in 2 ms
[2023-04-08 07:33:33] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 15/15 places, 15/15 transitions.
// Phase 1: matrix 15 rows 15 cols
[2023-04-08 07:33:33] [INFO ] Computed 6 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 225 ms. (steps per millisecond=4444 ) properties (out of 7) seen :376
Incomplete Best-First random walk after 1000001 steps, including 221 resets, run finished after 331 ms. (steps per millisecond=3021 ) properties (out of 7) seen :342
Incomplete Best-First random walk after 1000001 steps, including 221 resets, run finished after 314 ms. (steps per millisecond=3184 ) properties (out of 7) seen :428
Incomplete Best-First random walk after 1000001 steps, including 232 resets, run finished after 297 ms. (steps per millisecond=3367 ) properties (out of 7) seen :424
Incomplete Best-First random walk after 1000001 steps, including 221 resets, run finished after 301 ms. (steps per millisecond=3322 ) properties (out of 7) seen :339
Incomplete Best-First random walk after 1000001 steps, including 232 resets, run finished after 303 ms. (steps per millisecond=3300 ) properties (out of 7) seen :300
Incomplete Best-First random walk after 1000001 steps, including 223 resets, run finished after 297 ms. (steps per millisecond=3367 ) properties (out of 7) seen :424
Incomplete Best-First random walk after 1000001 steps, including 226 resets, run finished after 301 ms. (steps per millisecond=3322 ) properties (out of 7) seen :295
// Phase 1: matrix 15 rows 15 cols
[2023-04-08 07:33:36] [INFO ] Computed 6 place invariants in 3 ms
[2023-04-08 07:33:36] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:33:36] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-08 07:33:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:36] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-04-08 07:33:36] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:33:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:33:36] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2023-04-08 07:33:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:36] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:33:36] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-08 07:33:36] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:33:36] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2023-04-08 07:33:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2023-04-08 07:33:36] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:33:36] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 5 ms.
[2023-04-08 07:33:36] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:33:36] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-08 07:33:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:36] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-04-08 07:33:36] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:33:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:33:36] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-08 07:33:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:36] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-04-08 07:33:36] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:33:36] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2023-04-08 07:33:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2023-04-08 07:33:36] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 4 ms.
[2023-04-08 07:33:36] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 4 ms.
[2023-04-08 07:33:36] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:33:36] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-08 07:33:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:36] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-04-08 07:33:36] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:33:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:33:36] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-08 07:33:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:36] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-04-08 07:33:36] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2023-04-08 07:33:36] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2023-04-08 07:33:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2023-04-08 07:33:36] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-08 07:33:36] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 3 ms.
[2023-04-08 07:33:36] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:33:36] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2023-04-08 07:33:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:36] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-04-08 07:33:36] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:33:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:33:36] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2023-04-08 07:33:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:36] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-04-08 07:33:36] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2023-04-08 07:33:36] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2023-04-08 07:33:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2023-04-08 07:33:36] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:33:36] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 6 ms.
[2023-04-08 07:33:36] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:33:36] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-08 07:33:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:36] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-04-08 07:33:36] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:33:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:33:36] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-08 07:33:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:36] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:33:36] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:33:36] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2023-04-08 07:33:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2023-04-08 07:33:36] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:33:36] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 5 ms.
[2023-04-08 07:33:36] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:33:36] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-08 07:33:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:36] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-04-08 07:33:36] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:33:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:33:36] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2023-04-08 07:33:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:36] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-04-08 07:33:36] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:33:36] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2023-04-08 07:33:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2023-04-08 07:33:36] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-08 07:33:36] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 6 ms.
[2023-04-08 07:33:36] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:33:36] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-08 07:33:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:36] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-04-08 07:33:36] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:33:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:33:36] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-08 07:33:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:36] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-04-08 07:33:36] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:33:36] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:33:36] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [130, 130, 130, 130, 130, 130, 130] Max seen :[128, 128, 128, 128, 128, 128, 128]
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 15/15 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 15/15 places, 15/15 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 15/15 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 15/15 (removed 0) transitions.
// Phase 1: matrix 15 rows 15 cols
[2023-04-08 07:33:37] [INFO ] Computed 6 place invariants in 2 ms
[2023-04-08 07:33:37] [INFO ] Implicit Places using invariants in 33 ms returned [10, 11, 12, 13, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 35 ms to find 5 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 10/15 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 10/15 places, 15/15 transitions.
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:37] [INFO ] Computed 1 place invariants in 2 ms
Incomplete random walk after 1000011 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=6711 ) properties (out of 7) seen :402
Incomplete Best-First random walk after 1000001 steps, including 218 resets, run finished after 232 ms. (steps per millisecond=4310 ) properties (out of 7) seen :340
Incomplete Best-First random walk after 1000000 steps, including 222 resets, run finished after 248 ms. (steps per millisecond=4032 ) properties (out of 7) seen :425
Incomplete Best-First random walk after 1000001 steps, including 216 resets, run finished after 265 ms. (steps per millisecond=3773 ) properties (out of 7) seen :426
Incomplete Best-First random walk after 1000001 steps, including 223 resets, run finished after 251 ms. (steps per millisecond=3984 ) properties (out of 7) seen :345
Incomplete Best-First random walk after 1000001 steps, including 226 resets, run finished after 241 ms. (steps per millisecond=4149 ) properties (out of 7) seen :283
Incomplete Best-First random walk after 1000001 steps, including 225 resets, run finished after 254 ms. (steps per millisecond=3937 ) properties (out of 7) seen :426
Incomplete Best-First random walk after 1000001 steps, including 226 resets, run finished after 230 ms. (steps per millisecond=4347 ) properties (out of 7) seen :292
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:38] [INFO ] Computed 1 place invariants in 1 ms
[2023-04-08 07:33:39] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:33:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:39] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-04-08 07:33:39] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:33:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:33:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:39] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:33:39] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-08 07:33:39] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:33:39] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2023-04-08 07:33:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2023-04-08 07:33:39] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-08 07:33:39] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 5 ms.
[2023-04-08 07:33:39] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:33:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:39] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:33:39] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:33:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:33:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:39] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-04-08 07:33:39] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2023-04-08 07:33:39] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2023-04-08 07:33:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2023-04-08 07:33:39] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-08 07:33:39] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 7 ms.
[2023-04-08 07:33:39] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:33:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:39] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:33:39] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:33:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:33:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:39] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:33:39] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:33:39] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2023-04-08 07:33:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2023-04-08 07:33:39] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 6 ms.
[2023-04-08 07:33:39] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 5 ms.
[2023-04-08 07:33:39] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:33:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:39] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-04-08 07:33:39] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:33:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:33:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:39] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:33:39] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:33:39] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2023-04-08 07:33:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2023-04-08 07:33:39] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 3 ms.
[2023-04-08 07:33:39] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 4 ms.
[2023-04-08 07:33:39] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:33:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:39] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-04-08 07:33:39] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:33:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:33:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:39] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-04-08 07:33:39] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:33:39] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:33:39] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2023-04-08 07:33:39] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:33:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:39] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:33:39] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:33:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:33:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:39] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-04-08 07:33:39] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:33:39] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2023-04-08 07:33:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2023-04-08 07:33:39] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:33:39] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 6 ms.
[2023-04-08 07:33:39] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:33:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:39] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-04-08 07:33:39] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:33:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:33:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:39] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-04-08 07:33:39] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:33:39] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:33:39] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [130, 130, 130, 130, 130, 130, 130] Max seen :[128, 128, 128, 128, 128, 128, 128]
Support contains 4 out of 10 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 3 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 15/15 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:39] [INFO ] Computed 1 place invariants in 1 ms
[2023-04-08 07:33:39] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:39] [INFO ] Computed 1 place invariants in 1 ms
[2023-04-08 07:33:39] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-08 07:33:39] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-04-08 07:33:39] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:39] [INFO ] Computed 1 place invariants in 0 ms
[2023-04-08 07:33:39] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 15/15 transitions.
Starting property specific reduction for PGCD-PT-D04N025-UpperBounds-00
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:39] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 10003 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :29
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3333 ) properties (out of 1) seen :102
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:39] [INFO ] Computed 1 place invariants in 0 ms
[2023-04-08 07:33:39] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:33:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:39] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:33:39] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:33:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:33:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:39] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:33:39] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-08 07:33:39] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2023-04-08 07:33:39] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2023-04-08 07:33:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2023-04-08 07:33:39] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:33:39] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : [130] Max seen :[102]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:40] [INFO ] Computed 1 place invariants in 1 ms
[2023-04-08 07:33:40] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 15/15 transitions.
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:40] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000007 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=6535 ) properties (out of 1) seen :44
Incomplete Best-First random walk after 1000001 steps, including 224 resets, run finished after 249 ms. (steps per millisecond=4016 ) properties (out of 1) seen :104
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:40] [INFO ] Computed 1 place invariants in 2 ms
[2023-04-08 07:33:40] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:33:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:40] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:33:40] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:33:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:33:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:40] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-04-08 07:33:40] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-08 07:33:40] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:33:40] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2023-04-08 07:33:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2023-04-08 07:33:40] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:33:40] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [130] Max seen :[128]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 15/15 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:40] [INFO ] Computed 1 place invariants in 1 ms
[2023-04-08 07:33:40] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:40] [INFO ] Computed 1 place invariants in 1 ms
[2023-04-08 07:33:40] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-08 07:33:40] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-04-08 07:33:40] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:40] [INFO ] Computed 1 place invariants in 0 ms
[2023-04-08 07:33:40] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 15/15 transitions.
Ending property specific reduction for PGCD-PT-D04N025-UpperBounds-00 in 779 ms.
Starting property specific reduction for PGCD-PT-D04N025-UpperBounds-02
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:40] [INFO ] Computed 1 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :32
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :104
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:40] [INFO ] Computed 1 place invariants in 1 ms
[2023-04-08 07:33:40] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:33:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:40] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:33:40] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:33:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:33:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:40] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-04-08 07:33:40] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-08 07:33:40] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:33:40] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-08 07:33:40] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [130] Max seen :[104]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 2 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:40] [INFO ] Computed 1 place invariants in 1 ms
[2023-04-08 07:33:40] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 15/15 transitions.
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:40] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000030 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=6802 ) properties (out of 1) seen :58
Incomplete Best-First random walk after 1000001 steps, including 221 resets, run finished after 226 ms. (steps per millisecond=4424 ) properties (out of 1) seen :104
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:41] [INFO ] Computed 1 place invariants in 1 ms
[2023-04-08 07:33:41] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:33:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:41] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:33:41] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:33:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:33:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:41] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:33:41] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-08 07:33:41] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:33:41] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2023-04-08 07:33:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2023-04-08 07:33:41] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:33:41] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [130] Max seen :[128]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 15/15 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:41] [INFO ] Computed 1 place invariants in 0 ms
[2023-04-08 07:33:41] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:41] [INFO ] Computed 1 place invariants in 1 ms
[2023-04-08 07:33:41] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-08 07:33:41] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-04-08 07:33:41] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:41] [INFO ] Computed 1 place invariants in 0 ms
[2023-04-08 07:33:41] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 15/15 transitions.
Ending property specific reduction for PGCD-PT-D04N025-UpperBounds-02 in 689 ms.
Starting property specific reduction for PGCD-PT-D04N025-UpperBounds-04
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:41] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 10004 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=5002 ) properties (out of 1) seen :32
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :102
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:41] [INFO ] Computed 1 place invariants in 0 ms
[2023-04-08 07:33:41] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:33:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:41] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:33:41] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:33:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:33:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:41] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:33:41] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-08 07:33:41] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:33:41] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:33:41] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [130] Max seen :[102]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:41] [INFO ] Computed 1 place invariants in 2 ms
[2023-04-08 07:33:41] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 15/15 transitions.
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:41] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000007 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=6802 ) properties (out of 1) seen :42
Incomplete Best-First random walk after 1000001 steps, including 225 resets, run finished after 227 ms. (steps per millisecond=4405 ) properties (out of 1) seen :104
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:41] [INFO ] Computed 1 place invariants in 1 ms
[2023-04-08 07:33:41] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:33:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:41] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-04-08 07:33:41] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:33:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:33:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:41] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:33:41] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-08 07:33:41] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:33:41] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2023-04-08 07:33:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2023-04-08 07:33:41] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 4 ms.
[2023-04-08 07:33:41] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [130] Max seen :[128]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 2 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 15/15 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:41] [INFO ] Computed 1 place invariants in 0 ms
[2023-04-08 07:33:41] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:42] [INFO ] Computed 1 place invariants in 1 ms
[2023-04-08 07:33:42] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-08 07:33:42] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-04-08 07:33:42] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:42] [INFO ] Computed 1 place invariants in 1 ms
[2023-04-08 07:33:42] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 15/15 transitions.
Ending property specific reduction for PGCD-PT-D04N025-UpperBounds-04 in 697 ms.
Starting property specific reduction for PGCD-PT-D04N025-UpperBounds-06
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:42] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 10006 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2501 ) properties (out of 1) seen :32
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 :102
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:42] [INFO ] Computed 1 place invariants in 1 ms
[2023-04-08 07:33:42] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:33:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:42] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:33:42] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:33:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:33:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:42] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-04-08 07:33:42] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-08 07:33:42] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:33:42] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2023-04-08 07:33:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2023-04-08 07:33:42] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:33:42] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [130] Max seen :[102]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:42] [INFO ] Computed 1 place invariants in 0 ms
[2023-04-08 07:33:42] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 15/15 transitions.
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:42] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000044 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=7042 ) properties (out of 1) seen :42
Incomplete Best-First random walk after 1000000 steps, including 225 resets, run finished after 223 ms. (steps per millisecond=4484 ) properties (out of 1) seen :104
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:42] [INFO ] Computed 1 place invariants in 1 ms
[2023-04-08 07:33:42] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:33:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:42] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:33:42] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:33:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:33:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:42] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-04-08 07:33:42] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-08 07:33:42] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:33:42] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2023-04-08 07:33:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2023-04-08 07:33:42] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-08 07:33:42] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [130] Max seen :[128]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 15/15 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 2 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:42] [INFO ] Computed 1 place invariants in 0 ms
[2023-04-08 07:33:42] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:42] [INFO ] Computed 1 place invariants in 0 ms
[2023-04-08 07:33:42] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-08 07:33:42] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-04-08 07:33:42] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:42] [INFO ] Computed 1 place invariants in 1 ms
[2023-04-08 07:33:42] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 15/15 transitions.
Ending property specific reduction for PGCD-PT-D04N025-UpperBounds-06 in 707 ms.
Starting property specific reduction for PGCD-PT-D04N025-UpperBounds-07
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:42] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :30
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :102
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:42] [INFO ] Computed 1 place invariants in 1 ms
[2023-04-08 07:33:42] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:33:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:42] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-04-08 07:33:42] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:33:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:33:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:42] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:33:42] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-08 07:33:42] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:33:42] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:33:42] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [130] Max seen :[102]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:42] [INFO ] Computed 1 place invariants in 0 ms
[2023-04-08 07:33:42] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 15/15 transitions.
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:42] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000006 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=6711 ) properties (out of 1) seen :40
Incomplete Best-First random walk after 1000000 steps, including 219 resets, run finished after 245 ms. (steps per millisecond=4081 ) properties (out of 1) seen :104
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:43] [INFO ] Computed 1 place invariants in 0 ms
[2023-04-08 07:33:43] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:33:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:43] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-04-08 07:33:43] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:33:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:33:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:43] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:33:43] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-08 07:33:43] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:33:43] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:33:43] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [130] Max seen :[126]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 4 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 15/15 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:43] [INFO ] Computed 1 place invariants in 1 ms
[2023-04-08 07:33:43] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:43] [INFO ] Computed 1 place invariants in 0 ms
[2023-04-08 07:33:43] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-08 07:33:43] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-04-08 07:33:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:43] [INFO ] Computed 1 place invariants in 1 ms
[2023-04-08 07:33:43] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 15/15 transitions.
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:43] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000036 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=6536 ) properties (out of 1) seen :64
Incomplete Best-First random walk after 1000001 steps, including 219 resets, run finished after 226 ms. (steps per millisecond=4424 ) properties (out of 1) seen :104
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:43] [INFO ] Computed 1 place invariants in 1 ms
[2023-04-08 07:33:43] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:33:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:43] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-04-08 07:33:43] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:33:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:33:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:43] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:33:43] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-08 07:33:43] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:33:43] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:33:43] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [130] Max seen :[128]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 15/15 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:43] [INFO ] Computed 1 place invariants in 0 ms
[2023-04-08 07:33:43] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:43] [INFO ] Computed 1 place invariants in 0 ms
[2023-04-08 07:33:43] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-08 07:33:44] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-04-08 07:33:44] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:44] [INFO ] Computed 1 place invariants in 0 ms
[2023-04-08 07:33:44] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 15/15 transitions.
Ending property specific reduction for PGCD-PT-D04N025-UpperBounds-07 in 1277 ms.
Starting property specific reduction for PGCD-PT-D04N025-UpperBounds-09
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:44] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 10029 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3343 ) properties (out of 1) seen :30
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3333 ) properties (out of 1) seen :102
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:44] [INFO ] Computed 1 place invariants in 0 ms
[2023-04-08 07:33:44] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:33:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:44] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-04-08 07:33:44] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:33:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:33:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:44] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-04-08 07:33:44] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-08 07:33:44] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:33:44] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:33:44] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [130] Max seen :[102]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:44] [INFO ] Computed 1 place invariants in 2 ms
[2023-04-08 07:33:44] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 15/15 transitions.
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:44] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000048 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=6451 ) properties (out of 1) seen :48
Incomplete Best-First random walk after 1000001 steps, including 222 resets, run finished after 232 ms. (steps per millisecond=4310 ) properties (out of 1) seen :104
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:44] [INFO ] Computed 1 place invariants in 1 ms
[2023-04-08 07:33:44] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:33:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:44] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:33:44] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:33:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:33:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:44] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-04-08 07:33:44] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-08 07:33:44] [INFO ] [Nat]Added 5 Read/Feed constraints in 4 ms returned sat
[2023-04-08 07:33:44] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2023-04-08 07:33:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2023-04-08 07:33:44] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:33:44] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [130] Max seen :[128]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 15/15 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 2 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:44] [INFO ] Computed 1 place invariants in 1 ms
[2023-04-08 07:33:44] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:44] [INFO ] Computed 1 place invariants in 1 ms
[2023-04-08 07:33:44] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-08 07:33:44] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-04-08 07:33:44] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:44] [INFO ] Computed 1 place invariants in 0 ms
[2023-04-08 07:33:44] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 15/15 transitions.
Ending property specific reduction for PGCD-PT-D04N025-UpperBounds-09 in 701 ms.
Starting property specific reduction for PGCD-PT-D04N025-UpperBounds-10
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:44] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 10004 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2501 ) properties (out of 1) seen :30
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :102
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:44] [INFO ] Computed 1 place invariants in 0 ms
[2023-04-08 07:33:44] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:33:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:44] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:33:44] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:33:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:33:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:44] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:33:44] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-08 07:33:44] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2023-04-08 07:33:44] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:33:44] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [130] Max seen :[102]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:44] [INFO ] Computed 1 place invariants in 0 ms
[2023-04-08 07:33:44] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 15/15 transitions.
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:44] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=7092 ) properties (out of 1) seen :42
Incomplete Best-First random walk after 1000001 steps, including 218 resets, run finished after 227 ms. (steps per millisecond=4405 ) properties (out of 1) seen :104
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:45] [INFO ] Computed 1 place invariants in 1 ms
[2023-04-08 07:33:45] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:33:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:45] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-04-08 07:33:45] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:33:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:33:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:33:45] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-04-08 07:33:45] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-08 07:33:45] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:33:45] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 07:33:45] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [130] Max seen :[128]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 15/15 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:45] [INFO ] Computed 1 place invariants in 1 ms
[2023-04-08 07:33:45] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:45] [INFO ] Computed 1 place invariants in 0 ms
[2023-04-08 07:33:45] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-08 07:33:45] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2023-04-08 07:33:45] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 10 cols
[2023-04-08 07:33:45] [INFO ] Computed 1 place invariants in 0 ms
[2023-04-08 07:33:45] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 15/15 transitions.
Ending property specific reduction for PGCD-PT-D04N025-UpperBounds-10 in 643 ms.
[2023-04-08 07:33:45] [INFO ] Flatten gal took : 15 ms
[2023-04-08 07:33:45] [INFO ] Applying decomposition
[2023-04-08 07:33:45] [INFO ] Flatten gal took : 3 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/graph16660419633284644479.txt' '-o' '/tmp/graph16660419633284644479.bin' '-w' '/tmp/graph16660419633284644479.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16660419633284644479.bin' '-l' '-1' '-v' '-w' '/tmp/graph16660419633284644479.weights' '-q' '0' '-e' '0.001'
[2023-04-08 07:33:45] [INFO ] Decomposing Gal with order
[2023-04-08 07:33:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-08 07:33:45] [INFO ] Flatten gal took : 35 ms
[2023-04-08 07:33:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2023-04-08 07:33:45] [INFO ] Time to serialize gal into /tmp/UpperBounds17509810912249267386.gal : 1 ms
[2023-04-08 07:33:45] [INFO ] Time to serialize properties into /tmp/UpperBounds9512988458538318434.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/UpperBounds17509810912249267386.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9512988458538318434.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...275
Loading property file /tmp/UpperBounds9512988458538318434.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.57364e+12,760.173,1939672,1340,450,1.26241e+06,881595,42,5.20541e+06,19,2.22364e+06,0
Total reachable state count : 2573637642576

Verifying 7 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 128
Bounds property PGCD-PT-D04N025-UpperBounds-00 :0 <= i1.u2.p1_1 <= 128
FORMULA PGCD-PT-D04N025-UpperBounds-00 128 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
PGCD-PT-D04N025-UpperBounds-00,0,800.177,1939672,1,0,1.26241e+06,881595,69,5.20541e+06,155,2.30738e+06,1692
Min sum of variable value : 0
Maximum sum along a path : 128
Bounds property PGCD-PT-D04N025-UpperBounds-02 :0 <= i0.u3.p1_2 <= 128
FORMULA PGCD-PT-D04N025-UpperBounds-02 128 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
PGCD-PT-D04N025-UpperBounds-02,0,801.414,1939672,1,0,1.26241e+06,945810,76,5.20541e+06,155,2.57291e+06,2397
Min sum of variable value : 0
Maximum sum along a path : 128
Bounds property PGCD-PT-D04N025-UpperBounds-04 :0 <= i0.u3.p1_2 <= 128
FORMULA PGCD-PT-D04N025-UpperBounds-04 128 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
PGCD-PT-D04N025-UpperBounds-04,0,801.414,1939672,1,0,1.26241e+06,945810,76,5.20541e+06,155,2.57291e+06,2397
Min sum of variable value : 0
Maximum sum along a path : 128
Bounds property PGCD-PT-D04N025-UpperBounds-06 :0 <= i1.u2.p1_1 <= 128
FORMULA PGCD-PT-D04N025-UpperBounds-06 128 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
PGCD-PT-D04N025-UpperBounds-06,0,801.414,1939672,1,0,1.26241e+06,945810,76,5.20541e+06,155,2.57291e+06,2397
Min sum of variable value : 0
Maximum sum along a path : 128
Bounds property PGCD-PT-D04N025-UpperBounds-07 :0 <= i1.u1.p1_5 <= 128
FORMULA PGCD-PT-D04N025-UpperBounds-07 128 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
PGCD-PT-D04N025-UpperBounds-07,0,812.013,1939672,1,0,1.26241e+06,950904,85,5.20541e+06,155,2.5929e+06,3169
Min sum of variable value : 0
Maximum sum along a path : 128
Bounds property PGCD-PT-D04N025-UpperBounds-09 :0 <= i0.u3.p1_2 <= 128
FORMULA PGCD-PT-D04N025-UpperBounds-09 128 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
PGCD-PT-D04N025-UpperBounds-09,0,812.013,1939672,1,0,1.26241e+06,950904,85,5.20541e+06,155,2.5929e+06,3169
Min sum of variable value : 0
Maximum sum along a path : 128
Bounds property PGCD-PT-D04N025-UpperBounds-10 :0 <= i0.u0.p1_3 <= 128
FORMULA PGCD-PT-D04N025-UpperBounds-10 128 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
PGCD-PT-D04N025-UpperBounds-10,0,812.013,1939672,1,0,1.26241e+06,950904,89,5.20541e+06,155,2.5929e+06,3175
Total runtime 826766 ms.

BK_STOP 1680940038154

--------------------
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="PGCD-PT-D04N025"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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-5348"
echo " Executing tool gold2022"
echo " Input is PGCD-PT-D04N025, 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 r543-tall-167987257300059"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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