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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 5.8K Jun 7 17:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Jun 7 17:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Jun 7 17:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Jun 7 17:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 6 15:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Jun 6 15:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 15:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 6.4K Jun 7 17:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 57K Jun 7 17:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 7 17:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 35K Jun 7 17:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:25 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 1.6M 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-d2m07-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654745832974

Running Version 0
[2022-06-09 03:37: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:37:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 03:37:14] [INFO ] Load time of PNML (sax parser for PT used): 212 ms
[2022-06-09 03:37:14] [INFO ] Transformed 4763 places.
[2022-06-09 03:37:14] [INFO ] Transformed 2478 transitions.
[2022-06-09 03:37:14] [INFO ] Parsed PT model containing 4763 places and 2478 transitions in 274 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 3580 places in 21 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 2478 rows 1183 cols
[2022-06-09 03:37:15] [INFO ] Computed 6 place invariants in 174 ms
Incomplete random walk after 10000 steps, including 2287 resets, run finished after 327 ms. (steps per millisecond=30 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 948 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 908 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 981 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 956 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :1
// Phase 1: matrix 2478 rows 1183 cols
[2022-06-09 03:37:15] [INFO ] Computed 6 place invariants in 108 ms
[2022-06-09 03:37:16] [INFO ] [Real]Absence check using 2 positive place invariants in 20 ms returned sat
[2022-06-09 03:37:16] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 18 ms returned sat
[2022-06-09 03:37:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:37:16] [INFO ] [Real]Absence check using state equation in 637 ms returned sat
[2022-06-09 03:37:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:37:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 13 ms returned sat
[2022-06-09 03:37:17] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 14 ms returned sat
[2022-06-09 03:37:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:37:17] [INFO ] [Nat]Absence check using state equation in 673 ms returned sat
[2022-06-09 03:37:18] [INFO ] State equation strengthened by 1588 read => feed constraints.
[2022-06-09 03:37:21] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 03:37:22] [INFO ] [Nat]Added 1588 Read/Feed constraints in 3765 ms returned unknown
[2022-06-09 03:37:22] [INFO ] [Real]Absence check using 2 positive place invariants in 15 ms returned sat
[2022-06-09 03:37:22] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2022-06-09 03:37:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:37:22] [INFO ] [Real]Absence check using state equation in 760 ms returned sat
[2022-06-09 03:37:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:37:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 13 ms returned sat
[2022-06-09 03:37:23] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2022-06-09 03:37:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:37:23] [INFO ] [Nat]Absence check using state equation in 723 ms returned sat
[2022-06-09 03:37:28] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 03:37:28] [INFO ] [Nat]Added 1588 Read/Feed constraints in 4178 ms returned unknown
[2022-06-09 03:37:28] [INFO ] [Real]Absence check using 2 positive place invariants in 12 ms returned sat
[2022-06-09 03:37:28] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned unsat
[2022-06-09 03:37:28] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2022-06-09 03:37:28] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 16 ms returned sat
[2022-06-09 03:37:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:37:28] [INFO ] [Real]Absence check using state equation in 603 ms returned sat
[2022-06-09 03:37:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:37:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2022-06-09 03:37:29] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2022-06-09 03:37:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:37:29] [INFO ] [Nat]Absence check using state equation in 639 ms returned sat
[2022-06-09 03:37:33] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 03:37:34] [INFO ] [Nat]Added 1588 Read/Feed constraints in 4255 ms returned unknown
Current structural bounds on expressions (after SMT) : [7, 7, 1, 7] Max seen :[0, 0, 1, 0]
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 3 out of 1183 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Graph (complete) has 4476 edges and 1183 vertex of which 1136 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.13 ms
Discarding 47 places :
Also discarding 0 output transitions
Drop transitions removed 18 transitions
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 217 transitions.
Iterating post reduction 0 with 217 rules applied. Total rules applied 218 place count 1136 transition count 2261
Discarding 388 places :
Symmetric choice reduction at 1 with 388 rule applications. Total rules 606 place count 748 transition count 1203
Iterating global reduction 1 with 388 rules applied. Total rules applied 994 place count 748 transition count 1203
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1003 place count 748 transition count 1194
Discarding 312 places :
Symmetric choice reduction at 2 with 312 rule applications. Total rules 1315 place count 436 transition count 882
Iterating global reduction 2 with 312 rules applied. Total rules applied 1627 place count 436 transition count 882
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1639 place count 436 transition count 870
Discarding 239 places :
Symmetric choice reduction at 3 with 239 rule applications. Total rules 1878 place count 197 transition count 532
Iterating global reduction 3 with 239 rules applied. Total rules applied 2117 place count 197 transition count 532
Ensure Unique test removed 211 transitions
Reduce isomorphic transitions removed 211 transitions.
Iterating post reduction 3 with 211 rules applied. Total rules applied 2328 place count 197 transition count 321
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 2352 place count 173 transition count 282
Iterating global reduction 4 with 24 rules applied. Total rules applied 2376 place count 173 transition count 282
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2382 place count 173 transition count 276
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 2398 place count 157 transition count 260
Iterating global reduction 5 with 16 rules applied. Total rules applied 2414 place count 157 transition count 260
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2418 place count 157 transition count 256
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 2431 place count 144 transition count 243
Iterating global reduction 6 with 13 rules applied. Total rules applied 2444 place count 144 transition count 243
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 2457 place count 144 transition count 230
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 2463 place count 138 transition count 195
Iterating global reduction 7 with 6 rules applied. Total rules applied 2469 place count 138 transition count 195
Applied a total of 2469 rules in 287 ms. Remains 138 /1183 variables (removed 1045) and now considering 195/2478 (removed 2283) transitions.
Finished structural reductions, in 1 iterations. Remains : 138/1183 places, 195/2478 transitions.
// Phase 1: matrix 195 rows 138 cols
[2022-06-09 03:37:34] [INFO ] Computed 2 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 230142 resets, run finished after 1405 ms. (steps per millisecond=711 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95496 resets, run finished after 621 ms. (steps per millisecond=1610 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95691 resets, run finished after 593 ms. (steps per millisecond=1686 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95605 resets, run finished after 609 ms. (steps per millisecond=1642 ) properties (out of 3) seen :0
// Phase 1: matrix 195 rows 138 cols
[2022-06-09 03:37:37] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 03:37:37] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:37:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:37:37] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2022-06-09 03:37:37] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:37:37] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:37:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:37:37] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2022-06-09 03:37:37] [INFO ] State equation strengthened by 64 read => feed constraints.
[2022-06-09 03:37:37] [INFO ] [Nat]Added 64 Read/Feed constraints in 30 ms returned sat
[2022-06-09 03:37:37] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 9 ms to minimize.
[2022-06-09 03:37:37] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2022-06-09 03:37:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 203 ms
[2022-06-09 03:37:37] [INFO ] Computed and/alt/rep : 54/127/54 causal constraints (skipped 140 transitions) in 27 ms.
[2022-06-09 03:37:38] [INFO ] Added : 45 causal constraints over 9 iterations in 214 ms. Result :sat
Minimization took 66 ms.
[2022-06-09 03:37:38] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:37:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:37:38] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2022-06-09 03:37:38] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:37:38] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:37:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:37:38] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2022-06-09 03:37:38] [INFO ] [Nat]Added 64 Read/Feed constraints in 21 ms returned sat
[2022-06-09 03:37:38] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2022-06-09 03:37:38] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 2 ms to minimize.
[2022-06-09 03:37:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 113 ms
[2022-06-09 03:37:38] [INFO ] Computed and/alt/rep : 54/127/54 causal constraints (skipped 140 transitions) in 21 ms.
[2022-06-09 03:37:38] [INFO ] Added : 45 causal constraints over 9 iterations in 192 ms. Result :sat
Minimization took 64 ms.
[2022-06-09 03:37:38] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:37:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:37:38] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2022-06-09 03:37:38] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:37:38] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:37:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:37:38] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2022-06-09 03:37:38] [INFO ] [Nat]Added 64 Read/Feed constraints in 21 ms returned sat
[2022-06-09 03:37:38] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2022-06-09 03:37:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2022-06-09 03:37:38] [INFO ] Computed and/alt/rep : 54/127/54 causal constraints (skipped 140 transitions) in 22 ms.
[2022-06-09 03:37:39] [INFO ] Added : 45 causal constraints over 9 iterations in 201 ms. Result :sat
Minimization took 55 ms.
Current structural bounds on expressions (after SMT) : [7, 7, 7] Max seen :[0, 0, 0]
Incomplete Parikh walk after 47400 steps, including 8962 resets, run finished after 110 ms. (steps per millisecond=430 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 44700 steps, including 8781 resets, run finished after 87 ms. (steps per millisecond=513 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 47300 steps, including 8942 resets, run finished after 88 ms. (steps per millisecond=537 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 3 out of 138 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 138/138 places, 195/195 transitions.
Applied a total of 0 rules in 12 ms. Remains 138 /138 variables (removed 0) and now considering 195/195 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 138/138 places, 195/195 transitions.
Starting structural reductions, iteration 0 : 138/138 places, 195/195 transitions.
Applied a total of 0 rules in 14 ms. Remains 138 /138 variables (removed 0) and now considering 195/195 (removed 0) transitions.
// Phase 1: matrix 195 rows 138 cols
[2022-06-09 03:37:39] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:37:39] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 195 rows 138 cols
[2022-06-09 03:37:39] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:37:39] [INFO ] State equation strengthened by 64 read => feed constraints.
[2022-06-09 03:37:40] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
[2022-06-09 03:37:40] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 195 rows 138 cols
[2022-06-09 03:37:40] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:37:40] [INFO ] Dead Transitions using invariants and state equation in 85 ms returned []
Finished structural reductions, in 1 iterations. Remains : 138/138 places, 195/195 transitions.
Starting property specific reduction for DBSingleClientW-PT-d2m07-UpperBounds-04
// Phase 1: matrix 195 rows 138 cols
[2022-06-09 03:37:40] [INFO ] Computed 2 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 2310 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 927 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 195 rows 138 cols
[2022-06-09 03:37:40] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:37:40] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:37:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:37:40] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2022-06-09 03:37:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:37:40] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:37:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:37:40] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2022-06-09 03:37:40] [INFO ] State equation strengthened by 64 read => feed constraints.
[2022-06-09 03:37:40] [INFO ] [Nat]Added 64 Read/Feed constraints in 24 ms returned sat
[2022-06-09 03:37:40] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
[2022-06-09 03:37:40] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2022-06-09 03:37:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 156 ms
[2022-06-09 03:37:40] [INFO ] Computed and/alt/rep : 54/127/54 causal constraints (skipped 140 transitions) in 17 ms.
[2022-06-09 03:37:40] [INFO ] Added : 45 causal constraints over 9 iterations in 184 ms. Result :sat
Minimization took 69 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 47300 steps, including 8941 resets, run finished after 76 ms. (steps per millisecond=622 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 138/138 places, 195/195 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 136 transition count 193
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 136 transition count 193
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 7 place count 133 transition count 190
Iterating global reduction 0 with 3 rules applied. Total rules applied 10 place count 133 transition count 190
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 131 transition count 185
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 131 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 131 transition count 184
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 130 transition count 183
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 130 transition count 183
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 129 transition count 182
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 129 transition count 182
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 128 transition count 181
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 128 transition count 181
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 127 transition count 179
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 127 transition count 179
Applied a total of 23 rules in 44 ms. Remains 127 /138 variables (removed 11) and now considering 179/195 (removed 16) transitions.
Finished structural reductions, in 1 iterations. Remains : 127/138 places, 179/195 transitions.
// Phase 1: matrix 179 rows 127 cols
[2022-06-09 03:37:40] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 230365 resets, run finished after 1211 ms. (steps per millisecond=825 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95538 resets, run finished after 544 ms. (steps per millisecond=1838 ) properties (out of 1) seen :0
// Phase 1: matrix 179 rows 127 cols
[2022-06-09 03:37:42] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:37:42] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:37:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:37:42] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2022-06-09 03:37:42] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:37:42] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:37:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:37:42] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2022-06-09 03:37:42] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-06-09 03:37:42] [INFO ] [Nat]Added 58 Read/Feed constraints in 17 ms returned sat
[2022-06-09 03:37:42] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2022-06-09 03:37:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2022-06-09 03:37:42] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 128 transitions) in 21 ms.
[2022-06-09 03:37:43] [INFO ] Added : 44 causal constraints over 9 iterations in 161 ms. Result :sat
Minimization took 53 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 23500 steps, including 4447 resets, run finished after 34 ms. (steps per millisecond=691 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 127/127 places, 179/179 transitions.
Applied a total of 0 rules in 6 ms. Remains 127 /127 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 127/127 places, 179/179 transitions.
Starting structural reductions, iteration 0 : 127/127 places, 179/179 transitions.
Applied a total of 0 rules in 5 ms. Remains 127 /127 variables (removed 0) and now considering 179/179 (removed 0) transitions.
// Phase 1: matrix 179 rows 127 cols
[2022-06-09 03:37:43] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:37:43] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 179 rows 127 cols
[2022-06-09 03:37:43] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:37:43] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-06-09 03:37:43] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
[2022-06-09 03:37:43] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 179 rows 127 cols
[2022-06-09 03:37:43] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:37:43] [INFO ] Dead Transitions using invariants and state equation in 69 ms returned []
Finished structural reductions, in 1 iterations. Remains : 127/127 places, 179/179 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m07-UpperBounds-04 in 3483 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m07-UpperBounds-06
// Phase 1: matrix 195 rows 138 cols
[2022-06-09 03:37:43] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2279 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 981 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 195 rows 138 cols
[2022-06-09 03:37:43] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:37:43] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:37:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:37:43] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2022-06-09 03:37:43] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:37:43] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:37:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:37:43] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2022-06-09 03:37:43] [INFO ] State equation strengthened by 64 read => feed constraints.
[2022-06-09 03:37:43] [INFO ] [Nat]Added 64 Read/Feed constraints in 22 ms returned sat
[2022-06-09 03:37:43] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2022-06-09 03:37:43] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2022-06-09 03:37:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 123 ms
[2022-06-09 03:37:43] [INFO ] Computed and/alt/rep : 54/127/54 causal constraints (skipped 140 transitions) in 15 ms.
[2022-06-09 03:37:44] [INFO ] Added : 45 causal constraints over 9 iterations in 181 ms. Result :sat
Minimization took 65 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 44700 steps, including 8719 resets, run finished after 80 ms. (steps per millisecond=558 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 138/138 places, 195/195 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 136 transition count 193
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 136 transition count 193
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 134 transition count 191
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 134 transition count 191
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 132 transition count 189
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 132 transition count 189
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 132 transition count 187
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 131 transition count 180
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 131 transition count 180
Applied a total of 16 rules in 19 ms. Remains 131 /138 variables (removed 7) and now considering 180/195 (removed 15) transitions.
Finished structural reductions, in 1 iterations. Remains : 131/138 places, 180/195 transitions.
// Phase 1: matrix 180 rows 131 cols
[2022-06-09 03:37:44] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 230030 resets, run finished after 1214 ms. (steps per millisecond=823 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95221 resets, run finished after 548 ms. (steps per millisecond=1824 ) properties (out of 1) seen :0
// Phase 1: matrix 180 rows 131 cols
[2022-06-09 03:37:46] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-09 03:37:46] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:37:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:37:46] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2022-06-09 03:37:46] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:37:46] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:37:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:37:46] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2022-06-09 03:37:46] [INFO ] State equation strengthened by 53 read => feed constraints.
[2022-06-09 03:37:46] [INFO ] [Nat]Added 53 Read/Feed constraints in 26 ms returned sat
[2022-06-09 03:37:46] [INFO ] Computed and/alt/rep : 52/123/52 causal constraints (skipped 127 transitions) in 11 ms.
[2022-06-09 03:37:46] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
[2022-06-09 03:37:46] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2022-06-09 03:37:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 136 ms
[2022-06-09 03:37:46] [INFO ] Added : 43 causal constraints over 9 iterations in 282 ms. Result :sat
Minimization took 53 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 36900 steps, including 6886 resets, run finished after 54 ms. (steps per millisecond=683 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 131 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 131/131 places, 180/180 transitions.
Applied a total of 0 rules in 5 ms. Remains 131 /131 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 180/180 transitions.
Starting structural reductions, iteration 0 : 131/131 places, 180/180 transitions.
Applied a total of 0 rules in 4 ms. Remains 131 /131 variables (removed 0) and now considering 180/180 (removed 0) transitions.
// Phase 1: matrix 180 rows 131 cols
[2022-06-09 03:37:46] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:37:46] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 180 rows 131 cols
[2022-06-09 03:37:46] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:37:46] [INFO ] State equation strengthened by 53 read => feed constraints.
[2022-06-09 03:37:46] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
[2022-06-09 03:37:47] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 180 rows 131 cols
[2022-06-09 03:37:47] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:37:47] [INFO ] Dead Transitions using invariants and state equation in 68 ms returned []
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 180/180 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m07-UpperBounds-06 in 3475 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m07-UpperBounds-15
// Phase 1: matrix 195 rows 138 cols
[2022-06-09 03:37:47] [INFO ] Computed 2 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 2273 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 929 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 195 rows 138 cols
[2022-06-09 03:37:47] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:37:47] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:37:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:37:47] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2022-06-09 03:37:47] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:37:47] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:37:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:37:47] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2022-06-09 03:37:47] [INFO ] State equation strengthened by 64 read => feed constraints.
[2022-06-09 03:37:47] [INFO ] [Nat]Added 64 Read/Feed constraints in 19 ms returned sat
[2022-06-09 03:37:47] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2022-06-09 03:37:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2022-06-09 03:37:47] [INFO ] Computed and/alt/rep : 54/127/54 causal constraints (skipped 140 transitions) in 14 ms.
[2022-06-09 03:37:47] [INFO ] Added : 45 causal constraints over 9 iterations in 173 ms. Result :sat
Minimization took 58 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 47400 steps, including 8990 resets, run finished after 80 ms. (steps per millisecond=592 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 138/138 places, 195/195 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 136 transition count 193
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 136 transition count 193
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 7 place count 133 transition count 190
Iterating global reduction 0 with 3 rules applied. Total rules applied 10 place count 133 transition count 190
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 131 transition count 185
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 131 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 131 transition count 184
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 130 transition count 183
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 130 transition count 183
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 129 transition count 182
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 129 transition count 182
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 128 transition count 181
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 128 transition count 181
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 127 transition count 179
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 127 transition count 179
Applied a total of 23 rules in 18 ms. Remains 127 /138 variables (removed 11) and now considering 179/195 (removed 16) transitions.
Finished structural reductions, in 1 iterations. Remains : 127/138 places, 179/195 transitions.
// Phase 1: matrix 179 rows 127 cols
[2022-06-09 03:37:47] [INFO ] Computed 2 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 229671 resets, run finished after 1184 ms. (steps per millisecond=844 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95613 resets, run finished after 536 ms. (steps per millisecond=1865 ) properties (out of 1) seen :0
// Phase 1: matrix 179 rows 127 cols
[2022-06-09 03:37:49] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:37:49] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:37:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:37:49] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2022-06-09 03:37:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:37:49] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:37:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:37:49] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2022-06-09 03:37:49] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-06-09 03:37:49] [INFO ] [Nat]Added 58 Read/Feed constraints in 17 ms returned sat
[2022-06-09 03:37:49] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2022-06-09 03:37:49] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2022-06-09 03:37:49] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2022-06-09 03:37:49] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2022-06-09 03:37:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 232 ms
[2022-06-09 03:37:49] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 128 transitions) in 12 ms.
[2022-06-09 03:37:49] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 2 ms to minimize.
[2022-06-09 03:37:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2022-06-09 03:37:50] [INFO ] Added : 44 causal constraints over 9 iterations in 244 ms. Result :sat
Minimization took 60 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 24300 steps, including 4357 resets, run finished after 41 ms. (steps per millisecond=592 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 127/127 places, 179/179 transitions.
Applied a total of 0 rules in 5 ms. Remains 127 /127 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 127/127 places, 179/179 transitions.
Starting structural reductions, iteration 0 : 127/127 places, 179/179 transitions.
Applied a total of 0 rules in 5 ms. Remains 127 /127 variables (removed 0) and now considering 179/179 (removed 0) transitions.
// Phase 1: matrix 179 rows 127 cols
[2022-06-09 03:37:50] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 03:37:50] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 179 rows 127 cols
[2022-06-09 03:37:50] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:37:50] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-06-09 03:37:50] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2022-06-09 03:37:50] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 179 rows 127 cols
[2022-06-09 03:37:50] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:37:50] [INFO ] Dead Transitions using invariants and state equation in 65 ms returned []
Finished structural reductions, in 1 iterations. Remains : 127/127 places, 179/179 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m07-UpperBounds-15 in 3484 ms.
[2022-06-09 03:37:50] [INFO ] Flatten gal took : 75 ms
[2022-06-09 03:37:50] [INFO ] Applying decomposition
[2022-06-09 03:37:50] [INFO ] Flatten gal took : 19 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/graph1317882085517673569.txt, -o, /tmp/graph1317882085517673569.bin, -w, /tmp/graph1317882085517673569.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/graph1317882085517673569.bin, -l, -1, -v, -w, /tmp/graph1317882085517673569.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 03:37:50] [INFO ] Decomposing Gal with order
[2022-06-09 03:37:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 03:37:50] [INFO ] Removed a total of 233 redundant transitions.
[2022-06-09 03:37:51] [INFO ] Flatten gal took : 55 ms
[2022-06-09 03:37:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 153 labels/synchronizations in 15 ms.
[2022-06-09 03:37:51] [INFO ] Time to serialize gal into /tmp/UpperBounds13265461982246234669.gal : 7 ms
[2022-06-09 03:37:51] [INFO ] Time to serialize properties into /tmp/UpperBounds3417447945126827342.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/UpperBounds13265461982246234669.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds3417447945126827342.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/UpperBounds13265461982246234669.gal -t CGAL -reachable-file /tmp/UpperBounds3417447945126827342.prop --nowitness
Loading property file /tmp/UpperBounds3417447945126827342.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,1.18049e+07,14.5259,238684,4097,1099,195069,9224,607,1.62156e+06,167,155647,0
Total reachable state count : 11804898

Verifying 3 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m07-UpperBounds-04 :0 <= i4.u16.l2498 <= 1
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-04 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d2m07-UpperBounds-04,0,14.9076,238684,1,0,195069,9224,741,1.62156e+06,198,155647,1937
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m07-UpperBounds-06 :0 <= i3.u14.l2334 <= 1
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-06 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-d2m07-UpperBounds-06,0,14.91,238684,1,0,195069,9224,765,1.62156e+06,205,155647,1996
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m07-UpperBounds-15 :0 <= i4.u16.l2764 <= 1
FORMULA DBSingleClientW-PT-d2m07-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-d2m07-UpperBounds-15,0,14.9104,238684,1,0,195069,9224,783,1.62156e+06,210,155647,2042

BK_STOP 1654745886975

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

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