fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r312-tall-165472281900221
Last Updated
Jun 22, 2022

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
584.367 27971.00 44317.00 626.30 0 0 0 0 0 0 0 3 0 0 0 0 0 0 1 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/mcc2022-input.r312-tall-165472281900221.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DBSingleClientW-PT-d1m08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472281900221
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 864K
-rw-r--r-- 1 mcc users 6.8K Jun 7 17:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Jun 7 17:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 7 17:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Jun 7 17:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 6 15:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Jun 6 15:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 15:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 9.8K Jun 7 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Jun 7 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Jun 7 17:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Jun 7 17:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 432K Jun 6 12:11 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1654778862500

Running Version 202205111006
[2022-06-09 12:47:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-09 12:47:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 12:47:43] [INFO ] Load time of PNML (sax parser for PT used): 142 ms
[2022-06-09 12:47:43] [INFO ] Transformed 1440 places.
[2022-06-09 12:47:43] [INFO ] Transformed 672 transitions.
[2022-06-09 12:47:43] [INFO ] Parsed PT model containing 1440 places and 672 transitions in 247 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 1093 places in 5 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 672 rows 347 cols
[2022-06-09 12:47:44] [INFO ] Computed 6 place invariants in 49 ms
Incomplete random walk after 10000 steps, including 2273 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 965 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 996 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
// Phase 1: matrix 672 rows 347 cols
[2022-06-09 12:47:44] [INFO ] Computed 6 place invariants in 14 ms
[2022-06-09 12:47:44] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2022-06-09 12:47:44] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2022-06-09 12:47:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 12:47:44] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2022-06-09 12:47:44] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 12:47:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2022-06-09 12:47:44] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2022-06-09 12:47:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 12:47:44] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2022-06-09 12:47:44] [INFO ] State equation strengthened by 418 read => feed constraints.
[2022-06-09 12:47:44] [INFO ] [Nat]Added 418 Read/Feed constraints in 68 ms returned sat
[2022-06-09 12:47:45] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 134 ms.
[2022-06-09 12:47:45] [INFO ] Added : 5 causal constraints over 2 iterations in 274 ms. Result :sat
Minimization took 229 ms.
[2022-06-09 12:47:45] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-09 12:47:45] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2022-06-09 12:47:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 12:47:45] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2022-06-09 12:47:45] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 12:47:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-09 12:47:45] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2022-06-09 12:47:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 12:47:45] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2022-06-09 12:47:46] [INFO ] [Nat]Added 418 Read/Feed constraints in 74 ms returned sat
[2022-06-09 12:47:46] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 77 ms.
[2022-06-09 12:47:46] [INFO ] Deduced a trap composed of 111 places in 184 ms of which 5 ms to minimize.
[2022-06-09 12:47:46] [INFO ] Deduced a trap composed of 107 places in 132 ms of which 1 ms to minimize.
[2022-06-09 12:47:46] [INFO ] Deduced a trap composed of 117 places in 183 ms of which 2 ms to minimize.
[2022-06-09 12:47:47] [INFO ] Deduced a trap composed of 61 places in 202 ms of which 1 ms to minimize.
[2022-06-09 12:47:47] [INFO ] Deduced a trap composed of 64 places in 141 ms of which 1 ms to minimize.
[2022-06-09 12:47:47] [INFO ] Deduced a trap composed of 38 places in 215 ms of which 1 ms to minimize.
[2022-06-09 12:47:47] [INFO ] Deduced a trap composed of 38 places in 156 ms of which 1 ms to minimize.
[2022-06-09 12:47:48] [INFO ] Deduced a trap composed of 38 places in 162 ms of which 1 ms to minimize.
[2022-06-09 12:47:48] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 0 ms to minimize.
[2022-06-09 12:47:48] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 1 ms to minimize.
[2022-06-09 12:47:48] [INFO ] Deduced a trap composed of 42 places in 157 ms of which 1 ms to minimize.
[2022-06-09 12:47:48] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 1 ms to minimize.
[2022-06-09 12:47:49] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 1 ms to minimize.
[2022-06-09 12:47:49] [INFO ] Deduced a trap composed of 38 places in 133 ms of which 1 ms to minimize.
[2022-06-09 12:47:49] [INFO ] Deduced a trap composed of 33 places in 127 ms of which 0 ms to minimize.
[2022-06-09 12:47:49] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 1 ms to minimize.
[2022-06-09 12:47:49] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3576 ms
[2022-06-09 12:47:50] [INFO ] Added : 29 causal constraints over 8 iterations in 4120 ms. Result :sat
Minimization took 229 ms.
Current structural bounds on expressions (after SMT) : [10, 7] Max seen :[0, 0]
Support contains 2 out of 347 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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.6 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 96 places :
Symmetric choice reduction at 1 with 96 rule applications. Total rules 185 place count 229 transition count 327
Iterating global reduction 1 with 96 rules applied. Total rules applied 281 place count 229 transition count 327
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 285 place count 229 transition count 323
Discarding 74 places :
Symmetric choice reduction at 2 with 74 rule applications. Total rules 359 place count 155 transition count 249
Iterating global reduction 2 with 74 rules applied. Total rules applied 433 place count 155 transition count 249
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 439 place count 155 transition count 243
Discarding 43 places :
Symmetric choice reduction at 3 with 43 rule applications. Total rules 482 place count 112 transition count 174
Iterating global reduction 3 with 43 rules applied. Total rules applied 525 place count 112 transition count 174
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 549 place count 112 transition count 150
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 561 place count 100 transition count 131
Iterating global reduction 4 with 12 rules applied. Total rules applied 573 place count 100 transition count 131
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 575 place count 100 transition count 129
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 583 place count 92 transition count 121
Iterating global reduction 5 with 8 rules applied. Total rules applied 591 place count 92 transition count 121
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 594 place count 92 transition count 118
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 600 place count 86 transition count 112
Iterating global reduction 6 with 6 rules applied. Total rules applied 606 place count 86 transition count 112
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 609 place count 86 transition count 109
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 610 place count 85 transition count 107
Iterating global reduction 7 with 1 rules applied. Total rules applied 611 place count 85 transition count 107
Applied a total of 611 rules in 92 ms. Remains 85 /347 variables (removed 262) and now considering 107/672 (removed 565) transitions.
Finished structural reductions, in 1 iterations. Remains : 85/347 places, 107/672 transitions.
// Phase 1: matrix 107 rows 85 cols
[2022-06-09 12:47:50] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229696 resets, run finished after 955 ms. (steps per millisecond=1047 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 98578 resets, run finished after 457 ms. (steps per millisecond=2188 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 98141 resets, run finished after 411 ms. (steps per millisecond=2433 ) properties (out of 2) seen :0
// Phase 1: matrix 107 rows 85 cols
[2022-06-09 12:47:52] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 12:47:52] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 12:47:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 12:47:52] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-06-09 12:47:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 12:47:52] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 12:47:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 12:47:52] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2022-06-09 12:47:52] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-06-09 12:47:52] [INFO ] [Nat]Added 35 Read/Feed constraints in 5 ms returned sat
[2022-06-09 12:47:52] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 76 transitions) in 7 ms.
[2022-06-09 12:47:52] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2022-06-09 12:47:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2022-06-09 12:47:52] [INFO ] Added : 4 causal constraints over 2 iterations in 95 ms. Result :sat
Minimization took 26 ms.
[2022-06-09 12:47:52] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 12:47:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 12:47:52] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-06-09 12:47:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 12:47:52] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 12:47:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 12:47:52] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2022-06-09 12:47:52] [INFO ] [Nat]Added 35 Read/Feed constraints in 6 ms returned sat
[2022-06-09 12:47:52] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 76 transitions) in 9 ms.
[2022-06-09 12:47:52] [INFO ] Added : 10 causal constraints over 3 iterations in 44 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : [10, 7] Max seen :[0, 0]
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 85/85 places, 107/107 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 107/107 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 85/85 places, 107/107 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 107/107 (removed 0) transitions.
// Phase 1: matrix 107 rows 85 cols
[2022-06-09 12:47:52] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:47:53] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 107 rows 85 cols
[2022-06-09 12:47:53] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:47:53] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-06-09 12:47:53] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2022-06-09 12:47:53] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 107 rows 85 cols
[2022-06-09 12:47:53] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:47:53] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 107/107 transitions.
Starting property specific reduction for DBSingleClientW-PT-d1m08-UpperBounds-07
// Phase 1: matrix 107 rows 85 cols
[2022-06-09 12:47:53] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2286 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1007 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 107 rows 85 cols
[2022-06-09 12:47:53] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:47:53] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 12:47:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 12:47:53] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-06-09 12:47:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 12:47:53] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 12:47:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 12:47:53] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2022-06-09 12:47:53] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-06-09 12:47:53] [INFO ] [Nat]Added 35 Read/Feed constraints in 5 ms returned sat
[2022-06-09 12:47:53] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 76 transitions) in 8 ms.
[2022-06-09 12:47:53] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2022-06-09 12:47:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2022-06-09 12:47:53] [INFO ] Added : 4 causal constraints over 2 iterations in 93 ms. Result :sat
Minimization took 27 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 SAFETY mode, iteration 0 : 85/85 places, 107/107 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 84 transition count 106
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 84 transition count 106
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 83 transition count 105
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 83 transition count 105
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 82 transition count 99
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 82 transition count 99
Applied a total of 6 rules in 12 ms. Remains 82 /85 variables (removed 3) and now considering 99/107 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 82/85 places, 99/107 transitions.
// Phase 1: matrix 99 rows 82 cols
[2022-06-09 12:47:53] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229880 resets, run finished after 769 ms. (steps per millisecond=1300 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 98448 resets, run finished after 373 ms. (steps per millisecond=2680 ) properties (out of 1) seen :0
// Phase 1: matrix 99 rows 82 cols
[2022-06-09 12:47:54] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 12:47:54] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 12:47:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 12:47:54] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-06-09 12:47:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 12:47:54] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 12:47:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 12:47:54] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-06-09 12:47:54] [INFO ] State equation strengthened by 29 read => feed constraints.
[2022-06-09 12:47:54] [INFO ] [Nat]Added 29 Read/Feed constraints in 9 ms returned sat
[2022-06-09 12:47:54] [INFO ] Computed and/alt/rep : 29/61/29 causal constraints (skipped 69 transitions) in 6 ms.
[2022-06-09 12:47:54] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2022-06-09 12:47:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2022-06-09 12:47:54] [INFO ] Added : 5 causal constraints over 3 iterations in 91 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 82/82 places, 99/99 transitions.
Applied a total of 0 rules in 5 ms. Remains 82 /82 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 82/82 places, 99/99 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 82/82 places, 99/99 transitions.
Applied a total of 0 rules in 9 ms. Remains 82 /82 variables (removed 0) and now considering 99/99 (removed 0) transitions.
// Phase 1: matrix 99 rows 82 cols
[2022-06-09 12:47:54] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:47:55] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 99 rows 82 cols
[2022-06-09 12:47:55] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:47:55] [INFO ] State equation strengthened by 29 read => feed constraints.
[2022-06-09 12:47:55] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2022-06-09 12:47:55] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 99 rows 82 cols
[2022-06-09 12:47:55] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 12:47:55] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 82/82 places, 99/99 transitions.
Ending property specific reduction for DBSingleClientW-PT-d1m08-UpperBounds-07 in 1948 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m08-UpperBounds-14
// Phase 1: matrix 107 rows 85 cols
[2022-06-09 12:47:55] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2305 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1020 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
// Phase 1: matrix 107 rows 85 cols
[2022-06-09 12:47:55] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:47:55] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 12:47:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 12:47:55] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-06-09 12:47:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 12:47:55] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 12:47:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 12:47:55] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2022-06-09 12:47:55] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-06-09 12:47:55] [INFO ] [Nat]Added 35 Read/Feed constraints in 5 ms returned sat
[2022-06-09 12:47:55] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 76 transitions) in 5 ms.
[2022-06-09 12:47:55] [INFO ] Added : 10 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 85 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 85/85 places, 107/107 transitions.
Applied a total of 0 rules in 15 ms. Remains 85 /85 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 107/107 transitions.
// Phase 1: matrix 107 rows 85 cols
[2022-06-09 12:47:55] [INFO ] Computed 2 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 229932 resets, run finished after 814 ms. (steps per millisecond=1228 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 98399 resets, run finished after 412 ms. (steps per millisecond=2427 ) properties (out of 1) seen :0
// Phase 1: matrix 107 rows 85 cols
[2022-06-09 12:47:56] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 12:47:56] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 12:47:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 12:47:56] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-06-09 12:47:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 12:47:56] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 12:47:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 12:47:56] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-06-09 12:47:56] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-06-09 12:47:56] [INFO ] [Nat]Added 35 Read/Feed constraints in 5 ms returned sat
[2022-06-09 12:47:56] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 76 transitions) in 9 ms.
[2022-06-09 12:47:56] [INFO ] Added : 10 causal constraints over 3 iterations in 39 ms. Result :sat
Minimization took 17 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 SAFETY mode, iteration 0 : 85/85 places, 107/107 transitions.
Applied a total of 0 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 107/107 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 85/85 places, 107/107 transitions.
Applied a total of 0 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 107/107 (removed 0) transitions.
// Phase 1: matrix 107 rows 85 cols
[2022-06-09 12:47:56] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:47:56] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 107 rows 85 cols
[2022-06-09 12:47:56] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:47:56] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-06-09 12:47:57] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2022-06-09 12:47:57] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 107 rows 85 cols
[2022-06-09 12:47:57] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:47:57] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 107/107 transitions.
Ending property specific reduction for DBSingleClientW-PT-d1m08-UpperBounds-14 in 1896 ms.
[2022-06-09 12:47:57] [INFO ] Flatten gal took : 37 ms
[2022-06-09 12:47:57] [INFO ] Applying decomposition
[2022-06-09 12:47:57] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6619726489876513557.txt' '-o' '/tmp/graph6619726489876513557.bin' '-w' '/tmp/graph6619726489876513557.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6619726489876513557.bin' '-l' '-1' '-v' '-w' '/tmp/graph6619726489876513557.weights' '-q' '0' '-e' '0.001'
[2022-06-09 12:47:57] [INFO ] Decomposing Gal with order
[2022-06-09 12:47:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 12:47:57] [INFO ] Removed a total of 116 redundant transitions.
[2022-06-09 12:47:57] [INFO ] Flatten gal took : 59 ms
[2022-06-09 12:47:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 74 labels/synchronizations in 9 ms.
[2022-06-09 12:47:57] [INFO ] Time to serialize gal into /tmp/UpperBounds7163362151768844984.gal : 9 ms
[2022-06-09 12:47:57] [INFO ] Time to serialize properties into /tmp/UpperBounds5644445317799176955.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds7163362151768844984.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5644445317799176955.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...274
Loading property file /tmp/UpperBounds5644445317799176955.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.10416e+07,12.4635,244816,2708,601,151352,6342,389,2.36231e+06,87,78449,0
Total reachable state count : 11041614

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 3
Bounds property DBSingleClientW-PT-d1m08-UpperBounds-07 :0 <= i4.u1.l531 <= 3
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-07 3 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d1m08-UpperBounds-07,0,12.7558,244816,1,0,151352,11264,489,2.36231e+06,105,78449,2969
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d1m08-UpperBounds-14 :0 <= i5.u7.p54 <= 1
FORMULA DBSingleClientW-PT-d1m08-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-d1m08-UpperBounds-14,0,12.8415,244816,1,0,151352,12298,512,2.36231e+06,110,78449,3205
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 26771 ms.

BK_STOP 1654778890471

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-d1m08"
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-4028"
echo " Executing tool itstools"
echo " Input is DBSingleClientW-PT-d1m08, 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 r312-tall-165472281900221"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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