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-165472292600088.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-d1m10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r323-tall-165472292600088
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 952K
-rw-r--r-- 1 mcc users 7.0K Jun 7 17:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Jun 7 17:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 7 17:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Jun 7 17:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 6 15:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 6 15:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 15:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 15K Jun 7 17:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 167K Jun 7 17:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 7 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Jun 7 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:24 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 432K 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-d1m10-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d1m10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654745420997

Running Version 0
[2022-06-09 03:30:22] [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:30:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 03:30:22] [INFO ] Load time of PNML (sax parser for PT used): 200 ms
[2022-06-09 03:30:22] [INFO ] Transformed 1440 places.
[2022-06-09 03:30:22] [INFO ] Transformed 672 transitions.
[2022-06-09 03:30:22] [INFO ] Parsed PT model containing 1440 places and 672 transitions in 269 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Deduced a syphon composed of 1093 places in 5 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 672 rows 347 cols
[2022-06-09 03:30:22] [INFO ] Computed 6 place invariants in 55 ms
Incomplete random walk after 10000 steps, including 2282 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 1003 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 905 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 898 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 1029 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
// Phase 1: matrix 672 rows 347 cols
[2022-06-09 03:30:23] [INFO ] Computed 6 place invariants in 20 ms
[2022-06-09 03:30:23] [INFO ] [Real]Absence check using 2 positive place invariants in 19 ms returned sat
[2022-06-09 03:30:23] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 7 ms returned sat
[2022-06-09 03:30:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:30:23] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2022-06-09 03:30:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:30:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2022-06-09 03:30:23] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2022-06-09 03:30:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:30:23] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2022-06-09 03:30:24] [INFO ] State equation strengthened by 418 read => feed constraints.
[2022-06-09 03:30:24] [INFO ] [Nat]Added 418 Read/Feed constraints in 376 ms returned sat
[2022-06-09 03:30:24] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 3 ms to minimize.
[2022-06-09 03:30:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 275 ms
[2022-06-09 03:30:24] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 136 ms.
[2022-06-09 03:30:25] [INFO ] Added : 118 causal constraints over 24 iterations in 1258 ms. Result :sat
Minimization took 1079 ms.
[2022-06-09 03:30:27] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-06-09 03:30:27] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2022-06-09 03:30:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:30:27] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2022-06-09 03:30:27] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:30:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-09 03:30:27] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2022-06-09 03:30:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:30:27] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2022-06-09 03:30:27] [INFO ] [Nat]Added 418 Read/Feed constraints in 221 ms returned sat
[2022-06-09 03:30:27] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 2 ms to minimize.
[2022-06-09 03:30:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 200 ms
[2022-06-09 03:30:27] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 63 ms.
[2022-06-09 03:30:28] [INFO ] Added : 114 causal constraints over 23 iterations in 1100 ms. Result :sat
Minimization took 639 ms.
[2022-06-09 03:30:29] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-09 03:30:29] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 13 ms returned unsat
[2022-06-09 03:30:29] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-09 03:30:29] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2022-06-09 03:30:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:30:29] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2022-06-09 03:30:29] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:30:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-09 03:30:29] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2022-06-09 03:30:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:30:30] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2022-06-09 03:30:30] [INFO ] [Nat]Added 418 Read/Feed constraints in 207 ms returned sat
[2022-06-09 03:30:30] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 1 ms to minimize.
[2022-06-09 03:30:30] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 1 ms to minimize.
[2022-06-09 03:30:30] [INFO ] Deduced a trap composed of 108 places in 114 ms of which 1 ms to minimize.
[2022-06-09 03:30:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 524 ms
[2022-06-09 03:30:30] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 62 ms.
[2022-06-09 03:30:31] [INFO ] Added : 114 causal constraints over 23 iterations in 1135 ms. Result :sat
Minimization took 646 ms.
Current structural bounds on expressions (after SMT) : [10, 10, 1, 1741] Max seen :[0, 0, 1, 0]
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 46400 steps, including 9008 resets, run finished after 233 ms. (steps per millisecond=199 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 42100 steps, including 7898 resets, run finished after 180 ms. (steps per millisecond=233 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 82400 steps, including 15826 resets, run finished after 364 ms. (steps per millisecond=226 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 3 out of 347 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 347/347 places, 672/672 transitions.
Graph (complete) has 1246 edges and 347 vertex of which 326 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.6 ms
Discarding 21 places :
Also discarding 0 output transitions
Drop transitions removed 8 transitions
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 86 transitions.
Iterating post reduction 0 with 86 rules applied. Total rules applied 87 place count 326 transition count 586
Discarding 94 places :
Symmetric choice reduction at 1 with 94 rule applications. Total rules 181 place count 232 transition count 330
Iterating global reduction 1 with 94 rules applied. Total rules applied 275 place count 232 transition count 330
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 279 place count 232 transition count 326
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 351 place count 160 transition count 254
Iterating global reduction 2 with 72 rules applied. Total rules applied 423 place count 160 transition count 254
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 429 place count 160 transition count 248
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 470 place count 119 transition count 183
Iterating global reduction 3 with 41 rules applied. Total rules applied 511 place count 119 transition count 183
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 533 place count 119 transition count 161
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 545 place count 107 transition count 142
Iterating global reduction 4 with 12 rules applied. Total rules applied 557 place count 107 transition count 142
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 559 place count 107 transition count 140
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 567 place count 99 transition count 132
Iterating global reduction 5 with 8 rules applied. Total rules applied 575 place count 99 transition count 132
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 578 place count 99 transition count 129
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 584 place count 93 transition count 123
Iterating global reduction 6 with 6 rules applied. Total rules applied 590 place count 93 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 591 place count 93 transition count 122
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 592 place count 92 transition count 120
Iterating global reduction 7 with 1 rules applied. Total rules applied 593 place count 92 transition count 120
Applied a total of 593 rules in 100 ms. Remains 92 /347 variables (removed 255) and now considering 120/672 (removed 552) transitions.
Finished structural reductions, in 1 iterations. Remains : 92/347 places, 120/672 transitions.
// Phase 1: matrix 120 rows 92 cols
[2022-06-09 03:30:33] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229504 resets, run finished after 982 ms. (steps per millisecond=1018 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 98198 resets, run finished after 503 ms. (steps per millisecond=1988 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 98227 resets, run finished after 451 ms. (steps per millisecond=2217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 98149 resets, run finished after 456 ms. (steps per millisecond=2192 ) properties (out of 3) seen :0
// Phase 1: matrix 120 rows 92 cols
[2022-06-09 03:30:35] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:30:35] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:30:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:30:35] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2022-06-09 03:30:35] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:30:36] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:30:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:30:36] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2022-06-09 03:30:36] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-06-09 03:30:36] [INFO ] [Nat]Added 41 Read/Feed constraints in 10 ms returned sat
[2022-06-09 03:30:36] [INFO ] Computed and/alt/rep : 32/74/32 causal constraints (skipped 87 transitions) in 12 ms.
[2022-06-09 03:30:36] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2022-06-09 03:30:36] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2022-06-09 03:30:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 113 ms
[2022-06-09 03:30:36] [INFO ] Added : 29 causal constraints over 6 iterations in 205 ms. Result :sat
Minimization took 70 ms.
[2022-06-09 03:30:36] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:30:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:30:36] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2022-06-09 03:30:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:30:36] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:30:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:30:36] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2022-06-09 03:30:36] [INFO ] [Nat]Added 41 Read/Feed constraints in 8 ms returned sat
[2022-06-09 03:30:36] [INFO ] Computed and/alt/rep : 32/74/32 causal constraints (skipped 87 transitions) in 7 ms.
[2022-06-09 03:30:36] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2022-06-09 03:30:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2022-06-09 03:30:36] [INFO ] Added : 30 causal constraints over 6 iterations in 133 ms. Result :sat
Minimization took 28 ms.
[2022-06-09 03:30:36] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:30:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:30:36] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-06-09 03:30:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:30:36] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:30:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:30:36] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2022-06-09 03:30:36] [INFO ] [Nat]Added 41 Read/Feed constraints in 8 ms returned sat
[2022-06-09 03:30:36] [INFO ] Computed and/alt/rep : 32/74/32 causal constraints (skipped 87 transitions) in 7 ms.
[2022-06-09 03:30:36] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2022-06-09 03:30:36] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2022-06-09 03:30:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 93 ms
[2022-06-09 03:30:36] [INFO ] Added : 30 causal constraints over 6 iterations in 179 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : [10, 10, 1741] Max seen :[0, 0, 0]
Incomplete Parikh walk after 14100 steps, including 2322 resets, run finished after 32 ms. (steps per millisecond=440 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 15200 steps, including 2374 resets, run finished after 29 ms. (steps per millisecond=524 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 27400 steps, including 4495 resets, run finished after 50 ms. (steps per millisecond=548 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 3 out of 92 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 92/92 places, 120/120 transitions.
Applied a total of 0 rules in 9 ms. Remains 92 /92 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 92/92 places, 120/120 transitions.
Starting structural reductions, iteration 0 : 92/92 places, 120/120 transitions.
Applied a total of 0 rules in 9 ms. Remains 92 /92 variables (removed 0) and now considering 120/120 (removed 0) transitions.
// Phase 1: matrix 120 rows 92 cols
[2022-06-09 03:30:37] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:30:37] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 120 rows 92 cols
[2022-06-09 03:30:37] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:30:37] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-06-09 03:30:37] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2022-06-09 03:30:37] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 120 rows 92 cols
[2022-06-09 03:30:37] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:30:37] [INFO ] Dead Transitions using invariants and state equation in 56 ms returned []
Finished structural reductions, in 1 iterations. Remains : 92/92 places, 120/120 transitions.
Starting property specific reduction for DBSingleClientW-PT-d1m10-UpperBounds-01
// Phase 1: matrix 120 rows 92 cols
[2022-06-09 03:30:37] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2307 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 934 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
// Phase 1: matrix 120 rows 92 cols
[2022-06-09 03:30:37] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:30:37] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:30:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:30:37] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-06-09 03:30:37] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:30:37] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:30:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:30:37] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2022-06-09 03:30:37] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-06-09 03:30:37] [INFO ] [Nat]Added 41 Read/Feed constraints in 9 ms returned sat
[2022-06-09 03:30:37] [INFO ] Computed and/alt/rep : 32/74/32 causal constraints (skipped 87 transitions) in 9 ms.
[2022-06-09 03:30:37] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2022-06-09 03:30:37] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2022-06-09 03:30:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 101 ms
[2022-06-09 03:30:37] [INFO ] Added : 29 causal constraints over 6 iterations in 178 ms. Result :sat
Minimization took 72 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 27400 steps, including 4556 resets, run finished after 37 ms. (steps per millisecond=740 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 92 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 92/92 places, 120/120 transitions.
Graph (complete) has 289 edges and 92 vertex of which 91 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 91 transition count 119
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 90 transition count 118
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 90 transition count 118
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 89 transition count 117
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 89 transition count 117
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 88 transition count 115
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 88 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 9 place count 88 transition count 114
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 87 transition count 108
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 87 transition count 108
Applied a total of 11 rules in 19 ms. Remains 87 /92 variables (removed 5) and now considering 108/120 (removed 12) transitions.
Finished structural reductions, in 1 iterations. Remains : 87/92 places, 108/120 transitions.
// Phase 1: matrix 108 rows 87 cols
[2022-06-09 03:30:37] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229645 resets, run finished after 876 ms. (steps per millisecond=1141 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 98940 resets, run finished after 417 ms. (steps per millisecond=2398 ) properties (out of 1) seen :0
// Phase 1: matrix 108 rows 87 cols
[2022-06-09 03:30:39] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:30:39] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:30:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:30:39] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-06-09 03:30:39] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:30:39] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:30:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:30:39] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2022-06-09 03:30:39] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-06-09 03:30:39] [INFO ] [Nat]Added 32 Read/Feed constraints in 8 ms returned sat
[2022-06-09 03:30:39] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2022-06-09 03:30:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2022-06-09 03:30:39] [INFO ] Computed and/alt/rep : 31/70/31 causal constraints (skipped 76 transitions) in 5 ms.
[2022-06-09 03:30:39] [INFO ] Added : 29 causal constraints over 6 iterations in 63 ms. Result :sat
Minimization took 58 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 26100 steps, including 4684 resets, run finished after 31 ms. (steps per millisecond=841 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 87/87 places, 108/108 transitions.
Applied a total of 0 rules in 5 ms. Remains 87 /87 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 87/87 places, 108/108 transitions.
Starting structural reductions, iteration 0 : 87/87 places, 108/108 transitions.
Applied a total of 0 rules in 5 ms. Remains 87 /87 variables (removed 0) and now considering 108/108 (removed 0) transitions.
// Phase 1: matrix 108 rows 87 cols
[2022-06-09 03:30:39] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:30:39] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 108 rows 87 cols
[2022-06-09 03:30:39] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 03:30:39] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-06-09 03:30:39] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2022-06-09 03:30:39] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 108 rows 87 cols
[2022-06-09 03:30:39] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:30:39] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Finished structural reductions, in 1 iterations. Remains : 87/87 places, 108/108 transitions.
Ending property specific reduction for DBSingleClientW-PT-d1m10-UpperBounds-01 in 2279 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m10-UpperBounds-02
// Phase 1: matrix 120 rows 92 cols
[2022-06-09 03:30:39] [INFO ] Computed 2 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2287 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 985 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
// Phase 1: matrix 120 rows 92 cols
[2022-06-09 03:30:39] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:30:39] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:30:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:30:39] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2022-06-09 03:30:39] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:30:39] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:30:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:30:39] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2022-06-09 03:30:39] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-06-09 03:30:39] [INFO ] [Nat]Added 41 Read/Feed constraints in 8 ms returned sat
[2022-06-09 03:30:39] [INFO ] Computed and/alt/rep : 32/74/32 causal constraints (skipped 87 transitions) in 6 ms.
[2022-06-09 03:30:39] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2022-06-09 03:30:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2022-06-09 03:30:39] [INFO ] Added : 30 causal constraints over 6 iterations in 128 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 15200 steps, including 2429 resets, run finished after 22 ms. (steps per millisecond=690 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 92 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 92/92 places, 120/120 transitions.
Graph (complete) has 289 edges and 92 vertex of which 91 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 91 transition count 119
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 90 transition count 118
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 90 transition count 118
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 89 transition count 117
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 89 transition count 117
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 88 transition count 115
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 88 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 9 place count 88 transition count 114
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 87 transition count 113
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 87 transition count 113
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 86 transition count 112
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 86 transition count 112
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 15 place count 86 transition count 110
Applied a total of 15 rules in 22 ms. Remains 86 /92 variables (removed 6) and now considering 110/120 (removed 10) transitions.
Finished structural reductions, in 1 iterations. Remains : 86/92 places, 110/120 transitions.
// Phase 1: matrix 110 rows 86 cols
[2022-06-09 03:30:39] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229499 resets, run finished after 904 ms. (steps per millisecond=1106 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 99026 resets, run finished after 423 ms. (steps per millisecond=2364 ) properties (out of 1) seen :0
// Phase 1: matrix 110 rows 86 cols
[2022-06-09 03:30:41] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:30:41] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:30:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:30:41] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-06-09 03:30:41] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:30:41] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:30:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:30:41] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2022-06-09 03:30:41] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-06-09 03:30:41] [INFO ] [Nat]Added 37 Read/Feed constraints in 7 ms returned sat
[2022-06-09 03:30:41] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2022-06-09 03:30:41] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2022-06-09 03:30:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 79 ms
[2022-06-09 03:30:41] [INFO ] Computed and/alt/rep : 30/65/30 causal constraints (skipped 79 transitions) in 8 ms.
[2022-06-09 03:30:41] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2022-06-09 03:30:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2022-06-09 03:30:41] [INFO ] Added : 28 causal constraints over 6 iterations in 115 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 16400 steps, including 2870 resets, run finished after 23 ms. (steps per millisecond=713 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 86 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 86/86 places, 110/110 transitions.
Applied a total of 0 rules in 4 ms. Remains 86 /86 variables (removed 0) and now considering 110/110 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 86/86 places, 110/110 transitions.
Starting structural reductions, iteration 0 : 86/86 places, 110/110 transitions.
Applied a total of 0 rules in 3 ms. Remains 86 /86 variables (removed 0) and now considering 110/110 (removed 0) transitions.
// Phase 1: matrix 110 rows 86 cols
[2022-06-09 03:30:41] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:30:41] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 110 rows 86 cols
[2022-06-09 03:30:41] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:30:41] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-06-09 03:30:41] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2022-06-09 03:30:41] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 110 rows 86 cols
[2022-06-09 03:30:41] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:30:41] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Finished structural reductions, in 1 iterations. Remains : 86/86 places, 110/110 transitions.
Ending property specific reduction for DBSingleClientW-PT-d1m10-UpperBounds-02 in 2303 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m10-UpperBounds-15
// Phase 1: matrix 120 rows 92 cols
[2022-06-09 03:30:41] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2323 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1011 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
// Phase 1: matrix 120 rows 92 cols
[2022-06-09 03:30:41] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:30:41] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:30:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:30:42] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2022-06-09 03:30:42] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:30:42] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:30:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:30:42] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2022-06-09 03:30:42] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-06-09 03:30:42] [INFO ] [Nat]Added 41 Read/Feed constraints in 7 ms returned sat
[2022-06-09 03:30:42] [INFO ] Computed and/alt/rep : 32/74/32 causal constraints (skipped 87 transitions) in 6 ms.
[2022-06-09 03:30:42] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2022-06-09 03:30:42] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2022-06-09 03:30:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 91 ms
[2022-06-09 03:30:42] [INFO ] Added : 30 causal constraints over 6 iterations in 171 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 14100 steps, including 2304 resets, run finished after 21 ms. (steps per millisecond=671 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 92 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 92/92 places, 120/120 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 90 transition count 118
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 90 transition count 118
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 88 transition count 116
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 88 transition count 116
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 86 transition count 112
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 86 transition count 112
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 86 transition count 110
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 85 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 85 transition count 109
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 84 transition count 108
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 84 transition count 108
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 20 place count 84 transition count 106
Applied a total of 20 rules in 15 ms. Remains 84 /92 variables (removed 8) and now considering 106/120 (removed 14) transitions.
Finished structural reductions, in 1 iterations. Remains : 84/92 places, 106/120 transitions.
// Phase 1: matrix 106 rows 84 cols
[2022-06-09 03:30:42] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229828 resets, run finished after 820 ms. (steps per millisecond=1219 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 98035 resets, run finished after 404 ms. (steps per millisecond=2475 ) properties (out of 1) seen :0
// Phase 1: matrix 106 rows 84 cols
[2022-06-09 03:30:43] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:30:43] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:30:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:30:43] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2022-06-09 03:30:43] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:30:43] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:30:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:30:43] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2022-06-09 03:30:43] [INFO ] State equation strengthened by 36 read => feed constraints.
[2022-06-09 03:30:43] [INFO ] [Nat]Added 36 Read/Feed constraints in 7 ms returned sat
[2022-06-09 03:30:43] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2022-06-09 03:30:43] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2022-06-09 03:30:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 81 ms
[2022-06-09 03:30:43] [INFO ] Computed and/alt/rep : 29/61/29 causal constraints (skipped 76 transitions) in 6 ms.
[2022-06-09 03:30:43] [INFO ] Added : 27 causal constraints over 6 iterations in 60 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 16700 steps, including 2918 resets, run finished after 23 ms. (steps per millisecond=726 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 84/84 places, 106/106 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 106/106 transitions.
Starting structural reductions, iteration 0 : 84/84 places, 106/106 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 106/106 (removed 0) transitions.
// Phase 1: matrix 106 rows 84 cols
[2022-06-09 03:30:43] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:30:43] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 106 rows 84 cols
[2022-06-09 03:30:43] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:30:43] [INFO ] State equation strengthened by 36 read => feed constraints.
[2022-06-09 03:30:44] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2022-06-09 03:30:44] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 106 rows 84 cols
[2022-06-09 03:30:44] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:30:44] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 106/106 transitions.
Ending property specific reduction for DBSingleClientW-PT-d1m10-UpperBounds-15 in 2130 ms.
[2022-06-09 03:30:44] [INFO ] Flatten gal took : 44 ms
[2022-06-09 03:30:44] [INFO ] Applying decomposition
[2022-06-09 03:30:44] [INFO ] Flatten gal took : 13 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/graph16123914387621109017.txt, -o, /tmp/graph16123914387621109017.bin, -w, /tmp/graph16123914387621109017.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/graph16123914387621109017.bin, -l, -1, -v, -w, /tmp/graph16123914387621109017.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 03:30:44] [INFO ] Decomposing Gal with order
[2022-06-09 03:30:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 03:30:44] [INFO ] Removed a total of 114 redundant transitions.
[2022-06-09 03:30:44] [INFO ] Flatten gal took : 43 ms
[2022-06-09 03:30:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 84 labels/synchronizations in 9 ms.
[2022-06-09 03:30:44] [INFO ] Time to serialize gal into /tmp/UpperBounds3021010170337748907.gal : 6 ms
[2022-06-09 03:30:44] [INFO ] Time to serialize properties into /tmp/UpperBounds12102630244064212146.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/UpperBounds3021010170337748907.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds12102630244064212146.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/UpperBounds3021010170337748907.gal -t CGAL -reachable-file /tmp/UpperBounds12102630244064212146.prop --nowitness
Loading property file /tmp/UpperBounds12102630244064212146.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,5.53449e+08,77.7993,898020,5584,1413,680613,16293,380,5.33266e+06,148,224204,0
Total reachable state count : 553448811

Verifying 3 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 7
Bounds property DBSingleClientW-PT-d1m10-UpperBounds-01 :0 <= i2.u6.l1293 <= 7
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-01 7 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-d1m10-UpperBounds-01,0,80.1993,898020,1,0,680613,29315,484,5.33266e+06,180,224204,1723
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d1m10-UpperBounds-02 :0 <= u0.l534 <= 1
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-02 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d1m10-UpperBounds-02,0,80.2268,898020,1,0,680613,29657,502,5.33266e+06,185,224204,1849
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d1m10-UpperBounds-15 :0 <= i3.u10.l574 <= 1
FORMULA DBSingleClientW-PT-d1m10-UpperBounds-15 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d1m10-UpperBounds-15,0,80.2351,898020,1,0,680613,29766,525,5.33266e+06,185,224204,1994

BK_STOP 1654745525872

--------------------
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-d1m10"
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-d1m10, 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-165472292600088"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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