Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.0K Jun 7 17:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Jun 7 17:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 7 17:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Jun 7 17:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 6 15:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 6 15:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 6 15:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 6 15:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 8.1K Jun 7 17:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Jun 7 17:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 7 17:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Jun 7 17:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 119K Jun 6 12:11 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1654744933005

Running Version 0
[2022-06-09 03:22:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-09 03:22:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 03:22:14] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2022-06-09 03:22:14] [INFO ] Transformed 553 places.
[2022-06-09 03:22:14] [INFO ] Transformed 150 transitions.
[2022-06-09 03:22:14] [INFO ] Parsed PT model containing 553 places and 150 transitions in 101 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 444 places in 1 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 150 rows 109 cols
[2022-06-09 03:22:14] [INFO ] Computed 6 place invariants in 25 ms
Incomplete random walk after 10000 steps, including 2307 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10000 steps, including 1046 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10000 steps, including 1014 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10000 steps, including 1005 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 980 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 1017 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :3
// Phase 1: matrix 150 rows 109 cols
[2022-06-09 03:22:15] [INFO ] Computed 6 place invariants in 5 ms
[2022-06-09 03:22:15] [INFO ] [Real]Absence check using 2 positive place invariants in 8 ms returned sat
[2022-06-09 03:22:15] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 11 ms returned sat
[2022-06-09 03:22:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:22:15] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2022-06-09 03:22:15] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:22:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 03:22:15] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2022-06-09 03:22:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:22:15] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2022-06-09 03:22:15] [INFO ] State equation strengthened by 74 read => feed constraints.
[2022-06-09 03:22:15] [INFO ] [Nat]Added 74 Read/Feed constraints in 20 ms returned sat
[2022-06-09 03:22:15] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 3 ms to minimize.
[2022-06-09 03:22:15] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2022-06-09 03:22:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 203 ms
[2022-06-09 03:22:15] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 21 ms.
[2022-06-09 03:22:15] [INFO ] Added : 31 causal constraints over 7 iterations in 162 ms. Result :sat
Minimization took 40 ms.
[2022-06-09 03:22:15] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 03:22:15] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned unsat
[2022-06-09 03:22:15] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 03:22:15] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2022-06-09 03:22:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:22:15] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2022-06-09 03:22:15] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:22:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 03:22:16] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2022-06-09 03:22:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:22:16] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2022-06-09 03:22:16] [INFO ] [Nat]Added 74 Read/Feed constraints in 14 ms returned sat
[2022-06-09 03:22:16] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2022-06-09 03:22:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2022-06-09 03:22:16] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 14 ms.
[2022-06-09 03:22:16] [INFO ] Added : 36 causal constraints over 8 iterations in 120 ms. Result :sat
Minimization took 68 ms.
[2022-06-09 03:22:16] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 03:22:16] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2022-06-09 03:22:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:22:16] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2022-06-09 03:22:16] [INFO ] [Real]Added 74 Read/Feed constraints in 28 ms returned sat
[2022-06-09 03:22:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:22:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 03:22:16] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2022-06-09 03:22:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:22:16] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2022-06-09 03:22:16] [INFO ] [Nat]Added 74 Read/Feed constraints in 22 ms returned sat
[2022-06-09 03:22:16] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 2 ms to minimize.
[2022-06-09 03:22:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2022-06-09 03:22:16] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 18 ms.
[2022-06-09 03:22:16] [INFO ] Added : 34 causal constraints over 7 iterations in 108 ms. Result :sat
Minimization took 60 ms.
[2022-06-09 03:22:16] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 03:22:16] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned unsat
Current structural bounds on expressions (after SMT) : [6, 1, 6, 6, 1] Max seen :[0, 1, 0, 2, 1]
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 26800 steps, including 5171 resets, run finished after 59 ms. (steps per millisecond=454 ) properties (out of 3) seen :2 could not realise parikh vector
Incomplete Parikh walk after 31100 steps, including 6546 resets, run finished after 55 ms. (steps per millisecond=565 ) properties (out of 3) seen :1 could not realise parikh vector
Incomplete Parikh walk after 31200 steps, including 5898 resets, run finished after 51 ms. (steps per millisecond=611 ) properties (out of 3) seen :1 could not realise parikh vector
Support contains 3 out of 109 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 109/109 places, 150/150 transitions.
Graph (complete) has 332 edges and 109 vertex of which 102 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 places :
Also discarding 0 output transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 102 transition count 139
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 34 place count 80 transition count 99
Iterating global reduction 1 with 22 rules applied. Total rules applied 56 place count 80 transition count 99
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 66 place count 70 transition count 89
Iterating global reduction 1 with 10 rules applied. Total rules applied 76 place count 70 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 78 place count 70 transition count 87
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 80 place count 68 transition count 84
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 68 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 83 place count 68 transition count 83
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 84 place count 67 transition count 81
Iterating global reduction 3 with 1 rules applied. Total rules applied 85 place count 67 transition count 81
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 86 place count 66 transition count 80
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 66 transition count 80
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 88 place count 65 transition count 79
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 65 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 91 place count 65 transition count 77
Applied a total of 91 rules in 40 ms. Remains 65 /109 variables (removed 44) and now considering 77/150 (removed 73) transitions.
Finished structural reductions, in 1 iterations. Remains : 65/109 places, 77/150 transitions.
// Phase 1: matrix 77 rows 65 cols
[2022-06-09 03:22:16] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 228703 resets, run finished after 767 ms. (steps per millisecond=1303 ) properties (out of 3) seen :3
Incomplete Best-First random walk after 1000001 steps, including 101253 resets, run finished after 404 ms. (steps per millisecond=2475 ) properties (out of 3) seen :4
Incomplete Best-First random walk after 1000000 steps, including 101718 resets, run finished after 353 ms. (steps per millisecond=2832 ) properties (out of 3) seen :3
Incomplete Best-First random walk after 1000001 steps, including 100176 resets, run finished after 352 ms. (steps per millisecond=2840 ) properties (out of 3) seen :4
// Phase 1: matrix 77 rows 65 cols
[2022-06-09 03:22:18] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:22:18] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 03:22:18] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 03:22:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:22:18] [INFO ] [Real]Absence check using state equation in 15 ms returned unsat
[2022-06-09 03:22:18] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 03:22:18] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 03:22:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:22:18] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-06-09 03:22:18] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-09 03:22:18] [INFO ] [Real]Added 25 Read/Feed constraints in 4 ms returned sat
[2022-06-09 03:22:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:22:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 03:22:18] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 03:22:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:22:18] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-06-09 03:22:18] [INFO ] [Nat]Added 25 Read/Feed constraints in 4 ms returned sat
[2022-06-09 03:22:19] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2022-06-09 03:22:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2022-06-09 03:22:19] [INFO ] Computed and/alt/rep : 23/48/23 causal constraints (skipped 53 transitions) in 7 ms.
[2022-06-09 03:22:19] [INFO ] Added : 22 causal constraints over 5 iterations in 46 ms. Result :sat
Minimization took 25 ms.
[2022-06-09 03:22:19] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 03:22:19] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 03:22:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:22:19] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-06-09 03:22:19] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:22:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 03:22:19] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 03:22:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:22:19] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-06-09 03:22:19] [INFO ] [Nat]Added 25 Read/Feed constraints in 6 ms returned sat
[2022-06-09 03:22:19] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2022-06-09 03:22:19] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2022-06-09 03:22:19] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2022-06-09 03:22:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 90 ms
[2022-06-09 03:22:19] [INFO ] Computed and/alt/rep : 23/48/23 causal constraints (skipped 53 transitions) in 7 ms.
[2022-06-09 03:22:19] [INFO ] Added : 20 causal constraints over 4 iterations in 38 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : [1, 6, 6] Max seen :[1, 1, 4]
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 12500 steps, including 2773 resets, run finished after 31 ms. (steps per millisecond=403 ) properties (out of 2) seen :1 could not realise parikh vector
Incomplete Parikh walk after 16700 steps, including 3533 resets, run finished after 17 ms. (steps per millisecond=982 ) properties (out of 2) seen :1 could not realise parikh vector
Support contains 2 out of 65 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 65/65 places, 77/77 transitions.
Graph (complete) has 193 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 64 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 63 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 63 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 63 transition count 73
Applied a total of 6 rules in 8 ms. Remains 63 /65 variables (removed 2) and now considering 73/77 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 63/65 places, 73/77 transitions.
// Phase 1: matrix 73 rows 63 cols
[2022-06-09 03:22:19] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 228747 resets, run finished after 644 ms. (steps per millisecond=1552 ) properties (out of 2) seen :3
Incomplete Best-First random walk after 1000001 steps, including 102012 resets, run finished after 343 ms. (steps per millisecond=2915 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000001 steps, including 99544 resets, run finished after 409 ms. (steps per millisecond=2444 ) properties (out of 2) seen :4
// Phase 1: matrix 73 rows 63 cols
[2022-06-09 03:22:20] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:22:20] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:22:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:22:20] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-06-09 03:22:20] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 03:22:20] [INFO ] [Real]Added 21 Read/Feed constraints in 3 ms returned sat
[2022-06-09 03:22:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:22:20] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:22:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:22:20] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-06-09 03:22:20] [INFO ] [Nat]Added 21 Read/Feed constraints in 4 ms returned sat
[2022-06-09 03:22:20] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2022-06-09 03:22:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2022-06-09 03:22:20] [INFO ] Computed and/alt/rep : 21/44/21 causal constraints (skipped 51 transitions) in 7 ms.
[2022-06-09 03:22:20] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2022-06-09 03:22:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2022-06-09 03:22:21] [INFO ] Added : 21 causal constraints over 5 iterations in 97 ms. Result :sat
Minimization took 24 ms.
[2022-06-09 03:22:21] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:22:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:22:21] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-06-09 03:22:21] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:22:21] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:22:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:22:21] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-06-09 03:22:21] [INFO ] [Nat]Added 21 Read/Feed constraints in 5 ms returned sat
[2022-06-09 03:22:21] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2022-06-09 03:22:21] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2022-06-09 03:22:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 65 ms
[2022-06-09 03:22:21] [INFO ] Computed and/alt/rep : 21/44/21 causal constraints (skipped 51 transitions) in 5 ms.
[2022-06-09 03:22:21] [INFO ] Added : 13 causal constraints over 3 iterations in 29 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [6, 6] Max seen :[1, 4]
Incomplete Parikh walk after 13800 steps, including 3121 resets, run finished after 21 ms. (steps per millisecond=657 ) properties (out of 2) seen :1 could not realise parikh vector
Incomplete Parikh walk after 16700 steps, including 3554 resets, run finished after 16 ms. (steps per millisecond=1043 ) properties (out of 2) seen :1 could not realise parikh vector
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 63/63 places, 73/73 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 73/73 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 73/73 transitions.
Starting structural reductions, iteration 0 : 63/63 places, 73/73 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 73/73 (removed 0) transitions.
// Phase 1: matrix 73 rows 63 cols
[2022-06-09 03:22:21] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:22:21] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 73 rows 63 cols
[2022-06-09 03:22:21] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:22:21] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 03:22:21] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2022-06-09 03:22:21] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 73 rows 63 cols
[2022-06-09 03:22:21] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:22:21] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 73/73 transitions.
Starting property specific reduction for DBSingleClientW-PT-d0m06-UpperBounds-08
// Phase 1: matrix 73 rows 63 cols
[2022-06-09 03:22:21] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2301 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1013 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
// Phase 1: matrix 73 rows 63 cols
[2022-06-09 03:22:21] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:22:21] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:22:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:22:21] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-06-09 03:22:21] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:22:21] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:22:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:22:21] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-06-09 03:22:21] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 03:22:21] [INFO ] [Nat]Added 21 Read/Feed constraints in 3 ms returned sat
[2022-06-09 03:22:21] [INFO ] Computed and/alt/rep : 21/44/21 causal constraints (skipped 51 transitions) in 8 ms.
[2022-06-09 03:22:21] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2022-06-09 03:22:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2022-06-09 03:22:21] [INFO ] Added : 17 causal constraints over 4 iterations in 76 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 18000 steps, including 3908 resets, run finished after 22 ms. (steps per millisecond=818 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 63/63 places, 73/73 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 73/73 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 73/73 transitions.
// Phase 1: matrix 73 rows 63 cols
[2022-06-09 03:22:21] [INFO ] Computed 2 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 229231 resets, run finished after 674 ms. (steps per millisecond=1483 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 101536 resets, run finished after 345 ms. (steps per millisecond=2898 ) properties (out of 1) seen :0
// Phase 1: matrix 73 rows 63 cols
[2022-06-09 03:22:22] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:22:22] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:22:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:22:22] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-06-09 03:22:22] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 03:22:22] [INFO ] [Real]Added 21 Read/Feed constraints in 3 ms returned sat
[2022-06-09 03:22:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:22:22] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:22:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:22:22] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-06-09 03:22:22] [INFO ] [Nat]Added 21 Read/Feed constraints in 4 ms returned sat
[2022-06-09 03:22:22] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2022-06-09 03:22:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2022-06-09 03:22:22] [INFO ] Computed and/alt/rep : 21/44/21 causal constraints (skipped 51 transitions) in 6 ms.
[2022-06-09 03:22:22] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2022-06-09 03:22:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2022-06-09 03:22:22] [INFO ] Added : 21 causal constraints over 5 iterations in 90 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Incomplete Parikh walk after 16700 steps, including 3538 resets, run finished after 18 ms. (steps per millisecond=927 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 63/63 places, 73/73 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 73/73 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 73/73 transitions.
Starting structural reductions, iteration 0 : 63/63 places, 73/73 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 73/73 (removed 0) transitions.
// Phase 1: matrix 73 rows 63 cols
[2022-06-09 03:22:22] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 03:22:23] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 73 rows 63 cols
[2022-06-09 03:22:23] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:22:23] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 03:22:23] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2022-06-09 03:22:23] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 73 rows 63 cols
[2022-06-09 03:22:23] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 03:22:23] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 73/73 transitions.
// Phase 1: matrix 73 rows 63 cols
[2022-06-09 03:22:23] [INFO ] Computed 2 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 229250 resets, run finished after 698 ms. (steps per millisecond=1432 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 101447 resets, run finished after 353 ms. (steps per millisecond=2832 ) properties (out of 1) seen :0
// Phase 1: matrix 73 rows 63 cols
[2022-06-09 03:22:24] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:22:24] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:22:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:22:24] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-06-09 03:22:24] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 03:22:24] [INFO ] [Real]Added 21 Read/Feed constraints in 3 ms returned sat
[2022-06-09 03:22:24] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:22:24] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:22:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:22:24] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-06-09 03:22:24] [INFO ] [Nat]Added 21 Read/Feed constraints in 4 ms returned sat
[2022-06-09 03:22:24] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2022-06-09 03:22:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2022-06-09 03:22:24] [INFO ] Computed and/alt/rep : 21/44/21 causal constraints (skipped 51 transitions) in 6 ms.
[2022-06-09 03:22:24] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2022-06-09 03:22:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2022-06-09 03:22:24] [INFO ] Added : 21 causal constraints over 5 iterations in 86 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Incomplete Parikh walk after 16700 steps, including 3553 resets, run finished after 19 ms. (steps per millisecond=878 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 63/63 places, 73/73 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 73/73 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 73/73 transitions.
Starting structural reductions, iteration 0 : 63/63 places, 73/73 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 73/73 (removed 0) transitions.
// Phase 1: matrix 73 rows 63 cols
[2022-06-09 03:22:24] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:22:24] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 73 rows 63 cols
[2022-06-09 03:22:24] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:22:24] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 03:22:24] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2022-06-09 03:22:24] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 73 rows 63 cols
[2022-06-09 03:22:24] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:22:24] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 73/73 transitions.
Ending property specific reduction for DBSingleClientW-PT-d0m06-UpperBounds-08 in 3166 ms.
Starting property specific reduction for DBSingleClientW-PT-d0m06-UpperBounds-09
// Phase 1: matrix 73 rows 63 cols
[2022-06-09 03:22:24] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2314 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 1028 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :2
// Phase 1: matrix 73 rows 63 cols
[2022-06-09 03:22:24] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:22:24] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:22:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:22:24] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-06-09 03:22:24] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 03:22:24] [INFO ] [Real]Added 21 Read/Feed constraints in 3 ms returned sat
[2022-06-09 03:22:24] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:22:24] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:22:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:22:24] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-06-09 03:22:24] [INFO ] [Nat]Added 21 Read/Feed constraints in 4 ms returned sat
[2022-06-09 03:22:24] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2022-06-09 03:22:24] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2022-06-09 03:22:24] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2022-06-09 03:22:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 99 ms
[2022-06-09 03:22:24] [INFO ] Computed and/alt/rep : 21/44/21 causal constraints (skipped 51 transitions) in 8 ms.
[2022-06-09 03:22:24] [INFO ] Added : 21 causal constraints over 5 iterations in 40 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Incomplete Parikh walk after 12600 steps, including 2678 resets, run finished after 16 ms. (steps per millisecond=787 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 63/63 places, 73/73 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 62 transition count 72
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 62 transition count 72
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 60 transition count 70
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 60 transition count 70
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 59 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 58 transition count 66
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 58 transition count 66
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 57 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 57 transition count 65
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 57 transition count 63
Applied a total of 14 rules in 13 ms. Remains 57 /63 variables (removed 6) and now considering 63/73 (removed 10) transitions.
Finished structural reductions, in 1 iterations. Remains : 57/63 places, 63/73 transitions.
// Phase 1: matrix 63 rows 57 cols
[2022-06-09 03:22:24] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229370 resets, run finished after 626 ms. (steps per millisecond=1597 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 101663 resets, run finished after 317 ms. (steps per millisecond=3154 ) properties (out of 1) seen :4
// Phase 1: matrix 63 rows 57 cols
[2022-06-09 03:22:25] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:22:25] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:22:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:22:25] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-06-09 03:22:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:22:25] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:22:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:22:25] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-06-09 03:22:25] [INFO ] State equation strengthened by 19 read => feed constraints.
[2022-06-09 03:22:25] [INFO ] [Nat]Added 19 Read/Feed constraints in 4 ms returned sat
[2022-06-09 03:22:25] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2022-06-09 03:22:25] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2022-06-09 03:22:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 57 ms
[2022-06-09 03:22:25] [INFO ] Computed and/alt/rep : 18/35/18 causal constraints (skipped 44 transitions) in 3 ms.
[2022-06-09 03:22:26] [INFO ] Added : 17 causal constraints over 4 iterations in 25 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Incomplete Parikh walk after 11200 steps, including 2541 resets, run finished after 12 ms. (steps per millisecond=933 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 4 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 57/57 places, 63/63 transitions.
Starting structural reductions, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 57 cols
[2022-06-09 03:22:26] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 03:22:26] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 63 rows 57 cols
[2022-06-09 03:22:26] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:22:26] [INFO ] State equation strengthened by 19 read => feed constraints.
[2022-06-09 03:22:26] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2022-06-09 03:22:26] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 63 rows 57 cols
[2022-06-09 03:22:26] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:22:26] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 57/57 places, 63/63 transitions.
// Phase 1: matrix 63 rows 57 cols
[2022-06-09 03:22:26] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229327 resets, run finished after 614 ms. (steps per millisecond=1628 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000000 steps, including 101320 resets, run finished after 310 ms. (steps per millisecond=3225 ) properties (out of 1) seen :4
// Phase 1: matrix 63 rows 57 cols
[2022-06-09 03:22:27] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:22:27] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:22:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:22:27] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-06-09 03:22:27] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:22:27] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:22:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:22:27] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-06-09 03:22:27] [INFO ] State equation strengthened by 19 read => feed constraints.
[2022-06-09 03:22:27] [INFO ] [Nat]Added 19 Read/Feed constraints in 3 ms returned sat
[2022-06-09 03:22:27] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2022-06-09 03:22:27] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2022-06-09 03:22:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 60 ms
[2022-06-09 03:22:27] [INFO ] Computed and/alt/rep : 18/35/18 causal constraints (skipped 44 transitions) in 5 ms.
[2022-06-09 03:22:27] [INFO ] Added : 17 causal constraints over 4 iterations in 28 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Incomplete Parikh walk after 11200 steps, including 2520 resets, run finished after 13 ms. (steps per millisecond=861 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 57/57 places, 63/63 transitions.
Starting structural reductions, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 57 cols
[2022-06-09 03:22:27] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:22:27] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 63 rows 57 cols
[2022-06-09 03:22:27] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:22:27] [INFO ] State equation strengthened by 19 read => feed constraints.
[2022-06-09 03:22:27] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2022-06-09 03:22:27] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 63 rows 57 cols
[2022-06-09 03:22:27] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:22:27] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 57/57 places, 63/63 transitions.
Ending property specific reduction for DBSingleClientW-PT-d0m06-UpperBounds-09 in 2843 ms.
[2022-06-09 03:22:27] [INFO ] Flatten gal took : 33 ms
[2022-06-09 03:22:27] [INFO ] Applying decomposition
[2022-06-09 03:22:27] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph4812655274171303871.txt, -o, /tmp/graph4812655274171303871.bin, -w, /tmp/graph4812655274171303871.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph4812655274171303871.bin, -l, -1, -v, -w, /tmp/graph4812655274171303871.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 03:22:27] [INFO ] Decomposing Gal with order
[2022-06-09 03:22:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 03:22:27] [INFO ] Removed a total of 61 redundant transitions.
[2022-06-09 03:22:27] [INFO ] Flatten gal took : 33 ms
[2022-06-09 03:22:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 37 labels/synchronizations in 6 ms.
[2022-06-09 03:22:27] [INFO ] Time to serialize gal into /tmp/UpperBounds15705416114419221914.gal : 3 ms
[2022-06-09 03:22:27] [INFO ] Time to serialize properties into /tmp/UpperBounds2179346991519999297.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds15705416114419221914.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds2179346991519999297.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds15705416114419221914.gal -t CGAL -reachable-file /tmp/UpperBounds2179346991519999297.prop --nowitness
Loading property file /tmp/UpperBounds2179346991519999297.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,279182,0.567652,20596,841,512,21828,4516,250,53848,99,51180,0
Total reachable state count : 279182

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 3
Bounds property DBSingleClientW-PT-d0m06-UpperBounds-08 :0 <= u7.l492 <= 3
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-08 3 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
DBSingleClientW-PT-d0m06-UpperBounds-08,0,0.599501,20596,1,0,21828,4516,336,53848,122,51180,514
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property DBSingleClientW-PT-d0m06-UpperBounds-09 :0 <= u11.l345 <= 4
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-09 4 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
DBSingleClientW-PT-d0m06-UpperBounds-09,0,0.607383,20596,1,0,21828,4516,352,53848,134,51180,619

BK_STOP 1654744949460

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2021"
echo " Input is DBSingleClientW-PT-d0m06, 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 r323-tall-165472292600055"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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