Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 844K
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Feb 26 15:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 15:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 15:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 26 15:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 15:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 26 15:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 432K Mar 5 18:22 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-d1m04-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678239763584

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m04
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-08 01:42:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-08 01:42:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 01:42:45] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2023-03-08 01:42:45] [INFO ] Transformed 1440 places.
[2023-03-08 01:42:45] [INFO ] Transformed 672 transitions.
[2023-03-08 01:42:45] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 154 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 1093 places in 5 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 672 rows 347 cols
[2023-03-08 01:42:45] [INFO ] Computed 6 place invariants in 44 ms
Incomplete random walk after 10000 steps, including 2315 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 898 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 1008 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 962 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 947 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 994 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
[2023-03-08 01:42:46] [INFO ] Invariant cache hit.
[2023-03-08 01:42:46] [INFO ] [Real]Absence check using 2 positive place invariants in 8 ms returned sat
[2023-03-08 01:42:46] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned unsat
[2023-03-08 01:42:46] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-08 01:42:46] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-08 01:42:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:42:46] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2023-03-08 01:42:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:42:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-08 01:42:46] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-08 01:42:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:42:46] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2023-03-08 01:42:46] [INFO ] State equation strengthened by 418 read => feed constraints.
[2023-03-08 01:42:47] [INFO ] [Nat]Added 418 Read/Feed constraints in 114 ms returned sat
[2023-03-08 01:42:47] [INFO ] Deduced a trap composed of 100 places in 255 ms of which 3 ms to minimize.
[2023-03-08 01:42:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 318 ms
[2023-03-08 01:42:47] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 160 ms.
[2023-03-08 01:42:47] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 1 ms to minimize.
[2023-03-08 01:42:48] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 1 ms to minimize.
[2023-03-08 01:42:48] [INFO ] Deduced a trap composed of 104 places in 139 ms of which 1 ms to minimize.
[2023-03-08 01:42:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 574 ms
[2023-03-08 01:42:48] [INFO ] Added : 22 causal constraints over 5 iterations in 1124 ms. Result :sat
Minimization took 152 ms.
[2023-03-08 01:42:48] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-08 01:42:48] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-08 01:42:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:42:48] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2023-03-08 01:42:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:42:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-08 01:42:48] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2023-03-08 01:42:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:42:49] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2023-03-08 01:42:49] [INFO ] [Nat]Added 418 Read/Feed constraints in 93 ms returned sat
[2023-03-08 01:42:49] [INFO ] Deduced a trap composed of 34 places in 147 ms of which 1 ms to minimize.
[2023-03-08 01:42:49] [INFO ] Deduced a trap composed of 35 places in 138 ms of which 0 ms to minimize.
[2023-03-08 01:42:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 388 ms
[2023-03-08 01:42:49] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 68 ms.
[2023-03-08 01:42:49] [INFO ] Added : 10 causal constraints over 2 iterations in 217 ms. Result :sat
Minimization took 105 ms.
[2023-03-08 01:42:49] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-08 01:42:49] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-08 01:42:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:42:50] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2023-03-08 01:42:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:42:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-08 01:42:50] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-08 01:42:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:42:50] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2023-03-08 01:42:50] [INFO ] [Nat]Added 418 Read/Feed constraints in 119 ms returned sat
[2023-03-08 01:42:50] [INFO ] Deduced a trap composed of 97 places in 128 ms of which 0 ms to minimize.
[2023-03-08 01:42:50] [INFO ] Deduced a trap composed of 99 places in 136 ms of which 1 ms to minimize.
[2023-03-08 01:42:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 351 ms
[2023-03-08 01:42:50] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 62 ms.
[2023-03-08 01:42:51] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 1 ms to minimize.
[2023-03-08 01:42:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 284 ms
[2023-03-08 01:42:51] [INFO ] Added : 16 causal constraints over 4 iterations in 618 ms. Result :sat
Minimization took 130 ms.
[2023-03-08 01:42:51] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-08 01:42:51] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-08 01:42:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:42:51] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2023-03-08 01:42:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:42:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-08 01:42:51] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2023-03-08 01:42:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:42:52] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2023-03-08 01:42:52] [INFO ] [Nat]Added 418 Read/Feed constraints in 85 ms returned sat
[2023-03-08 01:42:52] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 62 ms.
[2023-03-08 01:42:52] [INFO ] Added : 10 causal constraints over 2 iterations in 204 ms. Result :sat
Minimization took 150 ms.
Current structural bounds on expressions (after SMT) : [1, 857, 6, 857, 7] Max seen :[1, 0, 0, 0, 0]
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 4 out of 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, 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.2 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 95 places :
Symmetric choice reduction at 1 with 95 rule applications. Total rules 182 place count 231 transition count 343
Iterating global reduction 1 with 95 rules applied. Total rules applied 277 place count 231 transition count 343
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 281 place count 231 transition count 339
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 353 place count 159 transition count 267
Iterating global reduction 2 with 72 rules applied. Total rules applied 425 place count 159 transition count 267
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 431 place count 159 transition count 261
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 472 place count 118 transition count 196
Iterating global reduction 3 with 41 rules applied. Total rules applied 513 place count 118 transition count 196
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 543 place count 118 transition count 166
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 554 place count 107 transition count 148
Iterating global reduction 4 with 11 rules applied. Total rules applied 565 place count 107 transition count 148
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 567 place count 107 transition count 146
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 575 place count 99 transition count 138
Iterating global reduction 5 with 8 rules applied. Total rules applied 583 place count 99 transition count 138
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 586 place count 99 transition count 135
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 592 place count 93 transition count 129
Iterating global reduction 6 with 6 rules applied. Total rules applied 598 place count 93 transition count 129
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 601 place count 93 transition count 126
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 602 place count 92 transition count 124
Iterating global reduction 7 with 1 rules applied. Total rules applied 603 place count 92 transition count 124
Applied a total of 603 rules in 80 ms. Remains 92 /347 variables (removed 255) and now considering 124/672 (removed 548) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 92/347 places, 124/672 transitions.
// Phase 1: matrix 124 rows 92 cols
[2023-03-08 01:42:52] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229710 resets, run finished after 1012 ms. (steps per millisecond=988 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 98779 resets, run finished after 492 ms. (steps per millisecond=2032 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 99175 resets, run finished after 462 ms. (steps per millisecond=2164 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 98671 resets, run finished after 451 ms. (steps per millisecond=2217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 99240 resets, run finished after 456 ms. (steps per millisecond=2192 ) properties (out of 4) seen :0
[2023-03-08 01:42:55] [INFO ] Invariant cache hit.
[2023-03-08 01:42:55] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:42:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:42:55] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-08 01:42:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:42:55] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 01:42:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:42:55] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-08 01:42:55] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-08 01:42:55] [INFO ] [Nat]Added 46 Read/Feed constraints in 9 ms returned sat
[2023-03-08 01:42:55] [INFO ] Computed and/alt/rep : 32/69/32 causal constraints (skipped 91 transitions) in 8 ms.
[2023-03-08 01:42:55] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 0 ms to minimize.
[2023-03-08 01:42:55] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2023-03-08 01:42:55] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2023-03-08 01:42:56] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2023-03-08 01:42:56] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2023-03-08 01:42:56] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2023-03-08 01:42:56] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2023-03-08 01:42:56] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2023-03-08 01:42:56] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 500 ms
[2023-03-08 01:42:56] [INFO ] Added : 12 causal constraints over 4 iterations in 558 ms. Result :sat
Minimization took 29 ms.
[2023-03-08 01:42:56] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 01:42:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:42:56] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-08 01:42:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:42:56] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:42:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:42:56] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-08 01:42:56] [INFO ] [Nat]Added 46 Read/Feed constraints in 12 ms returned sat
[2023-03-08 01:42:56] [INFO ] Computed and/alt/rep : 32/69/32 causal constraints (skipped 91 transitions) in 8 ms.
[2023-03-08 01:42:56] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2023-03-08 01:42:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2023-03-08 01:42:56] [INFO ] Added : 17 causal constraints over 5 iterations in 133 ms. Result :sat
Minimization took 20 ms.
[2023-03-08 01:42:56] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:42:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:42:56] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-08 01:42:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:42:56] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:42:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:42:56] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-08 01:42:56] [INFO ] [Nat]Added 46 Read/Feed constraints in 8 ms returned sat
[2023-03-08 01:42:56] [INFO ] Computed and/alt/rep : 32/69/32 causal constraints (skipped 91 transitions) in 8 ms.
[2023-03-08 01:42:56] [INFO ] Added : 12 causal constraints over 3 iterations in 40 ms. Result :sat
Minimization took 22 ms.
[2023-03-08 01:42:56] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:42:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:42:56] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-08 01:42:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:42:56] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:42:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:42:56] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-08 01:42:56] [INFO ] [Nat]Added 46 Read/Feed constraints in 7 ms returned sat
[2023-03-08 01:42:56] [INFO ] Computed and/alt/rep : 32/69/32 causal constraints (skipped 91 transitions) in 6 ms.
[2023-03-08 01:42:57] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2023-03-08 01:42:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2023-03-08 01:42:57] [INFO ] Added : 20 causal constraints over 5 iterations in 158 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : [857, 6, 857, 7] Max seen :[0, 0, 0, 0]
Support contains 4 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 124/124 transitions.
Applied a total of 0 rules in 7 ms. Remains 92 /92 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 92/92 places, 124/124 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 124/124 transitions.
Applied a total of 0 rules in 7 ms. Remains 92 /92 variables (removed 0) and now considering 124/124 (removed 0) transitions.
[2023-03-08 01:42:57] [INFO ] Invariant cache hit.
[2023-03-08 01:42:57] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-08 01:42:57] [INFO ] Invariant cache hit.
[2023-03-08 01:42:57] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-08 01:42:57] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
[2023-03-08 01:42:57] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-08 01:42:57] [INFO ] Invariant cache hit.
[2023-03-08 01:42:57] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 322 ms. Remains : 92/92 places, 124/124 transitions.
Starting property specific reduction for DBSingleClientW-PT-d1m04-UpperBounds-05
[2023-03-08 01:42:57] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2329 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 1023 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2023-03-08 01:42:57] [INFO ] Invariant cache hit.
[2023-03-08 01:42:57] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:42:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:42:57] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-08 01:42:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:42:57] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:42:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:42:57] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-08 01:42:57] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-08 01:42:57] [INFO ] [Nat]Added 46 Read/Feed constraints in 15 ms returned sat
[2023-03-08 01:42:57] [INFO ] Computed and/alt/rep : 32/69/32 causal constraints (skipped 91 transitions) in 8 ms.
[2023-03-08 01:42:57] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 0 ms to minimize.
[2023-03-08 01:42:58] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2023-03-08 01:42:58] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2023-03-08 01:42:58] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2023-03-08 01:42:58] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2023-03-08 01:42:58] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2023-03-08 01:42:58] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 0 ms to minimize.
[2023-03-08 01:42:58] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2023-03-08 01:42:58] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 458 ms
[2023-03-08 01:42:58] [INFO ] Added : 12 causal constraints over 4 iterations in 512 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 124/124 transitions.
Graph (complete) has 293 edges and 92 vertex of which 91 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 91 transition count 122
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 89 transition count 120
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 89 transition count 120
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 87 transition count 116
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 87 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 13 place count 87 transition count 114
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 86 transition count 113
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 86 transition count 113
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 85 transition count 112
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 85 transition count 112
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 84 transition count 111
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 84 transition count 111
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 83 transition count 105
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 83 transition count 105
Applied a total of 21 rules in 21 ms. Remains 83 /92 variables (removed 9) and now considering 105/124 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 83/92 places, 105/124 transitions.
// Phase 1: matrix 105 rows 83 cols
[2023-03-08 01:42:58] [INFO ] Computed 2 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 229199 resets, run finished after 852 ms. (steps per millisecond=1173 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 98616 resets, run finished after 390 ms. (steps per millisecond=2564 ) properties (out of 1) seen :0
[2023-03-08 01:42:59] [INFO ] Invariant cache hit.
[2023-03-08 01:42:59] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:42:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:42:59] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-08 01:42:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:42:59] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 01:42:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:42:59] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-08 01:42:59] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-08 01:42:59] [INFO ] [Nat]Added 35 Read/Feed constraints in 6 ms returned sat
[2023-03-08 01:42:59] [INFO ] Computed and/alt/rep : 29/61/29 causal constraints (skipped 75 transitions) in 6 ms.
[2023-03-08 01:42:59] [INFO ] Added : 12 causal constraints over 3 iterations in 32 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 105/105 transitions.
Applied a total of 0 rules in 5 ms. Remains 83 /83 variables (removed 0) and now considering 105/105 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 83/83 places, 105/105 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 105/105 transitions.
Applied a total of 0 rules in 5 ms. Remains 83 /83 variables (removed 0) and now considering 105/105 (removed 0) transitions.
[2023-03-08 01:42:59] [INFO ] Invariant cache hit.
[2023-03-08 01:42:59] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-08 01:42:59] [INFO ] Invariant cache hit.
[2023-03-08 01:43:00] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-08 01:43:00] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2023-03-08 01:43:00] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 01:43:00] [INFO ] Invariant cache hit.
[2023-03-08 01:43:00] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 263 ms. Remains : 83/83 places, 105/105 transitions.
Ending property specific reduction for DBSingleClientW-PT-d1m04-UpperBounds-05 in 2585 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m04-UpperBounds-10
// Phase 1: matrix 124 rows 92 cols
[2023-03-08 01:43:00] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2309 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1017 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
[2023-03-08 01:43:00] [INFO ] Invariant cache hit.
[2023-03-08 01:43:00] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:43:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:43:00] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-08 01:43:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:43:00] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 01:43:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:43:00] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-08 01:43:00] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-08 01:43:00] [INFO ] [Nat]Added 46 Read/Feed constraints in 5 ms returned sat
[2023-03-08 01:43:00] [INFO ] Computed and/alt/rep : 32/69/32 causal constraints (skipped 91 transitions) in 6 ms.
[2023-03-08 01:43:00] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2023-03-08 01:43:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2023-03-08 01:43:00] [INFO ] Added : 17 causal constraints over 5 iterations in 106 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 124/124 transitions.
Graph (complete) has 293 edges and 92 vertex of which 91 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 91 transition count 122
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 89 transition count 114
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 89 transition count 114
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 88 transition count 113
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 88 transition count 113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 88 transition count 112
Applied a total of 10 rules in 17 ms. Remains 88 /92 variables (removed 4) and now considering 112/124 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 88/92 places, 112/124 transitions.
// Phase 1: matrix 112 rows 88 cols
[2023-03-08 01:43:00] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229743 resets, run finished after 826 ms. (steps per millisecond=1210 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 99387 resets, run finished after 409 ms. (steps per millisecond=2444 ) properties (out of 1) seen :0
[2023-03-08 01:43:01] [INFO ] Invariant cache hit.
[2023-03-08 01:43:01] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:43:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:43:01] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-08 01:43:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:43:01] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 01:43:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:43:01] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-08 01:43:01] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-08 01:43:01] [INFO ] [Nat]Added 36 Read/Feed constraints in 7 ms returned sat
[2023-03-08 01:43:01] [INFO ] Computed and/alt/rep : 31/67/31 causal constraints (skipped 80 transitions) in 7 ms.
[2023-03-08 01:43:01] [INFO ] Added : 9 causal constraints over 2 iterations in 28 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 112/112 transitions.
Applied a total of 0 rules in 4 ms. Remains 88 /88 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 88/88 places, 112/112 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 112/112 transitions.
Applied a total of 0 rules in 3 ms. Remains 88 /88 variables (removed 0) and now considering 112/112 (removed 0) transitions.
[2023-03-08 01:43:01] [INFO ] Invariant cache hit.
[2023-03-08 01:43:01] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-08 01:43:01] [INFO ] Invariant cache hit.
[2023-03-08 01:43:02] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-08 01:43:02] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2023-03-08 01:43:02] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 01:43:02] [INFO ] Invariant cache hit.
[2023-03-08 01:43:02] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 273 ms. Remains : 88/88 places, 112/112 transitions.
Ending property specific reduction for DBSingleClientW-PT-d1m04-UpperBounds-10 in 2013 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m04-UpperBounds-14
// Phase 1: matrix 124 rows 92 cols
[2023-03-08 01:43:02] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2351 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 999 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2023-03-08 01:43:02] [INFO ] Invariant cache hit.
[2023-03-08 01:43:02] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:43:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:43:02] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-08 01:43:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:43:02] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:43:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:43:02] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-08 01:43:02] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-08 01:43:02] [INFO ] [Nat]Added 46 Read/Feed constraints in 8 ms returned sat
[2023-03-08 01:43:02] [INFO ] Computed and/alt/rep : 32/69/32 causal constraints (skipped 91 transitions) in 7 ms.
[2023-03-08 01:43:02] [INFO ] Added : 12 causal constraints over 3 iterations in 41 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 124/124 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 89 transition count 114
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 89 transition count 114
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 87 transition count 110
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 87 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 87 transition count 109
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 86 transition count 108
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 86 transition count 108
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 85 transition count 107
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 85 transition count 107
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 84 transition count 106
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 84 transition count 106
Applied a total of 17 rules in 12 ms. Remains 84 /92 variables (removed 8) and now considering 106/124 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 84/92 places, 106/124 transitions.
// Phase 1: matrix 106 rows 84 cols
[2023-03-08 01:43:02] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229865 resets, run finished after 799 ms. (steps per millisecond=1251 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 98774 resets, run finished after 410 ms. (steps per millisecond=2439 ) properties (out of 1) seen :0
[2023-03-08 01:43:03] [INFO ] Invariant cache hit.
[2023-03-08 01:43:03] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:43:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:43:03] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-08 01:43:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:43:03] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:43:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:43:03] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-08 01:43:03] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-08 01:43:03] [INFO ] [Nat]Added 36 Read/Feed constraints in 5 ms returned sat
[2023-03-08 01:43:03] [INFO ] Computed and/alt/rep : 29/61/29 causal constraints (skipped 76 transitions) in 19 ms.
[2023-03-08 01:43:03] [INFO ] Added : 12 causal constraints over 3 iterations in 50 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 106/106 transitions.
Applied a total of 0 rules in 5 ms. Remains 84 /84 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 84/84 places, 106/106 transitions.
Starting structural reductions in REACHABILITY mode, 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.
[2023-03-08 01:43:03] [INFO ] Invariant cache hit.
[2023-03-08 01:43:03] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-08 01:43:03] [INFO ] Invariant cache hit.
[2023-03-08 01:43:04] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-08 01:43:04] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2023-03-08 01:43:04] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 01:43:04] [INFO ] Invariant cache hit.
[2023-03-08 01:43:04] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 359 ms. Remains : 84/84 places, 106/106 transitions.
Ending property specific reduction for DBSingleClientW-PT-d1m04-UpperBounds-14 in 2025 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m04-UpperBounds-15
// Phase 1: matrix 124 rows 92 cols
[2023-03-08 01:43:04] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2270 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 1004 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2023-03-08 01:43:04] [INFO ] Invariant cache hit.
[2023-03-08 01:43:04] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:43:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:43:04] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-08 01:43:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:43:04] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 01:43:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:43:04] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-08 01:43:04] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-08 01:43:04] [INFO ] [Nat]Added 46 Read/Feed constraints in 11 ms returned sat
[2023-03-08 01:43:04] [INFO ] Computed and/alt/rep : 32/69/32 causal constraints (skipped 91 transitions) in 8 ms.
[2023-03-08 01:43:04] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 0 ms to minimize.
[2023-03-08 01:43:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2023-03-08 01:43:04] [INFO ] Added : 20 causal constraints over 5 iterations in 138 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 124/124 transitions.
Graph (complete) has 293 edges and 92 vertex of which 91 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 91 transition count 122
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 89 transition count 114
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 89 transition count 114
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 88 transition count 111
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 88 transition count 111
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 87 transition count 110
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 87 transition count 110
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 86 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 86 transition count 109
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 85 transition count 108
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 85 transition count 108
Applied a total of 15 rules in 10 ms. Remains 85 /92 variables (removed 7) and now considering 108/124 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 85/92 places, 108/124 transitions.
// Phase 1: matrix 108 rows 85 cols
[2023-03-08 01:43:04] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 230027 resets, run finished after 861 ms. (steps per millisecond=1161 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 99197 resets, run finished after 419 ms. (steps per millisecond=2386 ) properties (out of 1) seen :0
[2023-03-08 01:43:05] [INFO ] Invariant cache hit.
[2023-03-08 01:43:05] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 01:43:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:43:05] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-08 01:43:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:43:05] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:43:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:43:05] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-08 01:43:05] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-08 01:43:05] [INFO ] [Nat]Added 36 Read/Feed constraints in 7 ms returned sat
[2023-03-08 01:43:05] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 77 transitions) in 8 ms.
[2023-03-08 01:43:06] [INFO ] Added : 13 causal constraints over 3 iterations in 40 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 108/108 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 85/85 places, 108/108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 108/108 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2023-03-08 01:43:06] [INFO ] Invariant cache hit.
[2023-03-08 01:43:06] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-08 01:43:06] [INFO ] Invariant cache hit.
[2023-03-08 01:43:06] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-08 01:43:06] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2023-03-08 01:43:06] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 01:43:06] [INFO ] Invariant cache hit.
[2023-03-08 01:43:06] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 251 ms. Remains : 85/85 places, 108/108 transitions.
Ending property specific reduction for DBSingleClientW-PT-d1m04-UpperBounds-15 in 2125 ms.
[2023-03-08 01:43:06] [INFO ] Flatten gal took : 42 ms
[2023-03-08 01:43:06] [INFO ] Applying decomposition
[2023-03-08 01:43:06] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14044349138174195492.txt' '-o' '/tmp/graph14044349138174195492.bin' '-w' '/tmp/graph14044349138174195492.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14044349138174195492.bin' '-l' '-1' '-v' '-w' '/tmp/graph14044349138174195492.weights' '-q' '0' '-e' '0.001'
[2023-03-08 01:43:06] [INFO ] Decomposing Gal with order
[2023-03-08 01:43:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 01:43:06] [INFO ] Removed a total of 111 redundant transitions.
[2023-03-08 01:43:06] [INFO ] Flatten gal took : 51 ms
[2023-03-08 01:43:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 78 labels/synchronizations in 9 ms.
[2023-03-08 01:43:06] [INFO ] Time to serialize gal into /tmp/UpperBounds7469505908609013259.gal : 5 ms
[2023-03-08 01:43:06] [INFO ] Time to serialize properties into /tmp/UpperBounds7192925735279294191.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds7469505908609013259.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7192925735279294191.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds7192925735279294191.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,11388,0.11198,6176,396,286,3672,1490,374,6876,151,5556,0
Total reachable state count : 11388

Verifying 4 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d1m04-UpperBounds-05 :0 <= i4.u10.l608 <= 1
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-05 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-d1m04-UpperBounds-05,0,0.130054,6176,1,0,3672,1490,464,6876,184,5556,476
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d1m04-UpperBounds-10 :0 <= i3.u9.p52 <= 1
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-10 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-d1m04-UpperBounds-10,0,0.130556,6176,1,0,3672,1490,491,6876,195,5556,571
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d1m04-UpperBounds-14 :0 <= i4.u10.l574 <= 1
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-14 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-d1m04-UpperBounds-14,0,0.130727,6176,1,0,3672,1490,508,6876,200,5556,597
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d1m04-UpperBounds-15 :0 <= i3.u7.p27 <= 1
FORMULA DBSingleClientW-PT-d1m04-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-d1m04-UpperBounds-15,0,0.130987,6176,1,0,3672,1490,528,6876,210,5556,721
Total runtime 21312 ms.

BK_STOP 1678239788549

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-d1m04"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is DBSingleClientW-PT-d1m04, 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 r101-tall-167814475100237"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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