fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r101-tall-167814475100261
Last Updated
May 14, 2023

About the Execution of ITS-Tools for DBSingleClientW-PT-d1m07

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
457.096 27557.00 39182.00 2115.50 0 0 0 0 0 4 1 1 0 0 1 0 0 0 0 0 normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 900K
-rw-r--r-- 1 mcc users 8.9K Feb 26 15:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 15:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 15:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 15:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 26 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 26 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:49 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-d1m07-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678242049039

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-d1m07
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-08 02:20:50] [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 02:20:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 02:20:50] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2023-03-08 02:20:50] [INFO ] Transformed 1440 places.
[2023-03-08 02:20:50] [INFO ] Transformed 672 transitions.
[2023-03-08 02:20:50] [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-d1m07-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 672 rows 347 cols
[2023-03-08 02:20:50] [INFO ] Computed 6 place invariants in 45 ms
Incomplete random walk after 10000 steps, including 2299 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 922 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 944 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 977 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 941 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
[2023-03-08 02:20:50] [INFO ] Invariant cache hit.
[2023-03-08 02:20:51] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-08 02:20:51] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2023-03-08 02:20:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 02:20:51] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2023-03-08 02:20:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 02:20:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2023-03-08 02:20:51] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-08 02:20:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 02:20:51] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2023-03-08 02:20:51] [INFO ] State equation strengthened by 418 read => feed constraints.
[2023-03-08 02:20:51] [INFO ] [Nat]Added 418 Read/Feed constraints in 81 ms returned sat
[2023-03-08 02:20:52] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 139 ms.
[2023-03-08 02:20:52] [INFO ] Added : 7 causal constraints over 2 iterations in 369 ms. Result :sat
Minimization took 343 ms.
[2023-03-08 02:20:52] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-08 02:20:52] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-08 02:20:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 02:20:52] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2023-03-08 02:20:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 02:20:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-08 02:20:53] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-08 02:20:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 02:20:53] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2023-03-08 02:20:53] [INFO ] [Nat]Added 418 Read/Feed constraints in 81 ms returned sat
[2023-03-08 02:20:53] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 89 ms.
[2023-03-08 02:20:53] [INFO ] Deduced a trap composed of 26 places in 149 ms of which 3 ms to minimize.
[2023-03-08 02:20:53] [INFO ] Deduced a trap composed of 91 places in 128 ms of which 1 ms to minimize.
[2023-03-08 02:20:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 423 ms
[2023-03-08 02:20:54] [INFO ] Added : 20 causal constraints over 5 iterations in 845 ms. Result :sat
Minimization took 116 ms.
[2023-03-08 02:20:54] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-08 02:20:54] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 7 ms returned sat
[2023-03-08 02:20:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 02:20:54] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2023-03-08 02:20:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 02:20:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-08 02:20:54] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2023-03-08 02:20:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 02:20:54] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2023-03-08 02:20:54] [INFO ] [Nat]Added 418 Read/Feed constraints in 83 ms returned sat
[2023-03-08 02:20:54] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 53 ms.
[2023-03-08 02:20:55] [INFO ] Added : 12 causal constraints over 3 iterations in 224 ms. Result :sat
Minimization took 91 ms.
[2023-03-08 02:20:55] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-08 02:20:55] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-08 02:20:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 02:20:55] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2023-03-08 02:20:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 02:20:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-08 02:20:55] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2023-03-08 02:20:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 02:20:55] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2023-03-08 02:20:55] [INFO ] [Nat]Added 418 Read/Feed constraints in 59 ms returned sat
[2023-03-08 02:20:55] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 61 ms.
[2023-03-08 02:20:55] [INFO ] Added : 2 causal constraints over 1 iterations in 137 ms. Result :sat
Minimization took 72 ms.
Current structural bounds on expressions (after SMT) : [7, 7, 7, 7] Max seen :[0, 0, 0, 0]
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 325 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.2 ms
Discarding 22 places :
Also discarding 0 output transitions
Drop transitions removed 8 transitions
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 0 with 88 rules applied. Total rules applied 89 place count 325 transition count 584
Discarding 94 places :
Symmetric choice reduction at 1 with 94 rule applications. Total rules 183 place count 231 transition count 329
Iterating global reduction 1 with 94 rules applied. Total rules applied 277 place count 231 transition count 329
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 325
Discarding 71 places :
Symmetric choice reduction at 2 with 71 rule applications. Total rules 352 place count 160 transition count 254
Iterating global reduction 2 with 71 rules applied. Total rules applied 423 place count 160 transition count 254
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 429 place count 160 transition count 248
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 468 place count 121 transition count 188
Iterating global reduction 3 with 39 rules applied. Total rules applied 507 place count 121 transition count 188
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 3 with 21 rules applied. Total rules applied 528 place count 121 transition count 167
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 539 place count 110 transition count 149
Iterating global reduction 4 with 11 rules applied. Total rules applied 550 place count 110 transition count 149
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 552 place count 110 transition count 147
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 559 place count 103 transition count 140
Iterating global reduction 5 with 7 rules applied. Total rules applied 566 place count 103 transition count 140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 567 place count 103 transition count 139
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 573 place count 97 transition count 133
Iterating global reduction 6 with 6 rules applied. Total rules applied 579 place count 97 transition count 133
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 581 place count 97 transition count 131
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 582 place count 96 transition count 129
Iterating global reduction 7 with 1 rules applied. Total rules applied 583 place count 96 transition count 129
Applied a total of 583 rules in 87 ms. Remains 96 /347 variables (removed 251) and now considering 129/672 (removed 543) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 96/347 places, 129/672 transitions.
// Phase 1: matrix 129 rows 96 cols
[2023-03-08 02:20:55] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229626 resets, run finished after 995 ms. (steps per millisecond=1005 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 1000001 steps, including 98031 resets, run finished after 485 ms. (steps per millisecond=2061 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 1000000 steps, including 98303 resets, run finished after 448 ms. (steps per millisecond=2232 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 1000001 steps, including 99048 resets, run finished after 445 ms. (steps per millisecond=2247 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 1000000 steps, including 97514 resets, run finished after 489 ms. (steps per millisecond=2044 ) properties (out of 4) seen :1
[2023-03-08 02:20:58] [INFO ] Invariant cache hit.
[2023-03-08 02:20:58] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 02:20:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 02:20:58] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-08 02:20:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 02:20:58] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 02:20:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 02:20:58] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-08 02:20:58] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-08 02:20:58] [INFO ] [Nat]Added 41 Read/Feed constraints in 4 ms returned sat
[2023-03-08 02:20:58] [INFO ] Computed and/alt/rep : 35/85/35 causal constraints (skipped 93 transitions) in 7 ms.
[2023-03-08 02:20:59] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 3 ms to minimize.
[2023-03-08 02:20:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2023-03-08 02:20:59] [INFO ] Added : 6 causal constraints over 2 iterations in 84 ms. Result :sat
Minimization took 38 ms.
[2023-03-08 02:20:59] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 02:20:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 02:20:59] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-08 02:20:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 02:20:59] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 02:20:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 02:20:59] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-08 02:20:59] [INFO ] [Nat]Added 41 Read/Feed constraints in 8 ms returned sat
[2023-03-08 02:20:59] [INFO ] Computed and/alt/rep : 35/85/35 causal constraints (skipped 93 transitions) in 6 ms.
[2023-03-08 02:20:59] [INFO ] Added : 14 causal constraints over 3 iterations in 44 ms. Result :sat
Minimization took 20 ms.
[2023-03-08 02:20:59] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 02:20:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 02:20:59] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-08 02:20:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 02:20:59] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 02:20:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 02:20:59] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-08 02:20:59] [INFO ] [Nat]Added 41 Read/Feed constraints in 8 ms returned sat
[2023-03-08 02:20:59] [INFO ] Computed and/alt/rep : 35/85/35 causal constraints (skipped 93 transitions) in 8 ms.
[2023-03-08 02:20:59] [INFO ] Added : 13 causal constraints over 3 iterations in 38 ms. Result :sat
Minimization took 23 ms.
[2023-03-08 02:20:59] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 02:20:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 02:20:59] [INFO ] [Real]Absence check using state equation in 15 ms returned unsat
Current structural bounds on expressions (after SMT) : [7, 7, 7, 1] Max seen :[0, 0, 0, 1]
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 3 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 129/129 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 95 transition count 128
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 95 transition count 128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 94 transition count 126
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 94 transition count 126
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 94 transition count 125
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 93 transition count 124
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 93 transition count 124
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 92 transition count 123
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 92 transition count 123
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 92 transition count 122
Applied a total of 10 rules in 16 ms. Remains 92 /96 variables (removed 4) and now considering 122/129 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 92/96 places, 122/129 transitions.
// Phase 1: matrix 122 rows 92 cols
[2023-03-08 02:20:59] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229565 resets, run finished after 907 ms. (steps per millisecond=1102 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 98120 resets, run finished after 427 ms. (steps per millisecond=2341 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 97853 resets, run finished after 425 ms. (steps per millisecond=2352 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 98315 resets, run finished after 427 ms. (steps per millisecond=2341 ) properties (out of 3) seen :0
[2023-03-08 02:21:01] [INFO ] Invariant cache hit.
[2023-03-08 02:21:01] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 02:21:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 02:21:01] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-08 02:21:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 02:21:01] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 02:21:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 02:21:01] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-08 02:21:01] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-08 02:21:01] [INFO ] [Nat]Added 39 Read/Feed constraints in 15 ms returned sat
[2023-03-08 02:21:01] [INFO ] Computed and/alt/rep : 33/79/33 causal constraints (skipped 88 transitions) in 9 ms.
[2023-03-08 02:21:02] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2023-03-08 02:21:02] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2023-03-08 02:21:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 209 ms
[2023-03-08 02:21:02] [INFO ] Added : 16 causal constraints over 4 iterations in 264 ms. Result :sat
Minimization took 50 ms.
[2023-03-08 02:21:02] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 02:21:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 02:21:02] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-08 02:21:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 02:21:02] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 02:21:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 02:21:02] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-08 02:21:02] [INFO ] [Nat]Added 39 Read/Feed constraints in 7 ms returned sat
[2023-03-08 02:21:02] [INFO ] Computed and/alt/rep : 33/79/33 causal constraints (skipped 88 transitions) in 7 ms.
[2023-03-08 02:21:02] [INFO ] Added : 10 causal constraints over 3 iterations in 38 ms. Result :sat
Minimization took 18 ms.
[2023-03-08 02:21:02] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 02:21:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 02:21:02] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-08 02:21:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 02:21:02] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 02:21:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 02:21:02] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-08 02:21:02] [INFO ] [Nat]Added 39 Read/Feed constraints in 5 ms returned sat
[2023-03-08 02:21:02] [INFO ] Computed and/alt/rep : 33/79/33 causal constraints (skipped 88 transitions) in 7 ms.
[2023-03-08 02:21:02] [INFO ] Added : 9 causal constraints over 2 iterations in 31 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [7, 7, 7] Max seen :[0, 0, 0]
Support contains 3 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 122/122 transitions.
Applied a total of 0 rules in 6 ms. Remains 92 /92 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 92/92 places, 122/122 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 122/122 transitions.
Applied a total of 0 rules in 11 ms. Remains 92 /92 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2023-03-08 02:21:02] [INFO ] Invariant cache hit.
[2023-03-08 02:21:02] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-08 02:21:02] [INFO ] Invariant cache hit.
[2023-03-08 02:21:02] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-08 02:21:02] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2023-03-08 02:21:02] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 02:21:02] [INFO ] Invariant cache hit.
[2023-03-08 02:21:02] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 311 ms. Remains : 92/92 places, 122/122 transitions.
Starting property specific reduction for DBSingleClientW-PT-d1m07-UpperBounds-05
[2023-03-08 02:21:02] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2276 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1003 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-08 02:21:03] [INFO ] Invariant cache hit.
[2023-03-08 02:21:03] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 02:21:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 02:21:03] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2023-03-08 02:21:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 02:21:03] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 02:21:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 02:21:03] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-08 02:21:03] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-08 02:21:03] [INFO ] [Nat]Added 39 Read/Feed constraints in 13 ms returned sat
[2023-03-08 02:21:03] [INFO ] Computed and/alt/rep : 33/79/33 causal constraints (skipped 88 transitions) in 7 ms.
[2023-03-08 02:21:03] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2023-03-08 02:21:03] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
[2023-03-08 02:21:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 156 ms
[2023-03-08 02:21:03] [INFO ] Added : 16 causal constraints over 4 iterations in 208 ms. Result :sat
Minimization took 49 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, 122/122 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 90 transition count 120
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 90 transition count 120
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 88 transition count 117
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 88 transition count 117
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 88 transition count 115
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 87 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 87 transition count 109
Applied a total of 12 rules in 22 ms. Remains 87 /92 variables (removed 5) and now considering 109/122 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 87/92 places, 109/122 transitions.
// Phase 1: matrix 109 rows 87 cols
[2023-03-08 02:21:03] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229705 resets, run finished after 785 ms. (steps per millisecond=1273 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 98766 resets, run finished after 408 ms. (steps per millisecond=2450 ) properties (out of 1) seen :0
[2023-03-08 02:21:04] [INFO ] Invariant cache hit.
[2023-03-08 02:21:04] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 02:21:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 02:21:04] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-08 02:21:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 02:21:04] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 02:21:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 02:21:04] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-08 02:21:04] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-08 02:21:04] [INFO ] [Nat]Added 31 Read/Feed constraints in 5 ms returned sat
[2023-03-08 02:21:04] [INFO ] Computed and/alt/rep : 31/72/31 causal constraints (skipped 77 transitions) in 6 ms.
[2023-03-08 02:21:04] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2023-03-08 02:21:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2023-03-08 02:21:04] [INFO ] Added : 14 causal constraints over 4 iterations in 105 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 109/109 transitions.
Applied a total of 0 rules in 3 ms. Remains 87 /87 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 87/87 places, 109/109 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 109/109 transitions.
Applied a total of 0 rules in 4 ms. Remains 87 /87 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2023-03-08 02:21:04] [INFO ] Invariant cache hit.
[2023-03-08 02:21:05] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-08 02:21:05] [INFO ] Invariant cache hit.
[2023-03-08 02:21:05] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-08 02:21:05] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2023-03-08 02:21:05] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 02:21:05] [INFO ] Invariant cache hit.
[2023-03-08 02:21:05] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 257 ms. Remains : 87/87 places, 109/109 transitions.
Ending property specific reduction for DBSingleClientW-PT-d1m07-UpperBounds-05 in 2263 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m07-UpperBounds-06
// Phase 1: matrix 122 rows 92 cols
[2023-03-08 02:21:05] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2292 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 948 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2023-03-08 02:21:05] [INFO ] Invariant cache hit.
[2023-03-08 02:21:05] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 02:21:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 02:21:05] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-08 02:21:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 02:21:05] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 02:21:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 02:21:05] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-08 02:21:05] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-08 02:21:05] [INFO ] [Nat]Added 39 Read/Feed constraints in 7 ms returned sat
[2023-03-08 02:21:05] [INFO ] Computed and/alt/rep : 33/79/33 causal constraints (skipped 88 transitions) in 9 ms.
[2023-03-08 02:21:05] [INFO ] Added : 10 causal constraints over 3 iterations in 34 ms. Result :sat
Minimization took 16 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, 122/122 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 90 transition count 120
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 90 transition count 120
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 88 transition count 118
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 88 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 88 transition count 117
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 87 transition count 113
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 87 transition count 113
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 86 transition count 112
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 86 transition count 112
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 85 transition count 111
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 85 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 85 transition count 109
Applied a total of 17 rules in 14 ms. Remains 85 /92 variables (removed 7) and now considering 109/122 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 85/92 places, 109/122 transitions.
// Phase 1: matrix 109 rows 85 cols
[2023-03-08 02:21:05] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229758 resets, run finished after 790 ms. (steps per millisecond=1265 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 98326 resets, run finished after 396 ms. (steps per millisecond=2525 ) properties (out of 1) seen :0
[2023-03-08 02:21:06] [INFO ] Invariant cache hit.
[2023-03-08 02:21:06] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 02:21:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 02:21:06] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-08 02:21:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 02:21:06] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-08 02:21:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 02:21:06] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-08 02:21:06] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-08 02:21:06] [INFO ] [Nat]Added 36 Read/Feed constraints in 9 ms returned sat
[2023-03-08 02:21:06] [INFO ] Computed and/alt/rep : 30/65/30 causal constraints (skipped 78 transitions) in 7 ms.
[2023-03-08 02:21:06] [INFO ] Added : 19 causal constraints over 5 iterations in 50 ms. Result :sat
Minimization took 18 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, 109/109 transitions.
Applied a total of 0 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 85/85 places, 109/109 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 109/109 transitions.
Applied a total of 0 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2023-03-08 02:21:06] [INFO ] Invariant cache hit.
[2023-03-08 02:21:06] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-08 02:21:06] [INFO ] Invariant cache hit.
[2023-03-08 02:21:06] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-08 02:21:07] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2023-03-08 02:21:07] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 02:21:07] [INFO ] Invariant cache hit.
[2023-03-08 02:21:07] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 229 ms. Remains : 85/85 places, 109/109 transitions.
Ending property specific reduction for DBSingleClientW-PT-d1m07-UpperBounds-06 in 1857 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m07-UpperBounds-07
// Phase 1: matrix 122 rows 92 cols
[2023-03-08 02:21:07] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2234 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 990 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2023-03-08 02:21:07] [INFO ] Invariant cache hit.
[2023-03-08 02:21:07] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 02:21:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 02:21:07] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-08 02:21:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 02:21:07] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 11 ms returned sat
[2023-03-08 02:21:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 02:21:07] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-08 02:21:07] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-08 02:21:07] [INFO ] [Nat]Added 39 Read/Feed constraints in 10 ms returned sat
[2023-03-08 02:21:07] [INFO ] Computed and/alt/rep : 33/79/33 causal constraints (skipped 88 transitions) in 7 ms.
[2023-03-08 02:21:07] [INFO ] Added : 9 causal constraints over 2 iterations in 28 ms. Result :sat
Minimization took 15 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, 122/122 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 90 transition count 120
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 90 transition count 120
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 88 transition count 117
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 88 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 88 transition count 116
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 87 transition count 112
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 87 transition count 112
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 86 transition count 111
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 86 transition count 111
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 85 transition count 110
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 85 transition count 110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 85 transition count 108
Applied a total of 17 rules in 11 ms. Remains 85 /92 variables (removed 7) and now considering 108/122 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 85/92 places, 108/122 transitions.
// Phase 1: matrix 108 rows 85 cols
[2023-03-08 02:21:07] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229405 resets, run finished after 804 ms. (steps per millisecond=1243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 98476 resets, run finished after 390 ms. (steps per millisecond=2564 ) properties (out of 1) seen :0
[2023-03-08 02:21:08] [INFO ] Invariant cache hit.
[2023-03-08 02:21:08] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 02:21:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 02:21:08] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-08 02:21:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 02:21:08] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 02:21:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 02:21:08] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-08 02:21:08] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-08 02:21:08] [INFO ] [Nat]Added 36 Read/Feed constraints in 7 ms returned sat
[2023-03-08 02:21:08] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 77 transitions) in 6 ms.
[2023-03-08 02:21:08] [INFO ] Added : 9 causal constraints over 2 iterations in 24 ms. Result :sat
Minimization took 13 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 3 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 4 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 3 ms. Remains 85 /85 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2023-03-08 02:21:08] [INFO ] Invariant cache hit.
[2023-03-08 02:21:08] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-08 02:21:08] [INFO ] Invariant cache hit.
[2023-03-08 02:21:08] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-08 02:21:08] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2023-03-08 02:21:08] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 02:21:08] [INFO ] Invariant cache hit.
[2023-03-08 02:21:08] [INFO ] Dead Transitions using invariants and state equation in 50 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-d1m07-UpperBounds-07 in 1828 ms.
[2023-03-08 02:21:09] [INFO ] Flatten gal took : 43 ms
[2023-03-08 02:21:09] [INFO ] Applying decomposition
[2023-03-08 02:21:09] [INFO ] Flatten gal took : 11 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/graph17681509893124052980.txt' '-o' '/tmp/graph17681509893124052980.bin' '-w' '/tmp/graph17681509893124052980.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17681509893124052980.bin' '-l' '-1' '-v' '-w' '/tmp/graph17681509893124052980.weights' '-q' '0' '-e' '0.001'
[2023-03-08 02:21:09] [INFO ] Decomposing Gal with order
[2023-03-08 02:21:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 02:21:09] [INFO ] Removed a total of 118 redundant transitions.
[2023-03-08 02:21:09] [INFO ] Flatten gal took : 46 ms
[2023-03-08 02:21:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 84 labels/synchronizations in 8 ms.
[2023-03-08 02:21:09] [INFO ] Time to serialize gal into /tmp/UpperBounds15851010714336393317.gal : 4 ms
[2023-03-08 02:21:09] [INFO ] Time to serialize properties into /tmp/UpperBounds4412048803684742321.prop : 0 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/UpperBounds15851010714336393317.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4412048803684742321.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 ...284
Loading property file /tmp/UpperBounds4412048803684742321.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,5.35808e+06,1.55995,55540,2290,825,74871,5786,388,211694,150,49861,0
Total reachable state count : 5358076

Verifying 3 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property DBSingleClientW-PT-d1m07-UpperBounds-05 :0 <= i1.u4.l1239 <= 4
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-05 4 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d1m07-UpperBounds-05,0,1.69516,55540,1,0,74871,5786,484,211694,180,49861,972
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d1m07-UpperBounds-06 :0 <= i2.u7.p14 <= 1
FORMULA DBSingleClientW-PT-d1m07-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-d1m07-UpperBounds-06,0,1.69704,55540,1,0,74871,5786,505,211694,191,49861,1121
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d1m07-UpperBounds-07 :0 <= i2.u7.p12 <= 1
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-07 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-d1m07-UpperBounds-07,0,1.69754,55540,1,0,74871,5786,522,211694,203,49861,1242
Total runtime 20632 ms.

BK_STOP 1678242076596

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

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